Lines Matching refs:Trace
235 friend class Trace;
337 class Trace;
472 virtual void Emit(RegExpCompiler* compiler, Trace* trace) = 0;
485 Trace* bounds_check_trace,
486 Trace* trace,
545 // start of the trace) then it cannot be reused. This variable sets a limit
547 // trace and generating generic code for a node that can be reused by flushing
548 // the deferred actions in the current trace and generating a goto.
566 LimitResult LimitVersions(RegExpCompiler* compiler, Trace* trace);
580 // a trace, in which case it is generic and can be reused by flushing the
581 // deferred operations in the current trace and generating a goto.
640 virtual void Emit(RegExpCompiler* compiler, Trace* trace);
718 virtual void Emit(RegExpCompiler* compiler, Trace* trace);
749 Trace* trace,
783 virtual void Emit(RegExpCompiler* compiler, Trace* trace);
794 void EmitBoundaryCheck(RegExpCompiler* compiler, Trace* trace);
797 Trace* trace,
818 virtual void Emit(RegExpCompiler* compiler, Trace* trace);
844 virtual void Emit(RegExpCompiler* compiler, Trace* trace);
878 virtual void Emit(RegExpCompiler* compiler, Trace* trace);
939 virtual void Emit(RegExpCompiler* compiler, Trace* trace);
971 Trace* trace);
974 Trace* trace,
980 Trace* current_trace,
982 void AssertGuardsMentionRegisters(Trace* trace);
983 int EmitOptimizedUnanchoredSearch(RegExpCompiler* compiler, Trace* trace);
984 Trace* EmitGreedyLoop(RegExpCompiler* compiler,
985 Trace* trace,
993 Trace* trace,
997 // Allows a new trace to start with at_start() set to false.
1045 virtual void Emit(RegExpCompiler* compiler, Trace* trace);
1222 // of the foo-bar-baz trace and once as part of the foo-ip-baz trace. The code
1226 class Trace {
1246 friend class Trace;
1251 DeferredCapture(int reg, bool is_capture, Trace* trace)
1253 cp_offset_(trace->cp_offset()),
1289 Trace()
1300 // End the trace. This involves flushing the deferred actions in the trace
1302 // done we can start a new trace or go to one that has already been
1307 // A trivial trace is one that has no deferred actions or other state that
1309 // backtrack location in a trivial trace, so with a trivial trace we will
1312 // always start code generation with a trivial trace and non-trivial traces
1314 // actions in the trace. The location of the code generated for a node using
1315 // a trivial trace is recorded in a label in the node so that gotos can be
1385 Trace* counter_backtrack_trace() { return &counter_backtrack_trace_; }
1389 Trace counter_backtrack_trace_;
