Lines Matching refs:left

117 				bin_tree_t *left, bin_tree_t *right,
120 bin_tree_t *left, bin_tree_t *right,
1235 while (node->left || node->right) in postorder()
1236 if (node->left) in postorder()
1237 node = node->left; in postorder()
1270 if (node->left) in preorder()
1271 node = node->left; in preorder()
1303 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1305 Idx other_idx = node->left->token.opr.idx; in optimize_subexps()
1307 node->left = node->left->left; in optimize_subexps()
1308 if (node->left) in optimize_subexps()
1309 node->left->parent = node; in optimize_subexps()
1327 if (node->left && node->left->token.type == SUBEXP) in lower_subexps()
1329 node->left = lower_subexp (&err, preg, node->left); in lower_subexps()
1330 if (node->left) in lower_subexps()
1331 node->left->parent = node; in lower_subexps()
1347 bin_tree_t *body = node->left; in lower_subexp()
1355 && node->left != NULL in lower_subexp()
1359 return node->left; in lower_subexp()
1387 node->first = node->left->first; in calc_first()
1388 node->node_idx = node->left->node_idx; in calc_first()
1409 node->left->next = node; in calc_next()
1412 node->left->next = node->right->first; in calc_next()
1416 if (node->left) in calc_next()
1417 node->left->next = node->next; in calc_next()
1445 Idx left, right; in link_nfa_nodes() local
1447 if (node->left != NULL) in link_nfa_nodes()
1448 left = node->left->first->node_idx; in link_nfa_nodes()
1450 left = node->next->node_idx; in link_nfa_nodes()
1455 DEBUG_ASSERT (left > -1); in link_nfa_nodes()
1457 err = re_node_set_init_2 (dfa->edests + idx, left, right); in link_nfa_nodes()
3813 create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, in create_tree() argument
3817 return create_token_tree (dfa, left, right, &t); in create_tree()
3821 create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right, in create_token_tree() argument
3838 tree->left = left; in create_token_tree()
3847 if (left != NULL) in create_token_tree()
3848 left->parent = tree; in create_token_tree()
3915 if (node->left) in duplicate_tree()
3917 node = node->left; in duplicate_tree()
3918 p_new = &dup_node->left; in duplicate_tree()