Lines Matching refs:Code
6 // * Redistributions of source code must retain the above copyright
191 RemoveDeoptimizingCode(*node->code());
237 // Find the optimized code.
240 optimized_code_ = function_->code();
247 // function. The return address (from) points to unoptimized code.
248 optimized_code_ = function_->code();
249 ASSERT(optimized_code_->kind() == Code::OPTIMIZED_FUNCTION);
331 // Print the source code if available.
776 // Optimized code assumes that the argument object has not been
790 void Deoptimizer::PatchStackCheckCode(Code* unoptimized_code,
791 Code* check_code,
792 Code* replacement_code) {
794 // call to an unconditional call to the replacement code.
795 ASSERT(unoptimized_code->kind() == Code::FUNCTION);
809 void Deoptimizer::RevertStackCheckCode(Code* unoptimized_code,
810 Code* check_code,
811 Code* replacement_code) {
814 ASSERT(unoptimized_code->kind() == Code::FUNCTION);
837 // environment at the OSR entry. The code for that his built into
892 // references. This is fine because the deoptimizer's code section
910 Code* Deoptimizer::FindDeoptimizingCodeFromAddress(Address addr) {
914 if (node->code()->contains(addr)) return *node->code();
921 void Deoptimizer::RemoveDeoptimizingCode(Code* code) {
924 // Run through the code
928 if (*current->code() == code) {
942 // Deoptimizing code is removed through weak callback. Each object is expected
1035 buffer_->Add(reg.code());
1041 buffer_->Add(reg.code());
1141 DeoptimizingCodeListNode::DeoptimizingCodeListNode(Code* code): next_(NULL) {
1143 // Globalize the code object and make it weak.
1144 code_ = Handle<Code>::cast(global_handles->Create(code));
