| 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 99 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 110 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code); | 110 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code); |
| 111 } | 111 } |
| 112 for (int i = 0 ; i < prototype_maps_.length(); i++) { | 112 for (int i = 0 ; i < prototype_maps_.length(); i++) { |
| 113 prototype_maps_.at(i)->AddDependentCode( | 113 prototype_maps_.at(i)->AddDependentCode( |
| 114 DependentCode::kPrototypeCheckGroup, code); | 114 DependentCode::kPrototypeCheckGroup, code); |
| 115 } | 115 } |
| 116 for (int i = 0 ; i < transition_maps_.length(); i++) { | 116 for (int i = 0 ; i < transition_maps_.length(); i++) { |
| 117 transition_maps_.at(i)->AddDependentCode( | 117 transition_maps_.at(i)->AddDependentCode( |
| 118 DependentCode::kTransitionGroup, code); | 118 DependentCode::kTransitionGroup, code); |
| 119 } | 119 } |
| 120 if (graph()->depends_on_empty_array_proto_elements()) { |
| 121 isolate()->initial_object_prototype()->map()->AddDependentCode( |
| 122 DependentCode::kElementsCantBeAddedGroup, code); |
| 123 isolate()->initial_array_prototype()->map()->AddDependentCode( |
| 124 DependentCode::kElementsCantBeAddedGroup, code); |
| 125 } |
| 120 } | 126 } |
| 121 | 127 |
| 122 | 128 |
| 123 void LCodeGen::Abort(const char* reason) { | 129 void LCodeGen::Abort(const char* reason) { |
| 124 info()->set_bailout_reason(reason); | 130 info()->set_bailout_reason(reason); |
| 125 status_ = ABORTED; | 131 status_ = ABORTED; |
| 126 } | 132 } |
| 127 | 133 |
| 128 | 134 |
| 129 void LCodeGen::Comment(const char* format, ...) { | 135 void LCodeGen::Comment(const char* format, ...) { |
| (...skipping 6475 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 6605 FixedArray::kHeaderSize - kPointerSize)); | 6611 FixedArray::kHeaderSize - kPointerSize)); |
| 6606 __ bind(&done); | 6612 __ bind(&done); |
| 6607 } | 6613 } |
| 6608 | 6614 |
| 6609 | 6615 |
| 6610 #undef __ | 6616 #undef __ |
| 6611 | 6617 |
| 6612 } } // namespace v8::internal | 6618 } } // namespace v8::internal |
| 6613 | 6619 |
| 6614 #endif // V8_TARGET_ARCH_IA32 | 6620 #endif // V8_TARGET_ARCH_IA32 |
| OLD | NEW |