Revision a0fc7fafeee3a6678887d8c8e86c47def4572526 authored by Alexander Root on 04 February 2021, 01:13:53 UTC, committed by GitHub on 04 February 2021, 01:13:53 UTC
* add fixes to overflow analysis in bounds inference Co-authored-by: Steven Johnson <srj@google.com>
1 parent dadbcbf
StorageFolding.h
#ifndef HALIDE_STORAGE_FOLDING_H
#define HALIDE_STORAGE_FOLDING_H
/** \file
* Defines the lowering optimization pass that reduces large buffers
* down to smaller circular buffers when possible
*/
#include <map>
#include <string>
#include "Expr.h"
namespace Halide {
namespace Internal {
class Function;
/** Fold storage of functions if possible. This means reducing one of
* the dimensions module something for the purpose of storage, if we
* can prove that this is safe to do. E.g consider:
*
\code
f(x) = ...
g(x) = f(x-1) + f(x)
f.store_root().compute_at(g, x);
\endcode
*
* We can store f as a circular buffer of size two, instead of
* allocating space for all of it.
*/
Stmt storage_folding(const Stmt &s, const std::map<std::string, Function> &env);
} // namespace Internal
} // namespace Halide
#endif
Computing file changes ...