Revision c1885fc710ddebff3e50023e662e9f822a7f2a3d authored by Alexander Root on 04 December 2020, 00:14:07 UTC, committed by GitHub on 04 December 2020, 00:14:07 UTC
* Add shift_left fix for signed integers by possibly negative values + regression test * add required condition on shift_left integer fix * add type check to shift_left minimum condition * fix constant folding of shifts with |b| >= type.bits() for types that allow overflow (failes correctness/simplify test) * make regression tests use scoped bindings * change condition in case int24/int48 proposal happens soon * revert changes based on overflow expectations * add more regression tests * clarify comment * add shift_left min handler for b only UB * fix clang-tidy complaint * relax shift_left of non-negative value constraint * pull case outside of unnecessary preconditions * fix clang-format complaint * fix broken precondition * add typecheck to possibly save a can_prove() call * add easy-out type check to precondition * Add descriptive comment to bug fix + add another early-exit precondition Co-authored-by: Steven Johnson <srj@google.com>
1 parent 28f9aef
PartitionLoops.h
#ifndef PARTITION_LOOPS_H
#define PARTITION_LOOPS_H
/** \file
* Defines a lowering pass that partitions loop bodies into three
* to handle boundary conditions: A prologue, a simplified
* steady-stage, and an epilogue.
*/
#include "Expr.h"
namespace Halide {
namespace Internal {
/** Return true if an expression uses a likely tag that isn't captured
* by an enclosing Select, Min, or Max. */
bool has_uncaptured_likely_tag(const Expr &e);
/** Return true if an expression uses a likely tag. */
bool has_likely_tag(const Expr &e);
/** Partitions loop bodies into a prologue, a steady state, and an
* epilogue. Finds the steady state by hunting for use of clamped
* ramps, or the 'likely' intrinsic. */
Stmt partition_loops(Stmt s);
} // namespace Internal
} // namespace Halide
#endif
Computing file changes ...
