| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 75 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 86 if (FLAG_weak_embedded_maps_in_optimized_code) { | 86 if (FLAG_weak_embedded_maps_in_optimized_code) { |
| 87 RegisterDependentCodeForEmbeddedMaps(code); | 87 RegisterDependentCodeForEmbeddedMaps(code); |
| 88 } | 88 } |
| 89 PopulateDeoptimizationData(code); | 89 PopulateDeoptimizationData(code); |
| 90 info()->CommitDependentMaps(code); | 90 info()->CommitDependentMaps(code); |
| 91 | 91 |
| 92 for (int i = 0 ; i < transition_maps_.length(); i++) { | 92 for (int i = 0 ; i < transition_maps_.length(); i++) { |
| 93 transition_maps_.at(i)->AddDependentCode( | 93 transition_maps_.at(i)->AddDependentCode( |
| 94 DependentCode::kTransitionGroup, code); | 94 DependentCode::kTransitionGroup, code); |
| 95 } | 95 } |
| 96 if (graph()->depends_on_empty_array_proto_elements()) { | |
| 97 isolate()->initial_object_prototype()->map()->AddDependentCode( | |
| 98 DependentCode::kElementsCantBeAddedGroup, code); | |
| 99 isolate()->initial_array_prototype()->map()->AddDependentCode( | |
| 100 DependentCode::kElementsCantBeAddedGroup, code); | |
| 101 } | |
| 102 } | 96 } |
| 103 | 97 |
| 104 | 98 |
| 105 void LCodeGen::Abort(const char* reason) { | 99 void LCodeGen::Abort(const char* reason) { |
| 106 info()->set_bailout_reason(reason); | 100 info()->set_bailout_reason(reason); |
| 107 status_ = ABORTED; | 101 status_ = ABORTED; |
| 108 } | 102 } |
| 109 | 103 |
| 110 | 104 |
| 111 void LCodeGen::Comment(const char* format, ...) { | 105 void LCodeGen::Comment(const char* format, ...) { |
| (...skipping 5810 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5922 __ sub(scratch, result, Operand::PointerOffsetFromSmiKey(index)); | 5916 __ sub(scratch, result, Operand::PointerOffsetFromSmiKey(index)); |
| 5923 __ ldr(result, FieldMemOperand(scratch, | 5917 __ ldr(result, FieldMemOperand(scratch, |
| 5924 FixedArray::kHeaderSize - kPointerSize)); | 5918 FixedArray::kHeaderSize - kPointerSize)); |
| 5925 __ bind(&done); | 5919 __ bind(&done); |
| 5926 } | 5920 } |
| 5927 | 5921 |
| 5928 | 5922 |
| 5929 #undef __ | 5923 #undef __ |
| 5930 | 5924 |
| 5931 } } // namespace v8::internal | 5925 } } // namespace v8::internal |
| OLD | NEW |