116 				bin_tree_t *left, bin_tree_t *right,
119 				      bin_tree_t *left, bin_tree_t *right,
1212       while (node->left || node->right)  in postorder()
1213 	if (node->left)  in postorder()
1214           node = node->left;  in postorder()
1247       if (node->left)  in preorder()
1248 	node = node->left;  in preorder()
1280            && node->left && node->left->token.type == SUBEXP)  in optimize_subexps()
1282       Idx other_idx = node->left->token.opr.idx;  in optimize_subexps()
1284       node->left = node->left->left;  in optimize_subexps()
1285       if (node->left)  in optimize_subexps()
1286         node->left->parent = node;  in optimize_subexps()
1304   if (node->left && node->left->token.type == SUBEXP)  in lower_subexps()
1306       node->left = lower_subexp (&err, preg, node->left);  in lower_subexps()
1307       if (node->left)  in lower_subexps()
1308 	node->left->parent = node;  in lower_subexps()
1324   bin_tree_t *body = node->left;  in lower_subexp()
1332       && node->left != NULL  in lower_subexp()
1336     return node->left;  in lower_subexp()
1363       node->first = node->left->first;  in calc_first()
1364       node->node_idx = node->left->node_idx;  in calc_first()
1385       node->left->next = node;  in calc_next()
1388       node->left->next = node->right->first;  in calc_next()
1392       if (node->left)  in calc_next()
1393 	node->left->next = node->next;  in calc_next()
1421 	Idx left, right;  in link_nfa_nodes()  local
1423 	if (node->left != NULL)  in link_nfa_nodes()
1424 	  left = node->left->first->node_idx;  in link_nfa_nodes()
1426 	  left = node->next->node_idx;  in link_nfa_nodes()
1431 	assert (REG_VALID_INDEX (left));  in link_nfa_nodes()
1433 	err = re_node_set_init_2 (dfa->edests + idx, left, right);  in link_nfa_nodes()
3730 create_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right,  in create_tree()  argument
3735   return create_token_tree (dfa, left, right, &t);  in create_tree()
3739 create_token_tree (re_dfa_t *dfa, bin_tree_t *left, bin_tree_t *right,  in create_token_tree()  argument
3756   tree->left = left;  in create_token_tree()
3765   if (left != NULL)  in create_token_tree()
3766     left->parent = tree;  in create_token_tree()
3834       if (node->left)  in duplicate_tree()
3836 	  node = node->left;  in duplicate_tree()
3837 	  p_new = &dup_node->left;  in duplicate_tree()