schedule_tree_matcher.h

Go to the documentation of this file.

#pragma once

#include <tuple>
#include <utility>
#include <vector>

#include "tc/core/polyhedral/schedule_tree.h"
#include "tc/core/polyhedral/scop.h"

namespace tc {
namespace polyhedral {

// Return the union of the reduction init statements as well as
// the identifiers of all reduction update statements
// that appear in "domain", assuming "domain" only contains
// reduction init and update statements.
// If "domain" contains any other statements, then return an empty vector
// of identifiers.
std::pair<isl::union_set, std::vector<isl::id>> reductionInitsUpdates(
    isl::union_set domain,
    const Scop& scop);

// Find the first band member that corresponds to a reduction.
// TODO: heuristic to choose the "best" band member in presence of multiple
// reductions.
int findFirstReductionDim(isl::multi_union_pw_aff islMupa, const Scop& scop);

} // namespace polyhedral
} // namespace tc

#include "tc/core/polyhedral/schedule_tree_matcher-inl.h"