void populate_environment(Function f, map<string, Function> &env, bool recursive = true) {
map<string, Function>::const_iterator iter = env.find(f.name());
if (iter != env.end()) {
assert(iter->second.same_as(f) &&
"Can't compile a pipeline using multiple functions with same name");
return;
}
FindCalls calls;
for (size_t i = 0; i < f.values().size(); i++) {
f.values()[i].accept(&calls);
}
// Consider reductions
for (size_t j = 0; j < f.reductions().size(); j++) {
ReductionDefinition r = f.reductions()[j];
for (size_t i = 0; i < r.values.size(); i++) {
r.values[i].accept(&calls);
}
for (size_t i = 0; i < r.args.size(); i++) {
r.args[i].accept(&calls);
}
ReductionDomain d = r.domain;
if (r.domain.defined()) {
for (size_t i = 0; i < d.domain().size(); i++) {
d.domain()[i].min.accept(&calls);
d.domain()[i].extent.accept(&calls);
}
}
}
// Consider extern calls
if (f.has_extern_definition()) {
for (size_t i = 0; i < f.extern_arguments().size(); i++) {
ExternFuncArgument arg = f.extern_arguments()[i];
if (arg.is_func()) {
Function g(arg.func);
calls.calls[g.name()] = g;
}
}
}
if (!recursive) {
env.insert(calls.calls.begin(), calls.calls.end());
} else {
env[f.name()] = f;
for (map<string, Function>::const_iterator iter = calls.calls.begin();
iter != calls.calls.end(); ++iter) {
populate_environment(iter->second, env);
}
}
}
Definition::Definition(const std::vector<Expr> &args, const std::vector<Expr> &values,
const ReductionDomain &rdom, bool is_init)
: contents(new DefinitionContents) {
contents->is_init = is_init;
contents->values = values;
contents->args = args;
if (rdom.defined()) {
contents->predicate = rdom.predicate();
for (size_t i = 0; i < rdom.domain().size(); i++) {
contents->stage_schedule.rvars().push_back(rdom.domain()[i]);
}
}
}
void visit(const Variable *var) {
// Is it a parameter?
if (var->param.defined()) return;
// Was it defined internally by a let expression?
if (defined_internally.contains(var->name)) return;
// Is it a pure argument?
for (size_t i = 0; i < pure_args.size(); i++) {
if (var->name == pure_args[i]) return;
}
// Is it in a reduction domain?
if (var->reduction_domain.defined()) {
if (!reduction_domain.defined()) {
reduction_domain = var->reduction_domain;
return;
} else if (var->reduction_domain.same_as(reduction_domain)) {
// It's in a reduction domain we already know about
return;
} else {
assertf(false, "Multiple reduction domains found in function definition", name);
}
}
std::cerr << "Undefined variable in function definition: " << var->name
<< " (Func: " << name << ")"
<< std::endl;
assert(false);
}
void visit(const Variable *var) {
// Is it a parameter?
if (var->param.defined()) return;
// Was it defined internally by a let expression?
if (defined_internally.contains(var->name)) return;
// Is it a pure argument?
for (size_t i = 0; i < pure_args.size(); i++) {
if (var->name == pure_args[i]) return;
}
// Is it in a reduction domain?
if (var->reduction_domain.defined()) {
if (!reduction_domain.defined()) {
reduction_domain = var->reduction_domain;
return;
} else if (var->reduction_domain.same_as(reduction_domain)) {
// It's in a reduction domain we already know about
return;
} else {
user_error << "Multiple reduction domains found in definition of Func \"" << name << "\"\n";
}
}
user_error << "Undefined variable \"" << var->name << "\" in definition of Func \"" << name << "\"\n";
}
RDom::RDom(ReductionDomain d) : dom(d) {
if (d.defined()) {
init_vars("");
}
}
