Lines Matching defs:right
115 bin_tree_t *left, bin_tree_t *right,
118 bin_tree_t *left, bin_tree_t *right,
1189 /* Descend down the tree, preferably to the left (or to the right
1191 while (node->left || node->right)
1195 node = node->right;
1207 /* Go up while we have a node that is reached from the right. */
1208 while (node->right == prev || node->right == NULL);
1209 node = node->right;
1225 /* Go to the left node, or up and to the right. */
1231 while (node->right == prev || node->right == NULL)
1238 node = node->right;
1289 if (node->right && node->right->token.type == SUBEXP)
1291 node->right = lower_subexp (&err, preg, node->right);
1292 if (node->right)
1293 node->right->parent = node;
1367 node->left->next = node->right->first;
1368 node->right->next = node->next;
1373 if (node->right)
1374 node->right->next = node->next;
1400 int left, right;
1406 if (node->right != NULL)
1407 right = node->right->first->node_idx;
1409 right = node->next->node_idx;
1411 assert (right > -1);
1412 err = re_node_set_init_2 (dfa->edests + idx, left, right);
3706 create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right,
3711 return create_token_tree (dfa, left, right, &t);
3715 create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right,
3733 tree->right = right;
3743 if (right != NULL)
3744 right->parent = tree;
3808 /* Go to the left node, or up and to the right. */
3817 while (node->right == prev || node->right == NULL)
3825 node = node->right;
3826 p_new = &dup_node->right;