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