halide2isl.h

Go to the documentation of this file.

#pragma once

#include <iostream>
#include <sstream>
#include <string>
#include <unordered_map>

#include <Halide/Halide.h>

#include "tc/core/polyhedral/schedule_tree.h"
#include "tc/core/tc2halide.h"
#include "tc/external/isl.h"

namespace tc {
namespace halide2isl {


struct SymbolTable {
  std::vector<std::string> reductionVars, idxVars;
  std::vector<Halide::Internal::Parameter> params;
};
SymbolTable makeSymbolTable(const tc2halide::HalideComponents& components);

isl::space makeParamSpace(isl::ctx ctx, const SymbolTable& symbolTable);

isl::aff makeIslAffFromInt(isl::space space, int64_t i);

// Make an affine function over a space from a Halide Expr. Returns a
// null isl::aff if the expression is not affine. Fails if Variable
// does not correspond to a parameter or set dimension of the space.
isl::aff makeIslAffFromExpr(isl::space space, const Halide::Expr& e);

typedef std::unordered_map<isl::id, Halide::Internal::Stmt, isl::IslIdIslHash>
    StatementMap;
typedef std::unordered_map<const Halide::Internal::IRNode*, isl::id> AccessMap;
struct ScheduleTreeAndAccesses {
  tc::polyhedral::ScheduleTreeUPtr tree;

  isl::union_map reads, writes;

  AccessMap accesses;

  StatementMap statements;
};

ScheduleTreeAndAccesses makeScheduleTree(
    isl::space paramSpace,
    const Halide::Internal::Stmt& s);

struct Reduction {
  Halide::Internal::Stmt init, update;
  std::vector<size_t> dims;
};
std::vector<Reduction> findReductions(const Halide::Internal::Stmt& s);

} // namespace halide2isl
} // namespace tc