Home
last modified time | relevance | path

Searched refs:left (Results 1 – 3 of 3) sorted by relevance

/posix/
A Dregcomp.c1236 if (node->left) in postorder()
1237 node = node->left; in postorder()
1271 node = node->left; in preorder()
1303 && node->left && node->left->token.type == SUBEXP) in optimize_subexps()
1307 node->left = node->left->left; 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()
1445 Idx left, right; in link_nfa_nodes() local
1448 left = node->left->first->node_idx; in link_nfa_nodes()
3838 tree->left = left; in create_token_tree()
[all …]
A Dregexec.c4180 Idx left, right, mid, last; in search_cur_bkref_entry() local
4182 for (left = 0; left < right;) in search_cur_bkref_entry()
4184 mid = (left + right) / 2; in search_cur_bkref_entry()
4186 left = mid + 1; in search_cur_bkref_entry()
4190 if (left < last && mctx->bkref_ents[left].str_idx == str_idx) in search_cur_bkref_entry()
4191 return left; in search_cur_bkref_entry()
A Dregex_internal.h471 struct bin_tree_t *left; member

Completed in 24 milliseconds