@@ -1549,7 +1549,7 @@ void MachineVerifier::verifyPreISelGenericInstruction(const MachineInstr *MI) {
1549
1549
report (" G_BUILD_VECTOR result element type must match source type" , MI);
1550
1550
1551
1551
if (DstTy.getNumElements () != MI->getNumOperands () - 1 )
1552
- report (" G_BUILD_VECTOR must have an operand for each elemement " , MI);
1552
+ report (" G_BUILD_VECTOR must have an operand for each element " , MI);
1553
1553
1554
1554
for (const MachineOperand &MO : llvm::drop_begin (MI->operands (), 2 ))
1555
1555
if (MRI->getType (MI->getOperand (1 ).getReg ()) != MRI->getType (MO.getReg ()))
@@ -2398,11 +2398,11 @@ void MachineVerifier::visitMachineInstrBefore(const MachineInstr *MI) {
2398
2398
2399
2399
// The next two checks allow COPY between physical and virtual registers,
2400
2400
// when the virtual register has a scalable size and the physical register
2401
- // has a fixed size. These checks allow COPY between *potentialy* mismatched
2402
- // sizes. However, once RegisterBankSelection occurs, MachineVerifier should
2403
- // be able to resolve a fixed size for the scalable vector, and at that
2404
- // point this function will know for sure whether the sizes are mismatched
2405
- // and correctly report a size mismatch.
2401
+ // has a fixed size. These checks allow COPY between *potentially*
2402
+ // mismatched sizes. However, once RegisterBankSelection occurs,
2403
+ // MachineVerifier should be able to resolve a fixed size for the scalable
2404
+ // vector, and at that point this function will know for sure whether the
2405
+ // sizes are mismatched and correctly report a size mismatch.
2406
2406
if (SrcReg.isPhysical () && DstReg.isVirtual () && DstSize.isScalable () &&
2407
2407
!SrcSize.isScalable ())
2408
2408
break ;
@@ -3213,13 +3213,13 @@ struct VRegFilter {
3213
3213
3214
3214
private:
3215
3215
static constexpr unsigned SparseUniverseMax = 10 * 1024 * 8 ;
3216
- // VRegs indexed within SparseUniverseMax are tracked by Sparse, those beyound
3217
- // are tracked by Dense. The only purpose of the threashold and the Dense set
3216
+ // VRegs indexed within SparseUniverseMax are tracked by Sparse, those beyond
3217
+ // are tracked by Dense. The only purpose of the threshold and the Dense set
3218
3218
// is to have a reasonably growing memory usage in pathological cases (large
3219
3219
// number of very sparse VRegFilter instances live at the same time). In
3220
3220
// practice even in the worst-by-execution time cases having all elements
3221
3221
// tracked by Sparse (very large SparseUniverseMax scenario) tends to be more
3222
- // space efficient than if tracked by Dense. The threashold is set to keep the
3222
+ // space efficient than if tracked by Dense. The threshold is set to keep the
3223
3223
// worst-case memory usage within 2x of figures determined empirically for
3224
3224
// "all Dense" scenario in such worst-by-execution-time cases.
3225
3225
BitVector Sparse;
@@ -3459,7 +3459,7 @@ void MachineVerifier::visitMachineFunctionAfter() {
3459
3459
3460
3460
// Check live-in list of each MBB. If a register is live into MBB, check
3461
3461
// that the register is in regsLiveOut of each predecessor block. Since
3462
- // this must come from a definition in the predecesssor or its live-in
3462
+ // this must come from a definition in the predecessor or its live-in
3463
3463
// list, this will catch a live-through case where the predecessor does not
3464
3464
// have the register in its live-in list. This currently only checks
3465
3465
// registers that have no aliases, are not allocatable and are not
0 commit comments