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

Commit 34542a5

Browse files
authored
Merge pull request #450 from facebookresearch/pr/typo
fix typos
2 parents 7a45810 + 4afd8b0 commit 34542a5

File tree

5 files changed

+10
-10
lines changed

5 files changed

+10
-10
lines changed

tc/core/halide2isl.cc

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -153,7 +153,7 @@ inline std::vector<isl::aff> combineSingleAffs(
153153
* upper bounds
154154
* x < min(a,b) <=> x < a AND x < b.
155155
* Arguments "allowMin" and "allowMax" control whether Min and Max operations,
156-
* respecitvely, are allowed to be present in the expression. Note that they
156+
* respectively, are allowed to be present in the expression. Note that they
157157
* can only appear before any other operation and cannot appear together in an
158158
* expression.
159159
* If a Halide expression cannot be converted into a list of affine expressions,

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.

tc/core/polyhedral/cuda/mapped_scop.h

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -161,7 +161,7 @@ class MappedScop {
161161

162162
// Find best thread sync between st1 and st2 when st2 is scheduled after
163163
// st1.
164-
// This function should assumes that it is called before block mapping
164+
// This function assumes that it is called before block mapping
165165
// and that st1 and st2 are already mapped to threads.
166166
Scop::SyncLevel findBestSync(
167167
detail::ScheduleTree* st1,
@@ -172,7 +172,7 @@ class MappedScop {
172172
// the number of __syncthreads, and then the number of __syncwarp
173173
// bestSync[i][k] == l means that there must be a synchronization at level at
174174
// least l between child i and child i + k.
175-
// if i + k > nChildren, this means that it correspond to synchronizations
175+
// if i + k > nChildren, this means that it corresponds to synchronizations
176176
// between child i and child (i + k) % nChildren at two different iteration
177177
// of the outer sequential member if hasOuterSequentialMember is true.
178178
// However, these cells should still exist if hasOuterSequentialMember is

tc/core/polyhedral/memory_promotion.cc

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -108,8 +108,8 @@ isl::space add_range(isl::space space, unsigned dim) {
108108

109109
} // namespace
110110

111-
// Access has the shape :: [D -> ref] -> O
112-
// Extract the reference ID, store it separatly and simplify the access.
111+
// Access has the shape :: [S -> ref] -> O
112+
// Extract the reference ID, store it separately and simplify the access.
113113
std::unique_ptr<TensorReferenceGroup> TensorReferenceGroup::makeSingleton(
114114
isl::map originalAccess,
115115
isl::map scopedAccess,

tc/core/polyhedral/schedule_transforms.h

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -113,7 +113,7 @@ detail::ScheduleTree* bandScale(
113113
detail::ScheduleTree* tree,
114114
const std::vector<size_t>& scales);
115115

116-
// Update the top-level conext node by intersecting it with "context". The
116+
// Update the top-level context node by intersecting it with "context". The
117117
// top-level context node must be located directly under the root of the tree.
118118
// If there is no such node, insert one with universe context first.
119119
void updateTopLevelContext(detail::ScheduleTree* root, isl::set context);

0 commit comments

Comments
 (0)