36   virtual T PreVisit(Regexp* re, T parent_arg, bool* stop);
47   virtual T PostVisit(Regexp* re, T parent_arg, T pre_arg,
62   virtual T ShortVisit(Regexp* re, T parent_arg) = 0;
67   T Walk(Regexp* re, T top_arg);
77   T WalkExponential(Regexp* re, T top_arg, int max_visits);
93   T WalkInternal(Regexp* re, T top_arg, bool use_copy);
98 template<typename T> T Regexp::Walker<T>::PreVisit(Regexp* re,  in PreVisit()  argument
104 template<typename T> T Regexp::Walker<T>::PostVisit(Regexp* re,  in PostVisit()  argument
118   WalkState<T>(Regexp* re, T parent)  in WalkState()
119     : re(re),  in WalkState()
124   Regexp* re;  // The regexp  member
155 template<typename T> T Regexp::Walker<T>::WalkInternal(Regexp* re, T top_arg,  in WalkInternal()  argument
159   if (re == NULL) {  in WalkInternal()
164   stack_->push(WalkState<T>(re, top_arg));  in WalkInternal()
170     Regexp* re = s->re;  in WalkInternal()  local
175           t = ShortVisit(re, s->parent_arg);  in WalkInternal()
179         s->pre_arg = PreVisit(re, s->parent_arg, &stop);  in WalkInternal()
186         if (re->nsub_ == 1)  in WalkInternal()
188         else if (re->nsub_ > 1)  in WalkInternal()
189           s->child_args = new T[re->nsub_];  in WalkInternal()
193         if (re->nsub_ > 0) {  in WalkInternal()
194           Regexp** sub = re->sub();  in WalkInternal()
195           if (s->n < re->nsub_) {  in WalkInternal()
206         t = PostVisit(re, s->parent_arg, s->pre_arg, s->child_args, s->n);  in WalkInternal()
207         if (re->nsub_ > 1)  in WalkInternal()
227 template<typename T> T Regexp::Walker<T>::Walk(Regexp* re, T top_arg) {  in Walk()  argument
233   return WalkInternal(re, top_arg, true);  in Walk()
236 template<typename T> T Regexp::Walker<T>::WalkExponential(Regexp* re, T top_arg,  in WalkExponential()  argument
239   return WalkInternal(re, top_arg, false);  in WalkExponential()