//===-- HexagonRegisterInfo.td - Hexagon Register defs -----*- tablegen -*-===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===// // Declarations that describe the Hexagon register file. //===----------------------------------------------------------------------===// let Namespace = "Hexagon" in { class HexagonReg num, string n, list alt = [], list alias = []> : Register { field bits<5> Num; let Aliases = alias; let HWEncoding{4-0} = num; } class HexagonDoubleReg num, string n, list subregs, list alt = []> : RegisterWithSubRegs { field bits<5> Num; let AltNames = alt; let HWEncoding{4-0} = num; } // Registers are identified with 5-bit ID numbers. // Ri - 32-bit integer registers. class Ri num, string n, list alt = []> : HexagonReg { let Num = num; } // Rf - 32-bit floating-point registers. class Rf num, string n> : HexagonReg { let Num = num; } // Rd - 64-bit registers. class Rd num, string n, list subregs, list alt = []> : HexagonDoubleReg { let Num = num; let SubRegs = subregs; } // Rp - predicate registers class Rp num, string n> : HexagonReg { let Num = num; } // Rq - vector predicate registers class Rq num, string n> : Register { let HWEncoding{2-0} = num; } // Rc - control registers class Rc num, string n, list alt = [], list alias = []> : HexagonReg { let Num = num; } // Rcc - 64-bit control registers. class Rcc num, string n, list subregs, list alt = []> : HexagonDoubleReg { let Num = num; let SubRegs = subregs; } // Mx - address modifier registers class Mx num, string n> : HexagonReg<{0b0000, num}, n> { let Num = !cast>(num); } def subreg_loreg : SubRegIndex<32>; def subreg_hireg : SubRegIndex<32, 32>; def subreg_overflow : SubRegIndex<1, 0>; // Integer registers. foreach i = 0-28 in { def R#i : Ri, DwarfRegNum<[i]>; } def R29 : Ri<29, "r29", ["sp"]>, DwarfRegNum<[29]>; def R30 : Ri<30, "r30", ["fp"]>, DwarfRegNum<[30]>; def R31 : Ri<31, "r31", ["lr"]>, DwarfRegNum<[31]>; // Aliases of the R* registers used to hold 64-bit int values (doubles). let SubRegIndices = [subreg_loreg, subreg_hireg], CoveredBySubRegs = 1 in { def D0 : Rd< 0, "r1:0", [R0, R1]>, DwarfRegNum<[32]>; def D1 : Rd< 2, "r3:2", [R2, R3]>, DwarfRegNum<[34]>; def D2 : Rd< 4, "r5:4", [R4, R5]>, DwarfRegNum<[36]>; def D3 : Rd< 6, "r7:6", [R6, R7]>, DwarfRegNum<[38]>; def D4 : Rd< 8, "r9:8", [R8, R9]>, DwarfRegNum<[40]>; def D5 : Rd<10, "r11:10", [R10, R11]>, DwarfRegNum<[42]>; def D6 : Rd<12, "r13:12", [R12, R13]>, DwarfRegNum<[44]>; def D7 : Rd<14, "r15:14", [R14, R15]>, DwarfRegNum<[46]>; def D8 : Rd<16, "r17:16", [R16, R17]>, DwarfRegNum<[48]>; def D9 : Rd<18, "r19:18", [R18, R19]>, DwarfRegNum<[50]>; def D10 : Rd<20, "r21:20", [R20, R21]>, DwarfRegNum<[52]>; def D11 : Rd<22, "r23:22", [R22, R23]>, DwarfRegNum<[54]>; def D12 : Rd<24, "r25:24", [R24, R25]>, DwarfRegNum<[56]>; def D13 : Rd<26, "r27:26", [R26, R27]>, DwarfRegNum<[58]>; def D14 : Rd<28, "r29:28", [R28, R29]>, DwarfRegNum<[60]>; def D15 : Rd<30, "r31:30", [R30, R31], ["lr:fp"]>, DwarfRegNum<[62]>; } // Predicate registers. def P0 : Rp<0, "p0">, DwarfRegNum<[63]>; def P1 : Rp<1, "p1">, DwarfRegNum<[64]>; def P2 : Rp<2, "p2">, DwarfRegNum<[65]>; def P3 : Rp<3, "p3">, DwarfRegNum<[66]>; // Modifier registers. // C6 and C7 can also be M0 and M1, but register names must be unique, even // if belonging to different register classes. def M0 : Mx<0, "m0">, DwarfRegNum<[72]>; def M1 : Mx<1, "m1">, DwarfRegNum<[73]>; // Fake register to represent USR.OVF bit. Artihmetic/saturating instruc- // tions modify this bit, and multiple such instructions are allowed in the // same packet. We need to ignore output dependencies on this bit, but not // on the entire USR. def USR_OVF : Rc; def USR : Rc<8, "usr", ["c8"]>, DwarfRegNum<[75]> { let SubRegIndices = [subreg_overflow]; let SubRegs = [USR_OVF]; } // Control registers. def SA0 : Rc<0, "sa0", ["c0"]>, DwarfRegNum<[67]>; def LC0 : Rc<1, "lc0", ["c1"]>, DwarfRegNum<[68]>; def SA1 : Rc<2, "sa1", ["c2"]>, DwarfRegNum<[69]>; def LC1 : Rc<3, "lc1", ["c3"]>, DwarfRegNum<[70]>; def P3_0 : Rc<4, "p3:0", ["c4"], [P0, P1, P2, P3]>, DwarfRegNum<[71]>; def C5 : Rc<5, "c5", ["c5"]>, DwarfRegNum<[72]>; // future use def C6 : Rc<6, "c6", [], [M0]>, DwarfRegNum<[73]>; def C7 : Rc<7, "c7", [], [M1]>, DwarfRegNum<[74]>; // Define C8 separately and make it aliased with USR. // The problem is that USR has subregisters (e.g. overflow). If USR was // specified as a subregister of C9_8, it would imply that subreg_overflow // and subreg_loreg can be composed, which leads to all kinds of issues // with lane masks. def C8 : Rc<8, "c8", [], [USR]>, DwarfRegNum<[75]>; def PC : Rc<9, "pc">, DwarfRegNum<[76]>; def UGP : Rc<10, "ugp", ["c10"]>, DwarfRegNum<[77]>; def GP : Rc<11, "gp">, DwarfRegNum<[78]>; def CS0 : Rc<12, "cs0", ["c12"]>, DwarfRegNum<[79]>; def CS1 : Rc<13, "cs1", ["c13"]>, DwarfRegNum<[80]>; def UPCL : Rc<14, "upcyclelo", ["c14"]>, DwarfRegNum<[81]>; def UPCH : Rc<15, "upcyclehi", ["c15"]>, DwarfRegNum<[82]>; } // Control registers pairs. let SubRegIndices = [subreg_loreg, subreg_hireg], CoveredBySubRegs = 1 in { def C1_0 : Rcc<0, "c1:0", [SA0, LC0], ["lc0:sa0"]>, DwarfRegNum<[67]>; def C3_2 : Rcc<2, "c3:2", [SA1, LC1], ["lc1:sa1"]>, DwarfRegNum<[69]>; def C7_6 : Rcc<6, "c7:6", [C6, C7], ["m1:0"]>, DwarfRegNum<[72]>; // Use C8 instead of USR as a subregister of C9_8. def C9_8 : Rcc<8, "c9:8", [C8, PC]>, DwarfRegNum<[74]>; def C11_10 : Rcc<10, "c11:10", [UGP, GP]>, DwarfRegNum<[76]>; def CS : Rcc<12, "c13:12", [CS0, CS1], ["cs1:0"]>, DwarfRegNum<[78]>; def UPC : Rcc<14, "c15:14", [UPCL, UPCH]>, DwarfRegNum<[80]>; } foreach i = 0-31 in { def V#i : Ri, DwarfRegNum<[!add(i, 99)]>; } // Aliases of the V* registers used to hold double vec values. let SubRegIndices = [subreg_loreg, subreg_hireg], CoveredBySubRegs = 1 in { def W0 : Rd< 0, "v1:0", [V0, V1]>, DwarfRegNum<[99]>; def W1 : Rd< 2, "v3:2", [V2, V3]>, DwarfRegNum<[101]>; def W2 : Rd< 4, "v5:4", [V4, V5]>, DwarfRegNum<[103]>; def W3 : Rd< 6, "v7:6", [V6, V7]>, DwarfRegNum<[105]>; def W4 : Rd< 8, "v9:8", [V8, V9]>, DwarfRegNum<[107]>; def W5 : Rd<10, "v11:10", [V10, V11]>, DwarfRegNum<[109]>; def W6 : Rd<12, "v13:12", [V12, V13]>, DwarfRegNum<[111]>; def W7 : Rd<14, "v15:14", [V14, V15]>, DwarfRegNum<[113]>; def W8 : Rd<16, "v17:16", [V16, V17]>, DwarfRegNum<[115]>; def W9 : Rd<18, "v19:18", [V18, V19]>, DwarfRegNum<[117]>; def W10 : Rd<20, "v21:20", [V20, V21]>, DwarfRegNum<[119]>; def W11 : Rd<22, "v23:22", [V22, V23]>, DwarfRegNum<[121]>; def W12 : Rd<24, "v25:24", [V24, V25]>, DwarfRegNum<[123]>; def W13 : Rd<26, "v27:26", [V26, V27]>, DwarfRegNum<[125]>; def W14 : Rd<28, "v29:28", [V28, V29]>, DwarfRegNum<[127]>; def W15 : Rd<30, "v31:30", [V30, V31]>, DwarfRegNum<[129]>; } // Vector Predicate registers. def Q0 : Rq<0, "q0">, DwarfRegNum<[131]>; def Q1 : Rq<1, "q1">, DwarfRegNum<[132]>; def Q2 : Rq<2, "q2">, DwarfRegNum<[133]>; def Q3 : Rq<3, "q3">, DwarfRegNum<[134]>; // Register classes. // // FIXME: the register order should be defined in terms of the preferred // allocation order... // def IntRegs : RegisterClass<"Hexagon", [i32, f32, v4i8, v2i16], 32, (add (sequence "R%u", 0, 9), (sequence "R%u", 12, 28), R10, R11, R29, R30, R31)> { } // Registers are listed in reverse order for allocation preference reasons. def IntRegsLow8 : RegisterClass<"Hexagon", [i32], 32, (add R7, R6, R5, R4, R3, R2, R1, R0)> ; def DoubleRegs : RegisterClass<"Hexagon", [i64, f64, v8i8, v4i16, v2i32], 64, (add (sequence "D%u", 0, 4), (sequence "D%u", 6, 13), D5, D14, D15)>; def VectorRegs : RegisterClass<"Hexagon", [v64i8, v32i16, v16i32, v8i64], 512, (add (sequence "V%u", 0, 31))>; def VecDblRegs : RegisterClass<"Hexagon", [v128i8, v64i16, v32i32, v16i64], 1024, (add (sequence "W%u", 0, 15))>; def VectorRegs128B : RegisterClass<"Hexagon", [v128i8, v64i16, v32i32, v16i64], 1024, (add (sequence "V%u", 0, 31))>; def VecDblRegs128B : RegisterClass<"Hexagon", [v256i8,v128i16,v64i32,v32i64], 2048, (add (sequence "W%u", 0, 15))>; def VecPredRegs : RegisterClass<"Hexagon", [v512i1], 512, (add (sequence "Q%u", 0, 3))>; def VecPredRegs128B : RegisterClass<"Hexagon", [v1024i1], 1024, (add (sequence "Q%u", 0, 3))>; def PredRegs : RegisterClass<"Hexagon", [i1, v2i1, v4i1, v8i1, v4i8, v2i16, i32], 32, (add (sequence "P%u", 0, 3))> { let Size = 32; } let Size = 32 in def ModRegs : RegisterClass<"Hexagon", [i32], 32, (add M0, M1)>; let Size = 32, isAllocatable = 0 in def CtrRegs : RegisterClass<"Hexagon", [i32], 32, (add LC0, SA0, LC1, SA1, P3_0, M0, M1, C6, C7, CS0, CS1, UPCL, UPCH, USR, USR_OVF, UGP, GP, PC)>; let Size = 64, isAllocatable = 0 in def CtrRegs64 : RegisterClass<"Hexagon", [i64], 64, (add C1_0, C3_2, C7_6, C9_8, C11_10, CS, UPC)>; def VolatileV3 { list Regs = [D0, D1, D2, D3, D4, D5, D6, D7, R28, R31, P0, P1, P2, P3, M0, M1, LC0, LC1, SA0, SA1, USR, USR_OVF, CS0, CS1, V0, V1, V2, V3, V4, V5, V6, V7, V8, V9, V10, V11, V12, V13, V14, V15, V16, V17, V18, V19, V20, V21, V22, V23, V24, V25, V26, V27, V28, V29, V30, V31, W0, W1, W2, W3, W4, W5, W6, W7, W8, W9, W10, W11, W12, W13, W14, W15, Q0, Q1, Q2, Q3]; } def PositiveHalfWord : PatLeaf<(i32 IntRegs:$a), [{ return isPositiveHalfWord(N); }]>;