@@ -595,10 +595,10 @@ std::vector<std::pair<int, int>> MappedScop::findBestSyncConfigInSeq(
595
595
bool hasOuterSequentialMember) {
596
596
// Get the least strict synchronization level that is needed in the sequence
597
597
// children[i], ..., children[i+k] to be correct and optimal. If the level
598
- // is l, this mean that a synchronization of level l have to be inserted
598
+ // is l, this mean that a synchronization of level l has to be inserted
599
599
// in this sequence to be correct, and that no synchronizations of level
600
600
// greater than l is needed.
601
- // if i + k is greater than nChildren, it represent the child
601
+ // if i + k is greater than nChildren, it represents the child
602
602
// (i + k) % nChildren at the next iteration of the outer sequential member if
603
603
// it exists.
604
604
std::vector<std::vector<int >> bestSyncInRange (
@@ -633,8 +633,8 @@ std::vector<std::pair<int, int>> MappedScop::findBestSyncConfigInSeq(
633
633
634
634
// The dynamic programming algorithm to compute the optimal synchronizations
635
635
// To compute the optimal synchronizations for the sequence
636
- // children[i] ... children[i + k]
637
- // It split the sequence into children[i], ..., children[i + s] and
636
+ // children[i] ... children[i + k],
637
+ // it splits the sequence into children[i], ..., children[i + s] and
638
638
// children[i + s + 1], ..., children[i + k] for all possible s, and
639
639
// insert between children[i + s] and children[i + s + 1] the least
640
640
// strict synchronization needed.
0 commit comments