HomeSort by: relevance | last modified time | path
    Searched refs:backtrack (Results 1 - 12 of 12) sorted by relevancy

  /src/external/bsd/tre/lib/
Makefile 19 SRCS+= tre-match-backtrack.c tre-match-parallel.c tre-mem.c
  /src/external/bsd/tre/dist/lib/
Makefile.am 19 tre-match-backtrack.c \
tre-match-backtrack.c 2 tre-match-backtrack.c - TRE backtracking regex matching engine
333 /* Backtrack to this state. */
356 goto backtrack;
383 goto backtrack;
478 goto backtrack;
497 goto backtrack;
508 goto backtrack;
511 goto backtrack;
516 goto backtrack;
550 /* Second matching transition. We may need to backtrack her
    [all...]
  /src/external/bsd/tre/dist/tests/
Makefile.am 43 ../lib/tre-match-backtrack.c \
  /src/external/bsd/byacc/dist/
output.c 503 if (backtrack)
513 if (backtrack)
549 else if (backtrack && p->suppressed == 1)
571 if (backtrack && csym != -1)
593 if (backtrack)
599 if (backtrack)
643 if (backtrack && conflictcount > 0)
1196 if (backtrack && (SRtotal + RRtotal) != 0)
1649 if (backtrack)
1919 && !backtrack
    [all...]
mkpar.c 13 #define MaySuppress(p) ((backtrack ? ((p)->suppressed <= 1) : (p)->suppressed == 0))
15 #define StartBacktrack(p) if (backtrack && (p) != NULL && NotSuppressed(p)) (p)->suppressed = 1
verbose.c 301 if (backtrack && p->action_code == SHIFT && p->suppressed == 1)
339 if (backtrack && p->suppressed == 1)
main.c 113 int backtrack = 0; /* default is no backtracking */ variable
306 backtrack = 1;
  /src/bin/sh/
expand.c 2006 goto backtrack;
2017 goto backtrack;
2023 goto backtrack;
2145 goto backtrack;
2153 backtrack:
  /src/bin/ksh/
misc.c 646 goto backtrack;
756 backtrack: if (sNext != sStart && sNext <= se) {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp 1427 const SDep *backtrack() { function in class:__anon4282::SchedDAGReverseDFS
1484 // Visit the top of the stack in postorder and backtrack.
1486 const SDep *PredDep = DFS.backtrack();
  /src/external/mit/isl/dist/doc/
implementation.tex 589 when we backtrack over the addition of the constraint, as they will
590 satisfy the negation of the constraint. It is only when we backtrack
624 the dual simplex method incrementally on the context and backtrack

Completed in 25 milliseconds