Lines Matching refs:code
2 // Use of this source code is governed by a BSD-style license that can be
9 #include "src/codegen/code-factory.h"
102 Node* stub_code = jsgraph()->HeapConstant(callable.code());
137 Node* stub_code = jsgraph()->HeapConstant(callable.code());
344 // If the code below will be used for the invalid feedback case, it needs to
382 // native-context-independent code).
385 // the size of the compiled code as it would insert 1 call to the builtin
608 // If this fails, we might need to update the parameter reordering code
840 // If this fails, we might need to update the parameter reordering code
846 Node* stub_code = jsgraph()->HeapConstant(callable.code());
869 Node* stub_code = jsgraph()->HeapConstant(callable.code());
877 // After: {code, target, new_target, arity, receiver, ...args}.
895 // If this fails, we might need to update the parameter reordering code
901 Node* stub_code = jsgraph()->HeapConstant(callable.code());
907 // After: {code, target, new_target, arguments_list, receiver}.
924 // If this fails, we might need to update the parameter reordering code
930 Node* stub_code = jsgraph()->HeapConstant(callable.code());
945 // After: {code, target, new_target, arity, spread, receiver, ...args}.
957 Node* stub_code = jsgraph()->HeapConstant(callable.code());
978 Node* stub_code = jsgraph()->HeapConstant(callable.code());
999 Node* stub_code = jsgraph()->HeapConstant(callable.code());
1011 // After: {code, target, arguments_list, receiver}.
1028 // If this fails, we might need to update the parameter reordering code
1034 Node* stub_code = jsgraph()->HeapConstant(callable.code());
1050 // After: {code, target, arity, spread, receiver, ...args}.