Revision 248e8da6cc845fb4c7765a3719ebc653ace60e4f authored by Steven Johnson on 20 April 2022, 17:41:49 UTC, committed by Steven Johnson on 20 April 2022, 17:41:49 UTC
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
![swh spinner](/static/img/swh-spinner.gif)
Computing file changes ...