Lines Matching defs:code
2 // Use of this source code is governed by a BSD-style license that can be
7 #include "src/code-factory.h"
8 #include "src/code-stubs.h"
50 // NONE indicates that the scope shouldn't actually generate code to set up
59 void LCodeGen::FinishCode(Handle<Code> code) {
61 code->set_stack_slots(GetStackSlotCount());
62 code->set_safepoint_table_offset(safepoints_.GetCodeOffset());
63 if (code->is_optimized_code()) RegisterWeakObjectsInOptimizedCode(code);
64 PopulateDeoptimizationData(code);
150 // Reserve space for the stack slots needed by the code.
222 // We have not executed any compiled code yet, so cp still holds the
259 LDeferredCode* code = deferred_[i];
262 instructions_->at(code->instruction_index())->hydrogen_value();
268 code->instruction_index(),
269 code->instr()->hydrogen_value()->id(),
270 code->instr()->Mnemonic());
271 __ bind(code->entry());
282 Comment(";;; Deferred code");
284 code->Generate();
292 __ jmp(code->exit());
295 // Deferred code is the last part of the instruction sequence. Mark
296 // the generated code as done unless we bailed out.
344 // sequence. Mark the generated code as done unless we bailed out.
675 void LCodeGen::CallCode(Handle<Code> code,
678 CallCodeGeneric(code, mode, instr, RECORD_SIMPLE_SAFEPOINT);
682 void LCodeGen::CallCodeGeneric(Handle<Code> code,
687 __ Call(code, mode);
844 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) {
884 code->set_deoptimization_data(*data);
1054 // Theoretically, a variation of the branch-free code for integer division by
1066 // Note: The code below even works when right contains kMinInt.
1221 // TODO(svenpanne) Refactor this to avoid code duplication with DoFlooringDivI.
1380 // TODO(svenpanne) Refactor this to avoid code duplication with DoDivI.
1473 code.
1495 // Generate standard code.
2001 Handle<Code> code =
2002 CodeFactory::BinaryOpIC(isolate(), instr->op(), NO_OVERWRITE).code();
2003 CallCode(code, RelocInfo::CODE_TARGET, instr);
2005 // patchable code. Mips does not need the nop, since our marker
2006 // instruction (andi zero_reg) will never be used in normal code.
2485 Handle<Code> ic = CodeFactory::CompareIC(isolate(), op).code();
2582 // Faster code path to avoid two compares: subtract lower bound from the
2700 __ bind(deferred->map_check()); // Label for calculating code patching.
2715 // calling the deferred code.
2725 // Go to the deferred code.
2731 // Here result has either true or false. Deferred code also produces true or
2786 Handle<Code> ic = CodeFactory::CompareIC(isolate(), op).code();
2788 // On MIPS there is no need for a "no inlined smi code" marker (nop).
2807 // Runtime::TraceExit returns its parameter in v0. We're leaving the code
2880 Handle<Code> ic = CodeFactory::LoadIC(isolate(), mode).code();
3021 Handle<Code> ic = CodeFactory::LoadIC(isolate(), NOT_CONTEXTUAL).code();
3369 Handle<Code> ic = CodeFactory::KeyedLoadIC(isolate()).code();
3998 Handle<Code> code = Handle<Code>::cast(ToHandle(target));
3999 generator.BeforeCall(__ CallSize(code, RelocInfo::CODE_TARGET));
4000 __ Call(code, RelocInfo::CODE_TARGET);
4005 __ Daddu(target, target, Operand(Code::kHeaderSize - kHeapObjectTag));
4023 // Load the code entry address
4048 // No cell in a2 for construct type feedback in optimized code
4108 Operand(Code::kHeaderSize - kHeapObjectTag));
4215 Handle<Code> ic = StoreIC::initialize_stub(isolate(), instr->strict_mode());
4479 Handle<Code> ic =
4480 CodeFactory::KeyedStoreIC(isolate(), instr->strict_mode()).code();
5015 // Let the deferred code handle the HeapObject case.
5494 // Use the fast case closure allocation code that allocates in new
5672 // instruction for patching the code here.
5774 // the deferred code.
