/external/chromium_org/third_party/re2/re2/testing/ |
H A D | tester.h | 23 kEngineBacktrack = 0, // Prog::BadSearchBacktrack 24 kEngineNFA, // Prog::SearchNFA 25 kEngineDFA, // Prog::SearchDFA, only ask whether it matched 26 kEngineDFA1, // Prog::SearchDFA, ask for match[0] 27 kEngineOnePass, // Prog::SearchOnePass, if applicable 28 kEngineBitState, // Prog::SearchBitState 54 TestInstance(const StringPiece& regexp, Prog::MatchKind kind, 63 Prog::Anchor anchor); 69 Prog::Anchor anchor, 73 const StringPiece& context, Prog [all...] |
H A D | dfa_test.cc | 26 BuildThread(Prog* prog) : prog_(prog) {} 28 CHECK(prog_->BuildEntireDFA(Prog::kFirstMatch)); 32 Prog* prog_; 47 Prog* prog = re->CompileToProg(0); 62 Prog* prog = re->CompileToProg(0); 79 prog->BuildEntireDFA(Prog::kFirstMatch); 105 Prog* prog = re->CompileToProg(limit); 109 prog->BuildEntireDFA(Prog::kFirstMatch); 110 prog->BuildEntireDFA(Prog::kLongestMatch); 205 Prog* pro [all...] |
H A D | regexp_benchmark.cc | 26 Prog* prog = re->CompileToProg(0); 31 CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); 53 Prog* prog = re->CompileToProg(0); 56 fprintf(stderr, "Prog: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth()); 60 CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); 94 fprintf(stderr, "sizeof: PCRE=%d RE2=%d Prog=%d Inst=%d\n", 97 static_cast<int>(sizeof(Prog)), 98 static_cast<int>(sizeof(Prog [all...] |
H A D | tester.cc | 109 static string FormatKind(Prog::MatchKind kind) { 111 case Prog::kFullMatch: 113 case Prog::kLongestMatch: 115 case Prog::kFirstMatch: 117 case Prog::kManyMatch: 124 static string FormatAnchor(Prog::Anchor anchor) { 126 case Prog::kAnchored: 128 case Prog::kUnanchored: 161 TestInstance::TestInstance(const StringPiece& regexp_str, Prog::MatchKind kind, 194 LOG(INFO) << "Prog fo [all...] |
H A D | compile_test.cc | 114 Prog* prog = re->CompileToProg(0); 161 Prog* prog = re->CompileToProg(0);
|
H A D | backtrack.cc | 7 // Prog::BadSearchBacktrack is a backtracking regular expression search, 50 explicit Backtracker(Prog* prog); 63 Prog* prog_; // program being run 78 Backtracker::Backtracker(Prog* prog) 165 Prog::Inst* ip = prog_->inst(id); 199 if (ip->empty() & ~Prog::EmptyFlags(context_, p)) 225 bool Prog::UnsafeSearchBacktrack(const StringPiece& text,
|
/external/regex-re2/re2/testing/ |
H A D | tester.h | 23 kEngineBacktrack = 0, // Prog::BadSearchBacktrack 24 kEngineNFA, // Prog::SearchNFA 25 kEngineDFA, // Prog::SearchDFA, only ask whether it matched 26 kEngineDFA1, // Prog::SearchDFA, ask for match[0] 27 kEngineOnePass, // Prog::SearchOnePass, if applicable 28 kEngineBitState, // Prog::SearchBitState 54 TestInstance(const StringPiece& regexp, Prog::MatchKind kind, 63 Prog::Anchor anchor); 69 Prog::Anchor anchor, 73 const StringPiece& context, Prog [all...] |
H A D | dfa_test.cc | 26 BuildThread(Prog* prog) : prog_(prog) {} 28 CHECK(prog_->BuildEntireDFA(Prog::kFirstMatch)); 32 Prog* prog_; 47 Prog* prog = re->CompileToProg(0); 62 Prog* prog = re->CompileToProg(0); 79 prog->BuildEntireDFA(Prog::kFirstMatch); 105 Prog* prog = re->CompileToProg(limit); 109 prog->BuildEntireDFA(Prog::kFirstMatch); 110 prog->BuildEntireDFA(Prog::kLongestMatch); 205 Prog* pro [all...] |
H A D | regexp_benchmark.cc | 26 Prog* prog = re->CompileToProg(0); 31 CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); 53 Prog* prog = re->CompileToProg(0); 56 fprintf(stderr, "Prog: %7lld bytes (peak=%lld)\n", mc.HeapGrowth(), mc.PeakHeapGrowth()); 60 CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); 94 fprintf(stderr, "sizeof: PCRE=%d RE2=%d Prog=%d Inst=%d\n", 97 static_cast<int>(sizeof(Prog)), 98 static_cast<int>(sizeof(Prog [all...] |
H A D | tester.cc | 109 static string FormatKind(Prog::MatchKind kind) { 111 case Prog::kFullMatch: 113 case Prog::kLongestMatch: 115 case Prog::kFirstMatch: 117 case Prog::kManyMatch: 124 static string FormatAnchor(Prog::Anchor anchor) { 126 case Prog::kAnchored: 128 case Prog::kUnanchored: 161 TestInstance::TestInstance(const StringPiece& regexp_str, Prog::MatchKind kind, 194 LOG(INFO) << "Prog fo [all...] |
H A D | compile_test.cc | 114 Prog* prog = re->CompileToProg(0); 161 Prog* prog = re->CompileToProg(0);
|
H A D | backtrack.cc | 7 // Prog::BadSearchBacktrack is a backtracking regular expression search, 50 explicit Backtracker(Prog* prog); 63 Prog* prog_; // program being run 78 Backtracker::Backtracker(Prog* prog) 165 Prog::Inst* ip = prog_->inst(id); 199 if (ip->empty() & ~Prog::EmptyFlags(context_, p)) 225 bool Prog::UnsafeSearchBacktrack(const StringPiece& text,
|
/external/chromium_org/third_party/re2/re2/ |
H A D | prog.cc | 17 void Prog::Inst::InitAlt(uint32 out, uint32 out1) { 23 void Prog::Inst::InitByteRange(int lo, int hi, int foldcase, uint32 out) { 31 void Prog::Inst::InitCapture(int cap, uint32 out) { 37 void Prog::Inst::InitEmptyWidth(EmptyOp empty, uint32 out) { 43 void Prog::Inst::InitMatch(int32 id) { 49 void Prog::Inst::InitNop(uint32 out) { 54 void Prog::Inst::InitFail() { 59 string Prog::Inst::Dump() { 93 Prog::Prog() function in class:re2::Prog [all...] |
H A D | compile.cc | 5 // Compile regular expression to Prog. 7 // Prog and Inst are defined in prog.h. 38 static void Patch(Prog::Inst *inst0, PatchList l, uint32 v); 41 static PatchList Deref(Prog::Inst *inst0, PatchList l); 44 static PatchList Append(Prog::Inst *inst0, PatchList l1, PatchList l2); 57 PatchList PatchList::Deref(Prog::Inst* inst0, PatchList l) { 58 Prog::Inst* ip = &inst0[l.p>>1]; 67 void PatchList::Patch(Prog::Inst *inst0, PatchList l, uint32 val) { 69 Prog::Inst* ip = &inst0[l.p>>1]; 81 PatchList PatchList::Append(Prog [all...] |
H A D | set.h | 46 re2::Prog* prog_;
|
H A D | prog.h | 78 class Prog { class in namespace:re2 80 Prog(); 81 ~Prog(); 98 int id(Prog* p) { return this - p->inst_; } 108 bool greedy(Prog *p) { 168 friend class Prog; 332 // Compiles a collection of regexps to Prog. Each regexp will have 334 static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor, 371 DISALLOW_EVIL_CONSTRUCTORS(Prog);
|
H A D | set.cc | 90 prog_ = Prog::CompileSet(options_, anchor_, re); 101 bool ret = prog_->SearchDFA(text, text, Prog::kAnchored, 102 Prog::kManyMatch, NULL, &failed, v);
|
H A D | bitstate.cc | 7 // Prog::SearchBitState is a regular expression search with submatch 33 explicit BitState(Prog* prog); 49 Prog* prog_; // program being run 71 BitState::BitState(Prog* prog) 170 Prog::Inst* ip = prog_->inst(id); 246 if (ip->empty() & ~Prog::EmptyFlags(context_, p)) 349 bool Prog::SearchBitState(const StringPiece& text,
|
H A D | dfa.cc | 59 DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem); 62 Prog::MatchKind kind() { return kind_; } 234 Prog::MatchKind kind, 343 Prog* prog_; // The regular expression program to run. 344 Prog::MatchKind kind_; // The kind of DFA. 436 DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem) 449 if (kind_ == Prog::kLongestMatch) { 623 if (sawmatch && (kind_ == Prog [all...] |
/external/regex-re2/re2/ |
H A D | prog.cc | 17 void Prog::Inst::InitAlt(uint32 out, uint32 out1) { 23 void Prog::Inst::InitByteRange(int lo, int hi, int foldcase, uint32 out) { 31 void Prog::Inst::InitCapture(int cap, uint32 out) { 37 void Prog::Inst::InitEmptyWidth(EmptyOp empty, uint32 out) { 43 void Prog::Inst::InitMatch(int32 id) { 49 void Prog::Inst::InitNop(uint32 out) { 54 void Prog::Inst::InitFail() { 59 string Prog::Inst::Dump() { 93 Prog::Prog() function in class:re2::Prog [all...] |
H A D | compile.cc | 5 // Compile regular expression to Prog. 7 // Prog and Inst are defined in prog.h. 38 static void Patch(Prog::Inst *inst0, PatchList l, uint32 v); 41 static PatchList Deref(Prog::Inst *inst0, PatchList l); 44 static PatchList Append(Prog::Inst *inst0, PatchList l1, PatchList l2); 57 PatchList PatchList::Deref(Prog::Inst* inst0, PatchList l) { 58 Prog::Inst* ip = &inst0[l.p>>1]; 67 void PatchList::Patch(Prog::Inst *inst0, PatchList l, uint32 val) { 69 Prog::Inst* ip = &inst0[l.p>>1]; 81 PatchList PatchList::Append(Prog [all...] |
H A D | set.h | 46 re2::Prog* prog_;
|
H A D | prog.h | 78 class Prog { class in namespace:re2 80 Prog(); 81 ~Prog(); 98 int id(Prog* p) { return this - p->inst_; } 108 bool greedy(Prog *p) { 168 friend class Prog; 332 // Compiles a collection of regexps to Prog. Each regexp will have 334 static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor, 371 DISALLOW_EVIL_CONSTRUCTORS(Prog);
|
H A D | set.cc | 90 prog_ = Prog::CompileSet(options_, anchor_, re); 101 bool ret = prog_->SearchDFA(text, text, Prog::kAnchored, 102 Prog::kManyMatch, NULL, &failed, v);
|
H A D | bitstate.cc | 7 // Prog::SearchBitState is a regular expression search with submatch 33 explicit BitState(Prog* prog); 49 Prog* prog_; // program being run 71 BitState::BitState(Prog* prog) 170 Prog::Inst* ip = prog_->inst(id); 246 if (ip->empty() & ~Prog::EmptyFlags(context_, p)) 349 bool Prog::SearchBitState(const StringPiece& text,
|