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 17 matching lines...) Expand all Loading... |
28 #include "v8.h" | 28 #include "v8.h" |
29 | 29 |
30 #include "code-stubs.h" | 30 #include "code-stubs.h" |
31 #include "hydrogen.h" | 31 #include "hydrogen.h" |
32 #include "lithium.h" | 32 #include "lithium.h" |
33 | 33 |
34 namespace v8 { | 34 namespace v8 { |
35 namespace internal { | 35 namespace internal { |
36 | 36 |
37 | 37 |
38 // TODO(svenpanne) Merge with OptimizingCompiler::OptimizeGraph(). | |
39 static LChunk* OptimizeGraph(HGraph* graph) { | 38 static LChunk* OptimizeGraph(HGraph* graph) { |
40 AssertNoAllocation no_gc; | 39 AssertNoAllocation no_gc; |
41 NoHandleAllocation no_handles; | 40 NoHandleAllocation no_handles; |
42 NoHandleDereference no_deref; | 41 NoHandleDereference no_deref; |
43 | 42 |
44 ASSERT(graph != NULL); | 43 ASSERT(graph != NULL); |
45 SmartArrayPointer<char> bailout_reason; | 44 SmartArrayPointer<char> bailout_reason; |
46 if (!graph->Optimize(&bailout_reason)) { | 45 if (!graph->Optimize(&bailout_reason)) { |
47 FATAL(bailout_reason.is_empty() ? "unknown" : *bailout_reason); | 46 FATAL(bailout_reason.is_empty() ? "unknown" : *bailout_reason); |
48 } | 47 } |
(...skipping 73 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
122 Stub* casted_stub() { return static_cast<Stub*>(stub()); } | 121 Stub* casted_stub() { return static_cast<Stub*>(stub()); } |
123 }; | 122 }; |
124 | 123 |
125 | 124 |
126 template <> | 125 template <> |
127 void CodeStubGraphBuilder<KeyedLoadFastElementStub>::BuildCodeStub() { | 126 void CodeStubGraphBuilder<KeyedLoadFastElementStub>::BuildCodeStub() { |
128 Zone* zone = this->zone(); | 127 Zone* zone = this->zone(); |
129 | 128 |
130 HInstruction* load = BuildUncheckedMonomorphicElementAccess( | 129 HInstruction* load = BuildUncheckedMonomorphicElementAccess( |
131 GetParameter(0), GetParameter(1), NULL, NULL, | 130 GetParameter(0), GetParameter(1), NULL, NULL, |
132 casted_stub()->is_js_array(), casted_stub()->elements_kind(), false); | 131 casted_stub()->is_js_array(), casted_stub()->elements_kind(), |
| 132 false, Representation::Tagged()); |
133 AddInstruction(load); | 133 AddInstruction(load); |
134 | 134 |
135 HReturn* ret = new(zone) HReturn(load, context()); | 135 HReturn* ret = new(zone) HReturn(load, context()); |
136 current_block()->Finish(ret); | 136 current_block()->Finish(ret); |
137 } | 137 } |
138 | 138 |
139 | 139 |
140 Handle<Code> KeyedLoadFastElementStub::GenerateCode() { | 140 Handle<Code> KeyedLoadFastElementStub::GenerateCode() { |
141 CodeStubGraphBuilder<KeyedLoadFastElementStub> builder(this); | 141 CodeStubGraphBuilder<KeyedLoadFastElementStub> builder(this); |
142 LChunk* chunk = OptimizeGraph(builder.CreateGraph()); | 142 LChunk* chunk = OptimizeGraph(builder.CreateGraph()); |
143 return chunk->Codegen(Code::COMPILED_STUB); | 143 return chunk->Codegen(Code::COMPILED_STUB); |
144 } | 144 } |
145 | 145 |
146 | 146 |
147 } } // namespace v8::internal | 147 } } // namespace v8::internal |
OLD | NEW |