Lines Matching defs:code
2 // Use of this source code is governed by a BSD-style license that can be
208 static Code* IrregexpNativeCode(FixedArray* re, bool is_one_byte);
211 // would like to keep track of the amount of regexp code on the heap. This
213 // total regexp code compiled including code that has subsequently been freed
237 // Represents code units in the range from from_ to to_, both ends are
579 // Generates a goto to this node or actually generates the code at this point.
589 // Emits some quick code that checks whether the preloaded characters match.
616 // Collects information on the possible code units (mod 128) that can match if
618 // implementation. TODO(erikcorry): This should share more code with
655 // If non-generic code is generated for a node (i.e. the node is not at the
658 // trace and generating generic code for a node that can be reused by flushing
684 // This variable keeps track of how many times code has been generated for
686 // generated code is located unless the code is generated at the start of
1154 // alternative that is expected to fail. This is because quick check code
1227 // We also have another lookahead mechanism (called quick check in the code),
1282 ContainedInLattice surrogate_; // Surrogate UTF-16 code units.
1345 // There are many ways to generate code for a node. This class encapsulates
1347 code generator. The effect of this is that we
1348 // generate code for paths that the matcher can take through the regular
1349 // expression. A given node in the regexp can be code-generated several times
1351 // /foo(bar|ip)baz/ the code to match baz will be generated twice, once as part
1352 // of the foo-bar-baz trace and once as part of the foo-ip-baz trace. The code
1354 // code to store the capture is deferred and generated (twice) after the places
1438 // affects the assumptions used when generating code. There is no recorded
1440 // generate code that, on a failure to match, gets the backtrack location
1442 // always start code generation with a trivial trace and non-trivial traces
1443 // are created as we emit code for nodes or add to the list of deferred
1444 // actions in the trace. The location of the code generated for a node using
1446 // generated to that code.
1652 code(isolate->heap()->the_hole_value()),
1654 CompilationResult(Object* code, int registers)
1656 code(code),
1659 Object* code;
