Home
last modified time | relevance | path

Searched refs:right (Results 1 – 7 of 7) sorted by relevance

/posix/
A Dregcomp.c1239 node = node->right; in postorder()
1252 while (node->right == prev || node->right == NULL); 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()
1445 Idx left, right; in link_nfa_nodes() local
1452 right = node->right->first->node_idx; in link_nfa_nodes()
3839 tree->right = right; in create_token_tree()
3849 if (right != NULL) in create_token_tree()
[all …]
A Dregex_internal.c1379 __re_size_t idx, right, mid; in re_node_set_contains() local
1385 right = set->nelem - 1; in re_node_set_contains()
1386 while (idx < right) in re_node_set_contains()
1388 mid = (idx + right) / 2; in re_node_set_contains()
1392 right = mid; in re_node_set_contains()
A DBOOST.tests410 ; do we get the right subexpression when it is used more than once?
564 ;[[.right-curly-bracket.]] } 0 1
569 ;[[=right-curly-bracket=]] } 0 1
A Dregex_internal.h472 struct bin_tree_t *right; member
A Dregexec.c4180 Idx left, right, mid, last; in search_cur_bkref_entry() local
4181 last = right = mctx->nbkref_ents; in search_cur_bkref_entry()
4182 for (left = 0; left < right;) in search_cur_bkref_entry()
4184 mid = (left + right) / 2; in search_cur_bkref_entry()
4188 right = mid; in search_cur_bkref_entry()
A Dtst-regex.input3636 * elf/dl-close.c: Call shared object terminators at the right time.
3654 (KNOWN_VALUE, STORE_VALUE): Do it right.
11804 `internal_function' in the right order for gcc 2.7.2.
12172 * manual/arith.texi (Imaginary Unit): Move @end deftypevr to right
/posix/rxspencer/
A Dtests51 # gag me with a right parenthesis -- 1003.2 goofed here (my fault, partly)
161 # here is a case that no NFA implementation does right
392 # and a still fancier version, which does it right (I think)...
429 # do we get the right subexpression when it is used more than once?

Completed in 36 milliseconds