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 97 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
108 PopulateDeoptimizationData(code); | 108 PopulateDeoptimizationData(code); |
109 if (!info()->IsStub()) { | 109 if (!info()->IsStub()) { |
110 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code); | 110 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code); |
111 } | 111 } |
112 info()->CommitDependentMaps(code); | 112 info()->CommitDependentMaps(code); |
113 | 113 |
114 for (int i = 0 ; i < transition_maps_.length(); i++) { | 114 for (int i = 0 ; i < transition_maps_.length(); i++) { |
115 transition_maps_.at(i)->AddDependentCode( | 115 transition_maps_.at(i)->AddDependentCode( |
116 DependentCode::kTransitionGroup, code); | 116 DependentCode::kTransitionGroup, code); |
117 } | 117 } |
118 if (graph()->depends_on_empty_array_proto_elements()) { | |
119 isolate()->initial_object_prototype()->map()->AddDependentCode( | |
120 DependentCode::kElementsCantBeAddedGroup, code); | |
121 isolate()->initial_array_prototype()->map()->AddDependentCode( | |
122 DependentCode::kElementsCantBeAddedGroup, code); | |
123 } | |
124 } | 118 } |
125 | 119 |
126 | 120 |
127 void LCodeGen::Abort(const char* reason) { | 121 void LCodeGen::Abort(const char* reason) { |
128 info()->set_bailout_reason(reason); | 122 info()->set_bailout_reason(reason); |
129 status_ = ABORTED; | 123 status_ = ABORTED; |
130 } | 124 } |
131 | 125 |
132 | 126 |
133 void LCodeGen::Comment(const char* format, ...) { | 127 void LCodeGen::Comment(const char* format, ...) { |
(...skipping 6374 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
6508 FixedArray::kHeaderSize - kPointerSize)); | 6502 FixedArray::kHeaderSize - kPointerSize)); |
6509 __ bind(&done); | 6503 __ bind(&done); |
6510 } | 6504 } |
6511 | 6505 |
6512 | 6506 |
6513 #undef __ | 6507 #undef __ |
6514 | 6508 |
6515 } } // namespace v8::internal | 6509 } } // namespace v8::internal |
6516 | 6510 |
6517 #endif // V8_TARGET_ARCH_IA32 | 6511 #endif // V8_TARGET_ARCH_IA32 |
OLD | NEW |