@@ -46,7 +46,7 @@ using namespace mlir;
46
46
// / Control flow can create situations where a load could be replaced by
47
47
// / multiple possible stores depending on the control flow path taken. As a
48
48
// / result, this pass must introduce new block arguments in some blocks to
49
- // / accomodate for the multiple possible definitions. Each predecessor will
49
+ // / accommodate for the multiple possible definitions. Each predecessor will
50
50
// / populate the block argument with the definition reached at its end. With
51
51
// / this, the value stored can be well defined at block boundaries, allowing
52
52
// / the propagation of replacement through blocks.
@@ -109,7 +109,7 @@ struct MemorySlotPromotionInfo {
109
109
// / This is a DAG structure because if an operation must eliminate some of
110
110
// / its uses, it is because the defining ops of the blocking uses requested
111
111
// / it. The defining ops therefore must also have blocking uses or be the
112
- // / starting point of the bloccking uses.
112
+ // / starting point of the blocking uses.
113
113
BlockingUsesMap userToBlockingUses;
114
114
};
115
115
@@ -414,7 +414,7 @@ MemorySlotPromotionAnalyzer::computeInfo() {
414
414
415
415
// Then, compute blocks in which two or more definitions of the allocated
416
416
// variable may conflict. These blocks will need a new block argument to
417
- // accomodate this.
417
+ // accommodate this.
418
418
computeMergePoints (info.mergePoints );
419
419
420
420
// The slot can be promoted if the block arguments to be created can
0 commit comments