@@ -65,7 +65,7 @@ CIRGenFunction::emitOpenACCLoopConstruct(const OpenACCLoopConstruct &s) {
6565 //
6666 // HOWEVER: What ACC dialect REALLY cares about is the tripcount, which you
6767 // cannot get (in the case of `RandomAccessIterator`) from JUST 'upperbound'
68- // and 'lowerbound'. We will likely have to provide a 'recipe' equivilent to
68+ // and 'lowerbound'. We will likely have to provide a 'recipe' equivalent to
6969 // `std::distance` instead. In the case of integer/pointers, it is fairly
7070 // simple to find: it is just the mathematical subtraction. Howver, in the
7171 // case of `RandomAccessIterator`, we have to enable the use of `operator-`.
@@ -74,11 +74,11 @@ CIRGenFunction::emitOpenACCLoopConstruct(const OpenACCLoopConstruct &s) {
7474 // that loops through, like we would for a forward/etc iterator.
7575 //
7676 // 'step': Sema is currently allowing builtin ++,--, +=, -=, *=, /=, and =
77- // operators. Additionally, it allows the equivilent for the operator-call, as
77+ // operators. Additionally, it allows the equivalent for the operator-call, as
7878 // well as member-call.
7979 //
8080 // For builtin operators, we perhaps should refine the assignment here. It
81- // doesn't reallly help us know the 'step' count at all, but we could perhaps
81+ // doesn't really help us know the 'step' count at all, but we could perhaps
8282 // do one more step of analysis in Sema to allow something like Var = Var + 1.
8383 // For the others, this should get us the step reasonably well.
8484 //
0 commit comments