Skip to content
This repository was archived by the owner on Apr 28, 2023. It is now read-only.

Commit 8fad4a6

Browse files
author
Sven Verdoolaege
committed
mapped_scop.cc: fix typos in comments
1 parent 8165489 commit 8fad4a6

File tree

1 file changed

+4
-4
lines changed

1 file changed

+4
-4
lines changed

tc/core/polyhedral/cuda/mapped_scop.cc

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -595,10 +595,10 @@ std::vector<std::pair<int, int>> MappedScop::findBestSyncConfigInSeq(
595595
bool hasOuterSequentialMember) {
596596
// Get the least strict synchronization level that is needed in the sequence
597597
// 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
599599
// in this sequence to be correct, and that no synchronizations of level
600600
// 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
602602
// (i + k) % nChildren at the next iteration of the outer sequential member if
603603
// it exists.
604604
std::vector<std::vector<int>> bestSyncInRange(
@@ -633,8 +633,8 @@ std::vector<std::pair<int, int>> MappedScop::findBestSyncConfigInSeq(
633633

634634
// The dynamic programming algorithm to compute the optimal synchronizations
635635
// 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
638638
// children[i + s + 1], ..., children[i + k] for all possible s, and
639639
// insert between children[i + s] and children[i + s + 1] the least
640640
// strict synchronization needed.

0 commit comments

Comments
 (0)