Tree.td 394 B

12345678910111213141516171819
  1. // This tests to make sure we can parse tree patterns.
  2. // RUN: llvm-tblgen %s
  3. // XFAIL: vg_leak
  4. class TreeNode;
  5. class RegisterClass;
  6. def set : TreeNode;
  7. def plus : TreeNode;
  8. def imm : TreeNode;
  9. def R32 : RegisterClass;
  10. class Inst<dag T> {
  11. dag Pattern = T;
  12. }
  13. def ADDrr32 : Inst<(set R32, (plus R32, R32))>; // a = b + c
  14. def ADDri32 : Inst<(set R32, (plus R32, imm))>; // a = b + imm