tc/core/polyhedral/schedule_isl_conversion.cc
/*
 * Construct an isl::schedule from "root".
 * Start with the root node itself, which is assumed to be a domain node, and
 * then recursively add nodes corresponding to the descendants of "root".
 */
Construct an isl::schedule from "root".
Start with the root node itself, which is assumed to be a domain node, and
then recursively add nodes corresponding to the descendants of "root".
Construct an isl :: schedule from " root " . Start with the root node itself which is assumed to be a domain node and then recursively add nodes corresponding to the descendants of " root " .
isl::schedule toIslSchedule(const ScheduleTree* root) {
  checkValidIslSchedule(root);
  auto domain = root->elemAs<ScheduleTreeElemDomain>();
  CHECK(domain) << "Root node should be domain node" << *root;
  auto node = isl::schedule_node::from_domain(domain->domain_);
  node = extendChild(node, root);
  return node.get_schedule();
}
isl :: schedule toIslSchedule ( const ScheduleTree * root ) { checkValidIslSchedule ( root ) ; auto domain = root -> elemAs < ScheduleTreeElemDomain > ( ) ; CHECK ( domain ) << " " << * root ; auto node = isl :: schedule_node :: from_domain ( domain -> domain_ ) ; node = extendChild ( node , root ) ; return node . get_schedule ( ) ; }
Construct an isl::schedule from "root".
Construct an isl :: schedule from " root " .