1#ifndef HALIDE_IR_EQUALITY_H
2#define HALIDE_IR_EQUALITY_H
30 return (a.
type() ==
Int(32) && i->value == b);
Base classes for Halide expressions (Halide::Expr) and statements (Halide::Internal::Stmt)
#define HALIDE_ALWAYS_INLINE
bool equal(const RDom &bounds0, const RDom &bounds1)
Return true if bounds0 and bounds1 represent the same bounds.
HALIDE_ALWAYS_INLINE bool graph_less_than(const IRNode &a, const IRNode &b)
Check if two defined Stmts or Exprs are in a lexicographic order.
bool graph_less_than_impl(const IRNode &a, const IRNode &b)
bool equal_impl(const IRNode &a, const IRNode &b)
bool less_than_impl(const IRNode &a, const IRNode &b)
bool graph_equal_impl(const IRNode &a, const IRNode &b)
HALIDE_ALWAYS_INLINE bool less_than(const IRNode &a, const IRNode &b)
Check if two defined Stmts or Exprs are in a lexicographic order.
HALIDE_ALWAYS_INLINE bool graph_equal(const IRNode &a, const IRNode &b)
Check if two defined Stmts or Exprs are equal.
This file defines the class FunctionDAG, which is our representation of a Halide pipeline,...
@ Internal
Not visible externally, similar to 'static' linkage in C.
Type Int(int bits, int lanes=1)
Constructing a signed integer type.
A fragment of Halide syntax.
HALIDE_ALWAYS_INLINE Type type() const
Get the type of this expression node.
A compare struct built around less_than, for use as the comparison object in a std::map or std::set.
bool operator()(const IRHandle &a, const IRHandle &b) const
A compare struct built around graph_less_than, for use as the comparison object in a std::map or std:...
bool operator()(const IRHandle &a, const IRHandle &b) const
IR nodes are passed around opaque handles to them.
const T * as() const
Downcast this ir node to its actual type (e.g.
The abstract base classes for a node in the Halide IR.
IRNodeType node_type
Each IR node subclass has a unique identifier.
HALIDE_ALWAYS_INLINE bool defined() const
T * get() const
Access the raw pointer in a variety of ways.