Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(655)

Side by Side Diff: src/arm/lithium-arm.cc

Issue 8495011: Revert r9901 to make tree green again. (Closed) Base URL: http://v8.googlecode.com/svn/branches/bleeding_edge/
Patch Set: Created 9 years, 1 month ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « src/arm/lithium-arm.h ('k') | src/arm/lithium-codegen-arm.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright 2011 the V8 project authors. All rights reserved. 1 // Copyright 2011 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 210 matching lines...) Expand 10 before | Expand all | Expand 10 after
221 } 221 }
222 222
223 223
224 void LIsObjectAndBranch::PrintDataTo(StringStream* stream) { 224 void LIsObjectAndBranch::PrintDataTo(StringStream* stream) {
225 stream->Add("if is_object("); 225 stream->Add("if is_object(");
226 InputAt(0)->PrintTo(stream); 226 InputAt(0)->PrintTo(stream);
227 stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); 227 stream->Add(") then B%d else B%d", true_block_id(), false_block_id());
228 } 228 }
229 229
230 230
231 void LIsStringAndBranch::PrintDataTo(StringStream* stream) {
232 stream->Add("if is_string(");
233 InputAt(0)->PrintTo(stream);
234 stream->Add(") then B%d else B%d", true_block_id(), false_block_id());
235 }
236
237
238 void LIsSmiAndBranch::PrintDataTo(StringStream* stream) { 231 void LIsSmiAndBranch::PrintDataTo(StringStream* stream) {
239 stream->Add("if is_smi("); 232 stream->Add("if is_smi(");
240 InputAt(0)->PrintTo(stream); 233 InputAt(0)->PrintTo(stream);
241 stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); 234 stream->Add(") then B%d else B%d", true_block_id(), false_block_id());
242 } 235 }
243 236
244 237
245 void LIsUndetectableAndBranch::PrintDataTo(StringStream* stream) { 238 void LIsUndetectableAndBranch::PrintDataTo(StringStream* stream) {
246 stream->Add("if is_undetectable("); 239 stream->Add("if is_undetectable(");
247 InputAt(0)->PrintTo(stream); 240 InputAt(0)->PrintTo(stream);
248 stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); 241 stream->Add(") then B%d else B%d", true_block_id(), false_block_id());
249 } 242 }
250 243
251 244
252 void LStringCompareAndBranch::PrintDataTo(StringStream* stream) {
253 stream->Add("if compare_generic(");
254 InputAt(0)->PrintTo(stream);
255 InputAt(1)->PrintTo(stream);
256 stream->Add(") then B%d else B%d", true_block_id(), false_block_id());
257 }
258
259
260 void LHasInstanceTypeAndBranch::PrintDataTo(StringStream* stream) { 245 void LHasInstanceTypeAndBranch::PrintDataTo(StringStream* stream) {
261 stream->Add("if has_instance_type("); 246 stream->Add("if has_instance_type(");
262 InputAt(0)->PrintTo(stream); 247 InputAt(0)->PrintTo(stream);
263 stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); 248 stream->Add(") then B%d else B%d", true_block_id(), false_block_id());
264 } 249 }
265 250
266 251
267 void LHasCachedArrayIndexAndBranch::PrintDataTo(StringStream* stream) { 252 void LHasCachedArrayIndexAndBranch::PrintDataTo(StringStream* stream) {
268 stream->Add("if has_cached_array_index("); 253 stream->Add("if has_cached_array_index(");
269 InputAt(0)->PrintTo(stream); 254 InputAt(0)->PrintTo(stream);
(...skipping 1189 matching lines...) Expand 10 before | Expand all | Expand 10 after
1459 } 1444 }
1460 1445
1461 1446
1462 LInstruction* LChunkBuilder::DoIsObjectAndBranch(HIsObjectAndBranch* instr) { 1447 LInstruction* LChunkBuilder::DoIsObjectAndBranch(HIsObjectAndBranch* instr) {
1463 ASSERT(instr->value()->representation().IsTagged()); 1448 ASSERT(instr->value()->representation().IsTagged());
1464 LOperand* temp = TempRegister(); 1449 LOperand* temp = TempRegister();
1465 return new LIsObjectAndBranch(UseRegisterAtStart(instr->value()), temp); 1450 return new LIsObjectAndBranch(UseRegisterAtStart(instr->value()), temp);
1466 } 1451 }
1467 1452
1468 1453
1469 LInstruction* LChunkBuilder::DoIsStringAndBranch(HIsStringAndBranch* instr) {
1470 ASSERT(instr->value()->representation().IsTagged());
1471 LOperand* temp = TempRegister();
1472 return new LIsStringAndBranch(UseRegisterAtStart(instr->value()), temp);
1473 }
1474
1475
1476 LInstruction* LChunkBuilder::DoIsSmiAndBranch(HIsSmiAndBranch* instr) { 1454 LInstruction* LChunkBuilder::DoIsSmiAndBranch(HIsSmiAndBranch* instr) {
1477 ASSERT(instr->value()->representation().IsTagged()); 1455 ASSERT(instr->value()->representation().IsTagged());
1478 return new LIsSmiAndBranch(Use(instr->value())); 1456 return new LIsSmiAndBranch(Use(instr->value()));
1479 } 1457 }
1480 1458
1481 1459
1482 LInstruction* LChunkBuilder::DoIsUndetectableAndBranch( 1460 LInstruction* LChunkBuilder::DoIsUndetectableAndBranch(
1483 HIsUndetectableAndBranch* instr) { 1461 HIsUndetectableAndBranch* instr) {
1484 ASSERT(instr->value()->representation().IsTagged()); 1462 ASSERT(instr->value()->representation().IsTagged());
1485 return new LIsUndetectableAndBranch(UseRegisterAtStart(instr->value()), 1463 return new LIsUndetectableAndBranch(UseRegisterAtStart(instr->value()),
1486 TempRegister()); 1464 TempRegister());
1487 } 1465 }
1488 1466
1489 1467
1490 LInstruction* LChunkBuilder::DoStringCompareAndBranch(
1491 HStringCompareAndBranch* instr) {
1492
1493 ASSERT(instr->left()->representation().IsTagged());
1494 ASSERT(instr->right()->representation().IsTagged());
1495 LOperand* left = UseFixed(instr->left(), r1);
1496 LOperand* right = UseFixed(instr->right(), r0);
1497 LStringCompareAndBranch* result = new LStringCompareAndBranch(left, right);
1498 return MarkAsCall(result, instr);
1499 }
1500
1501
1502 LInstruction* LChunkBuilder::DoHasInstanceTypeAndBranch( 1468 LInstruction* LChunkBuilder::DoHasInstanceTypeAndBranch(
1503 HHasInstanceTypeAndBranch* instr) { 1469 HHasInstanceTypeAndBranch* instr) {
1504 ASSERT(instr->value()->representation().IsTagged()); 1470 ASSERT(instr->value()->representation().IsTagged());
1505 return new LHasInstanceTypeAndBranch(UseRegisterAtStart(instr->value())); 1471 return new LHasInstanceTypeAndBranch(UseRegisterAtStart(instr->value()));
1506 } 1472 }
1507 1473
1508 1474
1509 LInstruction* LChunkBuilder::DoGetCachedArrayIndex( 1475 LInstruction* LChunkBuilder::DoGetCachedArrayIndex(
1510 HGetCachedArrayIndex* instr) { 1476 HGetCachedArrayIndex* instr) {
1511 ASSERT(instr->value()->representation().IsTagged()); 1477 ASSERT(instr->value()->representation().IsTagged());
(...skipping 715 matching lines...) Expand 10 before | Expand all | Expand 10 after
2227 2193
2228 LInstruction* LChunkBuilder::DoIn(HIn* instr) { 2194 LInstruction* LChunkBuilder::DoIn(HIn* instr) {
2229 LOperand* key = UseRegisterAtStart(instr->key()); 2195 LOperand* key = UseRegisterAtStart(instr->key());
2230 LOperand* object = UseRegisterAtStart(instr->object()); 2196 LOperand* object = UseRegisterAtStart(instr->object());
2231 LIn* result = new LIn(key, object); 2197 LIn* result = new LIn(key, object);
2232 return MarkAsCall(DefineFixed(result, r0), instr); 2198 return MarkAsCall(DefineFixed(result, r0), instr);
2233 } 2199 }
2234 2200
2235 2201
2236 } } // namespace v8::internal 2202 } } // namespace v8::internal
OLDNEW
« no previous file with comments | « src/arm/lithium-arm.h ('k') | src/arm/lithium-codegen-arm.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698