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()
1216           node = node->right;  in postorder()
1229       while (node->right == prev || node->right == NULL);  in postorder()
1230       node = node->right;  in postorder()
1252 	  while (node->right == prev || node->right == NULL)  in preorder()
1259 	  node = node->right;  in preorder()
1310   if (node->right && node->right->token.type == SUBEXP)  in lower_subexps()
1312       node->right = lower_subexp (&err, preg, node->right);  in lower_subexps()
1313       if (node->right)  in lower_subexps()
1314 	node->right->parent = node;  in lower_subexps()
1388       node->left->next = node->right->first;  in calc_next()
1389       node->right->next = node->next;  in calc_next()
1394       if (node->right)  in calc_next()
1395         node->right->next = node->next;  in calc_next()
1421 	Idx left, right;  in link_nfa_nodes()  local
1427 	if (node->right != NULL)  in link_nfa_nodes()
1428 	  right = node->right->first->node_idx;  in link_nfa_nodes()
1430 	  right = node->next->node_idx;  in link_nfa_nodes()
1432 	assert (REG_VALID_INDEX (right));  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
3757   tree->right = right;  in create_token_tree()
3767   if (right != NULL)  in create_token_tree()
3768     right->parent = tree;  in create_token_tree()
3842 	  while (node->right == prev || node->right == NULL)  in duplicate_tree()
3850 	  node = node->right;  in duplicate_tree()
3851 	  p_new = &dup_node->right;  in duplicate_tree()