inline extractDomainToIds

Author: Sven Verdoolaege

tc/core/polyhedral/schedule_utils-inl.h

@@ -0,0 +1,73 @@
+/**
+ * Copyright (c) 2017-2018, Facebook, Inc.
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *     http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+#pragma once
+
+#include "tc/core/check.h"
+
+namespace tc {
+namespace polyhedral {
+
+/*
+ * Extract a mapping from the domain elements active at "tree"
+ * to identifiers "ids", where all branches in "tree"
+ * are assumed to have been mapped to these identifiers.
+ * The result lives in a space of the form "tupleId"["ids"...].
+ */
+inline isl::multi_union_pw_aff extractDomainToIds(
+    const detail::ScheduleTree* root,
+    const detail::ScheduleTree* tree,
+    const std::vector<mapping::MappingId>& ids,
+    isl::id tupleId) {
+  using namespace polyhedral::detail;
+
+  auto space = isl::space(tree->ctx_, 0);
+  auto empty = isl::union_set::empty(space);
+  space = space.add_named_tuple_id_ui(tupleId, ids.size());
+  auto zero = isl::multi_val::zero(space);
+  auto domainToIds = isl::multi_union_pw_aff(empty, zero);
+
+  for (auto mapping : tree->collect(tree, ScheduleTreeType::Mapping)) {
+    auto mappingNode = mapping->as<ScheduleTreeMapping>();
+    auto list = isl::union_pw_aff_list(tree->ctx_, ids.size());
+    for (auto id : ids) {
+      if (mappingNode->mapping.count(id) == 0) {
+        break;
+      }
+      auto idMap = mappingNode->mapping.at(id);
+      list = list.add(idMap);
+    }
+    // Ignore this node if it does not map to all required ids.
+    if (static_cast<size_t>(list.size()) != ids.size()) {
+      continue;
+    }
+    auto nodeToIds = isl::multi_union_pw_aff(space, list);
+    auto active = activeDomainPoints(root, mapping);
+    TC_CHECK(active.intersect(domainToIds.domain()).is_empty())
+        << "conflicting mappings; are the filters in the tree disjoint?";
+    nodeToIds = nodeToIds.intersect_domain(active);
+    domainToIds = domainToIds.union_add(nodeToIds);
+  }
+
+  auto active = activeDomainPoints(root, tree);
+  TC_CHECK(active.is_subset(domainToIds.domain()))
+      << "not all domain points of\n"
+      << active << "\nwere mapped to the required ids";
+
+  return domainToIds;
+}
+
+} // namespace polyhedral
+} // namespace tc

tc/core/polyhedral/schedule_utils.cc

@@ -265,54 +265,5 @@ isl::multi_union_pw_aff partialScheduleMupa(
   return band ? prefix.flat_range_product(band->mupa_) : prefix;
 }
 
-/*
- * Extract a mapping from the domain elements active at "tree"
- * to identifiers "ids", where all branches in "tree"
- * are assumed to have been mapped to these identifiers.
- * The result lives in a space of the form "tupleId"["ids"...].
- */
-isl::multi_union_pw_aff extractDomainToIds(
-    const detail::ScheduleTree* root,
-    const detail::ScheduleTree* tree,
-    const std::vector<mapping::MappingId>& ids,
-    isl::id tupleId) {
-  using namespace polyhedral::detail;
-
-  auto space = isl::space(tree->ctx_, 0);
-  auto empty = isl::union_set::empty(space);
-  space = space.add_named_tuple_id_ui(tupleId, ids.size());
-  auto zero = isl::multi_val::zero(space);
-  auto domainToIds = isl::multi_union_pw_aff(empty, zero);
-
-  for (auto mapping : tree->collect(tree, ScheduleTreeType::Mapping)) {
-    auto mappingNode = mapping->as<ScheduleTreeMapping>();
-    auto list = isl::union_pw_aff_list(tree->ctx_, ids.size());
-    for (auto id : ids) {
-      if (mappingNode->mapping.count(id) == 0) {
-        break;
-      }
-      auto idMap = mappingNode->mapping.at(id);
-      list = list.add(idMap);
-    }
-    // Ignore this node if it does not map to all required ids.
-    if (static_cast<size_t>(list.size()) != ids.size()) {
-      continue;
-    }
-    auto nodeToIds = isl::multi_union_pw_aff(space, list);
-    auto active = activeDomainPoints(root, mapping);
-    TC_CHECK(active.intersect(domainToIds.domain()).is_empty())
-        << "conflicting mappings; are the filters in the tree disjoint?";
-    nodeToIds = nodeToIds.intersect_domain(active);
-    domainToIds = domainToIds.union_add(nodeToIds);
-  }
-
-  auto active = activeDomainPoints(root, tree);
-  TC_CHECK(active.is_subset(domainToIds.domain()))
-      << "not all domain points of\n"
-      << active << "\nwere mapped to the required ids";
-
-  return domainToIds;
-}
-
 } // namespace polyhedral
 } // namespace tc

tc/core/polyhedral/schedule_utils.h

@@ -140,3 +140,5 @@ bool isMappingTo(const detail::ScheduleTree* tree) {
 
 } // namespace polyhedral
 } // namespace tc
+
+#include "tc/core/polyhedral/schedule_utils-inl.h"