Lines Matching defs:tidx
1497 int tidx; /* targets table index */
1916 cur->tidx = 1;
2191 while (cur->pc > targets[cur->tidx])
2192 cur->tidx += 1;
2193 if (cur->pc == targets[cur->tidx])
2458 int tidx = 0;
2469 while (npc > targets[tidx])
2470 tidx += 1;
2471 if (npc != targets[tidx])
2476 if (buf[i].tidx >= tidx)
2477 buf[i].tidx++;
2480 for (int i = ntrg; i > tidx; i--)
2483 targets[tidx++] = npc;
2492 new->tidx = tidx;
2917 int tidx = 0;
2921 while (npc > targets[tidx])
2922 tidx += 1;
2923 if (npc != targets[tidx])
2928 if (buf[i].tidx >= tidx)
2929 buf[i].tidx++;
2932 for (int i = ntrg; i > tidx; i--)
2935 targets[tidx++] = npc;
2943 new->tidx = tidx;
3550 int tidx = 0;
3554 while (npc > targets[tidx])
3555 tidx += 1;
3556 if (npc != targets[tidx])
3561 if (buf[i].tidx >= tidx)
3562 buf[i].tidx++;
3564 for (int i = ntrg; i > tidx; i--)
3567 targets[tidx++] = npc;
3575 new->tidx = tidx;
3625 int tidx = 0;
3626 while (npc > targets[tidx])
3627 tidx += 1;
3628 if (npc != targets[tidx])
3633 if (buf[i].tidx >= tidx)
3634 buf[i].tidx++;
3636 for (int i = ntrg; i > tidx; i--)
3639 targets[tidx++] = npc;
3644 cur->tidx = tidx;
3658 int tidx = 0;
3660 while (npc > targets[tidx])
3661 tidx += 1;
3662 if (npc != targets[tidx])
3667 if (buf[i].tidx >= tidx)
3668 buf[i].tidx++;
3670 for (int i = ntrg; i > tidx; i--)
3673 targets[tidx++] = npc;
3678 cur->tidx = tidx;