Lines Matching refs:p1
2454 /* Adds a transition from each position in `p1' to each position in `p2'. */
2456 tre_make_trans(tre_pos_and_tags_t *p1, tre_pos_and_tags_t *p2,
2465 while (p1->position >= 0)
2479 position `p1->position'. */
2480 trans = transitions + offs[p1->position];
2484 /* If we find a previous transition from `p1->position' to
2505 /* Use the character ranges, assertions, etc. from `p1' for
2506 the transition from `p1' to `p2'. */
2507 trans->code_min = p1->code_min;
2508 trans->code_max = p1->code_max;
2511 trans->assertions = p1->assertions | p2->assertions
2512 | (p1->class ? ASSERT_CHAR_CLASS : 0)
2513 | (p1->neg_classes != NULL ? ASSERT_CHAR_CLASS_NEG : 0);
2514 if (p1->backref >= 0)
2518 trans->u.backref = p1->backref;
2522 trans->u.class = p1->class;
2523 if (p1->neg_classes != NULL)
2525 for (i = 0; p1->neg_classes[i] != (tre_ctype_t)0; i++);
2530 for (i = 0; p1->neg_classes[i] != (tre_ctype_t)0; i++)
2531 trans->neg_classes[i] = p1->neg_classes[i];
2539 if (p1->tags != NULL)
2540 while(p1->tags[i] >= 0)
2559 if (p1->tags != NULL)
2560 while(p1->tags[i] >= 0)
2562 trans->tags[i] = p1->tags[i];
2587 p1++;
2592 while (p1->position >= 0)
2597 counts[p1->position]++;
2600 p1++;