Lines Matching refs:Code
6 // * Redistributions of source code must retain the above copyright
40 #include "code-stubs.h"
50 #include "mips/code-stubs-mips.h"
59 // A patch site is a location in the code which it is possible to patch. This
60 // class has a number of methods to emit the code which is patchable and the
61 // method EmitPatchInfo to record a marker back to the patchable code. This
64 // instruction of the patchable code.
66 // never be emitted by normal code.
80 // the inlined smi code.
91 // the inlined smi code.
110 __ nop(); // Signals no inlined code.
123 // Generate code for a JS function. On entry to the function the receiver
144 Comment cmnt(masm_, "[ function compiled by full code generator");
169 // MANUAL indicates that the scope shouldn't actually generate code to set up
175 // code aging to work properly.
354 // The generated code is used in Deoptimizer::PatchStackCheckCodeAt so we need
376 // the AST id from the unoptimized code in order to use it as a key into
377 // the deoptimization input data found in the optimized code.
430 // Add a label for checking the size of the code used for returning.
437 // Here we use masm_-> instead of the __ macro to avoid the code coverage
438 // tool from instrumenting as we rely on the code
451 // Check that the size of the code used for returning is large enough
682 Handle<Code> ic = ToBooleanStub::GetUninitialized(isolate());
749 // Emit the write barrier code if the location is in the heap.
1047 Handle<Code> ic = CompareIC::GetUninitialized(isolate(), Token::EQ_STRICT);
1117 // Check cache validity in generated code. This is a fast case for
1188 // Generate code for doing the condition check.
1237 // Generate code for the body of the loop.
1240 // Generate code for the going to the next element by incrementing
1307 // Generate code for the body of the loop.
1324 // Use the fast case closure allocation code that allocates in new
1328 // we are creating here gets a chance to have its code optimized and
1329 // doesn't just get a copy of the existing unoptimized code.
1406 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
1445 // Generate fast-case code for variables that might be shadowed by
1490 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
1503 // var->scope() may be NULL when the proxy is located in eval code and
1513 // the same declaration scope (i.e. they are both in global code, in the
1514 // same function or in the same eval code) and the VariableProxy is in
1567 // Generate code for loading from variables potentially shadowed
1677 // marked expressions, no store code is emitted.
1704 Handle<Code> ic = is_classic_mode()
1747 // Emit code to define accessors, using only a single call to the runtime for
1832 // Emit code to evaluate all the non-constant subexpressions and to store
2107 Handle<Code> ic = isolate()->stub_cache()->ComputeKeyedCallInitialize(1);
2116 Handle<Code> done_ic = isolate()->builtins()->LoadIC_Initialize();
2119 Handle<Code> bool_ic = ToBooleanStub::GetUninitialized(isolate());
2126 Handle<Code> value_ic = isolate()->builtins()->LoadIC_Initialize();
2273 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
2282 Handle<Code> ic = isolate()->builtins()->KeyedLoadIC_Initialize();
2317 // Smi case. This code works the same way as the smi-smi case in the type
2394 JumpPatchSite patch_site(masm_); // unbound, signals no inlined smi code.
2434 Handle<Code> ic = is_classic_mode()
2447 Handle<Code> ic = is_classic_mode()
2465 Handle<Code> ic = is_classic_mode()
2561 // Record source code position before IC call.
2567 Handle<Code> ic = is_classic_mode()
2580 // Record source code position before IC call.
2591 Handle<Code> ic = is_classic_mode()
2620 void FullCodeGenerator::CallIC(Handle<Code> code,
2624 __ Call(code, rmode, id);
2631 // Code common for calls using the IC.
2642 // Call the IC initialization code.
2643 Handle<Code> ic =
2664 // Code common for calls using the IC.
2674 // Call the IC initialization code.
2675 Handle<Code> ic =
2687 // Code common for calls using the call stub.
2802 // Generate code for loading from variables potentially shadowed
2816 // If fast case code has been generated, emit code to push the
2818 // code.
2893 // Record call targets in unoptimized code.
3360 // we call out to external C code below.
3604 // overwritten by the write barrier code and is needed afterward.
4174 // Jump into the loop after the code that copies the separator, so the first
4266 Handle<Code> ic =
4488 // We could eliminate this smi check if we split the code at
4532 Handle<Code> ic = is_classic_mode()
4550 Handle<Code> ic = is_classic_mode()
4576 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
4585 // Generate code for loading from variables potentially shadowed
4738 Handle<Code> ic = CompareIC::GetUninitialized(isolate(), op);
4772 Handle<Code> ic = CompareNilICStub::GetUninitialized(isolate(), nil);
4813 // code. Pass a smi sentinel and let the runtime look up the empty
4819 // code. Fetch it from the context.
4836 // Cook return address in link register to stack (smi encoded Code* delta).
4911 // code, we can restore it directly from there for the finally code
