Lines Matching refs:code
2 // Use of this source code is governed by a BSD-style license that can be
9 #include "src/diagnostics/code-tracer.h"
160 // than the code used for atom matches.
191 // Caching is based only on the pattern and flags, but code also differs when
431 Object compiled_code = re->code(is_one_byte);
461 Object entry = re->code(is_one_byte);
517 // CSA code in ConstructNewResultFromMatchInfo requires these strings to be
555 // native code for all regexp objects.
572 Code code = Code::cast(*compile_data.code);
573 data->set(JSRegExp::code_index(is_one_byte), ToCodeT(code));
582 // Store code generated by compiler in bytecode and trampoline to
583 // interpreter in code.
584 data->set(JSRegExp::bytecode_index(is_one_byte), *compile_data.code);
601 re->ShouldProduceBytecode() ? "bytecode" : "native code",
634 // Initialize compiled code entries to null.
671 // The stack is used to allocate registers for the compiled regexp code.
743 // slower than the jitted code execution. If the tier-up strategy is turned
840 // Returns true if we've either generated too much irregex code within this
844 // would like to keep track of the amount of regexp code on the heap. This
846 // total regexp code compiled including code that has subsequently been freed
1016 Handle<Code> c = Handle<Code>::cast(result.code);
1023 Handle<ByteArray> bytecode = Handle<ByteArray>::cast(result.code);
1038 data->code = result.code;
1170 // Zero-length match. Advance by one code point.