Lines Matching defs:ty
2268 int tx, ty;
2273 ty = MIN(b->used-1, ix);
2274 tx = ix - ty;
2278 tmpy = b->dp + ty;
2281 while (tx++ < a->used && ty
2283 iy = MIN(a->used-tx, ty+1);
2464 int tx, ty, iy;
2468 ty = MIN(b->used-1, ix);
2469 tx = ix - ty;
2473 tmpy = b->dp + ty;
2476 while (tx++ < a->used && ty-- >= 0) { ... }
2478 iy = MIN(a->used-tx, ty+1);
3042 * (ty-tx) so that it never happens. You double all those
3066 int tx, ty, iy;
3074 ty = MIN(a->used-1, ix);
3075 tx = ix - ty;
3079 tmpy = a->dp + ty;
3082 while (tx++ < a->used && ty-- >= 0) { ... }
3084 iy = MIN(a->used-tx, ty+1);
3086 /* now for squaring tx can never equal ty
3090 iy = MIN(iy, (int)((unsigned)(ty-tx+1)>>1));