Home | History | Annotate | Download | only in re2

Lines Matching defs:ip

93 // Should the search visit the pair ip, p?
156 // the loop simply updates ip, p, and arg
167 // Visit ip, p.
168 // VLOG(0) << "Job: " << ip->id() << " "
170 Prog::Inst* ip = prog_->inst(id);
171 switch (ip->opcode()) {
174 LOG(DFATAL) << "Unexpected opcode: " << ip->opcode() << " arg " << arg;
179 // Push(ip->out1(), p, 0);
180 // Push(ip->out(), p, 0);
181 // If, during the processing of ip->out(), we encounter
182 // ip->out1() via another path, we want to process it then.
184 // ip with arg==1 as a reminder to push ip->out1() later.
188 id = ip->out();
192 // Finished ip->out(); try ip->out1().
194 id = ip->out1();
202 if (ip->greedy(prog_)) {
204 Push(ip->out1(), p, 0);
205 id = ip->out1();
210 Push(ip->out(), end, 0);
211 id = ip->out();
218 if (ip->Matches(c)) {
219 id = ip->out();
229 if (0 <= ip->cap() && ip->cap() < ncap_) {
231 Push(id, cap_[ip->cap()], 1); // come back when we're done
232 cap_[ip->cap()] = p;
235 id = ip->out();
238 // Finished ip->out(); restore the old value.
239 cap_[ip->cap()] = p;
246 if (ip->empty() & ~Prog::EmptyFlags(context_, p))
248 id = ip->out();
252 id = ip->out();