OLD | NEW |
1 // Copyright 2009 the V8 project authors. All rights reserved. | 1 // Copyright 2009 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 1325 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1336 case 0x68: | 1336 case 0x68: |
1337 AppendToBuffer("push 0x%x", *reinterpret_cast<int32_t*>(data + 1)); | 1337 AppendToBuffer("push 0x%x", *reinterpret_cast<int32_t*>(data + 1)); |
1338 data += 5; | 1338 data += 5; |
1339 break; | 1339 break; |
1340 | 1340 |
1341 case 0x6A: | 1341 case 0x6A: |
1342 AppendToBuffer("push 0x%x", *reinterpret_cast<int8_t*>(data + 1)); | 1342 AppendToBuffer("push 0x%x", *reinterpret_cast<int8_t*>(data + 1)); |
1343 data += 2; | 1343 data += 2; |
1344 break; | 1344 break; |
1345 | 1345 |
| 1346 case 0xA1: // Fall through. |
| 1347 case 0xA3: |
| 1348 switch (operand_size()) { |
| 1349 case DOUBLEWORD_SIZE: { |
| 1350 const char* memory_location = NameOfAddress( |
| 1351 reinterpret_cast<byte*>( |
| 1352 *reinterpret_cast<int32_t*>(data + 1))); |
| 1353 if (*data & 0x2 == 0x2) { // Opcode 0xA3 |
| 1354 AppendToBuffer("movzxlq rax,(%s)", memory_location); |
| 1355 } else { // Opcode 0xA1 |
| 1356 AppendToBuffer("movzxlq (%s),rax", memory_location); |
| 1357 } |
| 1358 data += 5; |
| 1359 break; |
| 1360 } |
| 1361 case QUADWORD_SIZE: { |
| 1362 // New x64 instruction mov rax,(imm_64). |
| 1363 const char* memory_location = NameOfAddress( |
| 1364 *reinterpret_cast<byte**>(data + 1)); |
| 1365 if (*data & 0x2 == 0x2) { // Opcode 0xA3 |
| 1366 AppendToBuffer("movq rax,(%s)", memory_location); |
| 1367 } else { // Opcode 0xA1 |
| 1368 AppendToBuffer("movq (%s),rax", memory_location); |
| 1369 } |
| 1370 data += 9; |
| 1371 break; |
| 1372 } |
| 1373 default: |
| 1374 UnimplementedInstruction(); |
| 1375 data += 2; |
| 1376 } |
| 1377 break; |
| 1378 |
1346 case 0xA8: | 1379 case 0xA8: |
1347 AppendToBuffer("test al,0x%x", *reinterpret_cast<uint8_t*>(data + 1)); | 1380 AppendToBuffer("test al,0x%x", *reinterpret_cast<uint8_t*>(data + 1)); |
1348 data += 2; | 1381 data += 2; |
1349 break; | 1382 break; |
1350 | 1383 |
1351 case 0xA9: { | 1384 case 0xA9: { |
1352 int64_t value = 0; | 1385 int64_t value = 0; |
1353 switch (operand_size()) { | 1386 switch (operand_size()) { |
1354 case WORD_SIZE: | 1387 case WORD_SIZE: |
1355 value = *reinterpret_cast<uint16_t*>(data + 1); | 1388 value = *reinterpret_cast<uint16_t*>(data + 1); |
(...skipping 168 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1524 fprintf(f, "%02x", *bp); | 1557 fprintf(f, "%02x", *bp); |
1525 } | 1558 } |
1526 for (int i = 6 - (pc - prev_pc); i >= 0; i--) { | 1559 for (int i = 6 - (pc - prev_pc); i >= 0; i--) { |
1527 fprintf(f, " "); | 1560 fprintf(f, " "); |
1528 } | 1561 } |
1529 fprintf(f, " %s\n", buffer.start()); | 1562 fprintf(f, " %s\n", buffer.start()); |
1530 } | 1563 } |
1531 } | 1564 } |
1532 | 1565 |
1533 } // namespace disasm | 1566 } // namespace disasm |
OLD | NEW |