summaryrefslogtreecommitdiff
path: root/test/MC
diff options
context:
space:
mode:
authorDaniel Dunbar <daniel@zuster.org>2009-08-08 07:50:56 +0000
committerDaniel Dunbar <daniel@zuster.org>2009-08-08 07:50:56 +0000
commita3741fa28b1a397ebfd623ef9d14e978df94ce47 (patch)
tree13d45175a09a0f75b0da9b7ca7c865ae74f499ca /test/MC
parentb6ab51e8297281888b85eee8c38215eab2649c4b (diff)
downloadllvm-a3741fa28b1a397ebfd623ef9d14e978df94ce47.tar.gz
llvm-a3741fa28b1a397ebfd623ef9d14e978df94ce47.tar.bz2
llvm-a3741fa28b1a397ebfd623ef9d14e978df94ce47.tar.xz
llvm-mc/AsmMatcher: Improve match code.
- 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
Diffstat (limited to 'test/MC')
-rw-r--r--test/MC/AsmParser/labels.s3
-rw-r--r--test/MC/AsmParser/x86_instructions.s3
2 files changed, 0 insertions, 6 deletions
diff --git a/test/MC/AsmParser/labels.s b/test/MC/AsmParser/labels.s
index 6eb7c0f8e0..a5998c4dc3 100644
--- a/test/MC/AsmParser/labels.s
+++ b/test/MC/AsmParser/labels.s
@@ -1,8 +1,5 @@
// RUN: llvm-mc -triple i386-unknown-unknown %s | FileCheck %s
-// FIXME: Disabled until the generated code stops crashing gcc 4.0.
-// XFAIL: *
-
.data
// CHECK: a:
a:
diff --git a/test/MC/AsmParser/x86_instructions.s b/test/MC/AsmParser/x86_instructions.s
index 3ab8ac17d4..ffd2dde0f1 100644
--- a/test/MC/AsmParser/x86_instructions.s
+++ b/test/MC/AsmParser/x86_instructions.s
@@ -1,7 +1,4 @@
// FIXME: Switch back to FileCheck once we print actual instructions
-
-// FIXME: Disabled until the generated code stops crashing gcc 4.0.
-// XFAIL: *
// RUN: llvm-mc -triple i386-unknown-unknown %s > %t