Lines Matching refs:Code
6 // * Redistributions of source code must retain the above copyright
32 #include "code-stubs.h"
74 // NONE indicates that the scope shouldn't actually generate code to set up
86 void LCodeGen::FinishCode(Handle<Code> code) {
88 code->set_stack_slots(GetStackSlotCount());
89 code->set_safepoint_table_offset(safepoints_.GetCodeOffset());
90 PopulateDeoptimizationData(code);
159 // Reserve space for the stack slots needed by the code.
245 LDeferredCode* code = deferred_[i];
246 __ bind(code->entry());
247 Comment(";;; Deferred code @%d: %s.",
248 code->instruction_index(),
249 code->instr()->Mnemonic());
250 code->Generate();
251 __ jmp(code->exit());
255 // Force constant pool emission at the end of the deferred code to make
265 // code, i.e. that offsets to the table can be encoded in the 24bit signed
267 // To simplify we consider the code size from the first instruction to the
273 Abort("Generated code is too large");
291 // sequence. Mark the generated code as done unless we bailed out.
562 void LCodeGen::CallCode(Handle<Code> code,
565 CallCodeGeneric(code, mode, instr, RECORD_SIMPLE_SAFEPOINT);
569 void LCodeGen::CallCodeGeneric(Handle<Code> code,
576 __ Call(code, mode);
579 // Signal that we don't inline smi code before these stubs in the
580 // optimizing code generator.
581 if (code->kind() == Code::BINARY_OP_IC ||
582 code->kind() == Code::COMPARE_IC) {
680 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) {
709 code->set_deoptimization_data(*data);
1161 // Use optimized code for specific constants.
1190 // For other constants we emit standard code.
1212 // Generate standard code.
1493 __ stop("Unreachable code.");
1566 __ nop(); // Signals no inlined code.
1976 Handle<Code> ic = CompareIC::GetUninitialized(op);
1978 __ cmp(r0, Operand(0)); // This instruction also signals no smi code inlined.
2079 // Faster code path to avoid two compares: subtract lower bound from the
2196 __ bind(deferred->map_check()); // Label for calculating code patching.
2213 // calling the deferred code.
2224 // Go to the deferred code.
2230 // Here result has either true or false. Deferred code also produces true or
2282 Handle<Code> ic = CompareIC::GetUninitialized(op);
2284 __ cmp(r0, Operand(0)); // This instruction also signals no smi code inlined.
2330 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
2365 Handle<Code> ic = (instr->strict_mode_flag() == kStrictMode)
2474 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
2497 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
2514 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
2737 // happens, and generate code that returns a double rather than int.
2758 Handle<Code> ic = isolate()->builtins()->KeyedLoadIC_Initialize();
3441 Handle<Code> ic =
3453 Handle<Code> ic =
3478 Handle<Code> ic =
3562 Handle<Code> ic = (instr->strict_mode_flag() == kStrictMode)
3721 Handle<Code> ic = (instr->strict_mode_flag() == kStrictMode)
4107 // The carry flag is set when we reach this deferred code as we just executed
4197 // Branch to deferred code if the input was tagged.
4198 // The deferred code will take care of restoring the tag.
4774 // Use the fast case closure allocation code that allocates in new
4922 // instruction for patching the code here.
5030 // the deferred code.
