Revision 3657cf5f363fd64aeaf06432e62e3960800927b0 authored by Andrew Adams on 26 January 2024, 17:26:12 UTC, committed by GitHub on 26 January 2024, 17:26:12 UTC
* Fix bounds_of_nested_lanes bounds_of_nested_lanes assumed that one layer of nested vectorization could be removed at a time. When faced with the expression: min(ramp(x8(a), x8(b), 5), x40(27)) It panicked, because on the left hand side it reduced the bounds to x8(a) ... x8(a) + x8(b) * 4, and on the right hand side it reduced the bounds to 27. It then attempted to take a min of mismatched types. In general we can't assume that binary operators on nested vectors have the same nesting structure on both sides, so I just rewrote it to reduce directly to a scalar. Fixes #8038
1 parent 4590a09
PurifyIndexMath.h
#ifndef HALIDE_PURIFY_INDEX_MATH_H
#define HALIDE_PURIFY_INDEX_MATH_H
/** \file
* Removes side-effects in integer math.
*/
#include "Expr.h"
namespace Halide {
namespace Internal {
/** Bounds inference and related stages can lift integer bounds
* expressions out of if statements that guard against those integer
* expressions doing side-effecty things like dividing or modding by
* zero. In those cases, if the lowering passes are functional, the
* value resulting from the division or mod is evaluated but not
* used. This mutator rewrites divs and mods in such expressions to
* fail silently (evaluate to undef) when the denominator is zero.
*/
Expr purify_index_math(const Expr &);
} // namespace Internal
} // namespace Halide
#endif
Computing file changes ...
