|
| 1 | +// RUN: llvm-tblgen %s | FileCheck %s |
| 2 | +// XFAIL: vg_leak |
| 3 | + |
| 4 | +// This file has tests for range lists and range pieces. |
| 5 | + |
| 6 | +// These are tests for bits ranges. |
| 7 | + |
| 8 | +def bit_range_hyphen { |
| 9 | + bits<16> field1; |
| 10 | + let field1{15, 14, 13, 12} = {1, 0, 1, 0}; |
| 11 | + let field1{11-8} = {1, 0, 1, 1}; |
| 12 | + let field1{+7-4} = {1, 1, 0, 0}; |
| 13 | + let field1{+3-+0} = {1, 1, 0, 1}; |
| 14 | + bit hyphen_field1_ok = !eq(field1, 0xABCD); |
| 15 | +} |
| 16 | + |
| 17 | +def bit_range_dotdotdot { |
| 18 | + bits<16> field1; |
| 19 | + let field1{15, 14, 13, 12} = {1, 0, 1, 0}; |
| 20 | + let field1{11...8} = {1, 0, 1, 1}; |
| 21 | + let field1{+7...4} = {1, 1, 0, 0}; |
| 22 | + let field1{+3...+0} = {1, 1, 0, 1}; |
| 23 | + bit dotdotdot_field1_ok = !eq(field1, 0xABCD); |
| 24 | +} |
| 25 | + |
| 26 | +if !eq(bit_range_hyphen.field1, bit_range_dotdotdot.field1) then |
| 27 | + def bit_range_ok {} |
| 28 | +else |
| 29 | + def bit_range_not_ok {} |
| 30 | + |
| 31 | +// These are tests for lists. |
| 32 | + |
| 33 | +def list_range_hyphen { |
| 34 | + list<string> field1 = ["foo", "bar", "baz", "snork", "quux", "quuux", |
| 35 | + "bazola", "ztesch", "bletch", "flarp"]; |
| 36 | + list<string> subfielda = field1[0, 1, 2, 3]; |
| 37 | + list<string> subfieldb = field1[4-5]; |
| 38 | + list<string> subfieldc = field1[+6-7]; |
| 39 | + list<string> subfieldd = field1[+8-+9]; |
| 40 | + bit hyphen_subfields_ok = !and(!eq(subfieldb[0], "quux"), |
| 41 | + !eq(subfieldd[1], "flarp")); |
| 42 | +} |
| 43 | + |
| 44 | +def list_range_dotdotdot { |
| 45 | + list<string> field1 = ["foo", "bar", "baz", "snork", "quux", "quuux", |
| 46 | + "bazola", "ztesch", "bletch", "flarp"]; |
| 47 | + list<string> subfielda = field1[0, 1, 2, 3]; |
| 48 | + list<string> subfieldb = field1[4...5]; |
| 49 | + list<string> subfieldc = field1[+6...7]; |
| 50 | + list<string> subfieldd = field1[+8...+9]; |
| 51 | + bit dotdotdot_subfields_ok = !and(!eq(subfieldb[0], "quux"), |
| 52 | + !eq(subfieldd[1], "flarp")); |
| 53 | +} |
| 54 | + |
| 55 | +if !eq(!head(list_range_hyphen.subfieldd), |
| 56 | + !head(list_range_dotdotdot.subfieldd)) then |
| 57 | + def list_range_ok {} |
| 58 | +else |
| 59 | + def list_range_not_ok {} |
| 60 | + |
| 61 | +// This is a test of foreach. |
| 62 | + |
| 63 | +foreach i = {0-3} in |
| 64 | + foreach j = {4...5} in |
| 65 | + def eachrec#i#j { |
| 66 | + int fi = i; |
| 67 | + int fj = j; |
| 68 | + } |
| 69 | + |
| 70 | +//CHECK: bit dotdotdot_field1_ok = 1 |
| 71 | +//CHECK: bit hyphen_field1_ok = 1 |
| 72 | +//CHECK: def bit_range_ok { |
| 73 | + |
| 74 | +//CHECK: def eachrec04 { |
| 75 | +//CHECK: def eachrec35 { |
| 76 | + |
| 77 | +//CHECK: bit dotdotdot_subfields_ok = 1 |
| 78 | +//CHECK: bit hyphen_subfields_ok = 1 |
| 79 | +//CHECK: def list_range_ok { |
| 80 | + |
0 commit comments