15#include <unordered_map>
16#include <unordered_set>
21namespace Autoscheduler {
67 vector<vector<int64_t>> &inner_tilings,
68 const vector<int64_t> &pure_size)
const;
78 int &num_children)
const;
96 std::unordered_map<uint64_t, StateVector> &secondary_options,
This file defines the class FunctionDAG, which is our representation of a Halide pipeline,...
@ Internal
Not visible externally, similar to 'static' linkage in C.
signed __INT64_TYPE__ int64_t
bool operator<(const ParallelTileOption &other) const
ParallelTileOption & operator=(const ParallelTileOption &)=delete
ParallelTileOption & operator=(ParallelTileOption &&)=default
ParallelTileOption(const ParallelTileOption &)=delete
vector< int64_t > outer_tiling
ParallelTileOption(ParallelTileOption &&)=default
vector< int64_t > inner_tiling
ParallelTileOption()=default
bool add_states_from_memoized_blocks(const IntrusivePtr< State > &state, std::function< void(IntrusivePtr< State > &&)> &accept_child, const FunctionDAG::Node *node, int &num_children) const
std::vector< IntrusivePtr< State > > StateVector
void memoize_blocks(const FunctionDAG::Node *node, LoopNest *new_root)
void process_pending_states(std::unordered_map< uint64_t, StateVector > &primary_options, std::unordered_map< uint64_t, StateVector > &secondary_options, int &num_children, std::function< void(IntrusivePtr< State > &&)> &accept_child, const FunctionDAG::Node *node)
vector< ParallelTileOption > filter_parallel_tile_options(const IntrusivePtr< State > &state, const FunctionDAG::Node *node, vector< vector< int64_t > > &inner_tilings, const vector< int64_t > &pure_size) const
NodeMap< std::vector< IntrusivePtr< const LoopNest > > > compute_root_nodes
const LoopNestParser * partial_schedule
const Anderson2021Params & params
vector< ThreadTileOption > filter_thread_tile_options(vector< IntrusivePtr< const LoopNest > > &loop_nests) const
bool add_child(const IntrusivePtr< State > &state, const IntrusivePtr< const LoopNest > &new_root, std::function< void(IntrusivePtr< State > &&)> &accept_child) const
vector< vector< int64_t > > generate_compute_root_serial_tilings(const IntrusivePtr< const LoopNest > &pure_stage, const FunctionDAG::Node *node) const
bool is_in_partial_schedule(const FunctionDAG::Node *node) const
NodeMap< bool > inlined_nodes
void freeze_lowest_cost_stages(const IntrusivePtr< State > &best)
NodeMap< std::map< int, std::vector< IntrusivePtr< const LoopNest > > > > memoized_compute_root_blocks
void generate_children(const IntrusivePtr< State > &state, std::function< void(IntrusivePtr< State > &&)> &accept_child, int pass_idx, bool is_pre_pass)
SearchSpaceOptions search_space_options
SearchSpace(const FunctionDAG &dag, const Anderson2021Params ¶ms, const Target &target, std::mt19937 &rng, CostModel *cost_model, Statistics &stats, const LoopNestParser *partial_schedule)
Intrusive shared pointers have a reference count (a RefCount object) stored in the class itself.
A struct representing a target machine and os to generate code for.