Merge pull request #450 from facebookresearch/pr/typo

fix typos

Author: ftynse

tc/core/halide2isl.cc

@@ -153,7 +153,7 @@ inline std::vector<isl::aff> combineSingleAffs(
  * upper bounds
  *   x < min(a,b) <=> x < a AND x < b.
  * Arguments "allowMin" and "allowMax" control whether Min and Max operations,
- * respecitvely, are allowed to be present in the expression. Note that they
+ * respectively, are allowed to be present in the expression. Note that they
  * can only appear before any other operation and cannot appear together in an
  * expression.
  * If a Halide expression cannot be converted into a list of affine expressions,

tc/core/polyhedral/cuda/mapped_scop.cc

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

tc/core/polyhedral/cuda/mapped_scop.h

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

tc/core/polyhedral/memory_promotion.cc

@@ -108,8 +108,8 @@ isl::space add_range(isl::space space, unsigned dim) {
 
 } // namespace
 
-// Access has the shape :: [D -> ref] -> O
-// Extract the reference ID, store it separatly and simplify the access.
+// Access has the shape :: [S -> ref] -> O
+// Extract the reference ID, store it separately and simplify the access.
 std::unique_ptr<TensorReferenceGroup> TensorReferenceGroup::makeSingleton(
     isl::map originalAccess,
     isl::map scopedAccess,

tc/core/polyhedral/schedule_transforms.h

@@ -113,7 +113,7 @@ detail::ScheduleTree* bandScale(
     detail::ScheduleTree* tree,
     const std::vector<size_t>& scales);
 
-// Update the top-level conext node by intersecting it with "context".  The
+// Update the top-level context node by intersecting it with "context".  The
 // top-level context node must be located directly under the root of the tree.
 // If there is no such node, insert one with universe context first.
 void updateTopLevelContext(detail::ScheduleTree* root, isl::set context);