Lines Matching refs:prog
7 #include "re2/prog.h"
23 // Helper thread: builds entire DFA for prog.
26 BuildThread(Prog* prog) : prog_(prog) {}
28 CHECK(prog_->BuildEntireDFA(Prog::kFirstMatch));
32 Prog* prog_;
47 Prog* prog = re->CompileToProg(0);
48 CHECK(prog);
49 BuildThread* t = new BuildThread(prog);
54 delete prog;
62 Prog* prog = re->CompileToProg(0);
63 CHECK(prog);
67 BuildThread *t = new BuildThread(prog);
79 prog->BuildEntireDFA(Prog::kFirstMatch);
80 delete prog;
105 Prog* prog = re->CompileToProg(limit);
106 CHECK(prog);
108 //dfamem = prog->dfa_mem();
109 prog->BuildEntireDFA(Prog::kFirstMatch);
110 prog->BuildEntireDFA(Prog::kLongestMatch);
112 delete prog;
116 //LOG(INFO) << StringPrintf("Limit %d: prog used %d, DFA budget %d, total %d\n",
205 Prog* prog = re->CompileToProg(1<<n);
206 CHECK(prog);
209 matched = prog->SearchDFA(match, NULL,
210 Prog::kUnanchored, Prog::kFirstMatch,
214 matched = prog->SearchDFA(no_match, NULL,
215 Prog::kUnanchored, Prog::kFirstMatch,
222 delete prog;
237 SearchThread(Prog* prog, const StringPiece& match,
239 : prog_(prog), match_(match), no_match_(no_match) {}
245 Prog::kUnanchored, Prog::kFirstMatch,
250 Prog::kUnanchored, Prog::kFirstMatch,
258 Prog* prog_;
275 Prog* prog = re->CompileToProg(1<<n);
276 CHECK(prog);
277 SearchThread* t = new SearchThread(prog, match, no_match);
282 delete prog;
289 Prog* prog = re->CompileToProg(1<<n);
290 CHECK(prog);
294 SearchThread *t = new SearchThread(prog, match, no_match);
304 delete prog;
330 Prog *prog = re->CompileToReverseProg(0);
331 CHECK(prog);
333 bool matched = prog->SearchDFA(t.text, NULL, Prog::kUnanchored, Prog::kFirstMatch, NULL, &failed, NULL);
338 delete prog;
