diff --git a/llvm/lib/Bitcode/Writer/BitcodeWriter.cpp b/llvm/lib/Bitcode/Writer/BitcodeWriter.cpp index b6cfd46c5d533..6f3ff32279f17 100644 --- a/llvm/lib/Bitcode/Writer/BitcodeWriter.cpp +++ b/llvm/lib/Bitcode/Writer/BitcodeWriter.cpp @@ -4192,7 +4192,7 @@ static void writeIdentificationBlock(BitstreamWriter &Stream) { Abbv->Add(BitCodeAbbrevOp(bitc::IDENTIFICATION_CODE_EPOCH)); Abbv->Add(BitCodeAbbrevOp(BitCodeAbbrevOp::VBR, 6)); auto EpochAbbrev = Stream.EmitAbbrev(std::move(Abbv)); - constexpr std::array Vals = {bitc::BITCODE_CURRENT_EPOCH}; + constexpr std::array Vals = {{bitc::BITCODE_CURRENT_EPOCH}}; Stream.EmitRecord(bitc::IDENTIFICATION_CODE_EPOCH, Vals, EpochAbbrev); Stream.ExitBlock(); } diff --git a/llvm/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp b/llvm/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp index eb4215b490751..862b11c54a766 100644 --- a/llvm/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp +++ b/llvm/lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp @@ -3298,7 +3298,7 @@ SDValue DAGTypeLegalizer::WidenVecRes_Convert_StrictFP(SDNode *N) { // Otherwise unroll into some nasty scalar code and rebuild the vector. EVT EltVT = WidenVT.getVectorElementType(); - std::array EltVTs = {EltVT, MVT::Other}; + std::array EltVTs = {{EltVT, MVT::Other}}; SmallVector Ops(WidenNumElts, DAG.getUNDEF(EltVT)); SmallVector OpChains; // Use the original element count so we don't do more scalar opts than diff --git a/llvm/lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp b/llvm/lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp index 361c3388276a5..49bc133545eed 100644 --- a/llvm/lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp +++ b/llvm/lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp @@ -2201,29 +2201,29 @@ void HexagonDAGToDAGISel::SelectHVXDualOutput(SDNode *N) { SDNode *Result; switch (IID) { case Intrinsic::hexagon_V6_vaddcarry: { - std::array Ops = {N->getOperand(1), N->getOperand(2), - N->getOperand(3)}; + std::array Ops = { + {N->getOperand(1), N->getOperand(2), N->getOperand(3)}}; SDVTList VTs = CurDAG->getVTList(MVT::v16i32, MVT::v512i1); Result = CurDAG->getMachineNode(Hexagon::V6_vaddcarry, SDLoc(N), VTs, Ops); break; } case Intrinsic::hexagon_V6_vaddcarry_128B: { - std::array Ops = {N->getOperand(1), N->getOperand(2), - N->getOperand(3)}; + std::array Ops = { + {N->getOperand(1), N->getOperand(2), N->getOperand(3)}}; SDVTList VTs = CurDAG->getVTList(MVT::v32i32, MVT::v1024i1); Result = CurDAG->getMachineNode(Hexagon::V6_vaddcarry, SDLoc(N), VTs, Ops); break; } case Intrinsic::hexagon_V6_vsubcarry: { - std::array Ops = {N->getOperand(1), N->getOperand(2), - N->getOperand(3)}; + std::array Ops = { + {N->getOperand(1), N->getOperand(2), N->getOperand(3)}}; SDVTList VTs = CurDAG->getVTList(MVT::v16i32, MVT::v512i1); Result = CurDAG->getMachineNode(Hexagon::V6_vsubcarry, SDLoc(N), VTs, Ops); break; } case Intrinsic::hexagon_V6_vsubcarry_128B: { - std::array Ops = {N->getOperand(1), N->getOperand(2), - N->getOperand(3)}; + std::array Ops = { + {N->getOperand(1), N->getOperand(2), N->getOperand(3)}}; SDVTList VTs = CurDAG->getVTList(MVT::v32i32, MVT::v1024i1); Result = CurDAG->getMachineNode(Hexagon::V6_vsubcarry, SDLoc(N), VTs, Ops); break; diff --git a/llvm/lib/Target/Mips/MicroMipsSizeReduction.cpp b/llvm/lib/Target/Mips/MicroMipsSizeReduction.cpp index d486722184806..55d3c59cbf034 100644 --- a/llvm/lib/Target/Mips/MicroMipsSizeReduction.cpp +++ b/llvm/lib/Target/Mips/MicroMipsSizeReduction.cpp @@ -377,11 +377,11 @@ static bool CheckXWPInstr(MachineInstr *MI, bool ReduceToLwp, // Returns true if the registers Reg1 and Reg2 are consecutive static bool ConsecutiveRegisters(unsigned Reg1, unsigned Reg2) { constexpr std::array Registers = { - Mips::AT, Mips::V0, Mips::V1, Mips::A0, Mips::A1, Mips::A2, Mips::A3, - Mips::T0, Mips::T1, Mips::T2, Mips::T3, Mips::T4, Mips::T5, Mips::T6, - Mips::T7, Mips::S0, Mips::S1, Mips::S2, Mips::S3, Mips::S4, Mips::S5, - Mips::S6, Mips::S7, Mips::T8, Mips::T9, Mips::K0, Mips::K1, Mips::GP, - Mips::SP, Mips::FP, Mips::RA}; + {Mips::AT, Mips::V0, Mips::V1, Mips::A0, Mips::A1, Mips::A2, Mips::A3, + Mips::T0, Mips::T1, Mips::T2, Mips::T3, Mips::T4, Mips::T5, Mips::T6, + Mips::T7, Mips::S0, Mips::S1, Mips::S2, Mips::S3, Mips::S4, Mips::S5, + Mips::S6, Mips::S7, Mips::T8, Mips::T9, Mips::K0, Mips::K1, Mips::GP, + Mips::SP, Mips::FP, Mips::RA}}; for (uint8_t i = 0; i < Registers.size() - 1; i++) { if (Registers[i] == Reg1) { diff --git a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp index 1015c0b16a1ef..7ca7c1d4bdbe0 100644 --- a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp +++ b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp @@ -867,7 +867,7 @@ class BoUpSLP { int getExternalUsesCost(const std::pair &LHS, const std::pair &RHS) { int Cost = 0; - std::array, 2> Values = {LHS, RHS}; + std::array, 2> Values = {{LHS, RHS}}; for (int Idx = 0, IdxE = Values.size(); Idx != IdxE; ++Idx) { Value *V = Values[Idx].first; // Calculate the absolute lane, using the minimum relative lane of LHS