diff --git a/llvm/test/TableGen/Common/reg-with-subregs-common.td b/llvm/test/TableGen/Common/reg-with-subregs-common.td --- a/llvm/test/TableGen/Common/reg-with-subregs-common.td +++ b/llvm/test/TableGen/Common/reg-with-subregs-common.td @@ -19,7 +19,7 @@ #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 Index = 0-255 in { +foreach Index = 0...255 in { def R#Index : Register <"r"#Index>; } #ifdef USE_NAMESPACE diff --git a/llvm/test/TableGen/FixedLenDecoderEmitter/InitValue.td b/llvm/test/TableGen/FixedLenDecoderEmitter/InitValue.td --- a/llvm/test/TableGen/FixedLenDecoderEmitter/InitValue.td +++ b/llvm/test/TableGen/FixedLenDecoderEmitter/InitValue.td @@ -16,7 +16,7 @@ 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 @@ 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 @@ 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}; } } diff --git a/llvm/test/TableGen/FixedLenDecoderEmitter/conflict.td b/llvm/test/TableGen/FixedLenDecoderEmitter/conflict.td --- a/llvm/test/TableGen/FixedLenDecoderEmitter/conflict.td +++ b/llvm/test/TableGen/FixedLenDecoderEmitter/conflict.td @@ -21,11 +21,11 @@ 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: diff --git a/llvm/unittests/TableGen/Automata.td b/llvm/unittests/TableGen/Automata.td --- a/llvm/unittests/TableGen/Automata.td +++ b/llvm/unittests/TableGen/Automata.td @@ -15,7 +15,7 @@ // Define a transition implementation. class SimpleTransition State, SymKindTy A> : Transition { - let NewState{1-0} = State; + let NewState{1...0} = State; SymKindTy ActionSym = A; } @@ -38,7 +38,7 @@ // Define a transition implementation. class TupleTransition 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 @@ // NfaAutomaton test implementation class NfaTransition State, SymKindTy S> : Transition { - let NewState{1-0} = State; + let NewState{1...0} = State; SymKindTy A = S; }