| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 909 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 920 info()->set_bailout_reason(reason); | 920 info()->set_bailout_reason(reason); |
| 921 status_ = ABORTED; | 921 status_ = ABORTED; |
| 922 } | 922 } |
| 923 | 923 |
| 924 | 924 |
| 925 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) { | 925 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) { |
| 926 int length = deoptimizations_.length(); | 926 int length = deoptimizations_.length(); |
| 927 if (length == 0) return; | 927 if (length == 0) return; |
| 928 | 928 |
| 929 Handle<DeoptimizationInputData> data = | 929 Handle<DeoptimizationInputData> data = |
| 930 factory()->NewDeoptimizationInputData(length, TENURED); | 930 DeoptimizationInputData::New(isolate(), length, TENURED); |
| 931 | 931 |
| 932 Handle<ByteArray> translations = | 932 Handle<ByteArray> translations = |
| 933 translations_.CreateByteArray(isolate()->factory()); | 933 translations_.CreateByteArray(isolate()->factory()); |
| 934 data->SetTranslationByteArray(*translations); | 934 data->SetTranslationByteArray(*translations); |
| 935 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); | 935 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); |
| 936 data->SetOptimizationId(Smi::FromInt(info_->optimization_id())); | 936 data->SetOptimizationId(Smi::FromInt(info_->optimization_id())); |
| 937 if (info_->IsOptimizing()) { | 937 if (info_->IsOptimizing()) { |
| 938 // Reference to shared function info does not change between phases. | 938 // Reference to shared function info does not change between phases. |
| 939 AllowDeferredHandleDereference allow_handle_dereference; | 939 AllowDeferredHandleDereference allow_handle_dereference; |
| 940 data->SetSharedFunctionInfo(*info_->shared_info()); | 940 data->SetSharedFunctionInfo(*info_->shared_info()); |
| (...skipping 4958 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5899 __ Ldr(result, FieldMemOperand(object, JSObject::kPropertiesOffset)); | 5899 __ Ldr(result, FieldMemOperand(object, JSObject::kPropertiesOffset)); |
| 5900 // Index is equal to negated out of object property index plus 1. | 5900 // Index is equal to negated out of object property index plus 1. |
| 5901 __ Sub(result, result, Operand::UntagSmiAndScale(index, kPointerSizeLog2)); | 5901 __ Sub(result, result, Operand::UntagSmiAndScale(index, kPointerSizeLog2)); |
| 5902 __ Ldr(result, FieldMemOperand(result, | 5902 __ Ldr(result, FieldMemOperand(result, |
| 5903 FixedArray::kHeaderSize - kPointerSize)); | 5903 FixedArray::kHeaderSize - kPointerSize)); |
| 5904 __ Bind(deferred->exit()); | 5904 __ Bind(deferred->exit()); |
| 5905 __ Bind(&done); | 5905 __ Bind(&done); |
| 5906 } | 5906 } |
| 5907 | 5907 |
| 5908 } } // namespace v8::internal | 5908 } } // namespace v8::internal |
| OLD | NEW |