forked from OSchip/llvm-project
[NFC] Silence compiler warning [-Wmissing-braces].
This commit is contained in:
parent
dd4766451e
commit
8ee0e1dc02
|
@ -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<unsigned, 1> Vals = {bitc::BITCODE_CURRENT_EPOCH};
|
||||
constexpr std::array<unsigned, 1> Vals = {{bitc::BITCODE_CURRENT_EPOCH}};
|
||||
Stream.EmitRecord(bitc::IDENTIFICATION_CODE_EPOCH, Vals, EpochAbbrev);
|
||||
Stream.ExitBlock();
|
||||
}
|
||||
|
|
|
@ -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<EVT, 2> EltVTs = {EltVT, MVT::Other};
|
||||
std::array<EVT, 2> EltVTs = {{EltVT, MVT::Other}};
|
||||
SmallVector<SDValue, 16> Ops(WidenNumElts, DAG.getUNDEF(EltVT));
|
||||
SmallVector<SDValue, 32> OpChains;
|
||||
// Use the original element count so we don't do more scalar opts than
|
||||
|
|
|
@ -2201,29 +2201,29 @@ void HexagonDAGToDAGISel::SelectHVXDualOutput(SDNode *N) {
|
|||
SDNode *Result;
|
||||
switch (IID) {
|
||||
case Intrinsic::hexagon_V6_vaddcarry: {
|
||||
std::array<SDValue, 3> Ops = {N->getOperand(1), N->getOperand(2),
|
||||
N->getOperand(3)};
|
||||
std::array<SDValue, 3> 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<SDValue, 3> Ops = {N->getOperand(1), N->getOperand(2),
|
||||
N->getOperand(3)};
|
||||
std::array<SDValue, 3> 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<SDValue, 3> Ops = {N->getOperand(1), N->getOperand(2),
|
||||
N->getOperand(3)};
|
||||
std::array<SDValue, 3> 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<SDValue, 3> Ops = {N->getOperand(1), N->getOperand(2),
|
||||
N->getOperand(3)};
|
||||
std::array<SDValue, 3> 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;
|
||||
|
|
|
@ -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<unsigned, 31> 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) {
|
||||
|
|
|
@ -867,7 +867,7 @@ public:
|
|||
int getExternalUsesCost(const std::pair<Value *, int> &LHS,
|
||||
const std::pair<Value *, int> &RHS) {
|
||||
int Cost = 0;
|
||||
std::array<std::pair<Value *, int>, 2> Values = {LHS, RHS};
|
||||
std::array<std::pair<Value *, int>, 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
|
||||
|
|
Loading…
Reference in New Issue