| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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 1267 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1278 } | 1278 } |
| 1279 } | 1279 } |
| 1280 return new LBranch(UseRegisterAtStart(v), first_id, second_id); | 1280 return new LBranch(UseRegisterAtStart(v), first_id, second_id); |
| 1281 } | 1281 } |
| 1282 | 1282 |
| 1283 | 1283 |
| 1284 LInstruction* LChunkBuilder::DoCompareMapAndBranch( | 1284 LInstruction* LChunkBuilder::DoCompareMapAndBranch( |
| 1285 HCompareMapAndBranch* instr) { | 1285 HCompareMapAndBranch* instr) { |
| 1286 ASSERT(instr->value()->representation().IsTagged()); | 1286 ASSERT(instr->value()->representation().IsTagged()); |
| 1287 LOperand* value = UseRegisterAtStart(instr->value()); | 1287 LOperand* value = UseRegisterAtStart(instr->value()); |
| 1288 HBasicBlock* first = instr->FirstSuccessor(); | 1288 return new LCmpMapAndBranch(value); |
| 1289 HBasicBlock* second = instr->SecondSuccessor(); | |
| 1290 return new LCmpMapAndBranch(value, | |
| 1291 instr->map(), | |
| 1292 first->block_id(), | |
| 1293 second->block_id()); | |
| 1294 } | 1289 } |
| 1295 | 1290 |
| 1296 | 1291 |
| 1297 LInstruction* LChunkBuilder::DoArgumentsLength(HArgumentsLength* length) { | 1292 LInstruction* LChunkBuilder::DoArgumentsLength(HArgumentsLength* length) { |
| 1298 return DefineAsRegister(new LArgumentsLength(Use(length->value()))); | 1293 return DefineAsRegister(new LArgumentsLength(Use(length->value()))); |
| 1299 } | 1294 } |
| 1300 | 1295 |
| 1301 | 1296 |
| 1302 LInstruction* LChunkBuilder::DoArgumentsElements(HArgumentsElements* elems) { | 1297 LInstruction* LChunkBuilder::DoArgumentsElements(HArgumentsElements* elems) { |
| 1303 return DefineAsRegister(new LArgumentsElements); | 1298 return DefineAsRegister(new LArgumentsElements); |
| (...skipping 813 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2117 void LPointerMap::PrintTo(StringStream* stream) const { | 2112 void LPointerMap::PrintTo(StringStream* stream) const { |
| 2118 stream->Add("{"); | 2113 stream->Add("{"); |
| 2119 for (int i = 0; i < pointer_operands_.length(); ++i) { | 2114 for (int i = 0; i < pointer_operands_.length(); ++i) { |
| 2120 if (i != 0) stream->Add(";"); | 2115 if (i != 0) stream->Add(";"); |
| 2121 pointer_operands_[i]->PrintTo(stream); | 2116 pointer_operands_[i]->PrintTo(stream); |
| 2122 } | 2117 } |
| 2123 stream->Add("} @%d", position()); | 2118 stream->Add("} @%d", position()); |
| 2124 } | 2119 } |
| 2125 | 2120 |
| 2126 } } // namespace v8::internal | 2121 } } // namespace v8::internal |
| OLD | NEW |