Home
last modified time | relevance | path

Searched refs:Workq (Results 1 – 3 of 3) sorted by relevance

/external/regex-re2/re2/
Dprog.cc127 typedef SparseSet Workq; typedef
129 static inline void AddToQueue(Workq* q, int id) { in AddToQueue()
134 static string ProgToString(Prog* prog, Workq* q) { in ProgToString()
137 for (Workq::iterator i = q->begin(); i != q->end(); ++i) { in ProgToString()
160 Workq q(size_); in Dump()
166 Workq q(size_); in DumpUnanchored()
175 Workq q(size_); in Optimize()
181 for (Workq::iterator i = q.begin(); i != q.end(); ++i) { in Optimize()
212 for (Workq::iterator i = q.begin(); i != q.end(); ++i) { in Optimize()
Ddfa.cc89 class Workq;
208 State* WorkqToCachedState(Workq* q, uint flag);
220 static void StateToWorkq(State* s, Workq* q);
230 void RunWorkqOnByte(Workq* q, Workq* nq,
237 void RunWorkqOnEmptyString(Workq* q, Workq* nq, uint flag);
242 void AddToQueue(Workq* q, int id, uint flag);
248 static string DumpWorkq(Workq* q);
349 Workq* q0_; // Two pre-allocated work queues.
350 Workq* q1_;
384 class DFA::Workq : public SparseSet { class in re2::DFA
[all …]
Dnfa.cc629 typedef SparseSet Workq; in ComputeFirstByte() typedef
630 Workq q(prog_->size()); in ComputeFirstByte()
632 for (Workq::iterator it = q.begin(); it != q.end(); ++it) { in ComputeFirstByte()