Prog 33 third_party/re2/re2/bitstate.cc explicit BitState(Prog* prog); Prog 49 third_party/re2/re2/bitstate.cc Prog* prog_; // program being run Prog 71 third_party/re2/re2/bitstate.cc BitState::BitState(Prog* prog) Prog 170 third_party/re2/re2/bitstate.cc Prog::Inst* ip = prog_->inst(id); Prog 246 third_party/re2/re2/bitstate.cc if (ip->empty() & ~Prog::EmptyFlags(context_, p)) Prog 349 third_party/re2/re2/bitstate.cc bool Prog::SearchBitState(const StringPiece& text, Prog 38 third_party/re2/re2/compile.cc static void Patch(Prog::Inst *inst0, PatchList l, uint32 v); Prog 41 third_party/re2/re2/compile.cc static PatchList Deref(Prog::Inst *inst0, PatchList l); Prog 44 third_party/re2/re2/compile.cc static PatchList Append(Prog::Inst *inst0, PatchList l1, PatchList l2); Prog 57 third_party/re2/re2/compile.cc PatchList PatchList::Deref(Prog::Inst* inst0, PatchList l) { Prog 58 third_party/re2/re2/compile.cc Prog::Inst* ip = &inst0[l.p>>1]; Prog 67 third_party/re2/re2/compile.cc void PatchList::Patch(Prog::Inst *inst0, PatchList l, uint32 val) { Prog 69 third_party/re2/re2/compile.cc Prog::Inst* ip = &inst0[l.p>>1]; Prog 81 third_party/re2/re2/compile.cc PatchList PatchList::Append(Prog::Inst* inst0, PatchList l1, PatchList l2) { Prog 95 third_party/re2/re2/compile.cc Prog::Inst* ip = &inst0[l.p>>1]; Prog 132 third_party/re2/re2/compile.cc static Prog *Compile(Regexp* re, bool reversed, int64 max_mem); Prog 136 third_party/re2/re2/compile.cc static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor, Prog 213 third_party/re2/re2/compile.cc Prog* Finish(); Prog 219 third_party/re2/re2/compile.cc Prog* prog_; // Program being built. Prog 226 third_party/re2/re2/compile.cc Prog::Inst* inst_; // Pointer to first instruction. Prog 241 third_party/re2/re2/compile.cc prog_ = new Prog(); Prog 271 third_party/re2/re2/compile.cc Prog::Inst* ip = new Prog::Inst[inst_cap_]; Prog 284 third_party/re2/re2/compile.cc Prog::Inst* ip = new Prog::Inst[inst_len_]; Prog 312 third_party/re2/re2/compile.cc Prog::Inst* begin = &inst_[a.begin]; Prog 440 third_party/re2/re2/compile.cc for (j = i+1; j < 256 && Prog::IsWordChar(i) == Prog::IsWordChar(j); j++) Prog 961 third_party/re2/re2/compile.cc } else if (max_mem <= sizeof(Prog)) { Prog 965 third_party/re2/re2/compile.cc int64 m = (max_mem - sizeof(Prog)) / sizeof(Prog::Inst); Prog 978 third_party/re2/re2/compile.cc if (m > Prog::Inst::kMaxInst) Prog 979 third_party/re2/re2/compile.cc m = Prog::Inst::kMaxInst; Prog 992 third_party/re2/re2/compile.cc Prog* Compiler::Compile(Regexp* re, bool reversed, int64 max_mem) { Prog 1044 third_party/re2/re2/compile.cc Prog* Compiler::Finish() { Prog 1068 third_party/re2/re2/compile.cc int64 m = max_mem_ - sizeof(Prog) - inst_len_*sizeof(Prog::Inst); Prog 1074 third_party/re2/re2/compile.cc Prog* p = prog_; Prog 1080 third_party/re2/re2/compile.cc Prog* Regexp::CompileToProg(int64 max_mem) { Prog 1084 third_party/re2/re2/compile.cc Prog* Regexp::CompileToReverseProg(int64 max_mem) { Prog 1093 third_party/re2/re2/compile.cc Prog* Compiler::CompileSet(const RE2::Options& options, RE2::Anchor anchor, Prog 1117 third_party/re2/re2/compile.cc Prog* prog = c.Finish(); Prog 1125 third_party/re2/re2/compile.cc prog->SearchDFA(sp, sp, Prog::kAnchored, Prog::kManyMatch, Prog 1135 third_party/re2/re2/compile.cc Prog* Prog::CompileSet(const RE2::Options& options, RE2::Anchor anchor, Prog 59 third_party/re2/re2/dfa.cc DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem); Prog 62 third_party/re2/re2/dfa.cc Prog::MatchKind kind() { return kind_; } Prog 234 third_party/re2/re2/dfa.cc Prog::MatchKind kind, Prog 343 third_party/re2/re2/dfa.cc Prog* prog_; // The regular expression program to run. Prog 344 third_party/re2/re2/dfa.cc Prog::MatchKind kind_; // The kind of DFA. Prog 436 third_party/re2/re2/dfa.cc DFA::DFA(Prog* prog, Prog::MatchKind kind, int64 max_mem) Prog 449 third_party/re2/re2/dfa.cc if (kind_ == Prog::kLongestMatch) { Prog 623 third_party/re2/re2/dfa.cc if (sawmatch && (kind_ == Prog::kFirstMatch || q->is_mark(id))) Prog 632 third_party/re2/re2/dfa.cc Prog::Inst* ip = prog_->inst(id); Prog 639 third_party/re2/re2/dfa.cc if (kind_ != Prog::kManyMatch && Prog 640 third_party/re2/re2/dfa.cc (kind_ != Prog::kFirstMatch || Prog 642 third_party/re2/re2/dfa.cc (kind_ != Prog::kLongestMatch || !sawmark) && Prog 714 third_party/re2/re2/dfa.cc if (kind_ == Prog::kLongestMatch) { Prog 844 third_party/re2/re2/dfa.cc Prog::Inst* ip = prog_->inst(id); Prog 913 third_party/re2/re2/dfa.cc Prog::MatchKind kind, Prog 927 third_party/re2/re2/dfa.cc Prog::Inst* ip = prog_->inst(id); Prog 946 third_party/re2/re2/dfa.cc if (kind == Prog::kFirstMatch) { Prog 1026 third_party/re2/re2/dfa.cc bool isword = (c != kByteEndText && Prog::IsWordChar(c)); Prog 1049 third_party/re2/re2/dfa.cc if (c != kByteEndText || kind_ != Prog::kManyMatch) Prog 1512 third_party/re2/re2/dfa.cc if (params->matches && kind_ == Prog::kManyMatch) { Prog 1516 third_party/re2/re2/dfa.cc Prog::Inst* ip = prog_->inst(s->inst_[i]); Prog 1634 third_party/re2/re2/dfa.cc } else if (Prog::IsWordChar(text.begin()[-1] & 0xFF)) { Prog 1648 third_party/re2/re2/dfa.cc } else if (Prog::IsWordChar(text.end()[0] & 0xFF)) { Prog 1815 third_party/re2/re2/dfa.cc DFA* Prog::GetDFA(MatchKind kind) { Prog 1871 third_party/re2/re2/dfa.cc bool Prog::SearchDFA(const StringPiece& text, const StringPiece& const_context, Prog 1970 third_party/re2/re2/dfa.cc int Prog::BuildEntireDFA(MatchKind kind) { Prog 2119 third_party/re2/re2/dfa.cc bool Prog::PossibleMatchRange(string* min, string* max, int maxlen) { Prog 2126 third_party/re2/re2/dfa.cc dfa_longest_ = new DFA(this, Prog::kLongestMatch, dfa_mem_/2); Prog 36 third_party/re2/re2/nfa.cc NFA(Prog* prog); Prog 109 third_party/re2/re2/nfa.cc Prog* prog_; // underlying program Prog 128 third_party/re2/re2/nfa.cc NFA::NFA(Prog* prog) { Prog 223 third_party/re2/re2/nfa.cc Prog::Inst* ip = prog_->inst(id); Prog 309 third_party/re2/re2/nfa.cc Prog::Inst* ip = prog_->inst(id); Prog 471 third_party/re2/re2/nfa.cc wasword = Prog::IsWordChar(c); Prog 494 third_party/re2/re2/nfa.cc isword = Prog::IsWordChar(p[0] & 0xFF); Prog 525 third_party/re2/re2/nfa.cc Prog::Inst* ip = prog_->inst(id); Prog 577 third_party/re2/re2/nfa.cc isword = Prog::IsWordChar(p[0] & 0xFF); Prog 579 third_party/re2/re2/nfa.cc flag = Prog::EmptyFlags(context, p); Prog 634 third_party/re2/re2/nfa.cc Prog::Inst* ip = prog_->inst(id); Prog 686 third_party/re2/re2/nfa.cc Prog::SearchNFA(const StringPiece& text, const StringPiece& context, Prog 178 third_party/re2/re2/onepass.cc COMPILE_ASSERT(kMaxCap == Prog::kMaxOnePassCapture*2, Prog 183 third_party/re2/re2/onepass.cc uint32 satisfied = Prog::EmptyFlags(context, p); Prog 207 third_party/re2/re2/onepass.cc bool Prog::SearchOnePass(const StringPiece& text, Prog 378 third_party/re2/re2/onepass.cc bool Prog::IsOnePass() { Prog 430 third_party/re2/re2/onepass.cc Prog::Inst* ip = inst(id); Prog 17 third_party/re2/re2/prog.cc void Prog::Inst::InitAlt(uint32 out, uint32 out1) { Prog 23 third_party/re2/re2/prog.cc void Prog::Inst::InitByteRange(int lo, int hi, int foldcase, uint32 out) { Prog 31 third_party/re2/re2/prog.cc void Prog::Inst::InitCapture(int cap, uint32 out) { Prog 37 third_party/re2/re2/prog.cc void Prog::Inst::InitEmptyWidth(EmptyOp empty, uint32 out) { Prog 43 third_party/re2/re2/prog.cc void Prog::Inst::InitMatch(int32 id) { Prog 49 third_party/re2/re2/prog.cc void Prog::Inst::InitNop(uint32 out) { Prog 54 third_party/re2/re2/prog.cc void Prog::Inst::InitFail() { Prog 59 third_party/re2/re2/prog.cc string Prog::Inst::Dump() { Prog 93 third_party/re2/re2/prog.cc Prog::Prog() Prog 115 third_party/re2/re2/prog.cc Prog::~Prog() { Prog 134 third_party/re2/re2/prog.cc static string ProgToString(Prog* prog, Workq* q) { Prog 139 third_party/re2/re2/prog.cc Prog::Inst* ip = prog->inst(id); Prog 148 third_party/re2/re2/prog.cc string Prog::Dump() { Prog 165 third_party/re2/re2/prog.cc string Prog::DumpUnanchored() { Prog 171 third_party/re2/re2/prog.cc static bool IsMatch(Prog*, Prog::Inst*); Prog 174 third_party/re2/re2/prog.cc void Prog::Optimize() { Prog 238 third_party/re2/re2/prog.cc static bool IsMatch(Prog* prog, Prog::Inst* ip) { Prog 263 third_party/re2/re2/prog.cc uint32 Prog::EmptyFlags(const StringPiece& text, const char* p) { Prog 297 third_party/re2/re2/prog.cc void Prog::MarkByteRange(int lo, int hi) { Prog 307 third_party/re2/re2/prog.cc void Prog::ComputeByteMap() { Prog 78 third_party/re2/re2/prog.h class Prog { Prog 80 third_party/re2/re2/prog.h Prog(); Prog 81 third_party/re2/re2/prog.h ~Prog(); Prog 98 third_party/re2/re2/prog.h int id(Prog* p) { return this - p->inst_; } Prog 108 third_party/re2/re2/prog.h bool greedy(Prog *p) { Prog 168 third_party/re2/re2/prog.h friend class Prog; Prog 334 third_party/re2/re2/prog.h static Prog* CompileSet(const RE2::Options& options, RE2::Anchor anchor, Prog 371 third_party/re2/re2/prog.h DISALLOW_EVIL_CONSTRUCTORS(Prog); Prog 251 third_party/re2/re2/re2.cc re2::Prog* RE2::ReverseProg() const { Prog 610 third_party/re2/re2/re2.cc Prog::Anchor anchor = Prog::kUnanchored; Prog 611 third_party/re2/re2/re2.cc Prog::MatchKind kind = Prog::kFirstMatch; Prog 613 third_party/re2/re2/re2.cc kind = Prog::kLongestMatch; Prog 616 third_party/re2/re2/re2.cc bool can_one_pass = (is_one_pass_ && ncap <= Prog::kMaxOnePassCapture); Prog 658 third_party/re2/re2/re2.cc Prog* prog = ReverseProg(); Prog 661 third_party/re2/re2/re2.cc if (!prog->SearchDFA(match, text, Prog::kAnchored, Prog 662 third_party/re2/re2/re2.cc Prog::kLongestMatch, &match, &dfa_failed, NULL)) { Prog 690 third_party/re2/re2/re2.cc kind = Prog::kFullMatch; Prog 691 third_party/re2/re2/re2.cc anchor = Prog::kAnchored; Prog 751 third_party/re2/re2/re2.cc anchor = Prog::kAnchored; Prog 752 third_party/re2/re2/re2.cc kind = Prog::kFullMatch; Prog 755 third_party/re2/re2/re2.cc if (can_one_pass && anchor != Prog::kUnanchored) { Prog 194 third_party/re2/re2/re2.h class Prog; Prog 690 third_party/re2/re2/re2.h re2::Prog* ReverseProg() const; Prog 699 third_party/re2/re2/re2.h re2::Prog* prog_; // compiled program for regexp Prog 700 third_party/re2/re2/re2.h mutable re2::Prog* rprog_; // reverse program for regexp Prog 218 third_party/re2/re2/regexp.h class Prog; Prog 413 third_party/re2/re2/regexp.h Prog* CompileToProg(int64 max_mem); Prog 414 third_party/re2/re2/regexp.h Prog* CompileToReverseProg(int64 max_mem); Prog 90 third_party/re2/re2/set.cc prog_ = Prog::CompileSet(options_, anchor_, re); Prog 101 third_party/re2/re2/set.cc bool ret = prog_->SearchDFA(text, text, Prog::kAnchored, Prog 102 third_party/re2/re2/set.cc Prog::kManyMatch, NULL, &failed, v); Prog 46 third_party/re2/re2/set.h re2::Prog* prog_; Prog 50 third_party/re2/re2/testing/backtrack.cc explicit Backtracker(Prog* prog); Prog 63 third_party/re2/re2/testing/backtrack.cc Prog* prog_; // program being run Prog 78 third_party/re2/re2/testing/backtrack.cc Backtracker::Backtracker(Prog* prog) Prog 165 third_party/re2/re2/testing/backtrack.cc Prog::Inst* ip = prog_->inst(id); Prog 199 third_party/re2/re2/testing/backtrack.cc if (ip->empty() & ~Prog::EmptyFlags(context_, p)) Prog 225 third_party/re2/re2/testing/backtrack.cc bool Prog::UnsafeSearchBacktrack(const StringPiece& text, Prog 114 third_party/re2/re2/testing/compile_test.cc Prog* prog = re->CompileToProg(0); Prog 161 third_party/re2/re2/testing/compile_test.cc Prog* prog = re->CompileToProg(0); Prog 26 third_party/re2/re2/testing/dfa_test.cc BuildThread(Prog* prog) : prog_(prog) {} Prog 28 third_party/re2/re2/testing/dfa_test.cc CHECK(prog_->BuildEntireDFA(Prog::kFirstMatch)); Prog 32 third_party/re2/re2/testing/dfa_test.cc Prog* prog_; Prog 47 third_party/re2/re2/testing/dfa_test.cc Prog* prog = re->CompileToProg(0); Prog 62 third_party/re2/re2/testing/dfa_test.cc Prog* prog = re->CompileToProg(0); Prog 79 third_party/re2/re2/testing/dfa_test.cc prog->BuildEntireDFA(Prog::kFirstMatch); Prog 105 third_party/re2/re2/testing/dfa_test.cc Prog* prog = re->CompileToProg(limit); Prog 109 third_party/re2/re2/testing/dfa_test.cc prog->BuildEntireDFA(Prog::kFirstMatch); Prog 110 third_party/re2/re2/testing/dfa_test.cc prog->BuildEntireDFA(Prog::kLongestMatch); Prog 205 third_party/re2/re2/testing/dfa_test.cc Prog* prog = re->CompileToProg(1<<n); Prog 210 third_party/re2/re2/testing/dfa_test.cc Prog::kUnanchored, Prog::kFirstMatch, Prog 215 third_party/re2/re2/testing/dfa_test.cc Prog::kUnanchored, Prog::kFirstMatch, Prog 237 third_party/re2/re2/testing/dfa_test.cc SearchThread(Prog* prog, const StringPiece& match, Prog 245 third_party/re2/re2/testing/dfa_test.cc Prog::kUnanchored, Prog::kFirstMatch, Prog 250 third_party/re2/re2/testing/dfa_test.cc Prog::kUnanchored, Prog::kFirstMatch, Prog 258 third_party/re2/re2/testing/dfa_test.cc Prog* prog_; Prog 275 third_party/re2/re2/testing/dfa_test.cc Prog* prog = re->CompileToProg(1<<n); Prog 289 third_party/re2/re2/testing/dfa_test.cc Prog* prog = re->CompileToProg(1<<n); Prog 330 third_party/re2/re2/testing/dfa_test.cc Prog *prog = re->CompileToReverseProg(0); Prog 333 third_party/re2/re2/testing/dfa_test.cc bool matched = prog->SearchDFA(t.text, NULL, Prog::kUnanchored, Prog::kFirstMatch, NULL, &failed, NULL); Prog 112 third_party/re2/re2/testing/possible_match_test.cc Prog* prog = re->CompileToProg(0); Prog 26 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 31 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); Prog 53 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 60 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); Prog 97 third_party/re2/re2/testing/regexp_benchmark.cc static_cast<int>(sizeof(Prog)), Prog 98 third_party/re2/re2/testing/regexp_benchmark.cc static_cast<int>(sizeof(Prog::Inst))); Prog 106 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match); Prog 156 third_party/re2/re2/testing/regexp_benchmark.cc search(iters, regexp, s, Prog::kUnanchored, false); Prog 249 third_party/re2/re2/testing/regexp_benchmark.cc search(iters, regexp.c_str(), s, Prog::kUnanchored, true); Prog 290 third_party/re2/re2/testing/regexp_benchmark.cc search(iters, regexp, s, Prog::kAnchored, true); Prog 351 third_party/re2/re2/testing/regexp_benchmark.cc StringPiece(text, len), Prog::kAnchored, true); Prog 600 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = sre->CompileToProg(0); Prog 612 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 623 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 633 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 802 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 806 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 809 third_party/re2/re2/testing/regexp_benchmark.cc CHECK_EQ(prog->SearchDFA(text, NULL, anchor, Prog::kFirstMatch, Prog 819 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 823 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 825 third_party/re2/re2/testing/regexp_benchmark.cc CHECK_EQ(prog->SearchNFA(text, NULL, anchor, Prog::kFirstMatch, NULL, 0), Prog 833 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 837 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 840 third_party/re2/re2/testing/regexp_benchmark.cc CHECK_EQ(prog->SearchOnePass(text, text, anchor, Prog::kFirstMatch, NULL, 0), Prog 848 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 852 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 854 third_party/re2/re2/testing/regexp_benchmark.cc CHECK_EQ(prog->SearchBitState(text, text, anchor, Prog::kFirstMatch, NULL, 0), Prog 862 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 866 third_party/re2/re2/testing/regexp_benchmark.cc if (anchor == Prog::kAnchored) Prog 874 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 878 third_party/re2/re2/testing/regexp_benchmark.cc if (anchor == Prog::kAnchored) Prog 890 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 893 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(1LL<<31); Prog 898 third_party/re2/re2/testing/regexp_benchmark.cc Prog::kFirstMatch, NULL, &failed, NULL), Prog 907 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 910 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 913 third_party/re2/re2/testing/regexp_benchmark.cc CHECK_EQ(prog->SearchNFA(text, NULL, anchor, Prog::kFirstMatch, NULL, 0), Prog 921 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 924 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 928 third_party/re2/re2/testing/regexp_benchmark.cc CHECK_EQ(prog->SearchOnePass(text, text, anchor, Prog::kFirstMatch, NULL, 0), Prog 935 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 938 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 941 third_party/re2/re2/testing/regexp_benchmark.cc CHECK_EQ(prog->SearchBitState(text, text, anchor, Prog::kFirstMatch, NULL, 0), Prog 948 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 952 third_party/re2/re2/testing/regexp_benchmark.cc if (anchor == Prog::kAnchored) Prog 960 third_party/re2/re2/testing/regexp_benchmark.cc Prog::Anchor anchor, bool expect_match) { Prog 964 third_party/re2/re2/testing/regexp_benchmark.cc if (anchor == Prog::kAnchored) Prog 979 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 982 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchNFA(text, NULL, Prog::kAnchored, Prog::kFullMatch, sp, 4)); Prog 992 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 996 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); Prog 1006 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1009 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchBitState(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); Prog 1019 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1022 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->UnsafeSearchBacktrack(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); Prog 1049 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1053 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchNFA(text, NULL, Prog::kAnchored, Prog::kFullMatch, sp, 4)); Prog 1062 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1067 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); Prog 1075 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1079 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchBitState(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); Prog 1087 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1091 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->UnsafeSearchBacktrack(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 4)); Prog 1122 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1125 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchNFA(text, NULL, Prog::kAnchored, Prog::kFullMatch, sp, 2)); Prog 1135 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1139 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 2)); Prog 1149 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1152 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchBitState(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 2)); Prog 1179 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1183 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchNFA(text, NULL, Prog::kAnchored, Prog::kFullMatch, sp, 2)); Prog 1192 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1197 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchOnePass(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 2)); Prog 1205 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1209 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->SearchBitState(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 2)); Prog 1217 third_party/re2/re2/testing/regexp_benchmark.cc Prog* prog = re->CompileToProg(0); Prog 1221 third_party/re2/re2/testing/regexp_benchmark.cc CHECK(prog->UnsafeSearchBacktrack(text, text, Prog::kAnchored, Prog::kFullMatch, sp, 2)); Prog 109 third_party/re2/re2/testing/tester.cc static string FormatKind(Prog::MatchKind kind) { Prog 111 third_party/re2/re2/testing/tester.cc case Prog::kFullMatch: Prog 113 third_party/re2/re2/testing/tester.cc case Prog::kLongestMatch: Prog 115 third_party/re2/re2/testing/tester.cc case Prog::kFirstMatch: Prog 117 third_party/re2/re2/testing/tester.cc case Prog::kManyMatch: Prog 124 third_party/re2/re2/testing/tester.cc static string FormatAnchor(Prog::Anchor anchor) { Prog 126 third_party/re2/re2/testing/tester.cc case Prog::kAnchored: Prog 128 third_party/re2/re2/testing/tester.cc case Prog::kUnanchored: Prog 161 third_party/re2/re2/testing/tester.cc TestInstance::TestInstance(const StringPiece& regexp_str, Prog::MatchKind kind, Prog 231 third_party/re2/re2/testing/tester.cc if (kind_ == Prog::kLongestMatch) Prog 251 third_party/re2/re2/testing/tester.cc kind_ != Prog::kLongestMatch) { Prog 282 third_party/re2/re2/testing/tester.cc Prog::Anchor anchor, Prog 343 third_party/re2/re2/testing/tester.cc Prog::kAnchored, Prog::kLongestMatch, Prog 356 third_party/re2/re2/testing/tester.cc anchor == Prog::kUnanchored || Prog 358 third_party/re2/re2/testing/tester.cc nsubmatch > Prog::kMaxOnePassCapture) { Prog 386 third_party/re2/re2/testing/tester.cc if (anchor == Prog::kAnchored) Prog 390 third_party/re2/re2/testing/tester.cc if (kind_ == Prog::kFullMatch) Prog 416 third_party/re2/re2/testing/tester.cc if (anchor == Prog::kAnchored) Prog 420 third_party/re2/re2/testing/tester.cc if (kind_ == Prog::kFullMatch) Prog 475 third_party/re2/re2/testing/tester.cc Prog::Anchor anchor) { Prog 554 third_party/re2/re2/testing/tester.cc Prog::Anchor anchor) { Prog 575 third_party/re2/re2/testing/tester.cc static Prog::MatchKind kinds[] = { Prog 576 third_party/re2/re2/testing/tester.cc Prog::kFirstMatch, Prog 577 third_party/re2/re2/testing/tester.cc Prog::kLongestMatch, Prog 578 third_party/re2/re2/testing/tester.cc Prog::kFullMatch, Prog 600 third_party/re2/re2/testing/tester.cc Prog::Anchor anchor) { Prog 607 third_party/re2/re2/testing/tester.cc static Prog::Anchor anchors[] = { Prog 608 third_party/re2/re2/testing/tester.cc Prog::kAnchored, Prog 609 third_party/re2/re2/testing/tester.cc Prog::kUnanchored Prog 54 third_party/re2/re2/testing/tester.h TestInstance(const StringPiece& regexp, Prog::MatchKind kind, Prog 63 third_party/re2/re2/testing/tester.h Prog::Anchor anchor); Prog 69 third_party/re2/re2/testing/tester.h Prog::Anchor anchor, Prog 73 third_party/re2/re2/testing/tester.h const StringPiece& context, Prog::Anchor anchor); Prog 76 third_party/re2/re2/testing/tester.h Prog::MatchKind kind_; // kind of match Prog 82 third_party/re2/re2/testing/tester.h Prog* prog_; // compiled program Prog 83 third_party/re2/re2/testing/tester.h Prog* rprog_; // compiled reverse program Prog 101 third_party/re2/re2/testing/tester.h Prog::Anchor anchor);