#include "FunctionDAG.h"
#include "PerfectHashMap.h"
#include <map>
#include <set>
#include <utility>
#include <vector>
Go to the source code of this file.
|
std::vector< std::vector< int64_t > > | Halide::Internal::Autoscheduler::generate_tilings (const vector< int64_t > &s, int d, int factor, bool allow_splits) |
|
const LoopNest * | Halide::Internal::Autoscheduler::deepest_common_ancestor (const std::map< const LoopNest *, std::pair< const LoopNest *, int > > &parents, const LoopNest *a, const LoopNest *b) |
|
void | Halide::Internal::Autoscheduler::compute_loop_nest_parents (std::map< const LoopNest *, std::pair< const LoopNest *, int > > &parents, const LoopNest *here, int depth) |
|