values 428 python_bindings/python/Func.cpp func_class.def("values", &Func::values, p::arg("self"), values 154 python_bindings/python/IROperator.cpp std::vector<h::Expr> values; values 155 python_bindings/python/IROperator.cpp values.reserve(num_values); values 162 python_bindings/python/IROperator.cpp values.push_back(expr_extract()); values 173 python_bindings/python/IROperator.cpp return h::print_when(condition, values); values 78 src/AddImageChecks.cpp for (size_t i = 0; i < f.values().size(); i++) { values 80 src/AddImageChecks.cpp output_buffer.type = f.values()[i].type(); values 83 src/AddImageChecks.cpp if (f.values().size() > 1) { values 1305 src/Bounds.cpp for (size_t i = 0; i < op->values.size(); i++) { values 1306 src/Bounds.cpp op->values[i].accept(this); values 1407 src/Bounds.cpp Interval result = bounds_of_expr_in_scope(def.values()[dim], scope, fb); values 151 src/BoundsInference.cpp vecs[1] = def.values(); values 1003 src/CodeGen_C.cpp vector<string> values; values 1005 src/CodeGen_C.cpp values.push_back(print_expr(op->args[i])); values 1018 src/CodeGen_C.cpp stream << values[i]; values 568 src/CodeGen_OpenGL_Dev.cpp vector<string> values = print_lanes(op->value); values 573 src/CodeGen_OpenGL_Dev.cpp << values[i] << ";\n"; values 20 src/Definition.cpp std::vector<Expr> values, args; values 31 src/Definition.cpp for (Expr val : values) { values 53 src/Definition.cpp for (size_t i = 0; i < values.size(); ++i) { values 54 src/Definition.cpp values[i] = mutator->mutate(values[i]); values 88 src/Definition.cpp Definition::Definition(const std::vector<Expr> &args, const std::vector<Expr> &values, values 92 src/Definition.cpp contents->values = values; values 110 src/Definition.cpp copy.contents->values = contents->values; values 146 src/Definition.cpp return contents->values; values 150 src/Definition.cpp return contents->values; values 188 src/Definition.cpp s.definition.contents->values = contents->values; values 47 src/Definition.h EXPORT Definition(const std::vector<Expr> &args, const std::vector<Expr> &values, values 87 src/Definition.h EXPORT const std::vector<Expr> &values() const; values 88 src/Definition.h EXPORT std::vector<Expr> &values(); values 79 src/Func.cpp return func.values()[0]; values 86 src/Func.cpp return Tuple(func.values()); values 109 src/Func.cpp user_assert(func.update(idx).values().size() == 1) values 111 src/Func.cpp return func.update(idx).values()[0]; values 121 src/Func.cpp return Tuple(func.update(idx).values()); values 405 src/Func.cpp vector<Expr> &values) { values 414 src/Func.cpp substitute_var_in_exprs(res.name, res.value, values); values 426 src/Func.cpp substitute_var_in_exprs(let.first, let.second, values); values 435 src/Func.cpp vector<Expr> &values, map<string, Expr> &dim_extent_alignment) { values 457 src/Func.cpp apply_split_result(bounds_let_stmts, splits_result, predicates, args, values); values 468 src/Func.cpp vector<Expr> &values, map<string, Expr> &dim_extent_alignment) { values 492 src/Func.cpp apply_split_result(bounds_let_stmts, splits_result, predicates, args, values); values 505 src/Func.cpp vector<Expr> &values, map<string, Expr> &dim_extent_alignment) { values 516 src/Func.cpp apply_split_result(bounds_let_stmts, splits_result, predicates, args, values); values 526 src/Func.cpp vector<Expr> &values, map<string, Expr> &dim_extent_alignment) { values 536 src/Func.cpp apply_split_result(bounds_let_stmts, splits_result, predicates, args, values); values 547 src/Func.cpp vector<Expr> &values) { values 562 src/Func.cpp found = apply_split(s, rvars, predicates, args, values, dim_extent_alignment); values 564 src/Func.cpp found = apply_fuse(s, rvars, predicates, args, values, dim_extent_alignment); values 566 src/Func.cpp found = apply_purify(s, rvars, predicates, args, values, dim_extent_alignment); values 568 src/Func.cpp found = apply_rename(s, rvars, predicates, args, values, dim_extent_alignment); values 575 src/Func.cpp substitute_var_in_exprs(let.first, let.second, values); values 598 src/Func.cpp vector<Expr> &values = definition.values(); values 602 src/Func.cpp const auto &prover_result = prove_associativity(func_name, args, values); values 607 src/Func.cpp internal_assert(prover_result.size() == values.size()); values 670 src/Func.cpp if (!apply_split_directive(s, rvars, predicates, args, values)) { values 747 src/Func.cpp vector<Expr> init_vals(values.size()); values 793 src/Func.cpp vector<Expr> update_vals(values.size()); values 795 src/Func.cpp Expr val = substitute(substitution_map, values[i]); values 860 src/Func.cpp vector<Expr> f_values(values.size()); values 861 src/Func.cpp if (values.size() > 1) { values 900 src/Func.cpp values.swap(f_values); values 2559 src/Func.cpp vector<Expr> values(e.size()); values 2560 src/Func.cpp for (int i = 0; i < (int)values.size(); ++i) { values 2561 src/Func.cpp values[i] = BinaryOp()(self_ref[i], e[i]); values 2563 src/Func.cpp return self_ref = Tuple(values); values 2691 src/Func.cpp vector<Expr> values(func_ref.size()); values 2692 src/Func.cpp for (int i = 0; i < (int)values.size(); ++i) { values 2694 src/Func.cpp values[i] = e; values 2696 src/Func.cpp Type t = func_ref.function().values()[i].type(); values 2697 src/Func.cpp values[i] = undef(t); values 2700 src/Func.cpp return Tuple(values); values 892 src/Func.h EXPORT Tuple values() const; values 371 src/Function.cpp void Function::define(const vector<string> &args, vector<Expr> values) { values 379 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 380 src/Function.cpp user_assert(values[i].defined()) values 389 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 390 src/Function.cpp values[i].accept(&check); values 395 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 396 src/Function.cpp values[i].accept(&freezer); values 414 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 415 src/Function.cpp values[i] = common_subexpression_elimination(values[i]); values 420 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 421 src/Function.cpp values[i] = lower_random(values[i], args, tag); values 435 src/Function.cpp user_assert(contents->init_def.values().empty()) values 439 src/Function.cpp contents->init_def.values() = values; values 459 src/Function.cpp contents->output_types.resize(values.size()); values 461 src/Function.cpp contents->output_types[i] = values[i].type(); values 464 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 466 src/Function.cpp if (values.size() > 1) { values 469 src/Function.cpp Parameter output(values[i].type(), true, args.size(), buffer_name); values 474 src/Function.cpp void Function::define_update(const vector<Expr> &_args, vector<Expr> values) { values 486 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 487 src/Function.cpp user_assert(values[i].defined()) values 498 src/Function.cpp user_assert(values.size() == contents->init_def.values().size()) values 503 src/Function.cpp const auto &pure_def_vals = contents->init_def.values(); values 504 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 509 src/Function.cpp if (pure_type != values[i].type()) { values 512 src/Function.cpp if (values.size()) { values 517 src/Function.cpp err << values[i].type() << ", but pure definition has type " << pure_type; values 520 src/Function.cpp values[i] = common_subexpression_elimination(values[i]); values 564 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 565 src/Function.cpp values[i].accept(&check); values 577 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 578 src/Function.cpp values[i].accept(&freezer); values 604 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 605 src/Function.cpp values[i] = lower_random(values[i], free_vars, tag); values 620 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { values 621 src/Function.cpp values[i] = deleter.mutate(values[i]); values 628 src/Function.cpp Definition r(args, values, check.reduction_domain, false); values 758 src/Function.cpp return contents->init_def.values(); values 793 src/Function.cpp return !contents->init_def.values().empty(); values 113 src/Function.h EXPORT void define(const std::vector<std::string> &args, std::vector<Expr> values); values 123 src/Function.h EXPORT void define_update(const std::vector<Expr> &args, std::vector<Expr> values); values 153 src/Function.h EXPORT const std::vector<Expr> &values() const; values 187 src/Generator.cpp void ValueTracker::track_values(const std::string &name, const std::vector<Expr> &values) { values 190 src/Generator.cpp for (size_t i = 0; i < values.size(); ++i) { values 191 src/Generator.cpp history.push_back({values[i]}); values 196 src/Generator.cpp internal_assert(history.size() == values.size()) values 198 src/Generator.cpp << " but saw size " << values.size() values 202 src/Generator.cpp for (size_t i = 0; i < values.size(); ++i) { values 204 src/Generator.cpp Expr newval = values[i]; values 234 src/Generator.cpp std::vector<Expr> values; values 235 src/Generator.cpp values.push_back(Expr(p.host_alignment())); values 238 src/Generator.cpp values.push_back(p.min_constraint(i)); values 239 src/Generator.cpp values.push_back(p.extent_constraint(i)); values 240 src/Generator.cpp values.push_back(p.stride_constraint(i)); values 243 src/Generator.cpp values.push_back(p.get_min_value()); values 244 src/Generator.cpp values.push_back(p.get_max_value()); values 246 src/Generator.cpp return values; values 251 src/Generator.h EXPORT void track_values(const std::string &name, const std::vector<Expr> &values); values 1654 src/Generator.h HALIDE_OUTPUT_FORWARD_CONST(values) values 362 src/IR.cpp Stmt Provide::make(const std::string &name, const std::vector<Expr> &values, const std::vector<Expr> &args) { values 363 src/IR.cpp internal_assert(!values.empty()) << "Provide of no values\n"; values 364 src/IR.cpp for (size_t i = 0; i < values.size(); i++) { values 365 src/IR.cpp internal_assert(values[i].defined()) << "Provide of undefined value\n"; values 373 src/IR.cpp node->values = values; values 327 src/IR.h std::vector<Expr> values; values 330 src/IR.h EXPORT static Stmt make(const std::string &name, const std::vector<Expr> &values, const std::vector<Expr> &args); values 385 src/IREquality.cpp compare_expr_vector(s->values, op->values); values 230 src/IRMutator.cpp vector<Expr> new_values(op->values.size()); values 241 src/IRMutator.cpp for (size_t i = 0; i < op->values.size(); i++) { values 242 src/IRMutator.cpp Expr old_value = op->values[i]; values 1718 src/IROperator.h EXPORT Expr print(const std::vector<Expr> &values); values 1731 src/IROperator.h EXPORT Expr print_when(const Expr &condition, const std::vector<Expr> &values); values 1763 src/IROperator.h EXPORT Expr require(const Expr &condition, const std::vector<Expr> &values); values 596 src/IRPrinter.cpp if (op->values.size() > 1) { values 599 src/IRPrinter.cpp print_list(op->values); values 600 src/IRPrinter.cpp if (op->values.size() > 1) { values 178 src/IRVisitor.cpp for (size_t i = 0; i < op->values.size(); i++) { values 179 src/IRVisitor.cpp op->values[i].accept(this); values 417 src/IRVisitor.cpp for (size_t i = 0; i < op->values.size(); i++) { values 418 src/IRVisitor.cpp include(op->values[i]); values 33 src/InjectImageIntrinsics.cpp internal_assert(provide->values.size() == 1) values 40 src/InjectImageIntrinsics.cpp Expr value_arg = mutate(provide->values[0]); values 107 src/Inline.cpp Expr body = qualify(func.name() + ".", func.values()[op->value_index]); values 95 src/ParallelRVar.cpp const vector<Expr> &values = r.values(); values 100 src/ParallelRVar.cpp for (size_t i = 0; i < values.size(); i++) { values 101 src/ParallelRVar.cpp values[i].accept(&find); values 302 src/RemoveUndef.cpp vector<Expr> new_values(op->values.size()); values 329 src/RemoveUndef.cpp for (size_t i = 0; i < op->values.size(); i++) { values 330 src/RemoveUndef.cpp Expr old_value = op->values[i]; values 66 src/ScheduleFunctions.cpp const vector<Expr> &values, values 76 src/ScheduleFunctions.cpp Stmt stmt = Provide::make(func_name, values, site); values 274 src/ScheduleFunctions.cpp vector<Expr> values(def.values().size()); values 275 src/ScheduleFunctions.cpp for (size_t i = 0; i < values.size(); i++) { values 276 src/ScheduleFunctions.cpp Expr v = def.values()[i]; values 278 src/ScheduleFunctions.cpp values[i] = v; values 292 src/ScheduleFunctions.cpp func_name, prefix, dims, site, values, def.split_predicate(), def.schedule(), is_update); values 6180 src/Simplify.cpp const int32_t values[] = { values 6191 src/Simplify.cpp for (int32_t i1 : values) { values 6194 src/Simplify.cpp for (int32_t i2 : values) { values 26 src/SimplifySpecializations.cpp for (auto &def_val : def.values()) { values 62 src/SimplifySpecializations.cpp for (auto &def_val : def.values()) { values 109 src/SimplifySpecializations.cpp def.values() = s_def.values(); values 129 src/SplitTuples.cpp if (op->values.size() == 1) { values 170 src/SplitTuples.cpp for (size_t i = 0; i < op->values.size(); i++) { values 173 src/SplitTuples.cpp Expr val = mutate(op->values[i]); values 405 src/StmtToHtml.cpp if (op->values.size() > 1) { values 406 src/StmtToHtml.cpp print_list("{", op->values, "}"); values 408 src/StmtToHtml.cpp print(op->values[0]); values 191 src/StorageFlattening.cpp internal_assert(op->values.size() == 1); values 210 src/StorageFlattening.cpp Expr value = mutate(op->values[0]); values 81 src/StorageFolding.cpp stmt = Provide::make(op->name, op->values, args); values 23 src/Tracing.cpp Expr values = Call::make(type_of<void *>(), Call::make_struct, values 33 src/Tracing.cpp values, coords, values 119 src/Tracing.cpp const vector<Expr> &values = op->values; values 120 src/Tracing.cpp vector<Expr> traces(op->values.size()); values 127 src/Tracing.cpp for (size_t i = 0; i < values.size(); i++) { values 128 src/Tracing.cpp Type t = values[i].type(); values 137 src/Tracing.cpp traces[i] = Let::make(value_var_name, values[i], values 862 src/VaryingAttributes.cpp Stmt new_value = mutate(op->values[i]); values 619 src/VectorizeLoops.cpp vector<Expr> new_values(op->values.size()); values 633 src/VectorizeLoops.cpp Expr old_value = op->values[i]; values 45 test/correctness/interleave.cpp void define(FuncRef f, std::vector<Expr> values) { values 46 test/correctness/interleave.cpp if (values.size() == 1) { values 47 test/correctness/interleave.cpp f = values[0]; values 49 test/correctness/interleave.cpp f = Tuple(values); values 54 test/correctness/interleave.cpp std::vector<Expr> values; values 56 test/correctness/interleave.cpp values.push_back(value); values 58 test/correctness/interleave.cpp define(f, values);