llvm-6502/test/TableGen/Tree.td

// This tests to make sure we can parse tree patterns.
// RUN: tblgen %s
// XFAIL: vg_leak

class TreeNode;
class RegisterClass;

def set  : TreeNode;
def plus : TreeNode;
def imm  : TreeNode;
def R32  : RegisterClass;

class Inst<dag T> {
  dag Pattern = T;
}

def ADDrr32 : Inst<(set R32, (plus R32, R32))>;  // a = b + c
def ADDri32 : Inst<(set R32, (plus R32, imm))>;  // a = b + imm
New testcase git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7575 91177308-0d34-0410-b5e6-96231b3b80d8 2003-08-04 20:43:48 +00:00			`// This tests to make sure we can parse tree patterns.`
			`// RUN: tblgen %s`
Add support for XFAILing valgrind runs with memory leak checking independently of runs without leak checking. We add -vg to the triple for non-checked runs, or -vg_leak for checked runs. Also use this to XFAIL the TableGen tests, since tablegen leaks like a sieve. This includes some valgrindArgs refactoring. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@99103 91177308-0d34-0410-b5e6-96231b3b80d8 2010-03-20 23:08:45 +00:00			`// XFAIL: vg_leak`
New testcase git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7575 91177308-0d34-0410-b5e6-96231b3b80d8 2003-08-04 20:43:48 +00:00
			`class TreeNode;`
			`class RegisterClass;`

			`def set : TreeNode;`
			`def plus : TreeNode;`
			`def imm : TreeNode;`
			`def R32 : RegisterClass;`

			`class Inst<dag T> {`
			`dag Pattern = T;`
			`}`

			`def ADDrr32 : Inst<(set R32, (plus R32, R32))>; // a = b + c`
			`def ADDri32 : Inst<(set R32, (plus R32, imm))>; // a = b + imm`