| /external/regex-re2/re2/ |
| dfa.cc | 24 #include "re2/prog.h"
57 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem);
60 Prog::MatchKind kind() { return kind_; }
232 Prog::MatchKind kind,
341 Prog* prog_; // The regular expression program to run.
342 Prog::MatchKind kind_; // The kind of DFA.
434 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem
[all...] |
| nfa.cc | 7 // Prog::SearchNFA, an NFA search.
27 #include "re2/prog.h"
36 NFA(Prog* prog);
109 Prog* prog_; // underlying program
128 NFA::NFA(Prog* prog) {
129 prog_ = prog;
130 start_ = prog->start();
193 // Each inst in prog can be processed at most once
[all...] |
| re2.cc | 18 #include "re2/prog.h"
212 // Two thirds of the memory goes to the forward Prog,
213 // one third to the reverse prog, because the forward
214 // Prog has two DFAs but the reverse prog has one.
233 re2::Prog* RE2::ReverseProg() const {
592 Prog::Anchor anchor = Prog::kUnanchored;
593 Prog::MatchKind kind = Prog::kFirstMatch
[all...] |
| onepass.cc | 7 // Prog::SearchOnePass is an efficient implementation of
58 #include "re2/prog.h"
146 // Bits 0-5 are the empty-width flags from prog.h.
159 static const int kEmptyShift = 6; // number of empty flags in prog.h
172 // Check, at compile time, that prog.h agrees with math above.
178 COMPILE_ASSERT(kMaxCap == Prog::kMaxOnePassCapture*2,
183 uint32 satisfied = Prog::EmptyFlags(context, p);
207 bool Prog::SearchOnePass(const StringPiece& text,
378 bool Prog::IsOnePass() {
430 Prog::Inst* ip = inst(id)
[all...] |
| regexp.h | 78 // Prog, described in prog.h
217 // Compiled form; see prog.h
218 class Prog;
408 // Compile to Prog. See prog.h
409 // Reverse prog expects to be run over text backward.
410 // Construction and execution of prog will
413 Prog* CompileToProg(int64 max_mem);
414 Prog* CompileToReverseProg(int64 max_mem)
[all...] |
| re2.h | 194 class Prog;
527 // to hold the compiled form of the regexp (the Prog) and
529 // of Prog instructions and DFA states: 10,000 for both.
530 // In RE2, those limits would translate to about 240 KB per Prog
533 // Each RE2 has two Progs (one forward, one reverse), and each Prog
546 // Progs and then the DFAs: two thirds to the forward Prog
547 // and one third to the reverse Prog. The forward Prog gives half
548 // of what it has left over to each of its DFAs. The reverse Prog
702 re2::Prog* ReverseProg() const
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| nfa.cc | 7 // Prog::SearchNFA, an NFA search.
27 #include "re2/prog.h"
36 NFA(Prog* prog);
109 Prog* prog_; // underlying program
128 NFA::NFA(Prog* prog) {
129 prog_ = prog;
130 start_ = prog->start();
193 // Each inst in prog can be processed at most once
[all...] |
| re2.cc | 24 #include "re2/prog.h"
230 // Two thirds of the memory goes to the forward Prog,
231 // one third to the reverse prog, because the forward
232 // Prog has two DFAs but the reverse prog has one.
251 re2::Prog* RE2::ReverseProg() const {
610 Prog::Anchor anchor = Prog::kUnanchored;
611 Prog::MatchKind kind = Prog::kFirstMatch
[all...] |
| onepass.cc | 7 // Prog::SearchOnePass is an efficient implementation of
58 #include "re2/prog.h"
146 // Bits 0-5 are the empty-width flags from prog.h.
159 static const int kEmptyShift = 6; // number of empty flags in prog.h
172 // Check, at compile time, that prog.h agrees with math above.
178 COMPILE_ASSERT(kMaxCap == Prog::kMaxOnePassCapture*2,
183 uint32 satisfied = Prog::EmptyFlags(context, p);
207 bool Prog::SearchOnePass(const StringPiece& text,
378 bool Prog::IsOnePass() {
430 Prog::Inst* ip = inst(id)
[all...] |
| regexp.h | 78 // Prog, described in prog.h
217 // Compiled form; see prog.h
218 class Prog;
408 // Compile to Prog. See prog.h
409 // Reverse prog expects to be run over text backward.
410 // Construction and execution of prog will
413 Prog* CompileToProg(int64 max_mem);
414 Prog* CompileToReverseProg(int64 max_mem)
[all...] |
| re2.h | 194 class Prog;
527 // to hold the compiled form of the regexp (the Prog) and
529 // of Prog instructions and DFA states: 10,000 for both.
530 // In RE2, those limits would translate to about 240 KB per Prog
533 // Each RE2 has two Progs (one forward, one reverse), and each Prog
546 // Progs and then the DFAs: two thirds to the forward Prog
547 // and one third to the reverse Prog. The forward Prog gives half
548 // of what it has left over to each of its DFAs. The reverse Prog
690 re2::Prog* ReverseProg() const
[all...] |
| /external/llvm/tools/bugpoint/ |
| OptimizerDriver.cpp | 205 std::string Prog;
207 Prog = sys::FindProgramByName("valgrind");
209 Prog = tool;
216 int result = sys::ExecuteAndWait(Prog, Args.data(), 0,
|
| Miscompilation.cpp | 651 Module *Prog = BD.getProgram();
652 for (Module::iterator I = Prog->begin(), E = Prog->end(); I != E; ++I)
[all...] |
| /external/clang/tools/scan-build/ |
| scan-build | 27 my $Prog = "scan-build";
53 print BOLD, MAGENTA "$Prog: @_";
57 print "$Prog: @_";
63 print STDERR BOLD, RED "$Prog: ";
67 print STDERR "$Prog: @_";
81 print STDERR BOLD, RED "$Prog: ";
86 print STDERR "$Prog: ", @_;
153 # Strip the prefix '$Prog-' if we are dumping files to /tmp.
155 next if (!($f =~ /^$Prog-(.+)/));
193 $NewDir = "$Dir/$Prog-$DateString-$RunNumber"
[all...] |
| /external/chromium_org/third_party/re2/re2/testing/ |
| possible_match_test.cc | 7 #include "re2/prog.h"
112 Prog* prog = re->CompileToProg(0); local
113 CHECK(prog);
114 CHECK(prog->PossibleMatchRange(&min, &max, t.maxlen))
116 delete prog;
|
| /external/regex-re2/re2/testing/ |
| possible_match_test.cc | 7 #include "re2/prog.h"
112 Prog* prog = re->CompileToProg(0); local
113 CHECK(prog);
114 CHECK(prog->PossibleMatchRange(&min, &max, t.maxlen))
116 delete prog;
|
| /external/clang/lib/Driver/ |
| Compilation.cpp | 263 std::string Prog(C.getExecutable());
299 int Res = llvm::sys::ExecuteAndWait(Prog, Argv, /*env*/ 0, Redirects,
|
