Lines Matching defs:right
111 holds all but the last, and `right' part holds the last subexpression
115 tre_ast_node_t *right;
136 tre_ast_node_t *right;
188 tre_ast_new_union(tre_mem_t mem, tre_ast_node_t *left, tre_ast_node_t *right)
194 return right;
197 if (!node || !right)
200 un->right = right;
201 node->num_submatches = left->num_submatches + right->num_submatches;
206 tre_ast_new_catenation(tre_mem_t mem, tre_ast_node_t *left, tre_ast_node_t *right)
212 return right;
218 cat->right = right;
219 node->num_submatches = left->num_submatches + right->num_submatches;
1103 and the right child is the old root. */
1115 c->right = tre_mem_alloc(mem, sizeof(tre_ast_node_t));
1116 if (c->right == NULL)
1119 c->right->obj = node->obj;
1120 c->right->type = node->type;
1121 c->right->nullable = -1;
1122 c->right->submatch_id = -1;
1123 c->right->firstpos = NULL;
1124 c->right->lastpos = NULL;
1125 c->right->num_tags = 0;
1126 c->right->num_submatches = 0;
1133 As the right child a new tag with number `tag_id' to `node' is added,
1143 c->right = tre_ast_new_literal(mem, TAG, tag_id, -1);
1144 if (c->right == NULL)
1374 tre_ast_node_t *right = cat->right;
1378 /* After processing right child. */
1382 /* Process right child. */
1383 STACK_PUSHX(stack, voidptr, right);
1388 if (left->num_tags > 0 && right->num_tags > 0)
1390 /* Reserve the next tag to the right child. */
1457 tre_ast_node_t *right = uni->right;
1472 /* After processing right child. */
1478 STACK_PUSHX(stack, voidptr, right);
1482 /* Process right child. */
1483 STACK_PUSHX(stack, voidptr, right);
1586 + ((tre_catenation_t *)node->obj)->right->num_tags;
1591 the right operand the items currently in the array are
1602 tre_ast_node_t *right = tre_stack_pop_voidptr(stack);
1608 + ((tre_union_t *)node->obj)->right->num_tags + added_tags
1616 tag than the right child. This guarantees that we prefer
1617 the left child over the right child. */
1631 status = tre_add_tag_right(mem, right, tag_right);
1761 *result = tre_ast_new_union(mem, uni->left, uni->right);
1769 STACK_PUSHX(stack, voidptr, uni->right);
1771 STACK_PUSHX(stack, voidptr, &tmp->right);
1781 *result = tre_ast_new_catenation(mem, cat->left, cat->right);
1789 tmp->right = NULL;
1792 STACK_PUSHX(stack, voidptr, cat->right);
1794 STACK_PUSHX(stack, voidptr, &tmp->right);
1876 STACK_PUSHX(stack, voidptr, uni->right);
1885 STACK_PUSHX(stack, voidptr, cat->right);
2196 right subexpression. */
2200 else if (uni->right->nullable)
2201 STACK_PUSHX(stack, voidptr, uni->right)
2210 assert(cat->right->nullable);
2212 STACK_PUSHX(stack, voidptr, cat->right);
2319 STACK_PUSHR(stack, voidptr, ((tre_union_t *)node->obj)->right);
2330 STACK_PUSHR(stack, voidptr, ((tre_catenation_t *)node->obj)->right);
2350 node->nullable = uni->left->nullable || uni->right->nullable;
2352 uni->right->firstpos, NULL, 0);
2356 uni->right->lastpos, NULL, 0);
2380 node->nullable = cat->left->nullable && cat->right->nullable;
2408 tre_set_union(mem, cat->right->firstpos, cat->left->firstpos,
2420 if (cat->right->nullable)
2422 /* The right side matches the empty string. Make a first pass
2425 status = tre_match_empty(stack, cat->right,
2437 status = tre_match_empty(stack, cat->right, tags,
2445 tre_set_union(mem, cat->left->lastpos, cat->right->lastpos,
2453 node->lastpos = cat->right->lastpos;
2642 errcode = tre_ast_to_tnfa(uni->right, transitions, counts, offs);
2648 to each position in cat->right->firstpos. */
2649 errcode = tre_make_trans(cat->left->lastpos, cat->right->firstpos,
2656 errcode = tre_ast_to_tnfa(cat->right, transitions, counts, offs);