mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-10-03 08:55:51 +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
52 lines
837 B
ArmAsm
52 lines
837 B
ArmAsm
// RUN: llvm-mc -triple i386-unknown-unknown %s | FileCheck %s
|
|
|
|
.data
|
|
// CHECK: a:
|
|
a:
|
|
.long 0
|
|
// CHECK: b:
|
|
"b":
|
|
.long 0
|
|
// CHECK: "a$b":
|
|
"a$b":
|
|
.long 0
|
|
|
|
.text
|
|
foo:
|
|
// CHECK: val:"a$b"
|
|
addl $24, "a$b"(%eax)
|
|
// CHECK: val:"a$b" + 10
|
|
addl $24, ("a$b" + 10)(%eax)
|
|
|
|
// CHECK: "b$c" = 10
|
|
"b$c" = 10
|
|
// CHECK: val:10
|
|
addl "b$c", %eax
|
|
|
|
|
|
// CHECK: set "a 0", 11
|
|
.set "a 0", 11
|
|
// CHECK: .long 11
|
|
.long "a 0"
|
|
|
|
// CHECK: .section "a 1,a 2"
|
|
.section "a 1", "a 2"
|
|
|
|
// CHECK: .globl "a 3"
|
|
.globl "a 3"
|
|
|
|
// CHECK: .weak "a 4"
|
|
.weak "a 4"
|
|
|
|
// CHECK: .desc "a 5",1
|
|
.desc "a 5", 1
|
|
|
|
// CHECK: .comm "a 6",1
|
|
.comm "a 6", 1
|
|
|
|
// CHECK: .lcomm "a 7",1
|
|
.lcomm "a 7", 1
|
|
|
|
// CHECK: .lsym "a 8",1
|
|
.lsym "a 8", 1
|