mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-01-20 12:31:40 +00:00
a3741fa28b
- This doesn't actually improve the algorithm (its still linear), but the generated (match) code is now fairly compact and table driven. Still need a generic string matcher. - The table still needs to be compressed, this is quite simple to do and should shrink it to under 16k. - This also simplifies and restructures the code to make the match classes more explicit, in anticipation of resolving ambiguities. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@78461 91177308-0d34-0410-b5e6-96231b3b80d8
19 lines
819 B
ArmAsm
19 lines
819 B
ArmAsm
// FIXME: Switch back to FileCheck once we print actual instructions
|
|
|
|
// RUN: llvm-mc -triple i386-unknown-unknown %s > %t
|
|
|
|
// RUN: grep {MCInst(opcode=.*, operands=.reg:2, reg:0, reg:2.)} %t
|
|
subb %al, %al
|
|
|
|
// RUN: grep {MCInst(opcode=.*, operands=.reg:19, reg:0, val:24.)} %t
|
|
addl $24, %eax
|
|
|
|
// RUN: grep {MCInst(opcode=.*, operands=.reg:20, imm:1, reg:0, val:10, reg:0, reg:19.)} %t
|
|
movl %eax, 10(%ebp)
|
|
// RUN: grep {MCInst(opcode=.*, operands=.reg:20, imm:1, reg:21, val:10, reg:0, reg:19.)} %t
|
|
movl %eax, 10(%ebp, %ebx)
|
|
// RUN: grep {MCInst(opcode=.*, operands=.reg:20, imm:4, reg:21, val:10, reg:0, reg:19.)} %t
|
|
movl %eax, 10(%ebp, %ebx, 4)
|
|
// RUN: grep {MCInst(opcode=.*, operands=.reg:0, imm:4, reg:21, val:10, reg:0, reg:19.)} %t
|
|
movl %eax, 10(, %ebx, 4)
|