Lines Matching refs:Code
6 // * Redistributions of source code must retain the above copyright
32 #include "code-stubs.h"
42 #include "arm/code-stubs-arm.h"
51 // A patch site is a location in the code which it is possible to patch. This
52 // class has a number of methods to emit the code which is patchable and the
53 // method EmitPatchInfo to record a marker back to the patchable code. This
56 // the patchable code.
70 // the inlined smi code.
80 // the inlined smi code.
101 __ nop(); // Signals no inlined code.
114 // Generate code for a JS function. On entry to the function the receiver
135 Comment cmnt(masm_, "[ function compiled by full code generator");
161 // MANUAL indicates that the scope shouldn't actually generate code to set up
170 // for code aging to work properly.
172 __ nop(ip.code());
356 // Block literal pools whilst emitting back edge code.
373 // the AST id from the unoptimized code in order to use it as a key into
374 // the deoptimization input data found in the optimized code.
428 // Add a label for checking the size of the code used for returning.
435 // Here we use masm_-> instead of the __ macro to avoid the code coverage
436 // tool from instrumenting as we rely on the code size here.
439 // TODO(svenpanne) The code below is sometimes 4 words, sometimes 5!
451 // Check that the size of the code used for returning is large enough
682 Handle<Code> ic = ToBooleanStub::GetUninitialized(isolate());
748 // Emit the write barrier code if the location is in the heap.
1043 Handle<Code> ic = CompareIC::GetUninitialized(isolate(), Token::EQ_STRICT);
1115 // Check cache validity in generated code. This is a fast case for
1188 // Generate code for doing the condition check.
1236 // Generate code for the body of the loop.
1239 // Generate code for the going to the next element by incrementing
1304 // Generate code for the body of the loop.
1321 // Use the fast case closure allocation code that allocates in new
1325 // we are creating here gets a chance to have its code optimized and
1326 // doesn't just get a copy of the existing unoptimized code.
1406 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
1447 // 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
1565 // Generate code for loading from variables potentially shadowed
1675 // marked expressions, no store code is emitted.
1701 Handle<Code> ic = is_classic_mode()
1745 // Emit code to define accessors, using only a single call to the runtime for
1827 // Emit code to evaluate all the non-constant subexpressions and to store
2098 Handle<Code> ic = isolate()->stub_cache()->ComputeKeyedCallInitialize(1);
2106 Handle<Code> done_ic = isolate()->builtins()->LoadIC_Initialize();
2108 Handle<Code> bool_ic = ToBooleanStub::GetUninitialized(isolate());
2116 Handle<Code> value_ic = isolate()->builtins()->LoadIC_Initialize();
2264 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
2272 Handle<Code> ic = isolate()->builtins()->KeyedLoadIC_Initialize();
2306 // Smi case. This code works the same way as the smi-smi case in the type
2378 JumpPatchSite patch_site(masm_); // unbound, signals no inlined smi code.
2418 Handle<Code> ic = is_classic_mode()
2431 Handle<Code> ic = is_classic_mode()
2448 Handle<Code> ic = is_classic_mode()
2544 // Record source code position before IC call.
2549 Handle<Code> ic = is_classic_mode()
2562 // Record source code position before IC call.
2567 Handle<Code> ic = is_classic_mode()
2596 void FullCodeGenerator::CallIC(Handle<Code> code,
2600 // All calls must have a predictable size in full-codegen code to ensure that
2602 __ Call(code, rmode, ast_id, al, NEVER_INLINE_TARGET_ADDRESS);
2608 // Code common for calls using the IC.
2619 // Call the IC initialization code.
2620 Handle<Code> ic =
2641 // Code common for calls using the IC.
2651 // Call the IC initialization code.
2652 Handle<Code> ic =
2664 // Code common for calls using the call stub.
2675 // Record call targets in unoptimized code.
2780 // Generate code for loading from variables potentially shadowed
2794 // If fast case code has been generated, emit code to push the
2796 // code.
2871 // Record call targets in unoptimized code.
3584 // overwritten by the write barrier code and is needed afterward.
4140 // Jump into the loop after the code that copies the separator, so the first
4233 Handle<Code> ic =
4452 // We could eliminate this smi check if we split the code at
4498 Handle<Code> ic = is_classic_mode()
4515 Handle<Code> ic = is_classic_mode()
4541 Handle<Code> ic = isolate()->builtins()->LoadIC_Initialize();
4550 // Generate code for loading from variables potentially shadowed
4708 Handle<Code> ic = CompareIC::GetUninitialized(isolate(), op);
4743 Handle<Code> ic = CompareNilICStub::GetUninitialized(isolate(), nil);
4785 // code. Pass a smi sentinel and let the runtime look up the empty
4791 // code. Fetch it from the context.
4808 // Cook return address in link register to stack (smi encoded Code* delta)
4879 // code, we can restore it directly from there for the finally code
