Lines Matching defs:reach_p
487 tre_tnfa_approx_reach_t *reach_p;
493 reach_p = *deque_start;
494 id = reach_p - reach_next;
495 depth = reach_p->depth;
498 cost = reach_p->costs[depth][TRE_M_COST];
499 if (reach_p->params.cost_del != TRE_PARAM_UNSET)
500 cost += reach_p->params.cost_del;
504 if (cost > reach_p->params.max_cost
505 || (reach_p->costs[depth][TRE_M_NUM_DEL] + 1
506 > reach_p->params.max_del)
507 || (reach_p->costs[depth][TRE_M_NUM_ERR] + 1
508 > reach_p->params.max_err))
522 cost0 = reach_p->costs[0][TRE_M_COST];
523 if (reach_p->params.cost_del != TRE_PARAM_UNSET)
524 cost0 += reach_p->params.cost_del;
529 for (trans = reach_p->state; trans->state; trans++)
533 id, dest_id, cost0, reach_p->params.max_cost));
543 tmp_tags[i] = reach_p->tags[i];
572 reach_next[dest_id].params = reach_p->params;
577 reach_next[dest_id].depth = reach_p->depth;
579 reach_p->costs,
580 sizeof(reach_p->costs[0][0])