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()
1239 	  node = node->right;  in postorder()
1252       while (node->right == prev || node->right == NULL);  in postorder()
1253       node = node->right;  in postorder()
1275 	  while (node->right == prev || node->right == NULL)  in preorder()
1282 	  node = node->right;  in preorder()
1333   if (node->right && node->right->token.type == SUBEXP)  in lower_subexps()
1335       node->right = lower_subexp (&err, preg, node->right);  in lower_subexps()
1336       if (node->right)  in lower_subexps()
1337 	node->right->parent = node;  in lower_subexps()
1412       node->left->next = node->right->first;  in calc_next()
1413       node->right->next = node->next;  in calc_next()
1418       if (node->right)  in calc_next()
1419 	node->right->next = node->next;  in calc_next()
1445 	Idx left, right;  in link_nfa_nodes()  local
1451 	if (node->right != NULL)  in link_nfa_nodes()
1452 	  right = node->right->first->node_idx;  in link_nfa_nodes()
1454 	  right = node->next->node_idx;  in link_nfa_nodes()
1456 	DEBUG_ASSERT (right > -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
3839   tree->right = right;  in create_token_tree()
3849   if (right != NULL)  in create_token_tree()
3850     right->parent = tree;  in create_token_tree()
3923 	  while (node->right == prev || node->right == NULL)  in duplicate_tree()
3931 	  node = node->right;  in duplicate_tree()
3932 	  p_new = &dup_node->right;  in duplicate_tree()