| /external/regex-re2/re2/ |
| bitstate.cc | 49 Prog* prog_; // program being run member in class:re2::BitState
72 : prog_(prog),
125 int op = prog_->inst(id)->opcode();
170 Prog::Inst* ip = prog_->inst(id);
202 if (ip->greedy(prog_)) {
292 // Search text (within context) for prog_.
301 if (prog_->anchor_start() && context_.begin() != text.begin())
303 if (prog_->anchor_end() && context_.end() != text.end())
305 anchored_ = anchored || prog_->anchor_start();
306 longest_ = longest || prog_->anchor_end()
[all...] |
| set.cc | 18 prog_ = NULL;
25 delete prog_;
90 prog_ = Prog::CompileSet(options_, anchor_, re);
91 return prog_ != NULL;
101 bool ret = prog_->SearchDFA(text, text, Prog::kAnchored,
|
| set.h | 46 re2::Prog* prog_; member in class:re2::RE2::Set
|
| compile.cc | 218 Prog* prog_; // Program being built. member in class:re2::Compiler
240 prog_ = new Prog();
255 delete prog_;
397 prog_->byte_inst_count_++;
398 prog_->MarkByteRange(lo, hi);
405 prog_->MarkByteRange(lo + 'A' - 'a', hi + 'A' - 'a');
435 prog_->MarkByteRange('\n', '\n');
441 prog_->MarkByteRange(i, j-1);
953 prog_->set_flags(flags);
987 // Caller is responsible for deleting prog_
[all...] |
| nfa.cc | 109 Prog* prog_; // underlying program member in class:re2::NFA
129 prog_ = prog;
136 q0_.resize(prog_->size());
137 q1_.resize(prog_->size());
138 nastack_ = 2*prog_->size();
192 // It has room for 2*prog_->size() entries, which is enough:
223 Prog::Inst* ip = prog_->inst(id);
309 Prog::Inst* ip = prog_->inst(id);
326 if (ip->greedy(prog_) || longest_) {
333 if (ip->greedy(prog_))
[all...] |
| re2.cc | 181 prog_ = NULL;
215 prog_ = suffix_regexp_->CompileToProg(options_.max_mem()*2/3);
216 if (prog_ == NULL) {
229 is_one_pass_ = prog_->IsOnePass();
254 delete prog_;
265 if (prog_ == NULL)
267 return prog_->size();
464 if (prog_ == NULL)
486 if (maxlen > 0 && prog_->PossibleMatchRange(&dmin, &dmax, maxlen)) {
490 // prog_->PossibleMatchRange has failed us
[all...] |
| dfa.cc | 336 return prog_->bytemap_range();
337 return prog_->bytemap()[c];
341 Prog* prog_; // The regular expression program to run. member in class:re2::DFA
435 : prog_(prog),
444 fprintf(stderr, "\nkind %d\n%s\n", (int)kind_, prog_->DumpUnanchored().c_str());
455 mem_budget_ -= (prog_->size() + nmark) *
460 prog_->size(), max_mem);
471 int64 one_state = sizeof(State) + (prog_->size()+nmark)*sizeof(int) +
472 (prog_->bytemap_range()+1)*sizeof(State*);
475 prog_->size(), max_mem)
[all...] |
| re2.h | 711 re2::Prog* prog_; // compiled program for regexp member in class:re2::RE2
713 bool is_one_pass_; // can use prog_->SearchOnePass?
[all...] |
| /external/regex-re2/re2/testing/ |
| backtrack.cc | 63 Prog* prog_; // program being run member in class:re2::Backtracker
79 : prog_(prog),
101 if (prog_->anchor_start() && text.begin() > context_.begin())
103 if (prog_->anchor_end() && text.end() < context_.end())
105 anchored_ = anchored | prog_->anchor_start();
106 longest_ = longest | prog_->anchor_end();
107 endmatch_ = prog_->anchor_end();
125 nvisited_ = (prog_->size()*(text.size()+1) + 31)/32;
132 return Visit(prog_->start(), text.begin());
140 if (Visit(prog_->start(), p)) // Match must be leftmost; done
[all...] |
| tester.cc | 169 prog_(NULL),
187 prog_ = regexp_->CompileToProg(0);
188 if (prog_ == NULL) {
200 << prog_->Dump();
270 delete prog_;
301 if (prog_ == NULL) {
306 prog_->UnsafeSearchBacktrack(text, context, anchor, kind_,
312 if (prog_ == NULL) {
317 prog_->SearchNFA(text, context, anchor, kind_,
323 if (prog_ == NULL)
[all...] |
| dfa_test.cc | 26 BuildThread(Prog* prog) : prog_(prog) {}
28 CHECK(prog_->BuildEntireDFA(Prog::kFirstMatch));
32 Prog* prog_; member in class:re2::BuildThread
239 : prog_(prog), match_(match), no_match_(no_match) {}
244 matched = prog_->SearchDFA(match_, NULL,
249 matched = prog_->SearchDFA(no_match_, NULL,
258 Prog* prog_; member in class:re2::SearchThread
|
| tester.h | 82 Prog* prog_; // compiled program member in class:re2::TestInstance
|
