| /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 | 217 Prog* prog_; // Program being built. member in class:re2::Compiler
239 prog_ = new Prog();
254 delete prog_;
396 prog_->byte_inst_count_++;
397 prog_->MarkByteRange(lo, hi);
404 prog_->MarkByteRange(lo + 'A' - 'a', hi + 'A' - 'a');
434 prog_->MarkByteRange('\n', '\n');
440 prog_->MarkByteRange(i, j-1);
952 prog_->set_flags(flags);
986 // 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 | 155 prog_ = NULL;
189 prog_ = suffix_regexp_->CompileToProg(options_.max_mem()*2/3);
190 if (prog_ == NULL) {
203 is_one_pass_ = prog_->IsOnePass();
231 delete prog_;
242 if (prog_ == NULL)
244 return prog_->size();
441 if (prog_ == NULL)
463 if (maxlen > 0 && prog_->PossibleMatchRange(&dmin, &dmax, maxlen)) {
467 // prog_->PossibleMatchRange has failed us
[all...] |
| dfa.cc | 309 return prog_->bytemap_range();
310 return prog_->bytemap()[c];
314 Prog* prog_; // The regular expression program to run. member in class:re2::DFA
408 : prog_(prog),
417 fprintf(stderr, "\nkind %d\n%s\n", (int)kind_, prog_->DumpUnanchored().c_str());
428 mem_budget_ -= (prog_->size() + nmark) *
433 prog_->size(), max_mem);
444 int one_state = sizeof(State) + (prog_->size()+nmark)*sizeof(int) +
445 (prog_->bytemap_range()+1)*sizeof(State*);
448 prog_->size(), max_mem)
[all...] |
| re2.h | 693 re2::Prog* prog_; // compiled program for regexp member in class:re2::RE2
695 bool is_one_pass_; // can use prog_->SearchOnePass?
[all...] |
