Lines Matching refs:right
116 bin_tree_t *left, bin_tree_t *right,
119 bin_tree_t *left, bin_tree_t *right,
1217 /* Descend down the tree, preferably to the left (or to the right
1219 while (node->left || node->right)
1223 node = node->right;
1235 /* Go up while we have a node that is reached from the right. */
1236 while (node->right == prev || node->right == NULL);
1237 node = node->right;
1253 /* Go to the left node, or up and to the right. */
1259 while (node->right == prev || node->right == NULL)
1266 node = node->right;
1317 if (node->right && node->right->token.type == SUBEXP)
1319 node->right = lower_subexp (&err, preg, node->right);
1320 if (node->right)
1321 node->right->parent = node;
1395 node->left->next = node->right->first;
1396 node->right->next = node->next;
1401 if (node->right)
1402 node->right->next = node->next;
1428 Idx left, right;
1434 if (node->right != NULL)
1435 right = node->right->first->node_idx;
1437 right = node->next->node_idx;
1439 assert (REG_VALID_INDEX (right));
1440 err = re_node_set_init_2 (dfa->edests + idx, left, right);
3741 create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right,
3746 return create_token_tree (dfa, left, right, &t);
3750 create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right,
3768 tree->right = right;
3778 if (right != NULL)
3779 right->parent = tree;
3844 /* Go to the left node, or up and to the right. */
3853 while (node->right == prev || node->right == NULL)
3861 node = node->right;
3862 p_new = &dup_node->right;
