Lines Matching refs:prog
30 static void DoBuild(Prog* prog) { in DoBuild() argument
31 ASSERT_TRUE(prog->BuildEntireDFA(Prog::kFirstMatch, nullptr)); in DoBuild()
45 Prog* prog = re->CompileToProg(0); in TEST() local
46 ASSERT_TRUE(prog != NULL); in TEST()
48 std::thread t(DoBuild, prog); in TEST()
51 delete prog; in TEST()
56 Prog* prog = re->CompileToProg(0); in TEST() local
57 ASSERT_TRUE(prog != NULL); in TEST()
61 threads.emplace_back(DoBuild, prog); in TEST()
66 prog->BuildEntireDFA(Prog::kFirstMatch, nullptr); in TEST()
67 delete prog; in TEST()
87 Prog* prog = re->CompileToProg(limit); in TEST() local
88 ASSERT_TRUE(prog != NULL); in TEST()
91 prog->BuildEntireDFA(Prog::kFirstMatch, nullptr); in TEST()
92 prog->BuildEntireDFA(Prog::kLongestMatch, nullptr); in TEST()
94 delete prog; in TEST()
190 Prog* prog = re->CompileToProg(1<<n); in TEST() local
191 ASSERT_TRUE(prog != NULL); in TEST()
195 matched = prog->SearchDFA(match, StringPiece(), Prog::kUnanchored, in TEST()
199 matched = prog->SearchDFA(no_match, StringPiece(), Prog::kUnanchored, in TEST()
206 delete prog; in TEST()
222 static void DoSearch(Prog* prog, const StringPiece& match, in DoSearch() argument
227 matched = prog->SearchDFA(match, StringPiece(), Prog::kUnanchored, in DoSearch()
231 matched = prog->SearchDFA(no_match, StringPiece(), Prog::kUnanchored, in DoSearch()
251 Prog* prog = re->CompileToProg(1<<n); in TEST() local
252 ASSERT_TRUE(prog != NULL); in TEST()
254 std::thread t(DoSearch, prog, match, no_match); in TEST()
257 delete prog; in TEST()
263 Prog* prog = re->CompileToProg(1<<n); in TEST() local
264 ASSERT_TRUE(prog != NULL); in TEST()
268 threads.emplace_back(DoSearch, prog, match, no_match); in TEST()
272 delete prog; in TEST()
302 Prog* prog = re->CompileToReverseProg(0); in TEST() local
303 ASSERT_TRUE(prog != NULL); in TEST()
305 bool matched = prog->SearchDFA(t.text, StringPiece(), Prog::kUnanchored, in TEST()
311 delete prog; in TEST()
357 Prog* prog = re->CompileToProg(0); in TEST() local
358 ASSERT_TRUE(prog != NULL); in TEST()
360 prog->BuildEntireDFA(Prog::kLongestMatch, [&](const int* next, bool match) { in TEST()
365 for (int b = 0; b < prog->bytemap_range() + 1; b++) in TEST()
371 LOG(ERROR) << t.regexp << " bytemap:\n" << prog->DumpByteMap(); in TEST()
375 delete prog; in TEST()