Merge pull request #304 from facebookresearch/pr/typo

fix typos in comments

Author: skimo-openhub

tc/core/polyhedral/cuda/mapped_scop.cc

@@ -176,7 +176,7 @@ void fixThreadsBelowFilter(
 
   for (size_t i = begin; i < end; ++i) {
     if (mapping::ThreadId::makeId(i) == mapping::ThreadId::x()) {
-      // Mapping happend below filterTree, so we need points active for its
+      // Mapping happened below filterTree, so we need points active for its
       // children.  After insertion, filterTree is guaranteed to have at least
       // one child.
       mscop.threadIdxXScheduleDepthState.emplace_back(std::make_pair(

tc/core/polyhedral/cuda/memory_promotion_heuristic.cc

@@ -318,7 +318,7 @@ bool isCoalesced(
  * are mapped to threads (the innermost of them being mapped to thread x) and
  * the depth of this mapping can be obtained from threadIdxXScheduleDepthState.
  *
- * In parciular, the group's footprint must contain only one element and the
+ * In particular, the group's footprint must contain only one element and the
  * same tensor element should never be accessed by two different threads.
  */
 bool isPromotableToRegisterBelowThreads(
@@ -350,15 +350,15 @@ bool isPromotableToRegisterBelowThreads(
   auto scheduledAccesses = originalAccesses.apply_domain(schedule);
 
   // Scheduled accesses contain maps from schedule dimensions to tensor
-  // subscripts.  Compute the relation that between the schedule dimensions
+  // subscripts.  Compute the relation between the schedule dimensions
   // mapped to threads and tensor subscripts by first removing dimensions
   // following the one mapped to thread x (last one assuming inverse mapping
   // order), then by equating all dimensions not mapped to threads to
   // parameters.  Promotion to registers is only allowed if the resulting
   // relation is injective, i.e. the same tensor element is never accessed by
   // more than one thread.  Note that our current check is overly conservative
   // because different values of schedule dimension may get mapped to the same
-  // thread, in which case the could access the same tensor element.
+  // thread, in which case they could access the same tensor element.
   for (auto sa : isl::UnionAsVector<isl::union_map>(scheduledAccesses)) {
     sa = sa.project_out(
         isl::dim_type::in, depth, sa.dim(isl::dim_type::in) - depth);

tc/core/polyhedral/memory_promotion.cc

@@ -372,7 +372,7 @@ isl::multi_aff TensorReferenceGroup::promotion() const {
   isl::map map = scopedAccesses();
   auto accessSpace = map.get_space();
 
-  // lower bounsd space is S -> O; which we transform into [S -> O] -> P
+  // lower bounds space is S -> P; which we transform into [S -> O] -> P
   auto lowerBounds = approximation.lowerBounds().pullback(
       isl::multi_aff::domain_map(accessSpace));
   auto promotion = isl::multi_aff::range_map(accessSpace)

tc/core/polyhedral/schedule_transforms.h

@@ -64,8 +64,8 @@ detail::ScheduleTree* joinBandsIterative(
     detail::ScheduleTree* tree,
     bool permutable = false);
 
-// Split tree rooted under relativeRoot two nested trees, one with the first
-// "pos" dimensions and one with the remaining dimensions.
+// Split tree rooted under relativeRoot into two nested trees,
+// one with the first "pos" dimensions and one with the remaining dimensions.
 // The schedules of the two bands live in anonymous spaces.
 // This updates the current ScheduleTree and returns it so we can chain
 // expressions.

test/test_cuda_mapper_memory_promotion.cc

@@ -427,7 +427,7 @@ TEST_F(MapperMemoryPromotionRAW, fitAtOuterDepths) {
       << "expected one reference group to be promoted";
 
   // Note that due to bank conflict heuristic, we will allocate 32x33 arrays in
-  // shraed memory which require 32x33x2x4=8448 bytes.
+  // shared memory which require 32x33x2x4=8448 bytes.
   auto mscop3 = makeWithSharedGreedy(42, 40, 32, 32, 2, 8448);
   EXPECT_EQ(mscop3->scop().promotedDecls().size(), 2)
       << "expected two reference groups to fit";