Lines Matching refs:id
87 int id;
91 for (id = 0; id < tnfa->num_states; id++)
94 if (reach[id].pos < pos)
96 DPRINT((" %03d, costs ", id));
97 for (i = 0; i <= reach[id].depth; i++)
102 DPRINT(("%2d", reach[id].costs[i][j]));
107 if (i + 1 <= reach[id].depth)
113 DPRINT(("%02d", reach[id].tags[i]));
242 int i, id;
391 for (id = 0; id < tnfa->num_states; id++)
396 if (reach[id].pos != prev_pos)
398 DPRINT((" insert: %d not reached\n", id));
402 depth = reach[id].depth;
405 cost = reach[id].costs[depth][TRE_M_COST];
406 if (reach[id].params.cost_ins != TRE_PARAM_UNSET)
407 cost += reach[id].params.cost_ins;
408 if (cost > reach[id].params.max_cost)
412 if (reach[id].costs[depth][TRE_M_NUM_INS] + 1
413 > reach[id].params.max_ins)
417 if (reach[id].costs[depth][TRE_M_NUM_ERR] + 1
418 > reach[id].params.max_err)
425 cost0 = reach[id].costs[0][TRE_M_COST];
426 if (reach[id].params.cost_ins != TRE_PARAM_UNSET)
427 cost0 += reach[id].params.cost_ins;
432 DPRINT((" insert: from %d to %d, cost %d: ", id, id,
433 reach[id].costs[depth][TRE_M_COST]));
434 if (reach_next[id].pos == pos
435 && (cost0 >= reach_next[id].costs[0][TRE_M_COST]))
443 reach_next[id].state = reach[id].state;
444 reach_next[id].pos = pos;
446 reach_next[id].tags[i] = reach[id].tags[i];
447 reach_next[id].params = reach[id].params;
448 reach_next[id].depth = reach[id].depth;
451 memcpy(reach_next[id].costs, reach[id].costs,
452 sizeof(reach_next[id].costs[0][0])
454 reach_next[id].costs[depth][TRE_M_COST] = cost;
455 reach_next[id].costs[depth][TRE_M_NUM_INS]++;
456 reach_next[id].costs[depth][TRE_M_NUM_ERR]++;
459 reach_next[id].costs[0][TRE_M_COST] = cost0;
460 reach_next[id].costs[0][TRE_M_NUM_INS]++;
461 reach_next[id].costs[0][TRE_M_NUM_ERR]++;
478 for (id = 0; id < tnfa->num_states; id++)
480 if (reach_next[id].pos != pos)
482 *deque_end = &reach_next[id];
497 id = reach_p - reach_next;
514 DPRINT((" delete: from %03d: cost too large\n", id));
536 id, dest_id, cost0, reach_p->params.max_cost));
658 for (id = 0; id < tnfa->num_states; id++)
662 if (reach[id].pos < prev_pos)
664 for (trans = reach[id].state; trans->state; trans++)
674 DPRINT((" exact, from %d: assert failed\n", id));
678 depth = reach[id].depth;
681 cost = reach[id].costs[depth][TRE_M_COST];
682 cost0 = reach[id].costs[0][TRE_M_COST];
694 cost = reach[id].costs[depth][TRE_M_COST];
695 if (reach[id].params.cost_subst != TRE_PARAM_UNSET)
696 cost += reach[id].params.cost_subst;
697 if (cost > reach[id].params.max_cost)
701 if (reach[id].costs[depth][TRE_M_NUM_SUBST] + 1
702 > reach[id].params.max_subst)
706 if (reach[id].costs[depth][TRE_M_NUM_ERR] + 1
707 > reach[id].params.max_err)
714 cost0 = reach[id].costs[0][TRE_M_COST];
715 if (reach[id].params.cost_subst != TRE_PARAM_UNSET)
716 cost0 += reach[id].params.cost_subst;
721 id, dest_id, cost0));
725 id, dest_id, cost0));
729 tmp_tags[i] = reach[id].tags[i];
756 reach_next[dest_id].depth = reach[id].depth;
759 reach_next[dest_id].params = reach[id].params;
766 reach[id].costs,
767 sizeof(reach[id].costs[0][0])