Lines Matching refs:tags
55 int *tags;
95 DPRINT(("\n tags "));
98 DPRINT(("%02d", reach[id].tags[i]));
212 /* Number of tags. */
266 /* Space needed for one array of tags. */
304 reach[i].tags = (void *)buf_cursor;
306 reach_next[i].tags = (void *)buf_cursor;
353 reach_next[stateid].tags[i] = -1;
355 if (trans->tags)
356 for (i = 0; trans->tags[i] >= 0; i++)
357 if ((size_t)trans->tags[i] < num_tags)
358 reach_next[stateid].tags[trans->tags[i]] = pos;
374 match_tags[i] = reach_next[stateid].tags[i];
439 /* Copy state, position, tags, parameters, and depth. */
443 reach_next[id].tags[i] = reach[id].tags[i];
543 tmp_tags[i] = reach_p->tags[i];
544 if (trans->tags)
545 for (i = 0; trans->tags[i] >= 0; i++)
546 if ((size_t)trans->tags[i] < num_tags)
547 tmp_tags[trans->tags[i]] = pos;
550 with the smallest cost or best tags if costs are equal. */
558 reach_next[dest_id].tags)))))
566 /* Set state, position, tags, parameters, depth, and costs. */
570 reach_next[dest_id].tags[i] = tmp_tags[i];
726 tmp_tags[i] = reach[id].tags[i];
727 if (trans->tags)
728 for (i = 0; trans->tags[i] >= 0; i++)
729 if ((size_t)trans->tags[i] < num_tags)
730 tmp_tags[trans->tags[i]] = pos;
733 one with the smallest cost or best tags if costs are equal. */
739 reach_next[dest_id].tags))))
748 /* Set state, position, tags, and depth. */
752 reach_next[dest_id].tags[i] = tmp_tags[i];