Lines Matching refs:match
189 // which is not a match for 0[01]{n}$. Adding one more 0 is a match.
191 string match = no_match + "0";
209 matched = prog->SearchDFA(match, NULL,
233 // Helper thread: searches for match, which should match,
237 SearchThread(Prog* prog, const StringPiece& match,
239 : prog_(prog), match_(match), no_match_(no_match) {}
270 string match = no_match + "0";
277 SearchThread* t = new SearchThread(prog, match, no_match);
294 SearchThread *t = new SearchThread(prog, match, no_match);
312 bool match;
334 if (matched != t.match) {
335 LOG(ERROR) << t.regexp << " on " << t.text << ": want " << t.match;
