likely            115 apps/fft/complex.h     return ComplexExpr(Halide::likely(re(z)), Halide::likely(im(z)));
likely            334 apps/fft/fft.cpp             v(A({r, s, n0}, args)) = select(r > 0, likely(x_rs * W(r * (s % S))), x_rs * gain);
likely            745 apps/fft/fft.cpp         select(n1 > 0, likely(unzipped(A({n0, n1}, args))),
likely            887 apps/fft/fft.cpp         c_zipped(A({n0, n1}, args)) = select(n1 > 0, likely(c(A({n0, n1}, args))), X + j * Y);
likely            921 apps/fft/fft.cpp                                      likely(dft0(A({n0, min(n1, (N1 / 2) - 1)}, args))));
likely            673 python_bindings/python/IROperator.cpp     p::def("likely", &h::likely, p::args("e"),
likely             68 src/ApplySplit.cpp             Expr cond = likely(rebased_var < old_extent);
likely             22 src/BoundaryConditions.cpp             actuals.push_back(clamp(likely(arg_var), min, min + extent - 1));
likely            106 src/BoundaryConditions.cpp                            clamp(likely(arg_var), min, min + extent - 1));
likely            148 src/BoundaryConditions.cpp                            clamp(likely(arg_var), min, min + extent-1));
likely            193 src/BoundaryConditions.cpp                            clamp(likely(arg_var), min, min + extent - 1));
likely            624 src/Bounds.cpp         } else if (op->is_intrinsic(Call::likely) ||
likely           1118 src/Bounds.cpp                 if (call && (call->is_intrinsic(Call::likely) ||
likely           1148 src/Bounds.cpp                         if (call && call->is_intrinsic(Call::likely)) {
likely           1149 src/Bounds.cpp                             likely_i.min = likely(i.min);
likely           1150 src/Bounds.cpp                             likely_i.max = likely(i.max);
likely           1179 src/Bounds.cpp                         if (call && call->is_intrinsic(Call::likely)) {
likely           1180 src/Bounds.cpp                             likely_i.min = likely(i.min);
likely           1181 src/Bounds.cpp                             likely_i.max = likely(i.max);
likely            158 src/BoundsInference.cpp                                                    {likely(predicates[0]), val, make_zero(val.type())},
likely            163 src/BoundsInference.cpp                                                   {likely(predicates[i]), cond_val, make_zero(cond_val.type())},
likely            806 src/IR.cpp     Call::ConstString Call::likely = "likely";
likely            501 src/IR.h               likely,
likely            827 src/IROperator.cpp                                 {likely(condition), args[0], failure_value},
likely           1855 src/IROperator.h inline Expr likely(const Expr &e) {
likely           1856 src/IROperator.h     return Internal::Call::make(e.type(), Internal::Call::likely,
likely            291 src/Monotonic.cpp         if (op->is_intrinsic(Call::likely) ||
likely             37 src/PartitionLoops.cpp             expr = min(likely(op->a), mutate(op->b));
likely             39 src/PartitionLoops.cpp             expr = min(mutate(op->a), likely(op->b));
likely             47 src/PartitionLoops.cpp             expr = max(likely(op->a), mutate(op->b));
likely             49 src/PartitionLoops.cpp             expr = max(mutate(op->a), likely(op->b));
likely             84 src/PartitionLoops.cpp         if (op->is_intrinsic(Call::likely)) {
likely             97 src/PartitionLoops.cpp         if (op->is_intrinsic(Call::likely)) {
likely            325 src/PartitionLoops.cpp         if (call && call->is_intrinsic(Call::likely)) {
likely            964 src/PartitionLoops.cpp                 expr = Call::make(op->type, Call::likely, {mutate(op->args[0])}, Call::PureIntrinsic);
likely            147 src/ScheduleFunctions.cpp         Container c = {Container::If, 0, "", likely(pred)};
likely           2464 src/Simplify.cpp                    call_a->is_intrinsic(Call::likely) &&
likely           2469 src/Simplify.cpp                    call_b->is_intrinsic(Call::likely) &&
likely           2826 src/Simplify.cpp                    call_a->is_intrinsic(Call::likely) &&
likely           2831 src/Simplify.cpp                    call_b->is_intrinsic(Call::likely) &&
likely           3752 src/Simplify.cpp         } else if (ct && ct->is_intrinsic(Call::likely) &&
likely           3757 src/Simplify.cpp                    cf->is_intrinsic(Call::likely) &&
likely           5515 src/Simplify.cpp     check(min(x, likely(x)), likely(x));
likely           5516 src/Simplify.cpp     check(min(likely(x), x), likely(x));
likely           5517 src/Simplify.cpp     check(max(x, likely(x)), likely(x));
likely           5518 src/Simplify.cpp     check(max(likely(x), x), likely(x));
likely           5519 src/Simplify.cpp     check(select(x > y, likely(x), x), likely(x));
likely           5520 src/Simplify.cpp     check(select(x > y, x, likely(x)), likely(x));
likely            229 src/SlidingWindow.cpp                 new_min = select(loop_var_expr <= loop_min, min_required, likely(prev_max_plus_one));
likely            233 src/SlidingWindow.cpp                 new_max = select(loop_var_expr <= loop_min, max_required, likely(prev_min_minus_one));
likely            349 src/Solve.cpp          if (op->is_intrinsic(Call::likely) ||
likely             31 src/TrimNoOps.cpp             op->is_intrinsic(Call::likely) ||
likely            709 src/VectorizeLoops.cpp             if (c && (c->is_intrinsic(Call::likely) ||
likely            795 src/VectorizeLoops.cpp             body = IfThenElse::make(likely(var < op->min + op->extent), body);
likely             10 test/correctness/bad_likely.cpp     f(x) = select(x < 10 || x > 20, likely(1), 2);
likely            148 test/correctness/likely.cpp         g(x) = select(x < 10, sin(x), likely(1.0f));
likely            159 test/correctness/likely.cpp         g(x) = select(x < 10 || x > 100, sin(x), likely(1.0f));
likely            205 test/correctness/likely.cpp         g(c, x, y) = sum(select(nasty, likely(10), c + r));
likely            218 test/correctness/likely.cpp         g(x) = select(x > limit, likely(3), 2);