OLD | NEW |
---|---|
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 Loading... | |
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 | |
231 void LIsSmiAndBranch::PrintDataTo(StringStream* stream) { | 238 void LIsSmiAndBranch::PrintDataTo(StringStream* stream) { |
232 stream->Add("if is_smi("); | 239 stream->Add("if is_smi("); |
233 InputAt(0)->PrintTo(stream); | 240 InputAt(0)->PrintTo(stream); |
234 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()); |
235 } | 242 } |
236 | 243 |
237 | 244 |
238 void LIsUndetectableAndBranch::PrintDataTo(StringStream* stream) { | 245 void LIsUndetectableAndBranch::PrintDataTo(StringStream* stream) { |
239 stream->Add("if is_undetectable("); | 246 stream->Add("if is_undetectable("); |
240 InputAt(0)->PrintTo(stream); | 247 InputAt(0)->PrintTo(stream); |
241 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()); |
242 } | 249 } |
243 | 250 |
244 | 251 |
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 | |
245 void LHasInstanceTypeAndBranch::PrintDataTo(StringStream* stream) { | 260 void LHasInstanceTypeAndBranch::PrintDataTo(StringStream* stream) { |
246 stream->Add("if has_instance_type("); | 261 stream->Add("if has_instance_type("); |
247 InputAt(0)->PrintTo(stream); | 262 InputAt(0)->PrintTo(stream); |
248 stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); | 263 stream->Add(") then B%d else B%d", true_block_id(), false_block_id()); |
249 } | 264 } |
250 | 265 |
251 | 266 |
252 void LHasCachedArrayIndexAndBranch::PrintDataTo(StringStream* stream) { | 267 void LHasCachedArrayIndexAndBranch::PrintDataTo(StringStream* stream) { |
253 stream->Add("if has_cached_array_index("); | 268 stream->Add("if has_cached_array_index("); |
254 InputAt(0)->PrintTo(stream); | 269 InputAt(0)->PrintTo(stream); |
(...skipping 1138 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
1393 CAN_DEOPTIMIZE_EAGERLY); | 1408 CAN_DEOPTIMIZE_EAGERLY); |
1394 } | 1409 } |
1395 | 1410 |
1396 | 1411 |
1397 LInstruction* LChunkBuilder::DoCompareGeneric(HCompareGeneric* instr) { | 1412 LInstruction* LChunkBuilder::DoCompareGeneric(HCompareGeneric* instr) { |
1398 ASSERT(instr->left()->representation().IsTagged()); | 1413 ASSERT(instr->left()->representation().IsTagged()); |
1399 ASSERT(instr->right()->representation().IsTagged()); | 1414 ASSERT(instr->right()->representation().IsTagged()); |
1400 LOperand* left = UseFixed(instr->left(), r1); | 1415 LOperand* left = UseFixed(instr->left(), r1); |
1401 LOperand* right = UseFixed(instr->right(), r0); | 1416 LOperand* right = UseFixed(instr->right(), r0); |
1402 LCmpT* result = new LCmpT(left, right); | 1417 LCmpT* result = new LCmpT(left, right); |
1403 return MarkAsCall(DefineFixed(result, r0), instr); | 1418 return AssignEnvironment(MarkAsCall(DefineFixed(result, r0), instr)); |
fschneider
2011/11/07 15:34:00
Unintended change? The call to AssignEnvironment s
indutny
2011/11/07 17:06:08
Sorry, fixed
| |
1404 } | 1419 } |
1405 | 1420 |
1406 | 1421 |
1407 LInstruction* LChunkBuilder::DoCompareIDAndBranch( | 1422 LInstruction* LChunkBuilder::DoCompareIDAndBranch( |
1408 HCompareIDAndBranch* instr) { | 1423 HCompareIDAndBranch* instr) { |
1409 Representation r = instr->GetInputRepresentation(); | 1424 Representation r = instr->GetInputRepresentation(); |
1410 if (r.IsInteger32()) { | 1425 if (r.IsInteger32()) { |
1411 ASSERT(instr->left()->representation().IsInteger32()); | 1426 ASSERT(instr->left()->representation().IsInteger32()); |
1412 ASSERT(instr->right()->representation().IsInteger32()); | 1427 ASSERT(instr->right()->representation().IsInteger32()); |
1413 LOperand* left = UseRegisterOrConstantAtStart(instr->left()); | 1428 LOperand* left = UseRegisterOrConstantAtStart(instr->left()); |
(...skipping 30 matching lines...) Expand all Loading... | |
1444 } | 1459 } |
1445 | 1460 |
1446 | 1461 |
1447 LInstruction* LChunkBuilder::DoIsObjectAndBranch(HIsObjectAndBranch* instr) { | 1462 LInstruction* LChunkBuilder::DoIsObjectAndBranch(HIsObjectAndBranch* instr) { |
1448 ASSERT(instr->value()->representation().IsTagged()); | 1463 ASSERT(instr->value()->representation().IsTagged()); |
1449 LOperand* temp = TempRegister(); | 1464 LOperand* temp = TempRegister(); |
1450 return new LIsObjectAndBranch(UseRegisterAtStart(instr->value()), temp); | 1465 return new LIsObjectAndBranch(UseRegisterAtStart(instr->value()), temp); |
1451 } | 1466 } |
1452 | 1467 |
1453 | 1468 |
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 | |
1454 LInstruction* LChunkBuilder::DoIsSmiAndBranch(HIsSmiAndBranch* instr) { | 1476 LInstruction* LChunkBuilder::DoIsSmiAndBranch(HIsSmiAndBranch* instr) { |
1455 ASSERT(instr->value()->representation().IsTagged()); | 1477 ASSERT(instr->value()->representation().IsTagged()); |
1456 return new LIsSmiAndBranch(Use(instr->value())); | 1478 return new LIsSmiAndBranch(Use(instr->value())); |
1457 } | 1479 } |
1458 | 1480 |
1459 | 1481 |
1460 LInstruction* LChunkBuilder::DoIsUndetectableAndBranch( | 1482 LInstruction* LChunkBuilder::DoIsUndetectableAndBranch( |
1461 HIsUndetectableAndBranch* instr) { | 1483 HIsUndetectableAndBranch* instr) { |
1462 ASSERT(instr->value()->representation().IsTagged()); | 1484 ASSERT(instr->value()->representation().IsTagged()); |
1463 return new LIsUndetectableAndBranch(UseRegisterAtStart(instr->value()), | 1485 return new LIsUndetectableAndBranch(UseRegisterAtStart(instr->value()), |
1464 TempRegister()); | 1486 TempRegister()); |
1465 } | 1487 } |
1466 | 1488 |
1467 | 1489 |
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 | |
1468 LInstruction* LChunkBuilder::DoHasInstanceTypeAndBranch( | 1502 LInstruction* LChunkBuilder::DoHasInstanceTypeAndBranch( |
1469 HHasInstanceTypeAndBranch* instr) { | 1503 HHasInstanceTypeAndBranch* instr) { |
1470 ASSERT(instr->value()->representation().IsTagged()); | 1504 ASSERT(instr->value()->representation().IsTagged()); |
1471 return new LHasInstanceTypeAndBranch(UseRegisterAtStart(instr->value())); | 1505 return new LHasInstanceTypeAndBranch(UseRegisterAtStart(instr->value())); |
1472 } | 1506 } |
1473 | 1507 |
1474 | 1508 |
1475 LInstruction* LChunkBuilder::DoGetCachedArrayIndex( | 1509 LInstruction* LChunkBuilder::DoGetCachedArrayIndex( |
1476 HGetCachedArrayIndex* instr) { | 1510 HGetCachedArrayIndex* instr) { |
1477 ASSERT(instr->value()->representation().IsTagged()); | 1511 ASSERT(instr->value()->representation().IsTagged()); |
(...skipping 715 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
2193 | 2227 |
2194 LInstruction* LChunkBuilder::DoIn(HIn* instr) { | 2228 LInstruction* LChunkBuilder::DoIn(HIn* instr) { |
2195 LOperand* key = UseRegisterAtStart(instr->key()); | 2229 LOperand* key = UseRegisterAtStart(instr->key()); |
2196 LOperand* object = UseRegisterAtStart(instr->object()); | 2230 LOperand* object = UseRegisterAtStart(instr->object()); |
2197 LIn* result = new LIn(key, object); | 2231 LIn* result = new LIn(key, object); |
2198 return MarkAsCall(DefineFixed(result, r0), instr); | 2232 return MarkAsCall(DefineFixed(result, r0), instr); |
2199 } | 2233 } |
2200 | 2234 |
2201 | 2235 |
2202 } } // namespace v8::internal | 2236 } } // namespace v8::internal |
OLD | NEW |