exprs 58 python_bindings/python/RDom.cpp std::vector<h::Expr> exprs; exprs 65 python_bindings/python/RDom.cpp exprs.push_back(expr_extract()); exprs 76 python_bindings/python/RDom.cpp assert((exprs.size() % 2) == 0); exprs 78 python_bindings/python/RDom.cpp for (size_t i = 0; i < exprs.size(); i += 2) { exprs 79 python_bindings/python/RDom.cpp ranges.push_back({ exprs[i], exprs[i + 1] }); exprs 321 src/AssociativeOpsTable.cpp const vector<AssociativePattern> &get_ops_table(const vector<Expr> &exprs) { exprs 322 src/AssociativeOpsTable.cpp internal_assert(!exprs.empty()); exprs 326 src/AssociativeOpsTable.cpp for (size_t i = 1; i < exprs.size() - 1; ++i) { exprs 327 src/AssociativeOpsTable.cpp user_assert(exprs[i-1].type() == exprs[i].type()) exprs 331 src/AssociativeOpsTable.cpp if (exprs.size() > 2) { exprs 337 src/AssociativeOpsTable.cpp if (exprs[0].as<Halide::Internal::Add>()) { exprs 338 src/AssociativeOpsTable.cpp debug(5) << "Returning Add root table for type " << exprs[0].type() << "\n"; exprs 340 src/AssociativeOpsTable.cpp } else if (exprs[0].as<Halide::Internal::Sub>()) { exprs 341 src/AssociativeOpsTable.cpp debug(5) << "Returning Sub root table for type " << exprs[0].type() << "\n"; exprs 343 src/AssociativeOpsTable.cpp } else if (exprs[0].as<Halide::Internal::Mul>()) { exprs 344 src/AssociativeOpsTable.cpp debug(5) << "Returning Mul root table for type " << exprs[0].type() << "\n"; exprs 346 src/AssociativeOpsTable.cpp } else if (exprs[0].as<Halide::Internal::Min>()) { exprs 349 src/AssociativeOpsTable.cpp } else if (exprs[0].as<Halide::Internal::Max>()) { exprs 350 src/AssociativeOpsTable.cpp debug(5) << "Returning Max root table for type " << exprs[0].type() << "\n"; exprs 352 src/AssociativeOpsTable.cpp } else if (exprs[0].as<Halide::Internal::Select>()) { exprs 353 src/AssociativeOpsTable.cpp debug(5) << "Returning Select root table for type " << exprs[0].type() << "\n"; exprs 355 src/AssociativeOpsTable.cpp } else if (exprs[0].as<Halide::Internal::And>()) { exprs 356 src/AssociativeOpsTable.cpp debug(5) << "Returning And root table for type " << exprs[0].type() << "\n"; exprs 358 src/AssociativeOpsTable.cpp } else if (exprs[0].as<Halide::Internal::Or>()) { exprs 359 src/AssociativeOpsTable.cpp debug(5) << "Returning Or root table for type " << exprs[0].type() << "\n"; exprs 361 src/AssociativeOpsTable.cpp } else if (exprs[0].as<Halide::Internal::Cast>()) { exprs 362 src/AssociativeOpsTable.cpp debug(5) << "Returning Cast root table for type " << exprs[0].type() << "\n"; exprs 367 src/AssociativeOpsTable.cpp const vector<AssociativePattern> &table = get_ops_table_helper(exprs[0].type(), root, exprs.size()); exprs 62 src/AssociativeOpsTable.h const std::vector<AssociativePattern> &get_ops_table(const std::vector<Expr> &exprs); exprs 160 src/Associativity.cpp const vector<Expr> &exprs, AssociativeOp &assoc_op) { exprs 163 src/Associativity.cpp internal_assert(op_x_names.size() == exprs.size()); exprs 178 src/Associativity.cpp if (!associative_op_pattern_match(exprs[i], pattern.ops[i], op_x_names, exprs 208 src/Associativity.cpp for (size_t index = 0; index < exprs.size(); ++index) { exprs 209 src/Associativity.cpp Expr e = exprs[index]; exprs 228 src/Associativity.cpp bool extract_associative_op(const vector<Expr> exprs, const vector<string> &op_x_names, exprs 232 src/Associativity.cpp if ((exprs.size() == 1) && (!x_parts[0].defined())) { exprs 233 src/Associativity.cpp Type t = exprs[0].type(); exprs 241 src/Associativity.cpp assoc_op.ys[0] = {op_y_names[0], exprs[0]}; exprs 244 src/Associativity.cpp return find_match(get_ops_table(exprs), op_x_names, op_y_names, exprs 245 src/Associativity.cpp x_parts, exprs, assoc_op); exprs 308 src/Associativity.cpp AssociativeOp prove_associativity(const string &f, vector<Expr> args, vector<Expr> exprs) { exprs 309 src/Associativity.cpp AssociativeOp assoc_op(exprs.size()); exprs 317 src/Associativity.cpp vector<string> op_x_names(exprs.size()), op_y_names(exprs.size()); exprs 318 src/Associativity.cpp for (size_t idx = 0; idx < exprs.size(); ++idx) { exprs 323 src/Associativity.cpp vector<set<int>> dependencies(exprs.size()); exprs 324 src/Associativity.cpp vector<Expr> x_parts(exprs.size()); exprs 329 src/Associativity.cpp for (int idx = exprs.size()-1; idx >= 0; --idx) { exprs 330 src/Associativity.cpp exprs[idx] = simplify(exprs[idx]); exprs 331 src/Associativity.cpp exprs[idx] = common_subexpression_elimination(exprs[idx]); exprs 334 src/Associativity.cpp exprs[idx] = substitute_in_all_lets(exprs[idx]); exprs 338 src/Associativity.cpp exprs[idx] = csr.mutate(exprs[idx]); exprs 351 src/Associativity.cpp exprs[idx] = common_subexpression_elimination(exprs[idx]); exprs 352 src/Associativity.cpp exprs[idx] = simplify(exprs[idx]); exprs 353 src/Associativity.cpp exprs[idx] = solve_expression(exprs[idx], op_x_names[idx]).result; // Move 'x' to the left as possible exprs 354 src/Associativity.cpp exprs[idx] = substitute_in_all_lets(exprs[idx]); exprs 356 src/Associativity.cpp internal_assert((exprs.size() != 1) || all_independent) << "1D tuple should be all independent\n"; exprs 371 src/Associativity.cpp internal_assert(subgraphs.size() == exprs.size()); exprs 384 src/Associativity.cpp vector<Expr> sub_exprs = get_subvector(exprs, subgraphs[i]); exprs 446 src/Associativity.cpp std::string print_args(const string &f, const vector<Expr> &args, const vector<Expr> &exprs) { exprs 457 src/Associativity.cpp if (exprs.size() == 1) { exprs 458 src/Associativity.cpp stream << exprs[0]; exprs 459 src/Associativity.cpp } else if (exprs.size() > 1) { exprs 461 src/Associativity.cpp for (size_t i = 0; i < exprs.size(); ++i) { exprs 462 src/Associativity.cpp stream << exprs[i]; exprs 463 src/Associativity.cpp if (i != exprs.size() - 1) { exprs 472 src/Associativity.cpp void check_associativity(const string &f, vector<Expr> args, vector<Expr> exprs, exprs 474 src/Associativity.cpp auto result = prove_associativity(f, args, exprs); exprs 476 src/Associativity.cpp << "Checking associativity: " << print_args(f, args, exprs) << "\n" exprs 483 src/Associativity.cpp << "Checking associativity: " << print_args(f, args, exprs) << "\n" exprs 488 src/Associativity.cpp << "Checking associativity: " << print_args(f, args, exprs) << "\n" exprs 493 src/Associativity.cpp << "Checking associativity: " << print_args(f, args, exprs) << "\n" exprs 508 src/Associativity.cpp << "Checking associativity: " << print_args(f, args, exprs) << "\n" exprs 96 src/Associativity.h const std::string &f, std::vector<Expr> args, std::vector<Expr> exprs); exprs 128 src/BoundsInference.cpp vector<CondValue> exprs; exprs 229 src/BoundsInference.cpp exprs.clear(); exprs 241 src/BoundsInference.cpp exprs = result[0]; exprs 242 src/BoundsInference.cpp exprs.insert(exprs.end(), result[1].begin(), result[1].end()); exprs 687 src/BoundsInference.cpp for (size_t k = 0; k < s.exprs.size(); k++) { exprs 688 src/BoundsInference.cpp CondValue &cond_val = s.exprs[k]; exprs 752 src/BoundsInference.cpp for (const auto &cval : consumer.exprs) { exprs 369 src/CSE.cpp Expr ssa_block(vector<Expr> exprs) { exprs 370 src/CSE.cpp Expr e = exprs.back(); exprs 371 src/CSE.cpp for (size_t i = exprs.size() - 1; i > 0; i--) { exprs 373 src/CSE.cpp e = Let::make(name, exprs[i-1], e); exprs 396 src/Func.cpp void substitute_var_in_exprs(const string &name, Expr value, vector<Expr> &exprs) { exprs 397 src/Func.cpp for (auto &expr : exprs) { exprs 1567 src/Generator.cpp for (const Expr &e : exprs()) { exprs 1650 src/Generator.cpp const size_t expected = (kind() != IOKind::Scalar) ? funcs().size() : exprs().size(); exprs 1105 src/Generator.h EXPORT const std::vector<Expr> &exprs() const; exprs 1166 src/Generator.h return exprs(); exprs 1435 src/Generator.h return this->exprs().at(0); exprs 1441 src/Generator.h return ExternFuncArgument(this->exprs().at(0)); exprs 979 src/HexagonOptimize.cpp bool yields_removable_interleave(const vector<Expr> &exprs) { exprs 981 src/HexagonOptimize.cpp for (const Expr &i : exprs) { exprs 262 src/IRPrinter.cpp void IRPrinter::print_list(const std::vector<Expr> &exprs) { exprs 263 src/IRPrinter.cpp for (size_t i = 0; i < exprs.size(); i++) { exprs 264 src/IRPrinter.cpp print(exprs[i]); exprs 265 src/IRPrinter.cpp if (i < exprs.size() - 1) { exprs 81 src/IRPrinter.h EXPORT void print_list(const std::vector<Expr> &exprs); exprs 7 src/Tuple.cpp Tuple::Tuple(const FuncRef &f) : exprs(f.size()) { exprs 12 src/Tuple.cpp exprs[i] = f[i]; exprs 21 src/Tuple.h std::vector<Expr> exprs; exprs 24 src/Tuple.h size_t size() const { return exprs.size(); } exprs 28 src/Tuple.h user_assert(x < exprs.size()) << "Tuple access out of bounds\n"; exprs 29 src/Tuple.h return exprs[x]; exprs 34 src/Tuple.h user_assert(x < exprs.size()) << "Tuple access out of bounds\n"; exprs 35 src/Tuple.h return exprs[x]; exprs 40 src/Tuple.h exprs.push_back(e); exprs 47 src/Tuple.h exprs = std::vector<Expr>{a, b, std::forward<Args>(args)...}; exprs 52 src/Tuple.h explicit NO_INLINE Tuple(const std::vector<Expr> &e) : exprs(e) { exprs 61 src/Tuple.h return exprs; exprs 81 test/correctness/sort_exprs.cpp std::vector<Expr> exprs; exprs 83 test/correctness/sort_exprs.cpp exprs.push_back(f(i)); exprs 85 test/correctness/sort_exprs.cpp exprs = bitonic_sort(exprs); exprs 87 test/correctness/sort_exprs.cpp std::cout << exprs.size() << "\n"; exprs 97 test/correctness/sort_exprs.cpp g(i) = exprs[i];