mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-01-31 12:41:49 +01:00
[TableGen] [tests] Change integer ranges to use new '...' punctuation
Differential Revision: https://reviews.llvm.org/D90057
This commit is contained in:
parent
dfaaccca5a
commit
4e53b7e1cf
@ -19,7 +19,7 @@ class Indexes<int N> {
|
||||
#ifdef USE_NAMESPACE
|
||||
let Namespace = "TestNamespace" in {
|
||||
#endif
|
||||
foreach Index = 0-31 in {
|
||||
foreach Index = 0...31 in {
|
||||
def sub#Index : SubRegIndex<32, !shl(Index, 5)>;
|
||||
}
|
||||
|
||||
@ -35,7 +35,7 @@ foreach Size = {2,4,8,16} in {
|
||||
}
|
||||
}
|
||||
|
||||
foreach Index = 0-255 in {
|
||||
foreach Index = 0...255 in {
|
||||
def R#Index : Register <"r"#Index>;
|
||||
}
|
||||
#ifdef USE_NAMESPACE
|
||||
|
@ -16,7 +16,7 @@ def foo : Instruction {
|
||||
field bits<16> SoftFail = 0;
|
||||
bits<8> factor;
|
||||
let factor{0} = 0; // zero initial value
|
||||
let Inst{15-8} = factor{7-0};
|
||||
let Inst{15...8} = factor{7...0};
|
||||
}
|
||||
|
||||
def bar : Instruction {
|
||||
@ -25,7 +25,7 @@ def bar : Instruction {
|
||||
field bits<16> SoftFail = 0;
|
||||
bits<8> factor;
|
||||
let factor{0} = 1; // non-zero initial value
|
||||
let Inst{15-8} = factor{7-0};
|
||||
let Inst{15...8} = factor{7...0};
|
||||
}
|
||||
|
||||
def bax : Instruction {
|
||||
@ -34,7 +34,7 @@ def bax : Instruction {
|
||||
field bits<16> SoftFail = 0;
|
||||
bits<33> factor;
|
||||
let factor{32} = 1; // non-zero initial value
|
||||
let Inst{15-8} = factor{32-25};
|
||||
let Inst{15...8} = factor{32...25};
|
||||
}
|
||||
|
||||
}
|
||||
|
@ -21,11 +21,11 @@ class I<dag OOps, dag IOps, list<dag> Pat>
|
||||
|
||||
def A : I<(outs GPR32:$dst), (ins GPR32:$src1), []> {
|
||||
let Size = 4;
|
||||
let Inst{31-0} = 0;
|
||||
let Inst{31...0} = 0;
|
||||
}
|
||||
def B : I<(outs GPR32:$dst), (ins GPR32:$src1), []> {
|
||||
let Size = 4;
|
||||
let Inst{31-0} = 0;
|
||||
let Inst{31...0} = 0;
|
||||
}
|
||||
|
||||
// CHECK: Decoding Conflict:
|
||||
|
@ -15,7 +15,7 @@ def SymKind : GenericEnum {
|
||||
|
||||
// Define a transition implementation.
|
||||
class SimpleTransition<bits<2> State, SymKindTy A> : Transition {
|
||||
let NewState{1-0} = State;
|
||||
let NewState{1...0} = State;
|
||||
SymKindTy ActionSym = A;
|
||||
}
|
||||
|
||||
@ -38,7 +38,7 @@ def SimpleAutomaton : GenericAutomaton {
|
||||
|
||||
// Define a transition implementation.
|
||||
class TupleTransition<bits<2> State, SymKindTy s1, SymKindTy s2, string s3> : Transition {
|
||||
let NewState{1-0} = State;
|
||||
let NewState{1...0} = State;
|
||||
SymKindTy S1 = s1;
|
||||
SymKindTy S2 = s2;
|
||||
string S3 = s3;
|
||||
@ -59,7 +59,7 @@ def TupleAutomaton : GenericAutomaton {
|
||||
// NfaAutomaton test implementation
|
||||
|
||||
class NfaTransition<bits<2> State, SymKindTy S> : Transition {
|
||||
let NewState{1-0} = State;
|
||||
let NewState{1...0} = State;
|
||||
SymKindTy A = S;
|
||||
}
|
||||
|
||||
|
Loading…
x
Reference in New Issue
Block a user