result 10 apps/HelloAndroid/jni/hello_generator.cpp Output<Buffer<uint8_t>> result{"result", 2}; result 22 apps/HelloAndroid/jni/hello_generator.cpp result(x, y) = cast<uint8_t>(clamp(sharper(x, y), 0, 255)); result 29 apps/HelloAndroid/jni/hello_generator.cpp result.split(y, y, yi, 60).vectorize(x, 8).parallel(y); result 30 apps/HelloAndroid/jni/hello_generator.cpp curved.store_at(result, y).compute_at(result, yi); result 12 apps/HelloAndroidCamera2/jni/deinterleave_generator.cpp Func result("result"); result 13 apps/HelloAndroidCamera2/jni/deinterleave_generator.cpp result(x, y) = { uvInterleaved(2 * x, y), uvInterleaved(2 * x + 1, y) }; result 18 apps/HelloAndroidCamera2/jni/deinterleave_generator.cpp result result 24 apps/HelloAndroidCamera2/jni/deinterleave_generator.cpp result.specialize(uvInterleaved.dim(0).stride() == 1); result 25 apps/HelloAndroidCamera2/jni/deinterleave_generator.cpp result.specialize(uvInterleaved.dim(0).stride() == -1); result 27 apps/HelloAndroidCamera2/jni/deinterleave_generator.cpp return result; result 29 apps/HelloAndroidCamera2/jni/edge_detect_generator.cpp Func result; result 30 apps/HelloAndroidCamera2/jni/edge_detect_generator.cpp result(x, y) = cast<uint8_t>(clamp(grad_mag(x, y), 0, 255)); result 35 apps/HelloAndroidCamera2/jni/edge_detect_generator.cpp result result 42 apps/HelloAndroidCamera2/jni/edge_detect_generator.cpp result.specialize(input.dim(0).stride() == 1); result 43 apps/HelloAndroidCamera2/jni/edge_detect_generator.cpp result.specialize(input.dim(0).stride() == -1); result 45 apps/HelloAndroidCamera2/jni/edge_detect_generator.cpp return result; result 140 apps/HelloAndroidCamera2/src/com/android/ex/camera2/blocking/BlockingCaptureCallback.java TotalCaptureResult result) { result 141 apps/HelloAndroidCamera2/src/com/android/ex/camera2/blocking/BlockingCaptureCallback.java if (mProxy != null) mProxy.onCaptureCompleted(session, request, result); result 44 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java void onAutoFocusSuccess(CaptureResult result, boolean locked); result 51 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java void onAutoFocusFail(CaptureResult result, boolean locked); result 59 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java void onAutoFocusScan(CaptureResult result); result 67 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java void onAutoFocusInactive(CaptureResult result); result 102 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java public synchronized void onCaptureCompleted(CaptureResult result) { result 108 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java if (result == null) { result 127 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java Integer afState = result.get(CaptureResult.CONTROL_AF_STATE); result 128 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java Integer afMode = result.get(CaptureResult.CONTROL_AF_MODE); result 158 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java mListener.onAutoFocusSuccess(result, /*locked*/true); result 162 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java mListener.onAutoFocusFail(result, /*locked*/true); result 166 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java mListener.onAutoFocusSuccess(result, /*locked*/false); result 169 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java mListener.onAutoFocusFail(result, /*locked*/false); result 172 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java mListener.onAutoFocusScan(result); result 175 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java mListener.onAutoFocusScan(result); result 178 apps/HelloAndroidCamera2/src/com/android/ex/camera2/pos/AutoFocusStateMachine.java mListener.onAutoFocusInactive(result); result 225 apps/HelloAndroidCamera2/src/com/example/helloandroidcamera2/Camera2BasicFragment.java TotalCaptureResult result) { result 35 apps/HelloAndroidGL/jni/android_halide_gl_native.cpp int result = halide_opengl_wrap_render_target(user_context, &dstBuf); result 36 apps/HelloAndroidGL/jni/android_halide_gl_native.cpp if (result != 0) { result 40 apps/HelloAndroidGL/jni/android_halide_gl_native.cpp int result = halide_opengl_wrap_texture(user_context, &dstBuf, dst); result 41 apps/HelloAndroidGL/jni/android_halide_gl_native.cpp if (result != 0) { result 11 apps/HelloAndroidGL/jni/halide_gl_filter.cpp Func result; result 31 apps/HelloAndroidGL/jni/halide_gl_filter.cpp result(x, y, c) = cast<uint8_t>( result 36 apps/HelloAndroidGL/jni/halide_gl_filter.cpp result.output_buffer().set_stride(0, 4); result 37 apps/HelloAndroidGL/jni/halide_gl_filter.cpp result.bound(c, 0, 4); result 38 apps/HelloAndroidGL/jni/halide_gl_filter.cpp result.glsl(x, y, c); result 40 apps/HelloAndroidGL/jni/halide_gl_filter.cpp result.compile_to_file("halide_gl_filter", {time}, "halide_gl_filter"); result 69 apps/HelloHexagon/process.cpp int result = pipeline(in, out); result 70 apps/HelloHexagon/process.cpp if (result != 0) { result 71 apps/HelloHexagon/process.cpp printf("pipeline failed! %d\n", result); result 24 apps/c_backend/run.cpp int result = 0; result 30 apps/c_backend/run.cpp result += origin[x * in->dim[0].stride + y * in->dim[1].stride]; result 34 apps/c_backend/run.cpp dst[0] = result; result 39 apps/glsl/opengl_test.cpp int result = temp.copy_to_device(halide_opengl_device_interface()); result 40 apps/glsl/opengl_test.cpp if (result != 0) { result 41 apps/glsl/opengl_test.cpp fprintf(stderr, "halide_device_malloc failed with return %d.\n", result); result 44 apps/glsl/opengl_test.cpp result = temp.device_sync(); result 45 apps/glsl/opengl_test.cpp if (result != 0) { result 46 apps/glsl/opengl_test.cpp fprintf(stderr, "halide_device_sync failed with return %d.\n", result); result 96 apps/hexagon_benchmarks/process.cpp int result = p->run(m); result 97 apps/hexagon_benchmarks/process.cpp if (result != 0) { result 98 apps/hexagon_benchmarks/process.cpp printf("pipeline failed! %d\n", result); result 75 apps/hexagon_matmul/process.cpp int result = pipeline(mat_a, mat_b, mat_ab); result 76 apps/hexagon_matmul/process.cpp if (result != 0) { result 77 apps/hexagon_matmul/process.cpp printf("pipeline failed! %d\n", result); result 116 apps/linear_algebra/benchmarks/cblas_benchmarks.cpp Scalar result; result 121 apps/linear_algebra/benchmarks/cblas_benchmarks.cpp L1Benchmark(dot, "s", result = cblas_sdot(N, &(x[0]), 1, &(y[0]), 1)) result 122 apps/linear_algebra/benchmarks/cblas_benchmarks.cpp L1Benchmark(asum, "s", result = cblas_sasum(N, &(x[0]), 1)) result 157 apps/linear_algebra/benchmarks/cblas_benchmarks.cpp Scalar result; result 162 apps/linear_algebra/benchmarks/cblas_benchmarks.cpp L1Benchmark(dot, "d", result = cblas_ddot(N, &(x[0]), 1, &(y[0]), 1)) result 163 apps/linear_algebra/benchmarks/cblas_benchmarks.cpp L1Benchmark(asum, "d", result = cblas_dasum(N, &(x[0]), 1)) result 83 apps/linear_algebra/benchmarks/eigen_benchmarks.cpp Scalar result; result 88 apps/linear_algebra/benchmarks/eigen_benchmarks.cpp L1Benchmark(dot, type_name<T>(), result = x.dot(y)); result 89 apps/linear_algebra/benchmarks/eigen_benchmarks.cpp L1Benchmark(asum, type_name<T>(), result = x.array().abs().sum()); result 107 apps/linear_algebra/benchmarks/halide_benchmarks.cpp Halide::Runtime::Buffer<float> result; result 112 apps/linear_algebra/benchmarks/halide_benchmarks.cpp L1Benchmark(dot, "s", halide_sdot(x.raw_buffer(), y.raw_buffer(), result.raw_buffer())) result 113 apps/linear_algebra/benchmarks/halide_benchmarks.cpp L1Benchmark(asum, "s", halide_sasum(x.raw_buffer(), result.raw_buffer())) result 142 apps/linear_algebra/benchmarks/halide_benchmarks.cpp Halide::Runtime::Buffer<double> result; result 147 apps/linear_algebra/benchmarks/halide_benchmarks.cpp L1Benchmark(dot, "d", halide_ddot(x.raw_buffer(), y.raw_buffer(), result.raw_buffer())) result 148 apps/linear_algebra/benchmarks/halide_benchmarks.cpp L1Benchmark(asum, "d", halide_dasum(x.raw_buffer(), result.raw_buffer())) result 42 apps/linear_algebra/src/blas_l1_generators.cpp void Schedule(Func result, Expr width) { result 66 apps/linear_algebra/src/blas_l1_generators.cpp Func result("result"); result 69 apps/linear_algebra/src/blas_l1_generators.cpp result(i) = undef(type_of<T>()); result 70 apps/linear_algebra/src/blas_l1_generators.cpp result(vecs) = calc(vecs); result 71 apps/linear_algebra/src/blas_l1_generators.cpp result(tail) = calc(tail); result 75 apps/linear_algebra/src/blas_l1_generators.cpp result.update().vectorize(vecs, vec_size); result 78 apps/linear_algebra/src/blas_l1_generators.cpp result.bound(i, 0, x_.width()); result 79 apps/linear_algebra/src/blas_l1_generators.cpp result.output_buffer().set_bounds(0, 0, x_.width()); result 84 apps/linear_algebra/src/blas_l1_generators.cpp return result; result 128 apps/linear_algebra/src/blas_l1_generators.cpp Func result; result 137 apps/linear_algebra/src/blas_l1_generators.cpp result(i) = undef<T>(); result 138 apps/linear_algebra/src/blas_l1_generators.cpp result(0) = sum(dot(lanes)); result 139 apps/linear_algebra/src/blas_l1_generators.cpp result(0) += sum(x_(tail) * y_(tail)); result 145 apps/linear_algebra/src/blas_l1_generators.cpp result(i) = undef<T>(); result 146 apps/linear_algebra/src/blas_l1_generators.cpp result(0) = sum(x_(k) * y_(k)); result 152 apps/linear_algebra/src/blas_l1_generators.cpp return result; result 195 apps/linear_algebra/src/blas_l1_generators.cpp Func result; result 204 apps/linear_algebra/src/blas_l1_generators.cpp result(i) = undef<T>(); result 205 apps/linear_algebra/src/blas_l1_generators.cpp result(0) = sum(norm(lanes)); result 206 apps/linear_algebra/src/blas_l1_generators.cpp result(0) += sum(abs(x_(tail))); result 212 apps/linear_algebra/src/blas_l1_generators.cpp result(i) = undef<T>(); result 213 apps/linear_algebra/src/blas_l1_generators.cpp result(0) = sum(abs(x_(k))); result 218 apps/linear_algebra/src/blas_l1_generators.cpp return result; result 46 apps/linear_algebra/src/blas_l2_generators.cpp Func result("result"); result 74 apps/linear_algebra/src/blas_l2_generators.cpp result(i) = b_ * y_(i) + a_ * Ax(i); result 77 apps/linear_algebra/src/blas_l2_generators.cpp result.specialize((sum_size / vec_size) * vec_size == sum_size) result 82 apps/linear_algebra/src/blas_l2_generators.cpp result result 88 apps/linear_algebra/src/blas_l2_generators.cpp .compute_at(result, i).unroll(i).unroll(j) result 91 apps/linear_algebra/src/blas_l2_generators.cpp .compute_at(result, i).unroll(i).unroll(j); result 93 apps/linear_algebra/src/blas_l2_generators.cpp .compute_at(result, i).update().unroll(lanes); result 95 apps/linear_algebra/src/blas_l2_generators.cpp .compute_at(result, i) result 114 apps/linear_algebra/src/blas_l2_generators.cpp result.output_buffer().set_bounds(0, 0, A_.height()); result 127 apps/linear_algebra/src/blas_l2_generators.cpp result(i) = block(i); result 131 apps/linear_algebra/src/blas_l2_generators.cpp result.specialize(tail_size == 0) result 137 apps/linear_algebra/src/blas_l2_generators.cpp result.specialize(size >= vec_size).vectorize(i, vec_size) result 142 apps/linear_algebra/src/blas_l2_generators.cpp block.compute_at(result, i); result 157 apps/linear_algebra/src/blas_l2_generators.cpp result.output_buffer().set_bounds(0, 0, A_.width()); result 161 apps/linear_algebra/src/blas_l2_generators.cpp output(i) = result(i); result 162 apps/linear_algebra/src/blas_l2_generators.cpp result.compute_root(); result 215 apps/linear_algebra/src/blas_l2_generators.cpp Func result("result"); result 216 apps/linear_algebra/src/blas_l2_generators.cpp result(i, j) = A_(i, j) + a_ * x_(i) * y_(j); result 220 apps/linear_algebra/src/blas_l2_generators.cpp result.specialize(num_rows >= vec_size).vectorize(i, vec_size) result 231 apps/linear_algebra/src/blas_l2_generators.cpp result.output_buffer() result 235 apps/linear_algebra/src/blas_l2_generators.cpp return result; result 56 apps/linear_algebra/src/blas_l3_generators.cpp Func result("result"); result 96 apps/linear_algebra/src/blas_l3_generators.cpp result(i, j) = (a_ * ABt(i, j) + b_ * C_(i, j)); result 98 apps/linear_algebra/src/blas_l3_generators.cpp result.tile(i, j, ti[1], tj[1], i, j, 2*s, 2*s, TailStrategy::GuardWithIf); result 100 apps/linear_algebra/src/blas_l3_generators.cpp result result 105 apps/linear_algebra/src/blas_l3_generators.cpp result result 111 apps/linear_algebra/src/blas_l3_generators.cpp result.specialize(num_rows >= 512 && num_cols >= 512) result 116 apps/linear_algebra/src/blas_l3_generators.cpp result.specialize(num_rows >= 128 && num_cols >= 128) result 120 apps/linear_algebra/src/blas_l3_generators.cpp result.rename(tj[0], t); result 122 apps/linear_algebra/src/blas_l3_generators.cpp result.bound(i, 0, num_rows).bound(j, 0, num_cols); result 133 apps/linear_algebra/src/blas_l3_generators.cpp B.compute_at(result, t) result 143 apps/linear_algebra/src/blas_l3_generators.cpp AB.compute_at(result, i) result 149 apps/linear_algebra/src/blas_l3_generators.cpp ABt.compute_at(result, i) result 157 apps/linear_algebra/src/blas_l3_generators.cpp result.output_buffer().set_bounds(0, 0, num_rows).set_bounds(1, 0, num_cols); result 159 apps/linear_algebra/src/blas_l3_generators.cpp return result; result 94 apps/linear_algebra/src/halide_blas.cpp float result; result 97 apps/linear_algebra/src/halide_blas.cpp auto buff_dot = init_scalar_buffer(&result); result 99 apps/linear_algebra/src/halide_blas.cpp return result; result 104 apps/linear_algebra/src/halide_blas.cpp double result; result 107 apps/linear_algebra/src/halide_blas.cpp auto buff_dot = init_scalar_buffer(&result); result 109 apps/linear_algebra/src/halide_blas.cpp return result; result 117 apps/linear_algebra/src/halide_blas.cpp float result; result 119 apps/linear_algebra/src/halide_blas.cpp auto buff_nrm = init_scalar_buffer(&result); result 121 apps/linear_algebra/src/halide_blas.cpp return std::sqrt(result); result 125 apps/linear_algebra/src/halide_blas.cpp double result; result 127 apps/linear_algebra/src/halide_blas.cpp auto buff_nrm = init_scalar_buffer(&result); result 129 apps/linear_algebra/src/halide_blas.cpp return std::sqrt(result); result 137 apps/linear_algebra/src/halide_blas.cpp float result; result 139 apps/linear_algebra/src/halide_blas.cpp auto buff_sum = init_scalar_buffer(&result); result 141 apps/linear_algebra/src/halide_blas.cpp return result; result 145 apps/linear_algebra/src/halide_blas.cpp double result; result 147 apps/linear_algebra/src/halide_blas.cpp auto buff_sum = init_scalar_buffer(&result); result 149 apps/linear_algebra/src/halide_blas.cpp return result; result 18 apps/openglcompute/test_oglc_avg.cpp Func result("avg_filter"); result 19 apps/openglcompute/test_oglc_avg.cpp result(x, y, c) = (blur_x(x, y - 1, c) + result 23 apps/openglcompute/test_oglc_avg.cpp result.output_buffer().dim(2).set_bounds(0, 4).set_stride(1).dim(0).set_stride(4); result 26 apps/openglcompute/test_oglc_avg.cpp result.bound(c, 0, 4) result 31 apps/openglcompute/test_oglc_avg.cpp result.unroll(c) result 35 apps/openglcompute/test_oglc_avg.cpp result result 40 apps/openglcompute/test_oglc_avg.cpp blur_x.store_at(result, y) result 41 apps/openglcompute/test_oglc_avg.cpp .compute_at(result, yi) result 48 apps/openglcompute/test_oglc_avg.cpp result.compile_to_file(fn_name, {input}, fn_name); result 40 apps/simd_op_check/driver.cpp int result = posix_memalign((void **)&mem, 128, w*h*sizeof(T)); result 41 apps/simd_op_check/driver.cpp if (result != 0 || mem == NULL) { result 29 python_bindings/python/BoundaryConditions.cpp std::vector<std::pair<h::Expr, h::Expr>> result(intermediate.size()); result 30 python_bindings/python/BoundaryConditions.cpp std::transform(intermediate.begin(), intermediate.end(), result.begin(), to_pair<h::Expr, h::Expr>); result 31 python_bindings/python/BoundaryConditions.cpp return result; result 15 python_bindings/python/Expr.h std::vector<T> result; result 17 python_bindings/python/Expr.h result.push_back(boost::python::extract<T>(obj[i])); result 19 python_bindings/python/Expr.h return result; result 196 python_bindings/python/IROperator.cpp h::Expr memoize_tag0(h::Expr result, const std::vector<h::Expr> &cache_key_values) { result 197 python_bindings/python/IROperator.cpp return h::memoize_tag(result, cache_key_values); result 157 src/AlignLoads.cpp void visit_let(NodeType &result, const LetType *op) { result 170 src/AlignLoads.cpp result = LetType::make(op->name, value, body); result 172 src/AlignLoads.cpp result = op; result 14 src/ApplySplit.cpp vector<ApplySplitResult> result; result 63 src/ApplySplit.cpp result.push_back(ApplySplitResult( result 69 src/ApplySplit.cpp result.push_back(ApplySplitResult(cond)); result 70 src/ApplySplit.cpp result.push_back(ApplySplitResult(rebased_var_name, rebased, ApplySplitResult::LetStmt)); result 87 src/ApplySplit.cpp result.push_back(ApplySplitResult(old_var_name, base_var + inner, ApplySplitResult::Substitution)); result 89 src/ApplySplit.cpp result.push_back(ApplySplitResult(old_var_name, base_var + inner, ApplySplitResult::LetStmt)); result 90 src/ApplySplit.cpp result.push_back(ApplySplitResult(base_name, base, ApplySplitResult::LetStmt)); result 108 src/ApplySplit.cpp result.push_back(ApplySplitResult(prefix + split.inner, inner, ApplySplitResult::Substitution)); result 109 src/ApplySplit.cpp result.push_back(ApplySplitResult(prefix + split.outer, outer, ApplySplitResult::Substitution)); result 110 src/ApplySplit.cpp result.push_back(ApplySplitResult(prefix + split.inner, inner, ApplySplitResult::LetStmt)); result 111 src/ApplySplit.cpp result.push_back(ApplySplitResult(prefix + split.outer, outer, ApplySplitResult::LetStmt)); result 123 src/ApplySplit.cpp result.push_back(ApplySplitResult(prefix + split.old_var, outer, ApplySplitResult::Substitution)); result 124 src/ApplySplit.cpp result.push_back(ApplySplitResult(prefix + split.old_var, outer, ApplySplitResult::LetStmt)); result 127 src/ApplySplit.cpp return result; result 102 src/Associativity.cpp map<string, Expr> result; result 103 src/Associativity.cpp if (expr_match(op, e, result)) { result 105 src/Associativity.cpp << ", y_part: " << result["y0"] << "\n"; result 108 src/Associativity.cpp const auto &iter = result.find("x" + std::to_string(i)); result 109 src/Associativity.cpp if (iter != result.end()) { result 119 src/Associativity.cpp const auto &iter = result.find("y" + std::to_string(i)); result 120 src/Associativity.cpp if (iter != result.end()) { result 129 src/Associativity.cpp const auto &iter = result.find("k" + std::to_string(i)); result 130 src/Associativity.cpp if (iter != result.end()) { result 140 src/Associativity.cpp for (const auto &iter : result) { result 353 src/Associativity.cpp exprs[idx] = solve_expression(exprs[idx], op_x_names[idx]).result; // Move 'x' to the left as possible result 474 src/Associativity.cpp auto result = prove_associativity(f, args, exprs); result 475 src/Associativity.cpp internal_assert(result.associative() == assoc_op.associative()) result 478 src/Associativity.cpp << " instead of " << result.associative() << "\n"; result 482 src/Associativity.cpp internal_assert(equal(result.pattern.identities[i], assoc_op.pattern.identities[i])) result 486 src/Associativity.cpp << " instead of " << result.pattern.identities[i] << "\n"; result 487 src/Associativity.cpp internal_assert(equal(result.xs[i].expr, assoc_op.xs[i].expr)) result 491 src/Associativity.cpp << " instead of " << result.xs[i].expr << "\n"; result 492 src/Associativity.cpp internal_assert(equal(result.ys[i].expr, assoc_op.ys[i].expr)) result 496 src/Associativity.cpp << " instead of " << result.ys[i].expr << "\n"; result 498 src/Associativity.cpp if (result.xs[i].expr.defined()) { result 499 src/Associativity.cpp replacement.emplace(assoc_op.xs[i].var, Variable::make(result.xs[i].expr.type(), result.xs[i].var)); result 501 src/Associativity.cpp internal_assert(result.ys[i].expr.defined()); result 502 src/Associativity.cpp replacement.emplace(assoc_op.ys[i].var, Variable::make(result.ys[i].expr.type(), result.ys[i].var)); result 507 src/Associativity.cpp internal_assert(equal(result.pattern.ops[i], expected_op)) result 511 src/Associativity.cpp << " instead of " << result.pattern.ops[i] << "\n"; result 514 src/Associativity.cpp debug(5) << "Operator: " << result.pattern.ops[i] << "\n"; result 515 src/Associativity.cpp debug(5) << " identity: " << result.pattern.identities[i] << "\n"; result 516 src/Associativity.cpp debug(5) << " x: " << result.xs[i].var << " -> " << result.xs[i].expr << "\n"; result 517 src/Associativity.cpp debug(5) << " y: " << result.ys[i].var << " -> " << result.ys[i].expr << "\n"; result 738 src/Bounds.cpp Interval result = Interval::nothing(); result 741 src/Bounds.cpp result.include(interval); result 743 src/Bounds.cpp interval = result; result 803 src/Bounds.cpp Region result; result 810 src/Bounds.cpp result.push_back(Range(simplify(min), simplify(extent))); result 813 src/Bounds.cpp return result; result 894 src/Bounds.cpp Box result = a; result 895 src/Bounds.cpp merge_boxes(result, b); result 896 src/Bounds.cpp return result; result 900 src/Bounds.cpp Box result; result 902 src/Bounds.cpp return result; result 906 src/Bounds.cpp result.resize(a.size()); result 909 src/Bounds.cpp result[i].min = simplify(max(a[i].min, b[i].min)); result 910 src/Bounds.cpp result[i].max = simplify(min(a[i].max, b[i].max)); result 915 src/Bounds.cpp result.used = a.used && b.used; result 917 src/Bounds.cpp result.used = a.used; result 919 src/Bounds.cpp result.used = b.used; result 922 src/Bounds.cpp return result; result 1407 src/Bounds.cpp Interval result = bounds_of_expr_in_scope(def.values()[dim], scope, fb); result 1413 src/Bounds.cpp result.include(s_interval); result 1415 src/Bounds.cpp return result; result 1428 src/Bounds.cpp Interval result; result 1438 src/Bounds.cpp result = compute_pure_function_definition_value_bounds(f.definition(), arg_scope, fb, j); result 1441 src/Bounds.cpp if (result.has_lower_bound()) { result 1442 src/Bounds.cpp result.min = simplify(common_subexpression_elimination(result.min)); result 1445 src/Bounds.cpp if (result.has_upper_bound()) { result 1446 src/Bounds.cpp result.max = simplify(common_subexpression_elimination(result.max)); result 1449 src/Bounds.cpp fb[key] = result; result 1454 src/Bounds.cpp << " are: " << result.min << ", " << result.max << "\n"; result 1463 src/Bounds.cpp Interval result = bounds_of_expr_in_scope(e, scope, fb); result 1464 src/Bounds.cpp result.min = simplify(result.min); result 1465 src/Bounds.cpp result.max = simplify(result.max); result 1466 src/Bounds.cpp if (!equal(result.min, correct_min)) { result 1468 src/Bounds.cpp << "Incorrect min: " << result.min << '\n' result 1471 src/Bounds.cpp if (!equal(result.max, correct_max)) { result 1473 src/Bounds.cpp << "Incorrect max: " << result.max << '\n' result 26 src/BoundsInference.cpp result = true; result 33 src/BoundsInference.cpp result = true; result 40 src/BoundsInference.cpp bool result; result 41 src/BoundsInference.cpp DependsOnBoundsInference() : result(false) {} result 47 src/BoundsInference.cpp return d.result; result 63 src/BoundsInference.cpp Interval result; result 75 src/BoundsInference.cpp result = in; result 90 src/BoundsInference.cpp result = in; result 102 src/BoundsInference.cpp return b.result; result 139 src/BoundsInference.cpp vector<vector<CondValue>> result(2); // <args, values> result 153 src/BoundsInference.cpp for (size_t i = 0; i < result.size(); ++i) { result 166 src/BoundsInference.cpp result[i].push_back(CondValue(const_true(), cond_val)); result 168 src/BoundsInference.cpp result[i].push_back(CondValue(const_true(), val)); result 179 src/BoundsInference.cpp for (auto &vec : result) { result 192 src/BoundsInference.cpp for (size_t i = 0; i < result.size(); i++) { result 193 src/BoundsInference.cpp result[i].insert(result[i].end(), s_result[i].begin(), s_result[i].end()); result 201 src/BoundsInference.cpp for (auto &vec : result) { result 220 src/BoundsInference.cpp return result; result 233 src/BoundsInference.cpp vector<vector<CondValue>> result; result 235 src/BoundsInference.cpp result = compute_exprs_helper(func.definition(), is_update); result 238 src/BoundsInference.cpp result = compute_exprs_helper(def, is_update); result 240 src/BoundsInference.cpp internal_assert(result.size() == 2); result 241 src/BoundsInference.cpp exprs = result[0]; result 242 src/BoundsInference.cpp exprs.insert(exprs.end(), result[1].begin(), result[1].end()); result 585 src/BoundsInference.cpp Expr result = Variable::make(Int(32), result_name); result 587 src/BoundsInference.cpp {extern_name, result}, Call::Extern); result 588 src/BoundsInference.cpp Stmt check = AssertStmt::make(EQ::make(result, 0), error); result 610 src/BoundsInference.cpp void populate_scope(Scope<Interval> &result) { result 613 src/BoundsInference.cpp result.push(farg, result 620 src/BoundsInference.cpp result.push(rv.var, Interval(Variable::make(Int(32), arg + ".min"), result 66 src/Buffer.h void get_shape_from_start_of_parameter_pack_helper(std::vector<int> &result, int x, Args&&... rest) { result 67 src/Buffer.h result.push_back(x); result 68 src/Buffer.h get_shape_from_start_of_parameter_pack_helper(result, std::forward<Args>(rest)...); result 74 src/Buffer.h std::vector<int> result; result 75 src/Buffer.h get_shape_from_start_of_parameter_pack_helper(result, std::forward<Args>(args)...); result 76 src/Buffer.h return result; result 132 src/CPlusPlusMangle.cpp std::string result; result 151 src/CPlusPlusMangle.cpp result = one_qualifier_set(last_is_const, last_is_volatile, last_is_restrict, last_is_pointer, base_mode) + result; result 153 src/CPlusPlusMangle.cpp result = one_qualifier_set(last_is_const, last_is_volatile, last_is_restrict, false, base_mode) + result; result 167 src/CPlusPlusMangle.cpp result = one_qualifier_set(false, false, false, last_is_pointer, base_mode) + result; result 171 src/CPlusPlusMangle.cpp result = "A" + base_mode + result; // Or is it "R"? result 173 src/CPlusPlusMangle.cpp result = "$$Q" + base_mode + result; result 178 src/CPlusPlusMangle.cpp return result; result 193 src/CPlusPlusMangle.cpp MangledNamePart result(""); result 209 src/CPlusPlusMangle.cpp result.full_name = quals + code + type.handle_type->inner_name.name + "@"; result 210 src/CPlusPlusMangle.cpp result.with_substitutions = quals + code + prev_decls.check_and_enter_name(type.handle_type->inner_name.name); result 213 src/CPlusPlusMangle.cpp result.full_name += type.handle_type->enclosing_types[i - 1].name + "@"; result 214 src/CPlusPlusMangle.cpp result.with_substitutions += prev_decls.check_and_enter_name(type.handle_type->enclosing_types[i - 1].name); result 218 src/CPlusPlusMangle.cpp result.full_name += type.handle_type->namespaces[i - 1] + "@"; result 219 src/CPlusPlusMangle.cpp result.with_substitutions += prev_decls.check_and_enter_name(type.handle_type->namespaces[i - 1]); result 222 src/CPlusPlusMangle.cpp result.full_name += "@"; result 223 src/CPlusPlusMangle.cpp result.with_substitutions += "@"; result 225 src/CPlusPlusMangle.cpp return result; result 277 src/CPlusPlusMangle.cpp std::string result("\1?"); result 280 src/CPlusPlusMangle.cpp result += prev_decls.check_and_enter_name(name); result 283 src/CPlusPlusMangle.cpp result += prev_decls.check_and_enter_name(namespaces[i - 1]); result 285 src/CPlusPlusMangle.cpp result += "@"; result 287 src/CPlusPlusMangle.cpp result += "YA"; result 289 src/CPlusPlusMangle.cpp result += prev_decls.check_and_enter_type(mangle_type(return_type, target, prev_decls)); result 292 src/CPlusPlusMangle.cpp result += "X"; result 295 src/CPlusPlusMangle.cpp result += prev_decls.check_and_enter_type(mangle_type(arg.is_expr() ? arg.expr.type() : type_of<struct halide_buffer_t *>(), target, prev_decls)); result 300 src/CPlusPlusMangle.cpp if (result.back() != 'Z') { result 301 src/CPlusPlusMangle.cpp result += "@"; result 304 src/CPlusPlusMangle.cpp result += "Z"; result 306 src/CPlusPlusMangle.cpp return result; result 463 src/CPlusPlusMangle.cpp MangledNamePart result; result 476 src/CPlusPlusMangle.cpp result.full_name += "St"; result 477 src/CPlusPlusMangle.cpp result.with_substitutions += "St"; result 481 src/CPlusPlusMangle.cpp result.full_name += "St"; result 482 src/CPlusPlusMangle.cpp result.with_substitutions += "St"; result 484 src/CPlusPlusMangle.cpp prevs.extend_name_part(result, itanium_mangle_id(ns)); result 488 src/CPlusPlusMangle.cpp prevs.extend_name_part(result, itanium_mangle_id(et.name)); result 495 src/CPlusPlusMangle.cpp substituted = prevs.extend_name_part(result, mangled); result 497 src/CPlusPlusMangle.cpp result.full_name += mangled; result 498 src/CPlusPlusMangle.cpp result.with_substitutions += mangled; result 501 src/CPlusPlusMangle.cpp result.full_name = "N" + result.full_name + "E"; result 504 src/CPlusPlusMangle.cpp return result; result 509 src/CPlusPlusMangle.cpp MangledNamePart result = simple_type_to_mangle_char(type.handle_type->inner_name.name, target); result 510 src/CPlusPlusMangle.cpp return apply_indirection_and_cvr_quals(type, result, prevs).full_name; result 578 src/CPlusPlusMangle.cpp std::string result("_Z"); result 581 src/CPlusPlusMangle.cpp result += mangle_qualified_name(name, namespaces, {}, false, prevs).full_name; result 584 src/CPlusPlusMangle.cpp result += "v"; result 588 src/CPlusPlusMangle.cpp result += mangle_type(arg.is_expr() ? arg.expr.type() : type_of<struct halide_buffer_t *>(), target, prevs); result 591 src/CPlusPlusMangle.cpp return result; result 358 src/CSE.cpp Expr result = common_subexpression_elimination(in); result 360 src/CSE.cpp result = n.mutate(result); result 361 src/CSE.cpp internal_assert(equal(result, correct)) result 363 src/CSE.cpp << "\nbecame:\n" << result result 445 src/CSE.cpp Expr result = common_subexpression_elimination(e); result 37 src/CodeGen_GPU_Dev.cpp result = false; result 42 src/CodeGen_GPU_Dev.cpp bool result; result 44 src/CodeGen_GPU_Dev.cpp IsBlockUniform() : result(true) { result 52 src/CodeGen_GPU_Dev.cpp return v.result; result 64 src/CodeGen_GPU_Dev.cpp result = false; result 66 src/CodeGen_GPU_Dev.cpp if (result) { result 74 src/CodeGen_GPU_Dev.cpp result = false; result 76 src/CodeGen_GPU_Dev.cpp if (result) { result 82 src/CodeGen_GPU_Dev.cpp bool result; result 85 src/CodeGen_GPU_Dev.cpp IsBufferConstant(const std::string &b) : result(true), buffer(b) { result 94 src/CodeGen_GPU_Dev.cpp return v.result; result 205 src/CodeGen_GPU_Host.cpp Value *result = builder->CreateCall(init, init_kernels_args); result 206 src/CodeGen_GPU_Host.cpp Value *did_succeed = builder->CreateICmpEQ(result, ConstantInt::get(i32_t, 0)); result 207 src/CodeGen_GPU_Host.cpp CodeGen_CPU::create_assertion(did_succeed, Expr(), result); result 474 src/CodeGen_GPU_Host.cpp Value *result = builder->CreateCall(dev_run_fn, launch_args); result 475 src/CodeGen_GPU_Host.cpp Value *did_succeed = builder->CreateICmpEQ(result, ConstantInt::get(i32_t, 0)); result 480 src/CodeGen_GPU_Host.cpp result); result 1066 src/CodeGen_Hexagon.cpp vector<Value *> result; result 1105 src/CodeGen_Hexagon.cpp result.push_back(result_i); result 1108 src/CodeGen_Hexagon.cpp return slice_vector(concat_vectors(result), 0, idx_elements); result 1181 src/CodeGen_Hexagon.cpp Value *result = ranges[0].first; result 1182 src/CodeGen_Hexagon.cpp llvm::Type *element_ty = result->getType()->getVectorElementType(); result 1191 src/CodeGen_Hexagon.cpp result = call_intrin(result->getType(), mux, {ranges[i].second, ranges[i].first, result}); result 1193 src/CodeGen_Hexagon.cpp return result; result 357 src/CodeGen_Internal.cpp bool get_md_bool(llvm::Metadata *value, bool &result) { result 369 src/CodeGen_Internal.cpp result = !c->isZero(); result 373 src/CodeGen_Internal.cpp bool get_md_string(llvm::Metadata *value, std::string &result) { result 375 src/CodeGen_Internal.cpp result = ""; result 380 src/CodeGen_Internal.cpp result = c->getString(); result 893 src/CodeGen_LLVM.cpp llvm::CallInst *result = builder->CreateCall(function, wrapper_args); result 895 src/CodeGen_LLVM.cpp result->setIsNoInline(); result 896 src/CodeGen_LLVM.cpp builder->CreateRet(result); result 1878 src/CodeGen_LLVM.cpp Value *result = UndefValue::get(result_type); result 1882 src/CodeGen_LLVM.cpp result = builder->CreateInsertElement(result, v, ConstantInt::get(i32_t, i)); result 1884 src/CodeGen_LLVM.cpp value = result; result 3055 src/CodeGen_LLVM.cpp Value *result = builder->CreateCall(do_par_for, args); result 3067 src/CodeGen_LLVM.cpp Value *did_succeed = builder->CreateICmpEQ(result, ConstantInt::get(i32_t, 0)); result 3068 src/CodeGen_LLVM.cpp create_assertion(did_succeed, Expr(), result); result 3329 src/CodeGen_LLVM.cpp Value *result = concat_vectors(results); result 3330 src/CodeGen_LLVM.cpp return slice_vector(result, 0, arg_lanes); result 30 src/CodeGen_OpenGLCompute_Dev.cpp Type result = type; result 35 src/CodeGen_OpenGLCompute_Dev.cpp result = Float(32); result 37 src/CodeGen_OpenGLCompute_Dev.cpp result = Bool(); result 49 src/CodeGen_OpenGLCompute_Dev.cpp result = map_type(scalar_type).with_lanes(type.lanes()); result 51 src/CodeGen_OpenGLCompute_Dev.cpp return result; result 34 src/CodeGen_OpenGL_Dev.cpp Type result = type; result 39 src/CodeGen_OpenGL_Dev.cpp result = Float(32); result 41 src/CodeGen_OpenGL_Dev.cpp result = Bool(); result 46 src/CodeGen_OpenGL_Dev.cpp result = Int(32); result 50 src/CodeGen_OpenGL_Dev.cpp result = Float(32); result 60 src/CodeGen_OpenGL_Dev.cpp result = map_type(scalar_type).with_lanes(type.lanes()); result 62 src/CodeGen_OpenGL_Dev.cpp return result; result 413 src/CodeGen_OpenGL_Dev.cpp vector<Expr> result(lanes); result 420 src/CodeGen_OpenGL_Dev.cpp result[i] = is_one(cond) ? true_value : false_value; result 422 src/CodeGen_OpenGL_Dev.cpp result[i] = Select::make(cond, true_value, false_value); result 425 src/CodeGen_OpenGL_Dev.cpp return result; result 461 src/CodeGen_OpenGL_Dev.cpp vector<Expr> result = evaluate_vector_select(op); result 464 src/CodeGen_OpenGL_Dev.cpp ids[i] = print_expr(result[i]); result 505 src/CodeGen_OpenGL_Dev.cpp vector<string> result(l); result 509 src/CodeGen_OpenGL_Dev.cpp result[i] = val; result 513 src/CodeGen_OpenGL_Dev.cpp result[i] = print_expr(simplify(r->base + i * r->stride)); result 518 src/CodeGen_OpenGL_Dev.cpp result[i] = val + "[" + std::to_string(i) + "]"; result 521 src/CodeGen_OpenGL_Dev.cpp return result; result 746 src/CodeGen_OpenGL_Dev.cpp result = false; result 753 src/CodeGen_OpenGL_Dev.cpp result = false; result 759 src/CodeGen_OpenGL_Dev.cpp bool result = true; result 780 src/CodeGen_OpenGL_Dev.cpp } else if (size <= 4 && all_access_constant.result) { result 962 src/CodeGen_OpenGL_Dev.cpp string result; result 965 src/CodeGen_OpenGL_Dev.cpp result += '$'; result 969 src/CodeGen_OpenGL_Dev.cpp result += s[i++]; result 972 src/CodeGen_OpenGL_Dev.cpp return result; result 975 src/CodeGen_OpenGL_Dev.cpp void check(Expr e, const string &result) { result 985 src/CodeGen_OpenGL_Dev.cpp if (!ends_with(src, result)) { result 988 src/CodeGen_OpenGL_Dev.cpp << " Correct source code:\n" << result result 38 src/CodeGen_X86.cpp bool should_use_pmaddwd(Expr a, Expr b, vector<Expr> &result) { result 59 src/CodeGen_X86.cpp result.swap(args); result 103 src/CodeGen_X86.cpp vector<Value *> result; result 115 src/CodeGen_X86.cpp result.push_back(slice_value); result 118 src/CodeGen_X86.cpp value = concat_vectors(result); result 138 src/CodeGen_X86.cpp vector<Value *> result; result 148 src/CodeGen_X86.cpp result.push_back(slice_value); result 151 src/CodeGen_X86.cpp value = concat_vectors(result); result 186 src/CodeGen_X86.cpp vector<Value *> result; result 192 src/CodeGen_X86.cpp result.push_back(slice_value); result 195 src/CodeGen_X86.cpp value = concat_vectors(result); result 428 src/Deinterleave.cpp Body result; result 430 src/Deinterleave.cpp result = op; result 432 src/Deinterleave.cpp result = T::make(op->name, value, body); result 438 src/Deinterleave.cpp result = T::make(op->name + ".even_lanes", extract_even_lanes(value, vector_lets), result); result 439 src/Deinterleave.cpp result = T::make(op->name + ".odd_lanes", extract_odd_lanes(value, vector_lets), result); result 442 src/Deinterleave.cpp result = T::make(op->name + ".lanes_0_of_3", extract_mod3_lanes(value, 0, vector_lets), result); result 443 src/Deinterleave.cpp result = T::make(op->name + ".lanes_1_of_3", extract_mod3_lanes(value, 1, vector_lets), result); result 444 src/Deinterleave.cpp result = T::make(op->name + ".lanes_2_of_3", extract_mod3_lanes(value, 2, vector_lets), result); result 448 src/Deinterleave.cpp return result; result 738 src/Deinterleave.cpp std::pair<Expr, Expr> result; result 34 src/DeviceInterface.cpp fn_type &result) { result 42 src/DeviceInterface.cpp result = reinterpret_bits<fn_type>(f->second.address); result 24 src/ExprUsesVar.h result = true; result 44 src/ExprUsesVar.h ExprUsesVars(const Scope<T> &v, const Scope<Expr> *s = nullptr) : vars(v), result(false) { result 47 src/ExprUsesVar.h bool result; result 57 src/ExprUsesVar.h return uses.result; result 69 src/ExprUsesVar.h return uses.result; result 131 src/FastIntegerDivide.cpp Expr result; result 159 src/FastIntegerDivide.cpp result = (cast(wide, mul) * numerator); result 161 src/FastIntegerDivide.cpp if (t.bits() < 32) result = result / (1 << t.bits()); result 162 src/FastIntegerDivide.cpp else result = result >> t.bits(); result 164 src/FastIntegerDivide.cpp result = cast(t, result); result 167 src/FastIntegerDivide.cpp result = result + (numerator - result)/2; result 170 src/FastIntegerDivide.cpp result = result >> shift; result 210 src/FastIntegerDivide.cpp result = (cast(wide, mul) * numerator); result 211 src/FastIntegerDivide.cpp if (t.bits() < 32) result = result / (1 << t.bits()); result 212 src/FastIntegerDivide.cpp else result = result >> t.bits(); result 213 src/FastIntegerDivide.cpp result = cast(t, result); result 216 src/FastIntegerDivide.cpp result = result >> shift; result 219 src/FastIntegerDivide.cpp result = xsign ^ result; result 223 src/FastIntegerDivide.cpp result = select(denominator == 1, numerator, result); result 225 src/FastIntegerDivide.cpp internal_assert(result.type() == t); result 227 src/FastIntegerDivide.cpp return result; result 51 src/Float16.cpp llvm::APFloat result) { result 57 src/Float16.cpp " to float16_t results in overflow (Result \"" << toFP16(result).to_decimal_string() << "\")\n"; result 70 src/Float16.cpp toFP16(result).to_hex_string() << result 72 src/Float16.cpp toFP16(result).to_decimal_string() << "\" in decimal)\n"; result 228 src/Float16.cpp llvm::APFloat result = toLLVMAPF(*this); result 231 src/Float16.cpp result.add(rhsAPF, getLLVMAPFRoundingMode(roundingMode)); result 232 src/Float16.cpp return toFP16(result); result 236 src/Float16.cpp llvm::APFloat result = toLLVMAPF(*this); result 239 src/Float16.cpp result.subtract(rhsAPF, getLLVMAPFRoundingMode(roundingMode)); result 240 src/Float16.cpp return toFP16(result); result 244 src/Float16.cpp llvm::APFloat result = toLLVMAPF(*this); result 247 src/Float16.cpp result.multiply(rhsAPF, getLLVMAPFRoundingMode(roundingMode)); result 248 src/Float16.cpp return toFP16(result); result 252 src/Float16.cpp llvm::APFloat result = toLLVMAPF(*this); result 255 src/Float16.cpp result.divide(rhsAPF, getLLVMAPFRoundingMode(roundingMode)); result 256 src/Float16.cpp return toFP16(result); result 260 src/Float16.cpp llvm::APFloat result = toLLVMAPF(*this); result 263 src/Float16.cpp result.remainder(rhsAPF); result 264 src/Float16.cpp return toFP16(result); result 268 src/Float16.cpp llvm::APFloat result = toLLVMAPF(*this); result 274 src/Float16.cpp result.mod(rhsAPF, getLLVMAPFRoundingMode(roundingMode)); result 276 src/Float16.cpp result.mod(rhsAPF); result 278 src/Float16.cpp return toFP16(result); result 282 src/Float16.cpp llvm::APFloat result = toLLVMAPF(*this); result 283 src/Float16.cpp result.changeSign(); result 284 src/Float16.cpp return toFP16(result); result 322 src/Float16.cpp std::string result(buffer); result 323 src/Float16.cpp return result; result 348 src/Float16.cpp llvm::SmallVector<char, 16> result; result 349 src/Float16.cpp repr.toString(result, /*FormatPrecision=*/significantDigits, /*FormatMaxPadding=*/0); result 350 src/Float16.cpp return std::string(result.begin(), result.end()); result 178 src/Generator.cpp std::vector<Type> result; result 182 src/Generator.cpp result.push_back(it->second); result 184 src/Generator.cpp return result; result 1050 src/Generator.cpp std::vector<std::string> result; result 1052 src/Generator.cpp result.push_back(i.first); result 1054 src/Generator.cpp return result; result 1435 src/Generator.cpp Module result = pipeline.compile_to_module(filter_arguments, function_name, target, linkage_type); result 1439 src/Generator.cpp result.append(map_entry.second); result 1442 src/Generator.cpp return result; result 1103 src/HexagonOptimize.cpp void visit_let(NodeType &result, const LetType *op) { result 1130 src/HexagonOptimize.cpp result = op; result 1133 src/HexagonOptimize.cpp result = LetType::make(op->name, value, body); result 1136 src/HexagonOptimize.cpp result = body; result 1137 src/HexagonOptimize.cpp bool deinterleaved_used = uses_var(result, deinterleaved_name); result 1138 src/HexagonOptimize.cpp bool interleaved_used = uses_var(result, op->name); result 1154 src/HexagonOptimize.cpp result = LetType::make(op->name, interleaved, result); result 1155 src/HexagonOptimize.cpp result = LetType::make(deinterleaved_name, deinterleaved, result); result 1158 src/HexagonOptimize.cpp result = LetType::make(deinterleaved_name, remove_interleave(value), result); result 1161 src/HexagonOptimize.cpp result = LetType::make(op->name, value, result); result 401 src/IR.cpp int64_t result = 1; result 417 src/IR.cpp result *= int_size->value; result 418 src/IR.cpp if (result > (static_cast<int64_t>(1)<<31) - 1) { result 428 src/IR.cpp return static_cast<int32_t>(result); result 501 src/IR.cpp Stmt result = stmts.back(); result 503 src/IR.cpp result = Block::make(stmts[i-1], result); result 505 src/IR.cpp return result; result 22 src/IREquality.cpp CmpResult result; result 36 src/IREquality.cpp IRComparer(IRCompareCache *c = nullptr) : result(Equal), cache(c) {} result 97 src/IREquality.cpp if (result != Equal) return result; result 100 src/IREquality.cpp result = LessThan; result 102 src/IREquality.cpp result = GreaterThan; result 105 src/IREquality.cpp return result; result 109 src/IREquality.cpp if (result != Equal) { result 110 src/IREquality.cpp return result; result 114 src/IREquality.cpp result = Equal; result 115 src/IREquality.cpp return result; result 119 src/IREquality.cpp result = Equal; result 120 src/IREquality.cpp return result; result 124 src/IREquality.cpp result = LessThan; result 125 src/IREquality.cpp return result; result 129 src/IREquality.cpp result = GreaterThan; result 130 src/IREquality.cpp return result; result 140 src/IREquality.cpp return result; result 144 src/IREquality.cpp return result; result 149 src/IREquality.cpp result = Equal; result 150 src/IREquality.cpp return result; result 156 src/IREquality.cpp if (cache && result == Equal) { result 160 src/IREquality.cpp return result; result 164 src/IREquality.cpp if (result != Equal) { result 165 src/IREquality.cpp return result; result 169 src/IREquality.cpp result = Equal; result 170 src/IREquality.cpp return result; result 174 src/IREquality.cpp result = Equal; result 175 src/IREquality.cpp return result; result 179 src/IREquality.cpp result = LessThan; result 180 src/IREquality.cpp return result; result 184 src/IREquality.cpp result = GreaterThan; result 185 src/IREquality.cpp return result; result 189 src/IREquality.cpp return result; result 195 src/IREquality.cpp return result; result 199 src/IREquality.cpp if (result != Equal) return result; result 206 src/IREquality.cpp return result; result 210 src/IREquality.cpp if (result != Equal) return result; result 214 src/IREquality.cpp result = LessThan; result 216 src/IREquality.cpp result = GreaterThan; result 219 src/IREquality.cpp return result; result 224 src/IREquality.cpp if (result != Equal) return result; result 227 src/IREquality.cpp for (size_t i = 0; (i < a.size()) && result == Equal; i++) { result 231 src/IREquality.cpp return result; result 405 src/IREquality.cpp for (size_t i = 0; (result == Equal) && (i < s->types.size()); i++) { result 408 src/IREquality.cpp for (size_t i = 0; (result == Equal) && (i < s->bounds.size()); i++) { result 449 src/IREquality.cpp for (size_t i = 0; (i < e->indices.size()) && result == Equal; i++) { result 459 src/IREquality.cpp for (size_t i = 0; (result == Equal) && (i < s->bounds.size()); i++) { result 490 src/IREquality.cpp return cmp.result == IRComparer::LessThan; result 496 src/IREquality.cpp return cmp.result == IRComparer::LessThan; result 502 src/IREquality.cpp return cmp.result == IRComparer::LessThan; result 54 src/IRMatch.cpp bool result; result 59 src/IRMatch.cpp IRMatch(Expr e, vector<Expr> &m) : result(true), matches(&m), var_matches(nullptr), expr(e) { result 61 src/IRMatch.cpp IRMatch(Expr e, map<string, Expr> &m) : result(true), matches(nullptr), var_matches(&m), expr(e) { result 78 src/IRMatch.cpp result = false; result 87 src/IRMatch.cpp result = false; result 99 src/IRMatch.cpp result = false; result 105 src/IRMatch.cpp if (result && e && types_match(op->type, e->type)) { result 109 src/IRMatch.cpp result = false; result 114 src/IRMatch.cpp if (!result) { result 119 src/IRMatch.cpp result = false; result 125 src/IRMatch.cpp result = e && (e->name == op->name); result 130 src/IRMatch.cpp result = equal(match, expr); result 140 src/IRMatch.cpp if (result && e) { result 146 src/IRMatch.cpp result = false; result 168 src/IRMatch.cpp if (result && e) { result 172 src/IRMatch.cpp result = false; result 178 src/IRMatch.cpp if (result && e) { result 186 src/IRMatch.cpp result = false; result 192 src/IRMatch.cpp if (result && e && types_match(op->type, e->type) && e->name == op->name) { result 198 src/IRMatch.cpp result = false; result 204 src/IRMatch.cpp if (result && e && e->lanes == op->lanes) { result 210 src/IRMatch.cpp result = false; result 216 src/IRMatch.cpp if (result && e && types_match(op->type, e->type)) { result 220 src/IRMatch.cpp result = false; result 226 src/IRMatch.cpp if (result && e && result 232 src/IRMatch.cpp for (size_t i = 0; result && (i < e->args.size()); i++) { result 237 src/IRMatch.cpp result = false; result 243 src/IRMatch.cpp if (result && e && e->name == op->name) { result 249 src/IRMatch.cpp result = false; result 261 src/IRMatch.cpp if (eq.result) { result 278 src/IRMatch.cpp if (eq.result) { result 30 src/IRMatch.h EXPORT bool expr_match(Expr pattern, Expr expr, std::vector<Expr> &result); result 44 src/IRMatch.h EXPORT bool expr_match(Expr pattern, Expr expr, std::map<std::string, Expr> &result); result 489 src/IROperator.cpp Expr result = evaluate_polynomial(x1, coeff, sizeof(coeff)/sizeof(coeff[0])); result 491 src/IROperator.cpp result += cast(type, exponent) * logf(2.0); result 493 src/IROperator.cpp result = select(exceptional, select(use_nan, nan, neg_inf), result); result 496 src/IROperator.cpp result = common_subexpression_elimination(result); result 498 src/IROperator.cpp return result; result 525 src/IROperator.cpp Expr result = evaluate_polynomial(x, coeff, sizeof(coeff)/sizeof(coeff[0])); result 536 src/IROperator.cpp result *= two_to_the_n; result 539 src/IROperator.cpp result = select(biased < 255, result, inf); result 540 src/IROperator.cpp result = select(biased > 0, result, make_zero(type)); result 543 src/IROperator.cpp result = common_subexpression_elimination(result); result 545 src/IROperator.cpp return result; result 583 src/IROperator.cpp Expr result = common_subexpression_elimination(sign * y); result 585 src/IROperator.cpp return result; result 589 src/IROperator.cpp Expr result; result 591 src/IROperator.cpp result = make_one(e.type()); result 593 src/IROperator.cpp result = e; result 595 src/IROperator.cpp result = make_one(e.type()) / raise_to_integer_power(e, -p); result 599 src/IROperator.cpp if (p & 1) result = y*y*e; result 600 src/IROperator.cpp else result = y*y; result 602 src/IROperator.cpp return result; result 605 src/IROperator.cpp void split_into_ands(const Expr &cond, std::vector<Expr> &result) { result 611 src/IROperator.cpp split_into_ands(a->a, result); result 612 src/IROperator.cpp split_into_ands(a->b, result); result 614 src/IROperator.cpp result.push_back(cond); result 734 src/IROperator.cpp Expr result = evaluate_polynomial(x1, coeff, sizeof(coeff)/sizeof(coeff[0])); result 735 src/IROperator.cpp result = result + cast<float>(exponent) * logf(2); result 736 src/IROperator.cpp result = common_subexpression_elimination(result); result 737 src/IROperator.cpp return result; result 755 src/IROperator.cpp Expr result = evaluate_polynomial(x, coeff, sizeof(coeff)/sizeof(coeff[0])); result 764 src/IROperator.cpp result *= two_to_the_n; result 765 src/IROperator.cpp result = common_subexpression_elimination(result); result 766 src/IROperator.cpp return result; result 797 src/IROperator.cpp Expr result = result 800 src/IROperator.cpp return result; result 833 src/IROperator.cpp Expr memoize_tag_helper(const Expr &result, const std::vector<Expr> &cache_key_values) { result 835 src/IROperator.cpp args.push_back(result); result 837 src/IROperator.cpp return Internal::Call::make(result.type(), Internal::Call::memoize_expr, result 169 src/IROperator.h EXPORT void split_into_ands(const Expr &cond, std::vector<Expr> &result); result 1805 src/IROperator.h EXPORT Expr memoize_tag_helper(const Expr &result, const std::vector<Expr> &cache_key_values); result 1836 src/IROperator.h inline NO_INLINE Expr memoize_tag(const Expr &result, Args&&... args) { result 1838 src/IROperator.h return Internal::memoize_tag_helper(result, collected_args); result 104 src/Interval.cpp Interval result = a; result 105 src/Interval.cpp result.include(b); result 106 src/Interval.cpp return result; result 121 src/Interval.cpp void check(Interval result, Interval expected, int line) { result 122 src/Interval.cpp internal_assert(equal(result.min, expected.min) && result 123 src/Interval.cpp equal(result.max, expected.max)) result 126 src/Interval.cpp << " Got [" << result.min << ", " << result.max << "]\n"; result 2138 src/Introspection.cpp int64_t result = 0; result 2145 src/Introspection.cpp result |= (uint64_t)(byte & 0x7f) << shift; result 2155 src/Introspection.cpp result |= -(1ULL << shift); result 2158 src/Introspection.cpp return result; result 2162 src/Introspection.cpp uint64_t result = 0; result 2169 src/Introspection.cpp result |= (uint64_t)(byte & 0x7f) << shift; result 2172 src/Introspection.cpp return result; result 195 src/JITModule.cpp uint8_t *result = SectionMemoryManager::allocateCodeSection(size, alignment, section_id, section_name); result 196 src/JITModule.cpp code_pages.push_back({result, size}); result 197 src/JITModule.cpp return result; result 779 src/JITModule.cpp std::vector<JITModule> result; result 781 src/JITModule.cpp JITModule m = make_module(for_module, target, MainShared, result, create); result 783 src/JITModule.cpp result.push_back(m); result 789 src/JITModule.cpp JITModule m = make_module(for_module, target, OpenCL, result, create); result 791 src/JITModule.cpp result.push_back(m); result 795 src/JITModule.cpp JITModule m = make_module(for_module, target, Metal, result, create); result 797 src/JITModule.cpp result.push_back(m); result 801 src/JITModule.cpp JITModule m = make_module(for_module, target, CUDA, result, create); result 803 src/JITModule.cpp result.push_back(m); result 807 src/JITModule.cpp JITModule m = make_module(for_module, target, OpenGL, result, create); result 809 src/JITModule.cpp result.push_back(m); result 813 src/JITModule.cpp JITModule m = make_module(for_module, target, OpenGLCompute, result, create); result 815 src/JITModule.cpp result.push_back(m); result 819 src/JITModule.cpp JITModule m = make_module(for_module, target, Hexagon, result, create); result 821 src/JITModule.cpp result.push_back(m); result 825 src/JITModule.cpp return result; result 849 src/JITModule.cpp JITHandlers result = default_handlers; result 853 src/JITModule.cpp return result; result 123 src/LLVM_Output.cpp auto result = llvm::writeArchive(dst_file, new_members, result 128 src/LLVM_Output.cpp auto result = llvm::writeArchive(dst_file, new_members, result 133 src/LLVM_Output.cpp auto result = llvm::writeArchive(dst_file, new_members, result 137 src/LLVM_Output.cpp internal_assert(!result.second) << "Failed to write archive: " << dst_file result 138 src/LLVM_Output.cpp << ", reason: " << result.second << "\n"; result 26 src/LLVM_Runtime_Linker.cpp std::unique_ptr<llvm::Module> result(std::move(*ret_val)); result 27 src/LLVM_Runtime_Linker.cpp result->setModuleIdentifier(id); result 29 src/LLVM_Runtime_Linker.cpp return result; result 13 src/Lerp.cpp Expr result; result 47 src/Lerp.cpp result = select(weight > half_weight, one_val, zero_val); result 132 src/Lerp.cpp result = zero_val * inverse_typed_weight + result 138 src/Lerp.cpp result = select(typed_weight, one_val, zero_val); result 155 src/Lerp.cpp result = Cast::make(UInt(bits, computation_type.lanes()), divided); result 170 src/Lerp.cpp result = Cast::make(result_type, result + bias_value); result 174 src/Lerp.cpp return simplify(result); result 98 src/LoopCarry.cpp result.push_back(op); result 105 src/LoopCarry.cpp vector<const Load *> result; result 121 src/LoopCarry.cpp vector<Stmt> result; result 122 src/LoopCarry.cpp block_to_vector(s, result); result 123 src/LoopCarry.cpp return result; result 227 src/LoopCarry.cpp vector<Stmt> result; result 233 src/LoopCarry.cpp result.push_back(lift_carried_values_out_of_stmt(Block::make(stores))); result 236 src/LoopCarry.cpp result.push_back(mutate(v[i])); result 240 src/LoopCarry.cpp result.push_back(lift_carried_values_out_of_stmt(Block::make(stores))); result 243 src/LoopCarry.cpp stmt = Block::make(result); result 258 src/LoopCarry.cpp debug(4) << "Found " << find_loads.result.size() << " loads\n"; result 262 src/LoopCarry.cpp for (const Load *load : find_loads.result) { result 260 src/Module.cpp Buffer<uint8_t> result(object.size(), name()); result 261 src/Module.cpp memcpy(result.data(), reinterpret_cast<uint8_t*>(&object[0]), object.size()); result 262 src/Module.cpp return result; result 79 src/ModulusRemainder.cpp ModulusRemainder result = modulus_remainder(expr); result 88 src/ModulusRemainder.cpp if (result.modulus % modulus == 0) { result 89 src/ModulusRemainder.cpp *remainder = result.remainder % modulus; result 96 src/ModulusRemainder.cpp ModulusRemainder result = modulus_remainder(expr, scope); result 98 src/ModulusRemainder.cpp if (result.modulus % modulus == 0) { result 99 src/ModulusRemainder.cpp *remainder = result.remainder % modulus; result 113 src/ModulusRemainder.cpp ModulusRemainder result = modulus_remainder(e); result 114 src/ModulusRemainder.cpp if (result.modulus != m || result.remainder != r) { result 119 src/ModulusRemainder.cpp << result.modulus << ", " result 120 src/ModulusRemainder.cpp << result.remainder << "\n"; result 19 src/Monotonic.cpp result = Monotonic::Constant; result 23 src/Monotonic.cpp result = Monotonic::Constant; result 27 src/Monotonic.cpp result = Monotonic::Constant; result 49 src/Monotonic.cpp if (result != Monotonic::Constant) { result 50 src/Monotonic.cpp result = Monotonic::Unknown; result 56 src/Monotonic.cpp result = Monotonic::Increasing; result 58 src/Monotonic.cpp result = scope.get(op->name); result 60 src/Monotonic.cpp result = Monotonic::Constant; result 94 src/Monotonic.cpp Monotonic ra = result; result 96 src/Monotonic.cpp Monotonic rb = result; result 97 src/Monotonic.cpp result = unify(ra, rb); result 102 src/Monotonic.cpp Monotonic ra = result; result 104 src/Monotonic.cpp Monotonic rb = result; result 105 src/Monotonic.cpp result = unify(ra, flip(rb)); result 110 src/Monotonic.cpp Monotonic ra = result; result 112 src/Monotonic.cpp Monotonic rb = result; result 115 src/Monotonic.cpp result = Monotonic::Constant; result 117 src/Monotonic.cpp result = rb; result 119 src/Monotonic.cpp result = ra; result 121 src/Monotonic.cpp result = flip(rb); result 123 src/Monotonic.cpp result = flip(ra); result 125 src/Monotonic.cpp result = Monotonic::Unknown; result 132 src/Monotonic.cpp Monotonic ra = result; result 134 src/Monotonic.cpp Monotonic rb = result; result 137 src/Monotonic.cpp result = Monotonic::Constant; result 139 src/Monotonic.cpp result = ra; result 141 src/Monotonic.cpp result = flip(ra); result 143 src/Monotonic.cpp result = Monotonic::Unknown; result 148 src/Monotonic.cpp result = Monotonic::Unknown; result 153 src/Monotonic.cpp Monotonic ra = result; result 155 src/Monotonic.cpp Monotonic rb = result; result 156 src/Monotonic.cpp result = unify(ra, rb); result 161 src/Monotonic.cpp Monotonic ra = result; result 163 src/Monotonic.cpp Monotonic rb = result; result 164 src/Monotonic.cpp result = unify(ra, rb); result 169 src/Monotonic.cpp Monotonic ra = result; result 171 src/Monotonic.cpp Monotonic rb = result; result 173 src/Monotonic.cpp result = Monotonic::Constant; result 175 src/Monotonic.cpp result = Monotonic::Unknown; result 189 src/Monotonic.cpp Monotonic ra = result; result 191 src/Monotonic.cpp Monotonic rb = result; result 192 src/Monotonic.cpp result = unify(flip(ra), rb); result 213 src/Monotonic.cpp Monotonic ra = result; result 215 src/Monotonic.cpp Monotonic rb = result; result 216 src/Monotonic.cpp result = unify(ra, rb); result 221 src/Monotonic.cpp Monotonic ra = result; result 223 src/Monotonic.cpp Monotonic rb = result; result 224 src/Monotonic.cpp result = unify(ra, rb); result 229 src/Monotonic.cpp result = flip(result); result 234 src/Monotonic.cpp Monotonic rcond = result; result 237 src/Monotonic.cpp Monotonic ra = result; result 239 src/Monotonic.cpp Monotonic rb = result; result 243 src/Monotonic.cpp result = unified; result 256 src/Monotonic.cpp result = ra; result 262 src/Monotonic.cpp result = Monotonic::Increasing; result 268 src/Monotonic.cpp result = Monotonic::Decreasing; result 270 src/Monotonic.cpp result = Monotonic::Unknown; result 276 src/Monotonic.cpp if (result != Monotonic::Constant) { result 277 src/Monotonic.cpp result = Monotonic::Unknown; result 300 src/Monotonic.cpp if (result != Monotonic::Constant) { result 301 src/Monotonic.cpp result = Monotonic::Unknown; result 305 src/Monotonic.cpp result = Monotonic::Constant; result 311 src/Monotonic.cpp if (result == Monotonic::Constant) { result 316 src/Monotonic.cpp scope.push(op->name, result); result 325 src/Monotonic.cpp if (result != Monotonic::Constant) { result 326 src/Monotonic.cpp result = Monotonic::Unknown; result 330 src/Monotonic.cpp result = Monotonic::Constant; result 386 src/Monotonic.cpp Monotonic result; result 395 src/Monotonic.cpp return m.result; result 98 src/PartitionLoops.cpp result = true; result 104 src/PartitionLoops.cpp bool result = false; result 110 src/PartitionLoops.cpp return h.result; result 414 src/PartitionLoops.cpp bool result = false; result 420 src/PartitionLoops.cpp result = true; result 429 src/PartitionLoops.cpp return c.result; result 700 src/PartitionLoops.cpp result = true; result 704 src/PartitionLoops.cpp bool result = false; result 710 src/PartitionLoops.cpp return l.result; result 949 src/PartitionLoops.cpp result = true; result 952 src/PartitionLoops.cpp bool result = false; result 976 src/PartitionLoops.cpp inside_innermost_loop = !c.result; result 287 src/Pipeline.cpp vector<Argument> result; result 292 src/Pipeline.cpp result.push_back(arg.arg); result 297 src/Pipeline.cpp return result; result 741 src/Pipeline.cpp std::vector<JITModule> result; result 782 src/Pipeline.cpp result.push_back(free_standing_jit_externs); result 784 src/Pipeline.cpp return result; result 70 src/Random.cpp Expr result = rng32(cast(UInt(32), e[0])); result 76 src/Random.cpp const uint64_t *ir = as_const_uint(result); result 79 src/Random.cpp result = rng32(make_const(UInt(32), (*ir) + (*ie))); result 81 src/Random.cpp result = Let::make(name, result + cast<uint32_t>(e[i]), result 85 src/Random.cpp return result; result 89 src/Random.cpp Expr result = random_int(e); result 91 src/Random.cpp result = (127 << 23) | (cast<uint32_t>(result) >> 9); result 93 src/Random.cpp return clamp(reinterpret(Float(32), result) - 1.0f, 0.0f, 1.0f); result 16 src/Reduction.cpp std::vector<Expr> result; result 17 src/Reduction.cpp split_into_ands(pred, result); result 20 src/Reduction.cpp if (result.size() != expected.size()) { result 24 src/Reduction.cpp if (!equal(simplify(result[i]), simplify(expected[i]))) { result 37 src/Reduction.cpp for (const auto &e : result) { result 44 src/ScheduleFunctions.cpp result = true; result 51 src/ScheduleFunctions.cpp bool result = false; result 58 src/ScheduleFunctions.cpp return is_not_pure.result; result 491 src/ScheduleFunctions.cpp Expr result = Variable::make(Int(32), result_name); result 493 src/ScheduleFunctions.cpp {extern_name, result}, Call::Extern); result 494 src/ScheduleFunctions.cpp Stmt check = AssertStmt::make(EQ::make(result, 0), error); result 582 src/ScheduleFunctions.cpp if (op->name == func) result = true; result 590 src/ScheduleFunctions.cpp result = true; result 595 src/ScheduleFunctions.cpp bool result; result 604 src/ScheduleFunctions.cpp return is_called.result; result 898 src/ScheduleFunctions.cpp result = true; result 903 src/ScheduleFunctions.cpp bool result = false; result 931 src/ScheduleFunctions.cpp if (!uses.result) { result 143 src/Simplify.cpp result = false; result 153 src/Simplify.cpp result = false; result 159 src/Simplify.cpp bool result = true; result 167 src/Simplify.cpp return pure.result; result 4719 src/Simplify.cpp Body result = body; result 4723 src/Simplify.cpp result = T::make(new_name, new_value, result); result 4728 src/Simplify.cpp result = T::make(op->name, value, result); result 4733 src/Simplify.cpp const T *new_op = result.template as<T>(); result 4741 src/Simplify.cpp return result; result 69 src/SimplifySpecializations.cpp vector<Definition> result; result 71 src/SimplifySpecializations.cpp result.push_back(def); result 138 src/SimplifySpecializations.cpp substitute_value_in_var(var->name, !eq->b, result); result 145 src/SimplifySpecializations.cpp substitute_value_in_var(var->name, const_false(), result); result 148 src/SimplifySpecializations.cpp simplify_using_fact(!c, result); result 151 src/SimplifySpecializations.cpp result.insert(result.end(), s_result.begin(), s_result.end()); result 154 src/SimplifySpecializations.cpp return result; result 402 src/SkipStages.cpp result &= guarded; result 441 src/SkipStages.cpp bool old_result = result; result 442 src/SkipStages.cpp result = true; result 444 src/SkipStages.cpp result = result || old_result; result 454 src/SkipStages.cpp bool result; result 466 src/SkipStages.cpp if (check.result) { result 25 src/SlidingWindow.cpp if (op->name == var) result = true; result 38 src/SlidingWindow.cpp bool result; result 41 src/SlidingWindow.cpp ExprDependsOnVar(string v) : result(false), var(v) { result 48 src/SlidingWindow.cpp return depends.result; result 73 src/SlidingWindow.cpp Expr result = ee.mutate(e); result 74 src/SlidingWindow.cpp debug(3) << "Expanded " << e << " into " << result << "\n"; result 75 src/SlidingWindow.cpp return result; result 756 src/Solve.cpp result = Interval::everything(); result 759 src/Solve.cpp result = Interval::nothing(); result 767 src/Solve.cpp result = Interval::everything(); result 770 src/Solve.cpp result = Interval::nothing(); result 800 src/Solve.cpp Interval ia = result; result 802 src/Solve.cpp Interval ib = result; result 807 src/Solve.cpp result = Interval::make_intersection(ia, ib); result 812 src/Solve.cpp result = interval_union(ia, ib); result 818 src/Solve.cpp Interval ia = result; result 820 src/Solve.cpp Interval ib = result; result 825 src/Solve.cpp result = Interval::make_intersection(ia, ib); result 830 src/Solve.cpp result = interval_union(ia, ib); result 853 src/Solve.cpp if (result.has_lower_bound() && expr_uses_var(result.min, op->name)) { result 854 src/Solve.cpp result.min = Let::make(op->name, op->value, result.min); result 856 src/Solve.cpp if (result.has_upper_bound() && expr_uses_var(result.max, op->name)) { result 857 src/Solve.cpp result.max = Let::make(op->name, op->value, result.max); result 867 src/Solve.cpp result = it->second; result 870 src/Solve.cpp solved_vars[key] = result; result 907 src/Solve.cpp cache[cond] = result; result 910 src/Solve.cpp result = it->second; result 925 src/Solve.cpp solved.result.accept(this); result 930 src/Solve.cpp result = Interval(Interval::neg_inf, le->b); result 932 src/Solve.cpp result = Interval(le->b + 1, Interval::pos_inf); result 944 src/Solve.cpp if (result.has_upper_bound()) { result 945 src/Solve.cpp result.min = Let::make(b_name, b, result.min); result 946 src/Solve.cpp result.min = Let::make(c_name, c, result.min); result 948 src/Solve.cpp if (result.has_upper_bound()) { result 949 src/Solve.cpp result.max = Let::make(b_name, b, result.max); result 950 src/Solve.cpp result.max = Let::make(c_name, c, result.max); result 958 src/Solve.cpp if (result.has_lower_bound()) { result 959 src/Solve.cpp result.min = Let::make(b_name, b, result.min); result 960 src/Solve.cpp result.min = Let::make(c_name, c, result.min); result 962 src/Solve.cpp if (result.has_upper_bound()) { result 963 src/Solve.cpp result.max = Let::make(b_name, b, result.max); result 964 src/Solve.cpp result.max = Let::make(c_name, c, result.max); result 982 src/Solve.cpp solved.result.accept(this); result 987 src/Solve.cpp result = Interval(ge->b, Interval::pos_inf); result 989 src/Solve.cpp result = Interval(Interval::neg_inf, ge->b - 1); result 998 src/Solve.cpp if (result.has_lower_bound()) { result 999 src/Solve.cpp result.min = Let::make(b_name, b, result.min); result 1000 src/Solve.cpp result.min = Let::make(c_name, c, result.min); result 1002 src/Solve.cpp if (result.has_upper_bound()) { result 1003 src/Solve.cpp result.max = Let::make(b_name, b, result.max); result 1004 src/Solve.cpp result.max = Let::make(c_name, c, result.max); result 1012 src/Solve.cpp if (result.has_lower_bound()) { result 1013 src/Solve.cpp result.min = Let::make(b_name, b, result.min); result 1014 src/Solve.cpp result.min = Let::make(c_name, c, result.min); result 1016 src/Solve.cpp if (result.has_upper_bound()) { result 1017 src/Solve.cpp result.max = Let::make(b_name, b, result.max); result 1018 src/Solve.cpp result.max = Let::make(c_name, c, result.max); result 1065 src/Solve.cpp Interval result; result 1329 src/Solve.cpp internal_assert(s.result.min.defined() && s.result.max.defined()) result 1331 src/Solve.cpp s.result.min = simplify(common_subexpression_elimination(s.result.min)); result 1332 src/Solve.cpp s.result.max = simplify(common_subexpression_elimination(s.result.max)); result 1333 src/Solve.cpp if (s.result.is_bounded() && result 1334 src/Solve.cpp can_prove(s.result.min > s.result.max)) { result 1337 src/Solve.cpp return s.result; result 1343 src/Solve.cpp internal_assert(s.result.min.defined() && s.result.max.defined()) result 1345 src/Solve.cpp s.result.min = simplify(common_subexpression_elimination(s.result.min)); result 1346 src/Solve.cpp s.result.max = simplify(common_subexpression_elimination(s.result.max)); result 1347 src/Solve.cpp if (s.result.is_bounded() && result 1348 src/Solve.cpp can_prove(s.result.min > s.result.max)) { result 1351 src/Solve.cpp return s.result; result 1365 src/Solve.cpp internal_assert(equal(solved.result, b)) result 1367 src/Solve.cpp << " solved to " << solved.result << "\n" result 1372 src/Solve.cpp Interval result = result 1376 src/Solve.cpp result.min = simplify(result.min); result 1377 src/Solve.cpp result.max = simplify(result.max); result 1378 src/Solve.cpp internal_assert(equal(result.min, i.min) && equal(result.max, i.max)) result 1380 src/Solve.cpp << " min: " << result.min << "\n" result 1381 src/Solve.cpp << " max: " << result.max << "\n" result 1396 src/Solve.cpp void check_and_condition(Expr orig, Expr result, Interval i) { result 1400 src/Solve.cpp internal_assert(equal(cond, result)) result 1403 src/Solve.cpp << " instead of " << result << "\n"; result 1435 src/Solve.cpp internal_assert(solved.fully_solved && solved.result.as<Let>()); result 1449 src/Solve.cpp Expr out = simplify(solved.result); result 1470 src/Solve.cpp internal_assert(solved.fully_solved && solved.result.defined()); result 1554 src/Solve.cpp Interval result = solve_for_outer_interval(test, "z"); result 14 src/Solve.h Expr result; result 38 src/SplitTuples.cpp result = true; result 44 src/SplitTuples.cpp UsesExternImage() : result(false) {} result 45 src/SplitTuples.cpp bool result; result 51 src/SplitTuples.cpp return uses.result; result 181 src/SplitTuples.cpp Stmt result = Block::make(provides); result 186 src/SplitTuples.cpp result = LetStmt::make(p.first, p.second, result); result 189 src/SplitTuples.cpp stmt = result; result 191 src/Target.cpp bool lookup_os(const std::string &tok, Target::OS &result) { result 194 src/Target.cpp result = os_iter->second; result 209 src/Target.cpp bool lookup_arch(const std::string &tok, Target::Arch &result) { result 212 src/Target.cpp result = arch_iter->second; result 266 src/Target.cpp bool lookup_feature(const std::string &tok, Target::Feature &result) { result 269 src/Target.cpp result = feature_iter->second; result 445 src/Target.cpp string result; result 448 src/Target.cpp result += arch_entry.first; result 452 src/Target.cpp result += "-" + std::to_string(bits); result 455 src/Target.cpp result += "-" + os_entry.first; result 461 src/Target.cpp result += "-" + feature_entry.first; result 464 src/Target.cpp return result; result 42 src/ThreadPool.h std::promise<T> result; result 129 src/ThreadPool.h std::future<T> result = jobs.back().result.get_future(); result 134 src/ThreadPool.h return result; result 143 src/ThreadPool.h result.set_value(std::move(r)); result 151 src/ThreadPool.h result.set_value(); result 46 src/TrimNoOps.cpp result = true; result 54 src/TrimNoOps.cpp bool result = false; result 61 src/TrimNoOps.cpp return l.result; result 223 src/TrimNoOps.cpp test = solved.result; result 115 src/Tuple.h Tuple result(std::vector<Expr>(condition.size())); result 116 src/Tuple.h for (size_t i = 0; i < result.size(); i++) { result 117 src/Tuple.h result[i] = select(condition[i], true_value[i], false_value[i]); result 119 src/Tuple.h return result; result 123 src/Tuple.h Tuple result(std::vector<Expr>(true_value.size())); result 124 src/Tuple.h for (size_t i = 0; i < result.size(); i++) { result 125 src/Tuple.h result[i] = select(condition, true_value[i], false_value[i]); result 127 src/Tuple.h return result; result 180 src/Util.cpp string result = str; result 181 src/Util.cpp while ((pos = result.find(find, pos)) != string::npos) { result 182 src/Util.cpp result.replace(pos, find.length(), replace); result 185 src/Util.cpp return result; result 223 src/Util.cpp std::string result = namespaces.back(); result 225 src/Util.cpp return result; result 341 src/Util.cpp BOOL result = CreateDirectoryA(dir.c_str(), nullptr); result 342 src/Util.cpp if (result) { result 359 src/Util.cpp char* result = mkdtemp(&buf[0]); result 360 src/Util.cpp internal_assert(result != nullptr) << "Unable to create temp directory.\n"; result 361 src/Util.cpp return std::string(result); result 114 src/Util.h T result; result 116 src/Util.h return result; result 118 src/Util.h result = vec[0]; result 120 src/Util.h result = f(result, vec[i]); result 122 src/Util.h return result; result 129 src/Util.h T result; result 131 src/Util.h return result; result 133 src/Util.h result = vec.back(); result 135 src/Util.h result = f(vec[i-1], result); result 137 src/Util.h return result; result 880 src/VectorizeLoops.cpp Expr result; result 897 src/VectorizeLoops.cpp result = Broadcast::make(e, lanes); result 900 src/VectorizeLoops.cpp result = Select::make(cond, Broadcast::make(e, lanes), result); result 904 src/VectorizeLoops.cpp debug(0) << e << " -> " << result << "\n"; result 906 src/VectorizeLoops.cpp return result; result 796 src/runtime/HalideRuntime.h extern int halide_error_bounds_inference_call_failed(void *user_context, const char *extern_stage_name, int result); result 800 src/runtime/HalideRuntime.h extern int halide_error_extern_stage_failed(void *user_context, const char *extern_stage_name, int result); result 10 src/runtime/can_use_target.cpp halide_can_use_target_features_t result = custom_can_use_target_features; result 12 src/runtime/can_use_target.cpp return result; result 352 src/runtime/cuda.cpp CUresult result = cuPointerGetAttribute(&ctx, CU_POINTER_ATTRIBUTE_CONTEXT, dev_ptr); result 353 src/runtime/cuda.cpp if (result) { result 356 src/runtime/cuda.cpp << get_error_name(result); result 51 src/runtime/cuda_functions.h CUDA_FN(CUresult, cuPointerGetAttribute, (void *result, int query, CUdeviceptr ptr)); result 44 src/runtime/device_interface.cpp int result = interface->copy_to_host(user_context, buf); result 45 src/runtime/device_interface.cpp if (result != 0) { result 52 src/runtime/device_interface.cpp return result; result 81 src/runtime/device_interface.cpp int result = 0; result 105 src/runtime/device_interface.cpp result = copy_to_host_already_locked(user_context, buf); result 106 src/runtime/device_interface.cpp if (result != 0) { result 108 src/runtime/device_interface.cpp return result; result 111 src/runtime/device_interface.cpp result = halide_device_free(user_context, buf); result 112 src/runtime/device_interface.cpp if (result != 0) { result 114 src/runtime/device_interface.cpp return result; result 120 src/runtime/device_interface.cpp result = halide_device_malloc(user_context, buf, device_interface); result 121 src/runtime/device_interface.cpp if (result != 0) { result 124 src/runtime/device_interface.cpp return result; result 134 src/runtime/device_interface.cpp result = device_interface->copy_to_device(user_context, buf); result 135 src/runtime/device_interface.cpp if (result == 0) { result 159 src/runtime/device_interface.cpp int result = device_interface->device_sync(user_context, buf); result 160 src/runtime/device_interface.cpp if (result) { result 188 src/runtime/device_interface.cpp int result = device_interface->device_malloc(user_context, buf); result 191 src/runtime/device_interface.cpp if (result) { result 209 src/runtime/device_interface.cpp int result = device_interface->device_free(user_context, buf); result 212 src/runtime/device_interface.cpp if (result) { result 258 src/runtime/device_interface.cpp int result = device_interface->device_and_host_malloc(user_context, buf); result 261 src/runtime/device_interface.cpp if (result) { result 280 src/runtime/device_interface.cpp int result = device_interface->device_and_host_free(user_context, buf); result 283 src/runtime/device_interface.cpp if (result) { result 307 src/runtime/device_interface.cpp int result = halide_device_malloc(user_context, buf, device_interface); result 308 src/runtime/device_interface.cpp if (result != 0) { result 312 src/runtime/device_interface.cpp return result; result 317 src/runtime/device_interface.cpp int result = halide_device_free(user_context, buf); result 324 src/runtime/device_interface.cpp return result; result 6 src/runtime/errors.cpp WEAK int halide_error_bounds_inference_call_failed(void *user_context, const char *extern_stage_name, int result) { result 9 src/runtime/errors.cpp << " returned non-zero value: " << result; result 10 src/runtime/errors.cpp return result; result 13 src/runtime/errors.cpp WEAK int halide_error_extern_stage_failed(void *user_context, const char *extern_stage_name, int result) { result 16 src/runtime/errors.cpp << " returned non-zero value: " << result; result 17 src/runtime/errors.cpp return result; result 18 src/runtime/fake_thread_pool.cpp int result = halide_do_task(user_context, f, x, closure); result 19 src/runtime/fake_thread_pool.cpp if (result) { result 20 src/runtime/fake_thread_pool.cpp return result; result 59 src/runtime/fake_thread_pool.cpp halide_do_task_t result = custom_do_task; result 61 src/runtime/fake_thread_pool.cpp return result; result 65 src/runtime/fake_thread_pool.cpp halide_do_par_for_t result = custom_do_par_for; result 67 src/runtime/fake_thread_pool.cpp return result; result 13 src/runtime/float16_t.cpp } result; result 40 src/runtime/float16_t.cpp result.asUInt = signMask | (reEncodedExponent << 23) | newSignificand; result 63 src/runtime/float16_t.cpp result.asUInt = signMask | (reEncodedExponent << 23) | significandBits; result 65 src/runtime/float16_t.cpp return result.asFloat; result 107 src/runtime/gcd_thread_pool.cpp int result = halide_do_task(user_context, f, x, closure); result 108 src/runtime/gcd_thread_pool.cpp if (result) { result 109 src/runtime/gcd_thread_pool.cpp return result; result 165 src/runtime/gcd_thread_pool.cpp halide_do_task_t result = custom_do_task; result 167 src/runtime/gcd_thread_pool.cpp return result; result 171 src/runtime/gcd_thread_pool.cpp halide_do_par_for_t result = custom_do_par_for; result 173 src/runtime/gcd_thread_pool.cpp return result; result 69 src/runtime/hexagon_host.cpp int result = remote_poll_log(&message[0], sizeof(message), &read); result 70 src/runtime/hexagon_host.cpp if (result != 0) { result 73 src/runtime/hexagon_host.cpp print(user_context) << "Hexagon: remote_poll_log failed " << result << "\n"; result 178 src/runtime/hexagon_host.cpp int result = init_hexagon_runtime(user_context); result 179 src/runtime/hexagon_host.cpp return result == 0; result 184 src/runtime/hexagon_host.cpp int result = init_hexagon_runtime(user_context); result 185 src/runtime/hexagon_host.cpp if (result != 0) return result; result 220 src/runtime/hexagon_host.cpp result = remote_initialize_kernels(code, code_size, &module); result 222 src/runtime/hexagon_host.cpp if (result == 0) { result 227 src/runtime/hexagon_host.cpp debug(user_context) << " " << result << "\n"; result 239 src/runtime/hexagon_host.cpp return result != 0 ? -1 : 0; result 283 src/runtime/hexagon_host.cpp int result = init_hexagon_runtime(user_context); result 284 src/runtime/hexagon_host.cpp if (result != 0) return result; result 297 src/runtime/hexagon_host.cpp int result = remote_get_symbol(module, name, strlen(name) + 1, &sym); result 298 src/runtime/hexagon_host.cpp *function = result == 0 ? sym : 0; result 346 src/runtime/hexagon_host.cpp result = remote_run(module, *function, result 351 src/runtime/hexagon_host.cpp debug(user_context) << " " << result << "\n"; result 352 src/runtime/hexagon_host.cpp if (result != 0) { result 354 src/runtime/hexagon_host.cpp return result; result 364 src/runtime/hexagon_host.cpp return result != 0 ? -1 : 0; result 379 src/runtime/hexagon_host.cpp int result = remote_release_kernels(state->module); result 381 src/runtime/hexagon_host.cpp debug(user_context) << " " << result << "\n"; result 402 src/runtime/hexagon_host.cpp int result = init_hexagon_runtime(user_context); result 403 src/runtime/hexagon_host.cpp if (result != 0) return result; result 625 src/runtime/hexagon_host.cpp int result = halide_hexagon_device_malloc(user_context, buf); result 626 src/runtime/hexagon_host.cpp if (result == 0) { result 629 src/runtime/hexagon_host.cpp return result; result 640 src/runtime/hexagon_host.cpp int result = init_hexagon_runtime(user_context); result 641 src/runtime/hexagon_host.cpp if (result != 0) return result; result 655 src/runtime/hexagon_host.cpp result = remote_power_hvx_on(); result 656 src/runtime/hexagon_host.cpp debug(user_context) << " " << result << "\n"; result 657 src/runtime/hexagon_host.cpp if (result != 0) { result 659 src/runtime/hexagon_host.cpp return result; result 671 src/runtime/hexagon_host.cpp int result = init_hexagon_runtime(user_context); result 672 src/runtime/hexagon_host.cpp if (result != 0) return result; result 686 src/runtime/hexagon_host.cpp result = remote_power_hvx_off(); result 687 src/runtime/hexagon_host.cpp debug(user_context) << " " << result << "\n"; result 688 src/runtime/hexagon_host.cpp if (result != 0) { result 690 src/runtime/hexagon_host.cpp return result; result 706 src/runtime/hexagon_host.cpp int result = init_hexagon_runtime(user_context); result 707 src/runtime/hexagon_host.cpp if (result != 0) return result; result 716 src/runtime/hexagon_host.cpp result = remote_set_performance_mode(mode); result 717 src/runtime/hexagon_host.cpp debug(user_context) << " " << result << "\n"; result 718 src/runtime/hexagon_host.cpp if (result != 0) { result 720 src/runtime/hexagon_host.cpp return result; result 727 src/runtime/hexagon_host.cpp int result = init_hexagon_runtime(user_context); result 728 src/runtime/hexagon_host.cpp if (result != 0) return result; result 737 src/runtime/hexagon_host.cpp result = remote_set_performance(perf->set_mips, result 746 src/runtime/hexagon_host.cpp debug(user_context) << " " << result << "\n"; result 747 src/runtime/hexagon_host.cpp if (result != 0) { result 749 src/runtime/hexagon_host.cpp return result; result 164 src/runtime/hexagon_remote/halide_remote.cpp int result = set_runtime(halide_malloc, result 173 src/runtime/hexagon_remote/halide_remote.cpp if (result != 0) { result 179 src/runtime/hexagon_remote/halide_remote.cpp log_printf("set_runtime failed (%d)\n", result); result 180 src/runtime/hexagon_remote/halide_remote.cpp return result; result 195 src/runtime/hexagon_remote/halide_remote.cpp int result = HAP_power_set(NULL, &request); result 196 src/runtime/hexagon_remote/halide_remote.cpp if (0 != result) { result 197 src/runtime/hexagon_remote/halide_remote.cpp log_printf("HAP_power_set(HAP_power_set_HVX) failed (%d)\n", result); result 212 src/runtime/hexagon_remote/halide_remote.cpp int result = HAP_power_set(NULL, &request); result 213 src/runtime/hexagon_remote/halide_remote.cpp if (0 != result) { result 214 src/runtime/hexagon_remote/halide_remote.cpp log_printf("HAP_power_set(HAP_power_set_HVX) failed (%d)\n", result); result 402 src/runtime/hexagon_remote/halide_remote.cpp int result = halide_hexagon_remote_power_hvx_on(); result 403 src/runtime/hexagon_remote/halide_remote.cpp if (result != 0) { result 404 src/runtime/hexagon_remote/halide_remote.cpp return result; result 408 src/runtime/hexagon_remote/halide_remote.cpp result = run_context.run(pipeline, args); result 413 src/runtime/hexagon_remote/halide_remote.cpp return result; result 24 src/runtime/hexagon_remote/pipeline_context.h int result; result 32 src/runtime/hexagon_remote/pipeline_context.h result = function(args); result 91 src/runtime/hexagon_remote/pipeline_context.h int result = this->result; result 93 src/runtime/hexagon_remote/pipeline_context.h return result; result 240 src/runtime/hexagon_remote/sim_host.cpp HEX_4u_t result; result 241 src/runtime/hexagon_remote/sim_host.cpp state = sim->Run(&result); result 134 src/runtime/hexagon_remote/sim_remote.cpp int result = halide_do_task(user_context, f, x, closure); result 135 src/runtime/hexagon_remote/sim_remote.cpp if (result) { result 136 src/runtime/hexagon_remote/sim_remote.cpp return result; result 322 src/runtime/hexagon_remote/sim_remote.cpp int result = set_runtime(halide_malloc, result 331 src/runtime/hexagon_remote/sim_remote.cpp if (result != 0) { result 338 src/runtime/hexagon_remote/sim_remote.cpp return result; result 386 src/runtime/matlab.cpp int32_t &result = *result_ptr; result 389 src/runtime/matlab.cpp result = halide_error_code_generic_error; result 400 src/runtime/matlab.cpp return result; result 408 src/runtime/matlab.cpp return result; result 422 src/runtime/matlab.cpp result = halide_matlab_array_to_halide_buffer_t(user_context, arg, arg_metadata, buf); result 423 src/runtime/matlab.cpp if (result != 0) { result 425 src/runtime/matlab.cpp return result; result 432 src/runtime/matlab.cpp result = halide_matlab_array_to_scalar(user_context, arg, arg_metadata, scalar); result 433 src/runtime/matlab.cpp if (result != 0) { result 435 src/runtime/matlab.cpp return result; result 441 src/runtime/matlab.cpp result = pipeline(args); result 458 src/runtime/matlab.cpp return result; result 67 src/runtime/metal.cpp mtl_compute_pipeline_state *result = (*method)(device, sel_getUid("newComputePipelineStateWithFunction:error:"), result 69 src/runtime/metal.cpp if (result == NULL) { result 73 src/runtime/metal.cpp return result; result 132 src/runtime/metal.cpp mtl_library *result = (*method2)(device, sel_getUid("newLibraryWithSource:options:error:"), result 138 src/runtime/metal.cpp if (result == NULL) { result 142 src/runtime/metal.cpp return result; result 149 src/runtime/metal.cpp mtl_function *result = (*method)(library, sel_getUid("newFunctionWithName:"), name_str); result 151 src/runtime/metal.cpp return result; result 730 src/runtime/metal.cpp int result = halide_metal_device_malloc(user_context, buffer); result 731 src/runtime/metal.cpp if (result == 0) { result 739 src/runtime/metal.cpp return result; result 22 src/runtime/noos.cpp halide_malloc_t result = custom_malloc; result 24 src/runtime/noos.cpp return result; result 28 src/runtime/noos.cpp halide_free_t result = custom_free; result 30 src/runtime/noos.cpp return result; result 42 src/runtime/noos.cpp halide_print_t result = error_handler; result 44 src/runtime/noos.cpp return result; result 52 src/runtime/noos.cpp halide_print_t result = custom_print; result 54 src/runtime/noos.cpp return result; result 58 src/runtime/noos.cpp halide_do_task_t result = custom_do_task; result 60 src/runtime/noos.cpp return result; result 64 src/runtime/noos.cpp halide_do_par_for_t result = custom_do_par_for; result 66 src/runtime/noos.cpp return result; result 70 src/runtime/noos.cpp halide_get_symbol_t result = custom_get_symbol; result 72 src/runtime/noos.cpp return result; result 76 src/runtime/noos.cpp halide_load_library_t result = custom_load_library; result 78 src/runtime/noos.cpp return result; result 82 src/runtime/noos.cpp halide_get_library_symbol_t result = custom_get_library_symbol; result 84 src/runtime/noos.cpp return result; result 225 src/runtime/opencl.cpp cl_int result = clGetMemObjectInfo(dev_ptr, CL_MEM_SIZE, sizeof(size_t), &real_size, NULL); result 226 src/runtime/opencl.cpp if (result != CL_SUCCESS) { result 229 src/runtime/opencl.cpp << get_opencl_error_name(result); result 486 src/runtime/opencl.cpp cl_int result = clReleaseMemObject((cl_mem)dev_ptr); result 492 src/runtime/opencl.cpp if (result != CL_SUCCESS) { result 495 src/runtime/opencl.cpp return result; result 88 src/runtime/opengl.cpp const char *result; result 91 src/runtime/opengl.cpp result = "GL_INVALID_ENUM"; result 94 src/runtime/opengl.cpp result = "GL_INVALID_VALUE"; result 97 src/runtime/opengl.cpp result = "GL_INVALID_OPERATION"; result 100 src/runtime/opengl.cpp result = "GL_STACK_OVERFLOW"; result 103 src/runtime/opengl.cpp result = "GL_STACK_UNDERFLOW"; result 106 src/runtime/opengl.cpp result = "GL_OUT_OF_MEMORY"; result 109 src/runtime/opengl.cpp result = "GL_INVALID_FRAMEBUFFER_OPERATION"; result 112 src/runtime/opengl.cpp result = "GL_CONTEXT_LOST"; result 115 src/runtime/opengl.cpp result = "GL_TABLE_TOO_LARGE"; result 118 src/runtime/opengl.cpp result = "<unknown GL error>"; result 121 src/runtime/opengl.cpp return result; result 1076 src/runtime/opengl.cpp int result = 0; result 1081 src/runtime/opengl.cpp result = 1; result 1092 src/runtime/opengl.cpp return result; result 43 src/runtime/osx_get_symbol.cpp halide_get_symbol_t result = custom_get_symbol; result 45 src/runtime/osx_get_symbol.cpp return result; result 49 src/runtime/osx_get_symbol.cpp halide_load_library_t result = custom_load_library; result 51 src/runtime/osx_get_symbol.cpp return result; result 55 src/runtime/osx_get_symbol.cpp halide_get_library_symbol_t result = custom_get_library_symbol; result 57 src/runtime/osx_get_symbol.cpp return result; result 38 src/runtime/posix_allocator.cpp halide_malloc_t result = custom_malloc; result 40 src/runtime/posix_allocator.cpp return result; result 44 src/runtime/posix_allocator.cpp halide_free_t result = custom_free; result 46 src/runtime/posix_allocator.cpp return result; result 33 src/runtime/posix_error_handler.cpp halide_error_handler_t result = error_handler; result 35 src/runtime/posix_error_handler.cpp return result; result 41 src/runtime/posix_get_symbol.cpp halide_get_symbol_t result = custom_get_symbol; result 43 src/runtime/posix_get_symbol.cpp return result; result 47 src/runtime/posix_get_symbol.cpp halide_load_library_t result = custom_load_library; result 49 src/runtime/posix_get_symbol.cpp return result; result 53 src/runtime/posix_get_symbol.cpp halide_get_library_symbol_t result = custom_get_library_symbol; result 55 src/runtime/posix_get_symbol.cpp return result; result 18 src/runtime/posix_print.cpp halide_print_t result = custom_print; result 20 src/runtime/posix_print.cpp return result; result 43 src/runtime/qurt_allocator.cpp halide_malloc_t result = custom_malloc; result 45 src/runtime/qurt_allocator.cpp return result; result 49 src/runtime/qurt_allocator.cpp halide_free_t result = custom_free; result 51 src/runtime/qurt_allocator.cpp return result; result 29 src/runtime/qurt_hvx.cpp int result = qurt_hvx_lock(mode); result 30 src/runtime/qurt_hvx.cpp debug(user_context) << " " << result << "\n"; result 31 src/runtime/qurt_hvx.cpp if (result != QURT_EOK) { result 41 src/runtime/qurt_hvx.cpp int result = qurt_hvx_unlock(); result 42 src/runtime/qurt_hvx.cpp debug(user_context) << " " << result << "\n"; result 43 src/runtime/qurt_hvx.cpp if (result != QURT_EOK) { result 19 src/runtime/thread_pool.cpp halide_do_task_t result = custom_do_task; result 21 src/runtime/thread_pool.cpp return result; result 25 src/runtime/thread_pool.cpp halide_do_par_for_t result = custom_do_par_for; result 27 src/runtime/thread_pool.cpp return result; result 136 src/runtime/thread_pool_common.h int result = halide_do_task(myjob.user_context, myjob.f, myjob.next, result 141 src/runtime/thread_pool_common.h if (result) { result 142 src/runtime/thread_pool_common.h job->exit_status = result; result 171 src/runtime/tracing.cpp trace_fn result = halide_custom_trace; result 173 src/runtime/tracing.cpp return result; result 46 src/runtime/windows_get_symbol.cpp halide_get_symbol_t result = custom_get_symbol; result 48 src/runtime/windows_get_symbol.cpp return result; result 52 src/runtime/windows_get_symbol.cpp halide_load_library_t result = custom_load_library; result 54 src/runtime/windows_get_symbol.cpp return result; result 58 src/runtime/windows_get_symbol.cpp halide_get_library_symbol_t result = custom_get_library_symbol; result 60 src/runtime/windows_get_symbol.cpp return result; result 50 test/common/check_call_graphs.h inline int check_call_graphs(CallGraphs &result, CallGraphs &expected) { result 51 test/common/check_call_graphs.h if (result.size() != expected.size()) { result 52 test/common/check_call_graphs.h printf("Expect %d callers instead of %d\n", (int)expected.size(), (int)result.size()); result 56 test/common/check_call_graphs.h if (result.count(iter.first) == 0) { result 61 test/common/check_call_graphs.h std::vector<std::string> &result_callees = result[iter.first]; result 9 test/correctness/align_bounds.cpp result = true; result 12 test/correctness/align_bounds.cpp bool result = false; result 44 test/correctness/align_bounds.cpp if (checker.result) { result 51 test/correctness/align_bounds.cpp Buffer<int> result = h.realize(10); result 55 test/correctness/align_bounds.cpp if (result(i) != correct) { result 57 test/correctness/align_bounds.cpp i, result(i), correct); result 70 test/correctness/align_bounds.cpp assert(result.data()); result 71 test/correctness/align_bounds.cpp h.realize(result); result 78 test/correctness/align_bounds.cpp assert(result.data()); result 80 test/correctness/align_bounds.cpp h.realize(result); result 107 test/correctness/align_bounds.cpp if (checker.result) { result 114 test/correctness/align_bounds.cpp Buffer<int> result = h.realize(10); result 118 test/correctness/align_bounds.cpp if (result(i) != correct) { result 120 test/correctness/align_bounds.cpp i, result(i), correct); result 133 test/correctness/align_bounds.cpp h.realize(result); result 141 test/correctness/align_bounds.cpp h.realize(result); result 20 test/correctness/bool_compute_root_vectorize.cpp int32_t result = evaluate_may_gpu<int32_t>(sum(selector(range.x, range.y))); result 22 test/correctness/bool_compute_root_vectorize.cpp assert(result == 4950); result 40 test/correctness/boundary_conditions.cpp Buffer<T> result(test_extent_x, test_extent_y); result 41 test/correctness/boundary_conditions.cpp result.set_min(test_min_x, test_min_y); result 44 test/correctness/boundary_conditions.cpp f.realize(result, t); result 45 test/correctness/boundary_conditions.cpp result.copy_to_host(); result 50 test/correctness/boundary_conditions.cpp success &= expect_eq(result(x, y), exterior); result 52 test/correctness/boundary_conditions.cpp success &= expect_eq(result(x, y), input(x, y)); result 66 test/correctness/boundary_conditions.cpp Buffer<T> result(test_extent_x, test_extent_y); result 67 test/correctness/boundary_conditions.cpp result.set_min(test_min_x, test_min_y); result 70 test/correctness/boundary_conditions.cpp f.realize(result, t); result 71 test/correctness/boundary_conditions.cpp result.copy_to_host(); result 77 test/correctness/boundary_conditions.cpp success &= expect_eq(result(x, y), input(clamped_x, clamped_y)); result 90 test/correctness/boundary_conditions.cpp Buffer<T> result(test_extent_x, test_extent_y); result 91 test/correctness/boundary_conditions.cpp result.set_min(test_min_x, test_min_y); result 94 test/correctness/boundary_conditions.cpp f.realize(result, t); result 95 test/correctness/boundary_conditions.cpp result.copy_to_host(); result 105 test/correctness/boundary_conditions.cpp success &= expect_eq(result(x, y), input(mapped_x, mapped_y)); result 118 test/correctness/boundary_conditions.cpp Buffer<T> result(test_extent_x, test_extent_y); result 119 test/correctness/boundary_conditions.cpp result.set_min(test_min_x, test_min_y); result 122 test/correctness/boundary_conditions.cpp f.realize(result, t); result 123 test/correctness/boundary_conditions.cpp result.copy_to_host(); result 137 test/correctness/boundary_conditions.cpp success &= expect_eq(result(x, y), input(mapped_x, mapped_y)); result 150 test/correctness/boundary_conditions.cpp Buffer<T> result(test_extent_x, test_extent_y); result 151 test/correctness/boundary_conditions.cpp result.set_min(test_min_x, test_min_y); result 154 test/correctness/boundary_conditions.cpp f.realize(result, t); result 155 test/correctness/boundary_conditions.cpp result.copy_to_host(); result 168 test/correctness/boundary_conditions.cpp success &= expect_eq(result(x, y), input(mapped_x, mapped_y)); result 14 test/correctness/bounds_inference_outer_split.cpp result = op->extents[0]; result 21 test/correctness/bounds_inference_outer_split.cpp Expr result; result 71 test/correctness/bounds_inference_outer_split.cpp if (!is_const(checker.result, 512)) { result 38 test/correctness/cascaded_filters.cpp Buffer<float> result = stages.back().realize(10); result 41 test/correctness/cascaded_filters.cpp float err = evaluate_may_gpu<float>(sum(abs(result(RDom(result)) - 1.0f))); result 38 test/correctness/compute_outermost.cpp Buffer<int> result = out.realize(256, 256); result 42 test/correctness/compute_outermost.cpp if (result(x, y) != correct) { result 44 test/correctness/compute_outermost.cpp x, y, result(x, y), correct); result 100 test/correctness/exception.cpp Buffer<float> result = f2.realize(10); result 103 test/correctness/exception.cpp if (result(i) != correct) { result 105 test/correctness/exception.cpp << ") = " << result(i) result 137 test/correctness/exception.cpp Buffer<int> result = f3.realize(4); result 14 test/correctness/explicit_inline_reductions.cpp Buffer<int> result = f.realize(10, 10); result 55 test/correctness/extern_consumer.cpp char result[1024]; result 56 test/correctness/extern_consumer.cpp size_t bytes_read = fread(&result[0], 1, 1023, f); result 57 test/correctness/extern_consumer.cpp result[bytes_read] = 0; result 60 test/correctness/extern_consumer.cpp if (strncmp(result, correct, 1023)) { result 61 test/correctness/extern_consumer.cpp printf("Incorrect output: %s\n", result); result 64 test/correctness/extern_output_expansion.cpp Buffer<int32_t> result = h.realize(100); result 68 test/correctness/extern_output_expansion.cpp if (result(i) != correct) { result 69 test/correctness/extern_output_expansion.cpp printf("result(%d) = %d instead of %d\n", i, result(i), correct); result 94 test/correctness/extern_stage.cpp Buffer<uint8_t> result = h.realize(100); result 98 test/correctness/extern_stage.cpp if (result(i) != correct) { result 99 test/correctness/extern_stage.cpp printf("result(%d) = %d instead of %d\n", i, result(i), correct); result 35 test/correctness/external_code.cpp Func result; result 36 test/correctness/external_code.cpp result(x, y) = f_extern(x, y); result 38 test/correctness/external_code.cpp Module module = result.compile_to_module({}, "forty_two", target); result 71 test/correctness/gpu_mixed_shared_mem_types.cpp int result; result 73 test/correctness/gpu_mixed_shared_mem_types.cpp result = check_result<uint32_t>(output, n_types - 2, offset); result 75 test/correctness/gpu_mixed_shared_mem_types.cpp result = check_result<uint64_t>(output, n_types, offset); result 77 test/correctness/gpu_mixed_shared_mem_types.cpp if (result != 0) { result 78 test/correctness/gpu_mixed_shared_mem_types.cpp return result; result 50 test/correctness/gpu_multi_device.cpp void run(Buffer<float> &result) { result 51 test/correctness/gpu_multi_device.cpp stage[current_stage - 1].realize(result); result 52 test/correctness/gpu_multi_device.cpp result.copy_to_host(); result 55 test/correctness/gpu_multi_device.cpp bool verify(const Buffer<float> &result, size_t stages, const char * test_case) { result 60 test/correctness/gpu_multi_device.cpp if (result(i, j, k) != correct) { result 61 test/correctness/gpu_multi_device.cpp printf("result(%d, %d, %d) = %f instead of %f. (%s).\n", i, j, k, result(i, j, k), correct, test_case); result 28 test/correctness/gpu_multi_kernel.cpp Buffer<int32_t> result = kernel3.realize(256, target); result 34 test/correctness/gpu_multi_kernel.cpp assert(result(i) == c); result 39 test/correctness/gpu_object_lifetime_1.cpp Buffer<int32_t> result = f.realize(256, target); result 41 test/correctness/gpu_object_lifetime_1.cpp if (result(i) != i) { result 42 test/correctness/gpu_object_lifetime_1.cpp std::cout << "Error! " << result(i) << " != " << i << std::endl; result 34 test/correctness/handle.cpp int result = evaluate<int>(my_strlen(message)); result 37 test/correctness/handle.cpp if (result != correct) { result 39 test/correctness/handle.cpp c_message, result, correct); result 14 test/correctness/host_alignment.cpp bool result; result 15 test/correctness/host_alignment.cpp FindErrorHandler() : result(false) {} result 20 test/correctness/host_alignment.cpp result = true; result 52 test/correctness/host_alignment.cpp if (f.result) { result 48 test/correctness/image_of_lists.cpp Buffer<std::list<int> *> result = factors.realize(100); result 52 test/correctness/image_of_lists.cpp std::list<int> *list = result(i); result 326 test/correctness/image_wrap.cpp Func source("source"), g("g"), result("result"); result 370 test/correctness/image_wrap.cpp Func source("source"), g("g"), result("result"); result 379 test/correctness/image_wrap.cpp result(x, y) = img(x) + g(x, y); result 382 test/correctness/image_wrap.cpp Func img_wrapper = img.in().compute_at(result, y); result 385 test/correctness/image_wrap.cpp g.compute_at(result, y); result 390 test/correctness/image_wrap.cpp Module m = result.compile_to_module({result.infer_arguments()}); result 395 test/correctness/image_wrap.cpp {result.name(), {g.name(), img_wrapper.name()}}, result 405 test/correctness/image_wrap.cpp Buffer<int> im = result.realize(200, 200); result 39 test/correctness/implicit_args_tests.cpp Realization result = f.realize(100, 100, 100); result 43 test/correctness/implicit_args_tests.cpp if (check_image(result, {func})) { result 62 test/correctness/implicit_args_tests.cpp Realization result = g.realize(100, 100, 100); result 66 test/correctness/implicit_args_tests.cpp if (check_image(result, {func})) { result 84 test/correctness/implicit_args_tests.cpp Realization result = f.realize(100, 100, 100); result 88 test/correctness/implicit_args_tests.cpp if (check_image(result, {func})) { result 105 test/correctness/implicit_args_tests.cpp Realization result = f.realize(100, 100, 100); result 109 test/correctness/implicit_args_tests.cpp if (check_image(result, {func})) { result 129 test/correctness/implicit_args_tests.cpp Realization result = f.realize(100, 100); result 133 test/correctness/implicit_args_tests.cpp if (check_image(result, {func})) { result 148 test/correctness/implicit_args_tests.cpp Realization result = f.realize(100, 100, 100); result 155 test/correctness/implicit_args_tests.cpp if (check_image(result, {func1, func2})) { result 176 test/correctness/implicit_args_tests.cpp Realization result = g.realize(100, 100, 100); result 180 test/correctness/implicit_args_tests.cpp if (check_image(result, {func})) { result 197 test/correctness/implicit_args_tests.cpp Realization result = f.realize(100, 100, 100); result 204 test/correctness/implicit_args_tests.cpp if (check_image(result, {func1, func2})) { result 224 test/correctness/implicit_args_tests.cpp Realization result = f.realize(100, 100, 100); result 231 test/correctness/implicit_args_tests.cpp if (check_image(result, {func1, func2})) { result 251 test/correctness/implicit_args_tests.cpp Realization result = f.realize(100, 100); result 258 test/correctness/implicit_args_tests.cpp if (check_image(result, {func1, func2})) { result 21 test/correctness/inline_reduction.cpp Buffer<float> result = local_variance.realize(10, 10); result 36 test/correctness/inline_reduction.cpp float r = result(x, y); result 32 test/correctness/input_larger_than_two_gigs.cpp Buffer<uint64_t> result; result 35 test/correctness/input_larger_than_two_gigs.cpp result = grand_total.realize(); result 37 test/correctness/input_larger_than_two_gigs.cpp assert(result(0) == (uint64_t)84); result 41 test/correctness/input_larger_than_two_gigs.cpp result = grand_total.realize(); result 11 test/correctness/interleave.cpp int result; result 12 test/correctness/interleave.cpp CountInterleaves() : result(0) {} result 18 test/correctness/interleave.cpp result++; result 33 test/correctness/interleave.cpp return i.result; result 112 test/correctness/interleave.cpp Buffer<float> result = results[i]; result 115 test/correctness/interleave.cpp float delta = result(x) - correct; result 117 test/correctness/interleave.cpp printf("result(%d) = %f instead of %f\n", x, result(x), correct); result 103 test/correctness/introspection.cpp bool result = HalideIntrospectionCanary::test(&HalideIntrospectionCanary::test_a); result 105 test/correctness/introspection.cpp if (result) { result 90 test/correctness/lerp.cpp Buffer<value_t> result(zero_extent, one_extent, weight_extent); result 91 test/correctness/lerp.cpp lerp_test.realize(result); result 93 test/correctness/lerp.cpp for (int32_t i = 0; i < result.extent(0); i++) { result 94 test/correctness/lerp.cpp for (int32_t j = 0; j < result.extent(1); j++) { result 95 test/correctness/lerp.cpp for (int32_t k = 0; k < result.extent(2); k++) { result 108 test/correctness/lerp.cpp value_t computed_val = result(i, j, k); result 224 test/correctness/lerp.cpp Buffer<uint32_t> result = lerp_constants.realize(); result 227 test/correctness/lerp.cpp if (result(0) != expected) result 228 test/correctness/lerp.cpp std::cerr << "Expected " << expected << " got " << result(0) << std::endl; result 229 test/correctness/lerp.cpp assert(result(0) == expected); result 223 test/correctness/likely.cpp Buffer<int> result = g.realize(10); result 226 test/correctness/likely.cpp result = g.realize(10); result 66 test/correctness/many_small_extern_stages.cpp Buffer<int> result = h.realize(10, 10); result 68 test/correctness/many_small_extern_stages.cpp for (int y = 0; y < result.height(); y++) { result 69 test/correctness/many_small_extern_stages.cpp for (int x = 0; x < result.width(); x++) { result 71 test/correctness/many_small_extern_stages.cpp if (result(x, y) != 0) { result 72 test/correctness/many_small_extern_stages.cpp printf("result(%d, %d) = %d instead of %d\n", x, y, result(x, y), correct); result 70 test/correctness/math.cpp Buffer<type_ret> result = test_##name.realize(in.extent(0), target); \ result 73 test/correctness/math.cpp if (!relatively_equal(c_result, result(i))) \ result 74 test/correctness/math.cpp printf("For " #name "(%.20f) == %.20f from cpu and %.20f from GPU.\n", (double)in(i), (double)c_result, (double)result(i)); \ result 75 test/correctness/math.cpp assert(relatively_equal(c_result, result(i)) && \ result 95 test/correctness/math.cpp Buffer<type_ret> result = test_##name.realize(in.height(), target); \ result 98 test/correctness/math.cpp assert(relatively_equal(c_result, result(i)) && \ result 525 test/correctness/memoize.cpp Buffer<uint8_t> result = output.realize(128, 128); result 529 test/correctness/memoize.cpp assert(result(i, j) == (uint8_t)((i << 8) + j + 4 * 23)); result 537 test/correctness/memoize.cpp result = output.realize(128, 128); result 540 test/correctness/memoize.cpp assert(result(i, j) == (uint8_t)((i << 8) + j + 4 * 23)); result 181 test/correctness/mul_div_mod.cpp Buffer<T> result(width, height); result 205 test/correctness/mul_div_mod.cpp result(i,j) = (T)v; result 208 test/correctness/mul_div_mod.cpp result(0,0) = (T)min; result 209 test/correctness/mul_div_mod.cpp result(1,0) = (T)max; result 210 test/correctness/mul_div_mod.cpp result(0,1) = (T)((unique & 1) ? min : max); result 211 test/correctness/mul_div_mod.cpp result(1,1) = (T)((unique & 1) ? max : min); result 228 test/correctness/mul_div_mod.cpp result(i,j) = (T)v; result 231 test/correctness/mul_div_mod.cpp result(0,0) = (T)0; result 232 test/correctness/mul_div_mod.cpp result(1,0) = (T)max; result 233 test/correctness/mul_div_mod.cpp result(0,1) = (T)((unique & 1) ? 0 : max); result 234 test/correctness/mul_div_mod.cpp result(1,1) = (T)((unique & 1) ? max : 0); result 253 test/correctness/mul_div_mod.cpp result(i,j) = (T)v; result 256 test/correctness/mul_div_mod.cpp result(0,0) = (T)(0.0); result 257 test/correctness/mul_div_mod.cpp result(1,0) = (T)(1.0); result 258 test/correctness/mul_div_mod.cpp result(0,1) = (T)((unique & 1) ? 0.0 : 1.0); result 259 test/correctness/mul_div_mod.cpp result(1,1) = (T)((unique & 1) ? 1.0 : 0.0); result 265 test/correctness/mul_div_mod.cpp return result; result 21 test/correctness/multi_pass_reduction.cpp Buffer<float> result = f.realize(11); result 36 test/correctness/multi_pass_reduction.cpp if (fabs(result(i) - ref[i]) > 0.0001f) { result 38 test/correctness/multi_pass_reduction.cpp i, result(i), ref[i]); result 65 test/correctness/multi_pass_reduction.cpp Buffer<int> result = f.realize(110); result 81 test/correctness/multi_pass_reduction.cpp if (correct[i] != result(i)) { result 83 test/correctness/multi_pass_reduction.cpp i, result(i), correct[i]); result 98 test/correctness/multi_pass_reduction.cpp Buffer<int> result = f.realize(20); result 105 test/correctness/multi_pass_reduction.cpp if (ref[i] != result(i)) { result 107 test/correctness/multi_pass_reduction.cpp i, result(i), ref[i]); result 130 test/correctness/multi_pass_reduction.cpp Buffer<float> result = f.realize(100, 100); result 148 test/correctness/multi_pass_reduction.cpp if (fabs(ref(x, y) - result(x, y)) > 0.0001f) { result 150 test/correctness/multi_pass_reduction.cpp x, y, result(x, y), ref(x, y)); result 49 test/correctness/multiple_outputs.cpp Realization result = g.realize(); result 52 test/correctness/multiple_outputs.cpp float result_val = Buffer<float>(result[2])(0); result 61 test/correctness/named_updates.cpp Buffer<int> result = f.realize(128); result 64 test/correctness/named_updates.cpp RDom check(result); result 66 test/correctness/named_updates.cpp maximum(abs(result(check) - result_ref(check)))); result 69 test/correctness/newtons_method.cpp int result; result 72 test/correctness/newtons_method.cpp result = find_pi<float>(); result 73 test/correctness/newtons_method.cpp if (result != 0) result 74 test/correctness/newtons_method.cpp return result; result 77 test/correctness/newtons_method.cpp result = find_pi<double>(); result 78 test/correctness/newtons_method.cpp if (result != 0) result 79 test/correctness/newtons_method.cpp return result; result 25 test/correctness/obscure_image_references.cpp Buffer<int> result = f.realize(100); result 29 test/correctness/obscure_image_references.cpp if (result(i) != correct) { result 30 test/correctness/obscure_image_references.cpp printf("result(%d) = %d instead of %d\n", i, result(i), correct); result 19 test/correctness/out_of_memory.cpp void * result = malloc(x); result 20 test/correctness/out_of_memory.cpp if (result != nullptr) { result 22 test/correctness/out_of_memory.cpp allocation_sizes[result] = x; result 25 test/correctness/out_of_memory.cpp return result; result 75 test/correctness/parallel_reductions.cpp Buffer<int> result = out.realize(256); result 78 test/correctness/parallel_reductions.cpp if (result(i) != correct(i)) { result 79 test/correctness/parallel_reductions.cpp printf("result(%d) = %d instead of %d\n", i, result(i), correct(i)); result 27 test/correctness/partition_loops_bug.cpp Buffer<double> result(4, 4); result 36 test/correctness/partition_loops_bug.cpp output.realize(result); result 38 test/correctness/partition_loops_bug.cpp return result; result 35 test/correctness/print.cpp Buffer<int32_t> result = f.realize(10); result 38 test/correctness/print.cpp if (result(i) != i * i) { result 68 test/correctness/print.cpp Buffer<int32_t> result = f.realize(10); result 71 test/correctness/print.cpp if (result(i) != i * i) { result 112 test/correctness/print.cpp Buffer<uint64_t> result = f.realize(1); result 114 test/correctness/print.cpp if (result(0) != 100) { result 79 test/correctness/process_some_tiles.cpp Buffer<float> result = output.realize(10 * tile_size, 10 * tile_size); result 92 test/correctness/process_some_tiles.cpp for (int y = 0; y < result.height(); y++) { result 93 test/correctness/process_some_tiles.cpp for (int x = 0; x < result.width(); x++) { result 96 test/correctness/process_some_tiles.cpp if (fabs(correct - result(x, y)) > 0.001f) { result 98 test/correctness/process_some_tiles.cpp x, y, result(x, y), correct); result 31 test/correctness/realize_larger_than_two_gigs.cpp Buffer<uint8_t> result = grand_total.realize(); result 37 test/correctness/realize_larger_than_two_gigs.cpp result = grand_total.realize(); result 22 test/correctness/realize_over_shifted_domain.cpp Buffer<int> result(50, 100); result 23 test/correctness/realize_over_shifted_domain.cpp result.set_min(50, 100); result 25 test/correctness/realize_over_shifted_domain.cpp f.realize(result); result 27 test/correctness/realize_over_shifted_domain.cpp if (result(50, 100) != 123 || result(99, 199) != 234) { result 30 test/correctness/realize_over_shifted_domain.cpp result(50, 100), result(99, 199)); result 26 test/correctness/reduction_subregion.cpp Buffer<int> result = f.realize(10); result 19 test/correctness/require.cpp Buffer<float> result; result 37 test/correctness/require.cpp result = f.realize(1); result 47 test/correctness/require.cpp result = f.realize(1); result 52 test/correctness/require.cpp if (result(0) != (kPrime1 * kPrime2)) { result 53 test/correctness/require.cpp printf("Unexpected value: %f\n", result(0)); result 29 test/correctness/reuse_stack_alloc.cpp Buffer<int> result = k.realize(16); result 30 test/correctness/reuse_stack_alloc.cpp for (int i = 0; i < result.width(); i++) { result 31 test/correctness/reuse_stack_alloc.cpp if (result(i) != 2 * i) { result 32 test/correctness/reuse_stack_alloc.cpp printf("Error! Allocation did not get reused at %d (%d != %d)\n", i, result(i), 2 * i); result 9 test/correctness/round.cpp bool test(Expr e, const char *funcname, int vector_width, int N, Buffer<T> &input, T *result) { result 20 test/correctness/round.cpp if (result[i] != im(i)) { result 21 test/correctness/round.cpp printf("Error: %s(%.9g)=%.9g, should be %.9g\n", funcname, input(i), im(i), result[i]); result 29 test/correctness/round.cpp bool test(Expr e, const char *funcname, int N, Buffer<T> &input, T *result) { result 30 test/correctness/round.cpp return test(e, funcname, 1, N, input, result) result 31 test/correctness/round.cpp && test(e, funcname, 2, N, input, result) result 32 test/correctness/round.cpp && test(e, funcname, 4, N, input, result) result 33 test/correctness/round.cpp && test(e, funcname, 8, N, input, result); result 35 test/correctness/saturating_casts.cpp Buffer<target_t> result = f.realize(7); result 99 test/correctness/saturating_casts.cpp if (result(i) != correct_result) { result 101 test/correctness/saturating_casts.cpp << " got " << result(i) result 106 test/correctness/saturating_casts.cpp assert(result(i) == correct_result); result 134 test/correctness/saturating_casts.cpp Buffer<target_t> result = f.realize(7); result 209 test/correctness/saturating_casts.cpp if (result(i) != correct_result) { result 211 test/correctness/saturating_casts.cpp << " got " << result(i) result 217 test/correctness/saturating_casts.cpp assert(result(i) == correct_result); result 17 test/correctness/scatter.cpp Buffer<int> result = g.realize(10, 1); result 30 test/correctness/scatter.cpp if (result(i, 0) != correct) { result 31 test/correctness/scatter.cpp printf("Value at %d should have been %d but was instead %d\n", i, correct, result(i, 0)); result 2062 test/correctness/simd_op_check.cpp const TestResult &result = f.get(); result 2063 test/correctness/simd_op_check.cpp std::cout << result.op << "\n"; result 2064 test/correctness/simd_op_check.cpp if (!result.error_msg.empty()) { result 2065 test/correctness/simd_op_check.cpp std::cerr << result.error_msg; result 100 test/correctness/sort_exprs.cpp Buffer<float> result = g.realize(N); result 103 test/correctness/sort_exprs.cpp printf("%f ", result(i)); result 108 test/correctness/sort_exprs.cpp if (result(i) >= result(i+1)) { result 16 test/correctness/split_by_non_factor.cpp Buffer<int> result = f.realize(3); result 17 test/correctness/split_by_non_factor.cpp for (int i = 0; i < result.width(); i++) { result 18 test/correctness/split_by_non_factor.cpp if (result(i) != i) { result 19 test/correctness/split_by_non_factor.cpp printf("result(%d) was %d instead of %d\n", i, result(i), i); result 60 test/correctness/split_by_non_factor.cpp Buffer<int> result = f.realize(15); result 61 test/correctness/split_by_non_factor.cpp for (int i = 0; i < result.width(); i++) { result 63 test/correctness/split_by_non_factor.cpp int actual = result(i); result 37 test/correctness/stream_compaction.cpp Buffer<int> result = ones.realize(1001); result 39 test/correctness/stream_compaction.cpp for (int i = 0; i < result.width(); i++) { result 40 test/correctness/stream_compaction.cpp if (result(i) != next) { result 41 test/correctness/stream_compaction.cpp printf("result(%d) = %d instead of %d\n", i, result(i), next); result 19 test/correctness/tuple_partial_update.cpp Realization result = f.realize(1024, 1024); result 20 test/correctness/tuple_partial_update.cpp Buffer<int> a = result[0], b = result[1]; result 41 test/correctness/tuple_partial_update.cpp Realization result = f.realize(1024, 1024); result 42 test/correctness/tuple_partial_update.cpp Buffer<int> a = result[0], b = result[1]; result 28 test/correctness/tuple_reduction.cpp Realization result = f.realize(1024, 1024); result 30 test/correctness/tuple_reduction.cpp Buffer<int> a = result[0], b = result[1]; result 75 test/correctness/tuple_reduction.cpp Realization result = f.realize(1024, 1024); result 77 test/correctness/tuple_reduction.cpp Buffer<int> a = result[0], b = result[1]; result 118 test/correctness/tuple_reduction.cpp Realization result = f.realize(1024, 1024); result 120 test/correctness/tuple_reduction.cpp Buffer<int> a = result[0], b = result[1]; result 162 test/correctness/tuple_reduction.cpp Realization result = f.realize(1024, 1024); result 164 test/correctness/tuple_reduction.cpp Buffer<int> a = result[0], b = result[1]; result 14 test/correctness/tuple_update_ops.cpp Realization result = f.realize(1024, 1024); result 15 test/correctness/tuple_update_ops.cpp Buffer<int> a = result[0]; result 37 test/correctness/tuple_update_ops.cpp Realization result = f.realize(1024, 1024); result 38 test/correctness/tuple_update_ops.cpp Buffer<int> a = result[0], b = result[1]; result 61 test/correctness/tuple_update_ops.cpp Realization result = f.realize(100, 100, 100); result 62 test/correctness/tuple_update_ops.cpp Buffer<int16_t> a = result[0]; result 63 test/correctness/tuple_update_ops.cpp Buffer<int32_t> b = result[1]; result 86 test/correctness/tuple_update_ops.cpp Realization result = f.realize(1024, 1024); result 87 test/correctness/tuple_update_ops.cpp Buffer<int> a = result[0], b = result[1]; result 109 test/correctness/tuple_update_ops.cpp Realization result = f.realize(1024, 1024); result 110 test/correctness/tuple_update_ops.cpp Buffer<int> a = result[0]; result 42 test/correctness/unsafe_dedup_lets.cpp int result = evaluate<int>(f()[0]); result 44 test/correctness/unsafe_dedup_lets.cpp if (result != correct) { result 45 test/correctness/unsafe_dedup_lets.cpp printf("Bad GCD: %d != %d\n", result, correct); result 32 test/correctness/vectorize_guard_with_if.cpp Buffer<int> result = f.realize(w); result 47 test/correctness/vectorize_guard_with_if.cpp if (result(i) != i) { result 49 test/correctness/vectorize_guard_with_if.cpp i, result(i), i); result 25 test/correctness/vectorized_initialization.cpp Buffer<int> result = g.realize(4); result 30 test/correctness/vectorized_initialization.cpp if (result(0) != 0 || result(1) != 2 || result(2) != 5 || result(3) != 9) { result 32 test/correctness/vectorized_initialization.cpp result(0), result(1), result(2), result(3)); result 306 test/correctness/wrap.cpp Func f("f"), g("g"), result("result"); result 345 test/correctness/wrap.cpp Func f("f"), g("g"), result("result"); result 350 test/correctness/wrap.cpp result(x, y) = f(x) + g(x, y); result 353 test/correctness/wrap.cpp Func f_wrapper = f.in().compute_at(result, y); result 355 test/correctness/wrap.cpp g.compute_at(result, y); result 360 test/correctness/wrap.cpp Module m = result.compile_to_module({}); result 365 test/correctness/wrap.cpp {result.name(), {g.name(), f_wrapper.name()}}, result 375 test/correctness/wrap.cpp Buffer<int> im = result.realize(200, 200); result 19 test/error/ambiguous_inline_reductions.cpp Buffer<int> result = f.realize(10, 10); result 21 test/error/bad_host_alignment.cpp Buffer<uint8_t> result = f.realize(10, 10); result 7 test/error/buffer_larger_than_two_gigs.cpp Buffer<uint8_t> result(1 << 24, 1 << 24, 1 << 24); result 9 test/error/buffer_larger_than_two_gigs.cpp Buffer<uint8_t> result(1 << 12, 1 << 12, 1 << 8); result 11 test/error/clamp_out_of_range.cpp Buffer<> result = f.realize(42); result 29 test/error/five_d_gpu_buffer.cpp Buffer<int> result = g.realize(32); result 35 test/error/five_d_gpu_buffer.cpp for (int i = 0; i < result.width(); i++) { result 36 test/error/five_d_gpu_buffer.cpp if (i != result(i)) { result 38 test/error/five_d_gpu_buffer.cpp i, result(i), i); result 25 test/error/realize_constantly_larger_than_two_gigs.cpp Buffer<uint8_t> result = grand_total.realize(); result 15 test/error/reduction_type_mismatch.cpp Buffer<float> result = f.realize(50); result 17 test/error/thread_id_outside_block_id.cpp Buffer<int> result = f.realize(16); result 16 test/error/too_many_args.cpp Buffer<uint32_t> result = bad_call.realize(256, 256); result 24 test/error/undefined_rdom_dimension.cpp Buffer<int32_t> result = f.realize(100, 5, 3); result 29 test/generator/argvcall_aottest.cpp int result; result 33 test/generator/argvcall_aottest.cpp result = argvcall(1.2f, 3.4f, output); result 34 test/generator/argvcall_aottest.cpp if (result != 0) { result 35 test/generator/argvcall_aottest.cpp fprintf(stderr, "Result: %d\n", result); result 45 test/generator/argvcall_aottest.cpp result = argvcall_argv(args); result 46 test/generator/argvcall_aottest.cpp if (result != 0) { result 47 test/generator/argvcall_aottest.cpp fprintf(stderr, "Result: %d\n", result); result 67 test/generator/cleanup_on_error_aottest.cpp int result = cleanup_on_error(output); result 69 test/generator/cleanup_on_error_aottest.cpp if (result != halide_error_code_out_of_memory && result 70 test/generator/cleanup_on_error_aottest.cpp result != halide_error_code_device_malloc_failed) { result 72 test/generator/cleanup_on_error_aottest.cpp result, result 44 test/generator/cxx_mangling_aottest.cpp Buffer<double> result(100); result 86 test/generator/cxx_mangling_aottest.cpp &mc, &ms, &mu, result); result 13 test/generator/error_codes_aottest.cpp void check(int result, int correct) { result 14 test/generator/error_codes_aottest.cpp if (result != correct) { result 15 test/generator/error_codes_aottest.cpp printf("The exit status was %d instead of %d\n", result, correct); result 39 test/generator/error_codes_aottest.cpp int result = error_codes(&in, 64, &out); result 41 test/generator/error_codes_aottest.cpp check(result, correct); result 45 test/generator/error_codes_aottest.cpp result = error_codes(&in, 50, &out); result 47 test/generator/error_codes_aottest.cpp check(result, correct); result 53 test/generator/error_codes_aottest.cpp result = error_codes(&in, 64, &out); result 55 test/generator/error_codes_aottest.cpp check(result, correct); result 66 test/generator/error_codes_aottest.cpp result = error_codes(&i, 0, &o); result 68 test/generator/error_codes_aottest.cpp check(result, correct); result 75 test/generator/error_codes_aottest.cpp result = error_codes(&in, 64, &out); result 77 test/generator/error_codes_aottest.cpp check(result, correct); result 84 test/generator/error_codes_aottest.cpp result = error_codes(&in, 64, &out); result 86 test/generator/error_codes_aottest.cpp check(result, correct); result 99 test/generator/error_codes_aottest.cpp result = error_codes(&in, 64, &out); result 101 test/generator/error_codes_aottest.cpp check(result, correct); result 105 test/generator/error_codes_aottest.cpp result = error_codes(&in, -23, &out); result 107 test/generator/error_codes_aottest.cpp check(result, correct); result 110 test/generator/error_codes_aottest.cpp result = error_codes(&in, 108, &out); result 112 test/generator/error_codes_aottest.cpp check(result, correct); result 116 test/generator/error_codes_aottest.cpp result = error_codes(nullptr, 64, &out); result 118 test/generator/error_codes_aottest.cpp check(result, correct); result 759 test/generator/metadata_tester_aottest.cpp int result; result 774 test/generator/metadata_tester_aottest.cpp result = metadata_tester( result 814 test/generator/metadata_tester_aottest.cpp EXPECT_EQ(0, result); result 816 test/generator/metadata_tester_aottest.cpp result = metadata_tester_ucon( result 857 test/generator/metadata_tester_aottest.cpp EXPECT_EQ(0, result); result 94 test/generator/multitarget_aottest.cpp int result = HalideTest::multitarget(bad_type); result 95 test/generator/multitarget_aottest.cpp if (result != halide_error_code_bad_type) { result 96 test/generator/multitarget_aottest.cpp printf("Error: expected to fail with halide_error_code_bad_type (%d) but actually got %d!\n", (int) halide_error_code_bad_type, result); result 91 test/generator/old_buffer_t_aottest.cpp int result = get_pixel(&out, x, y); result 93 test/generator/old_buffer_t_aottest.cpp if (result != correct) { result 94 test/generator/old_buffer_t_aottest.cpp printf("out(%d, %d) = %x instead of %x\n", x, y, (unsigned)result, (unsigned)correct); result 47 test/generator/user_context_aottest.cpp int result; result 61 test/generator/user_context_aottest.cpp result = user_context(context_pointer, input, output); result 62 test/generator/user_context_aottest.cpp if (result != 0) { result 63 test/generator/user_context_aottest.cpp fprintf(stderr, "Result: %d\n", result); result 77 test/generator/user_context_aottest.cpp result = user_context_argv(args); result 78 test/generator/user_context_aottest.cpp if (result != 0) { result 79 test/generator/user_context_aottest.cpp fprintf(stderr, "Result: %d\n", result); result 90 test/generator/user_context_aottest.cpp result = user_context(context_pointer, input, big_output); result 91 test/generator/user_context_aottest.cpp if (result == 0) { result 92 test/generator/user_context_aottest.cpp fprintf(stderr, "Expected this to fail, but got %d\n", result); result 37 test/opengl/conv_select.cpp Buffer<float> result = g.realize(width, height, res_channels, target); result 38 test/opengl/conv_select.cpp result.copy_to_host(); result 41 test/opengl/conv_select.cpp if (!Testing::check_result<float>(result, [](int x, int y, int c) { result 18 test/opengl/inline_reduction.cpp Buffer<float> result = f.realize(100, 100, 3, target); result 20 test/opengl/inline_reduction.cpp if (!Testing::check_result<float>(result, [&](int x, int y, int c) { return 45; })) { result 22 test/opengl/multiple_stages.cpp Buffer<uint8_t> result = f.realize(10, 10, 3, target); result 23 test/opengl/multiple_stages.cpp result.copy_to_host(); result 25 test/opengl/multiple_stages.cpp if (!Testing::check_result<uint8_t>(result, [&](int i, int j, int k) { return i + j + 1; })) { result 26 test/opengl/shifted_domains.cpp Buffer<float> result(8, 8, 1); result 27 test/opengl/shifted_domains.cpp gradient.realize(result, target); result 28 test/opengl/shifted_domains.cpp result.copy_to_host(); result 30 test/opengl/shifted_domains.cpp if (!Testing::check_result<float>(result, 5e-5, [](int x, int y) { return float(x + y); })) result 30 test/opengl/sum_reduction.cpp Buffer<float> result = g.realize(width, height, channels, target); result 31 test/opengl/sum_reduction.cpp result.copy_to_host(); result 34 test/opengl/sum_reduction.cpp if (!Testing::check_result<float>(result, 1e-3, [&](int x, int y, int c) { result 30 test/opengl/sumcolor_reduction.cpp Buffer<float> result = g.realize(10, 10, 3, target); result 31 test/opengl/sumcolor_reduction.cpp result.copy_to_host(); result 34 test/opengl/sumcolor_reduction.cpp if (!Testing::check_result<float>(result, 1e-6, [](int x, int y, int c) { return 3.0f * (x + y); })) { result 34 test/opengl/testing.h std::vector<T> result; result 37 test/opengl/testing.h result.push_back(buf(x, y, c)); result 40 test/opengl/testing.h if (neq(result[c], expected[c], tol)) { result 42 test/opengl/testing.h err::vector(result); result 63 test/opengl/testing.h const T result = buf(x, y); result 64 test/opengl/testing.h if (neq(result, expected, tol)) { result 66 test/opengl/testing.h std::cerr << +result; result 52 test/performance/block_transpose.cpp Buffer<uint16_t> result(1024, 1024); result 55 test/performance/block_transpose.cpp output.realize(result); result 58 test/performance/block_transpose.cpp output.realize(result); result 62 test/performance/block_transpose.cpp return result; result 102 test/performance/block_transpose.cpp Buffer<uint16_t> result(1024, 1024); result 105 test/performance/block_transpose.cpp output.realize(result); result 108 test/performance/block_transpose.cpp output.realize(result); result 112 test/performance/block_transpose.cpp return result; result 111 test/performance/rfactor.cpp Buffer<int> result(256); result 113 test/performance/rfactor.cpp ref.realize(result); result 116 test/performance/rfactor.cpp hist.realize(result); result 60 test/performance/sort.cpp Func result; result 90 test/performance/sort.cpp result(x, y) = select(x == 0, b0, result 94 test/performance/sort.cpp result.compute_at(parallel_stage, y).bound(x, 0, 4).unroll(x); result 96 test/performance/sort.cpp stages.push_back(result); result 102 test/performance/sort.cpp assert(result.dimensions() == 2); result 117 test/performance/sort.cpp Expr value_a = result(clamp(candidate_a, 0, chunk_size-1), 2*y); result 118 test/performance/sort.cpp Expr value_b = result(clamp(candidate_b, 0, chunk_size-1), 2*y+1); result 133 test/performance/sort.cpp result = parallel_stage; result 135 test/performance/sort.cpp result = lambda(x, y, merge_rows(x, y)[2]); result 140 test/performance/sort.cpp return lambda(x, result(x, 0)); result 29 tools/find_inverse.cpp uint64_t result = num; result 30 tools/find_inverse.cpp result >>= sh_post; result 31 tools/find_inverse.cpp if (num / den != result) return false; result 44 tools/find_inverse.cpp uint64_t result = num; result 45 tools/find_inverse.cpp result *= mul; result 46 tools/find_inverse.cpp result >>= bits; result 47 tools/find_inverse.cpp if (result > max) return false; result 48 tools/find_inverse.cpp result >>= sh_post; result 49 tools/find_inverse.cpp if (num / den != result) return false; result 62 tools/find_inverse.cpp uint64_t result = num; result 63 tools/find_inverse.cpp result *= mul; result 64 tools/find_inverse.cpp result >>= bits; result 65 tools/find_inverse.cpp if (result > max) return false; result 66 tools/find_inverse.cpp result += (num - result)>>1; result 67 tools/find_inverse.cpp if (result > max) return false; result 68 tools/find_inverse.cpp result >>= sh_post; result 69 tools/find_inverse.cpp if (num / den != result) return false; result 82 tools/find_inverse.cpp int64_t result = num; result 83 tools/find_inverse.cpp result >>= sh_post; result 84 tools/find_inverse.cpp if (sdiv(num, den) != result) return false; result 98 tools/find_inverse.cpp int64_t result = num; result 99 tools/find_inverse.cpp uint64_t xsign = result >> (bits-1); result 100 tools/find_inverse.cpp uint64_t q0 = (mul * (xsign ^ result)) >> bits; result 101 tools/find_inverse.cpp result = xsign ^ (q0 >> sh_post); result 102 tools/find_inverse.cpp if (sdiv(num, den) != result) return false; result 323 tutorial/lesson_05_scheduling_1.cpp Buffer<int> result = gradient.realize(4, 4); result 513 tutorial/lesson_05_scheduling_1.cpp Buffer<int> result = gradient_fast.realize(350, 250); result 543 tutorial/lesson_05_scheduling_1.cpp if (result(x_vec[i], y_vec[i]) != val[i]) { result 561 tutorial/lesson_05_scheduling_1.cpp if (result(x_vec[i], y_vec[i]) != val[i]) { result 57 tutorial/lesson_06_realizing_over_shifted_domains.cpp Buffer<int> result(8, 8); result 58 tutorial/lesson_06_realizing_over_shifted_domains.cpp gradient.realize(result); result 63 tutorial/lesson_06_realizing_over_shifted_domains.cpp if (result(x, y) != x + y) { result 85 tutorial/lesson_07_multi_stage_pipelines.cpp Buffer<uint8_t> result(input.width()-2, input.height()-2, 3); result 86 tutorial/lesson_07_multi_stage_pipelines.cpp result.set_min(1, 1); result 87 tutorial/lesson_07_multi_stage_pipelines.cpp output.realize(result); result 92 tutorial/lesson_07_multi_stage_pipelines.cpp save_image(result, "blurry_parrot_1.png"); result 160 tutorial/lesson_07_multi_stage_pipelines.cpp Buffer<uint8_t> result = output.realize(input.width(), input.height(), 3); result 165 tutorial/lesson_07_multi_stage_pipelines.cpp save_image(result, "blurry_parrot_2.png"); result 66 tutorial/lesson_08_scheduling_2.cpp float result[4][4]; result 69 tutorial/lesson_08_scheduling_2.cpp result[y][x] = (sin(x*y) + result 118 tutorial/lesson_08_scheduling_2.cpp float result[4][4]; result 133 tutorial/lesson_08_scheduling_2.cpp result[y][x] = (producer_storage[y][x] + result 220 tutorial/lesson_08_scheduling_2.cpp float result[4][4]; result 237 tutorial/lesson_08_scheduling_2.cpp result[y][x] = (producer_storage[0][x] + result 306 tutorial/lesson_08_scheduling_2.cpp float result[4][4]; result 329 tutorial/lesson_08_scheduling_2.cpp result[y][x] = (producer_storage[y][x] + result 373 tutorial/lesson_08_scheduling_2.cpp result[y][x] = (producer_storage[y & 1][x] + result 408 tutorial/lesson_08_scheduling_2.cpp float result[4][4]; result 430 tutorial/lesson_08_scheduling_2.cpp result[y][x] = (producer_storage[y & 1][x] + result 507 tutorial/lesson_08_scheduling_2.cpp float result[8][8]; result 531 tutorial/lesson_08_scheduling_2.cpp result[y][x] = result 114 tutorial/lesson_09_update_definitions.cpp int result[4][4]; result 118 tutorial/lesson_09_update_definitions.cpp result[y][x] = x + y; result 122 tutorial/lesson_09_update_definitions.cpp result[1][2] = 42; result 125 tutorial/lesson_09_update_definitions.cpp result[0][x] = result[1][x]; result 276 tutorial/lesson_13_tuples.cpp Buffer<int> result = escape.realize(61, 25); result 278 tutorial/lesson_13_tuples.cpp for (int y = 0; y < result.height(); y++) { result 279 tutorial/lesson_13_tuples.cpp for (int x = 0; x < result.width(); x++) { result 280 tutorial/lesson_13_tuples.cpp printf("%c", code[result(x, y)]);