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 82 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
93 } | 93 } |
94 PopulateDeoptimizationData(code); | 94 PopulateDeoptimizationData(code); |
95 for (int i = 0 ; i < prototype_maps_.length(); i++) { | 95 for (int i = 0 ; i < prototype_maps_.length(); i++) { |
96 prototype_maps_.at(i)->AddDependentCode( | 96 prototype_maps_.at(i)->AddDependentCode( |
97 DependentCode::kPrototypeCheckGroup, code); | 97 DependentCode::kPrototypeCheckGroup, code); |
98 } | 98 } |
99 for (int i = 0 ; i < transition_maps_.length(); i++) { | 99 for (int i = 0 ; i < transition_maps_.length(); i++) { |
100 transition_maps_.at(i)->AddDependentCode( | 100 transition_maps_.at(i)->AddDependentCode( |
101 DependentCode::kTransitionGroup, code); | 101 DependentCode::kTransitionGroup, code); |
102 } | 102 } |
| 103 if (graph()->depends_on_empty_array_proto_elements()) { |
| 104 isolate()->initial_object_prototype()->map()->AddDependentCode( |
| 105 DependentCode::kElementsCantBeAddedGroup, code); |
| 106 isolate()->initial_array_prototype()->map()->AddDependentCode( |
| 107 DependentCode::kElementsCantBeAddedGroup, code); |
| 108 } |
103 } | 109 } |
104 | 110 |
105 | 111 |
106 void LChunkBuilder::Abort(const char* reason) { | 112 void LChunkBuilder::Abort(const char* reason) { |
107 info()->set_bailout_reason(reason); | 113 info()->set_bailout_reason(reason); |
108 status_ = ABORTED; | 114 status_ = ABORTED; |
109 } | 115 } |
110 | 116 |
111 | 117 |
112 void LCodeGen::Comment(const char* format, ...) { | 118 void LCodeGen::Comment(const char* format, ...) { |
(...skipping 5484 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5597 FixedArray::kHeaderSize - kPointerSize)); | 5603 FixedArray::kHeaderSize - kPointerSize)); |
5598 __ bind(&done); | 5604 __ bind(&done); |
5599 } | 5605 } |
5600 | 5606 |
5601 | 5607 |
5602 #undef __ | 5608 #undef __ |
5603 | 5609 |
5604 } } // namespace v8::internal | 5610 } } // namespace v8::internal |
5605 | 5611 |
5606 #endif // V8_TARGET_ARCH_X64 | 5612 #endif // V8_TARGET_ARCH_X64 |
OLD | NEW |