Lines Matching defs:tidx
1502 int tidx; /* targets table index */
1921 cur->tidx = 1;
2196 while (cur->pc > targets[cur->tidx])
2197 cur->tidx += 1;
2198 if (cur->pc == targets[cur->tidx])
2463 int tidx = 0;
2474 while (npc > targets[tidx])
2475 tidx += 1;
2476 if (npc != targets[tidx])
2481 if (buf[i].tidx >= tidx)
2482 buf[i].tidx++;
2485 for (int i = ntrg; i > tidx; i--)
2488 targets[tidx++] = npc;
2497 new->tidx = tidx;
2922 int tidx = 0;
2926 while (npc > targets[tidx])
2927 tidx += 1;
2928 if (npc != targets[tidx])
2933 if (buf[i].tidx >= tidx)
2934 buf[i].tidx++;
2937 for (int i = ntrg; i > tidx; i--)
2940 targets[tidx++] = npc;
2948 new->tidx = tidx;
3555 int tidx = 0;
3559 while (npc > targets[tidx])
3560 tidx += 1;
3561 if (npc != targets[tidx])
3566 if (buf[i].tidx >= tidx)
3567 buf[i].tidx++;
3569 for (int i = ntrg; i > tidx; i--)
3572 targets[tidx++] = npc;
3580 new->tidx = tidx;
3630 int tidx = 0;
3631 while (npc > targets[tidx])
3632 tidx += 1;
3633 if (npc != targets[tidx])
3638 if (buf[i].tidx >= tidx)
3639 buf[i].tidx++;
3641 for (int i = ntrg; i > tidx; i--)
3644 targets[tidx++] = npc;
3649 cur->tidx = tidx;
3663 int tidx = 0;
3665 while (npc > targets[tidx])
3666 tidx += 1;
3667 if (npc != targets[tidx])
3672 if (buf[i].tidx >= tidx)
3673 buf[i].tidx++;
3675 for (int i = ntrg; i > tidx; i--)
3678 targets[tidx++] = npc;
3683 cur->tidx = tidx;