| 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 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 88 } | 88 } |
| 89 PopulateDeoptimizationData(code); | 89 PopulateDeoptimizationData(code); |
| 90 for (int i = 0 ; i < prototype_maps_.length(); i++) { | 90 for (int i = 0 ; i < prototype_maps_.length(); i++) { |
| 91 prototype_maps_.at(i)->AddDependentCode( | 91 prototype_maps_.at(i)->AddDependentCode( |
| 92 DependentCode::kPrototypeCheckGroup, code); | 92 DependentCode::kPrototypeCheckGroup, code); |
| 93 } | 93 } |
| 94 for (int i = 0 ; i < transition_maps_.length(); i++) { | 94 for (int i = 0 ; i < transition_maps_.length(); i++) { |
| 95 transition_maps_.at(i)->AddDependentCode( | 95 transition_maps_.at(i)->AddDependentCode( |
| 96 DependentCode::kTransitionGroup, code); | 96 DependentCode::kTransitionGroup, code); |
| 97 } | 97 } |
| 98 if (graph()->depends_on_empty_array_proto_elements()) { |
| 99 isolate()->initial_object_prototype()->map()->AddDependentCode( |
| 100 DependentCode::kElementsCantBeAddedGroup, code); |
| 101 isolate()->initial_array_prototype()->map()->AddDependentCode( |
| 102 DependentCode::kElementsCantBeAddedGroup, code); |
| 103 } |
| 98 } | 104 } |
| 99 | 105 |
| 100 | 106 |
| 101 void LChunkBuilder::Abort(const char* reason) { | 107 void LChunkBuilder::Abort(const char* reason) { |
| 102 info()->set_bailout_reason(reason); | 108 info()->set_bailout_reason(reason); |
| 103 status_ = ABORTED; | 109 status_ = ABORTED; |
| 104 } | 110 } |
| 105 | 111 |
| 106 | 112 |
| 107 void LCodeGen::Comment(const char* format, ...) { | 113 void LCodeGen::Comment(const char* format, ...) { |
| (...skipping 5552 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5660 __ Subu(scratch, result, scratch); | 5666 __ Subu(scratch, result, scratch); |
| 5661 __ lw(result, FieldMemOperand(scratch, | 5667 __ lw(result, FieldMemOperand(scratch, |
| 5662 FixedArray::kHeaderSize - kPointerSize)); | 5668 FixedArray::kHeaderSize - kPointerSize)); |
| 5663 __ bind(&done); | 5669 __ bind(&done); |
| 5664 } | 5670 } |
| 5665 | 5671 |
| 5666 | 5672 |
| 5667 #undef __ | 5673 #undef __ |
| 5668 | 5674 |
| 5669 } } // namespace v8::internal | 5675 } } // namespace v8::internal |
| OLD | NEW |