Lines Matching refs:Code
6 // * Redistributions of source code must retain the above copyright
175 V(Code, js_entry_code, JsEntryCode) \
176 V(Code, js_construct_entry_code, JsConstructEntryCode) \
212 V(code_string, ".code") \
506 // code that looks here, because it is faster than loading from the static
769 // Allocates an empty code cache.
877 // Computes a single character string where the character has code.
882 uint16_t code);
1159 // Makes a new native code object
1161 // failed. On success, the pointer to the Code object is stored in the
1162 // self_reference. This allows generated code to reference its own Code
1166 Code::Flags flags,
1171 MUST_USE_RESULT MaybeObject* CopyCode(Code* code);
1173 // Copy the code and scope info part of the code object, but insert
1175 MUST_USE_RESULT MaybeObject* CopyCode(Code* code, Vector<byte> reloc_info);
1212 // Code that should be run before and after each GC. Includes some
1259 // Utility to invoke the scavenger. This is needed in test code to
1423 // Generated code can embed this address to get access to the roots.
1623 // Generated code can embed direct references to non-writable roots if
1626 // Generated code can treat direct references to this root as constant.
1849 FIRST_CODE_KIND_SUB_TYPE + Code::NUMBER_OF_KINDS,
1861 ASSERT(sub_type < Code::NUMBER_OF_KINDS);
1919 // For keeping track on when to flush RegExp code.
1982 // TODO(hpayer): change to bool if no longer accessed from generated code
2094 // have to test the allocation space argument and (b) can reduce code size
2157 // Code to be run before and after mark-compact.
2175 // Note: this code was factored out of AllocateFunction such that
2184 // Total RegExp code ever generated
2484 // space, old data space and code space. Returns each space in turn, and null
2497 // space, old pointer space, old data space, code space and cell space. Returns
2609 // generated code to perform cache lookups.
