add_child(const IntrusivePtr< State > &state, const IntrusivePtr< const LoopNest > &new_root, std::function< void(IntrusivePtr< State > &&)> &accept_child) const | Halide::Internal::Autoscheduler::SearchSpace | |
add_states_from_memoized_blocks(const IntrusivePtr< State > &state, std::function< void(IntrusivePtr< State > &&)> &accept_child, const FunctionDAG::Node *node, int &num_children) const | Halide::Internal::Autoscheduler::SearchSpace | |
compute_root_nodes | Halide::Internal::Autoscheduler::SearchSpace | |
cost_model | Halide::Internal::Autoscheduler::SearchSpace | |
dag | Halide::Internal::Autoscheduler::SearchSpace | |
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 | Halide::Internal::Autoscheduler::SearchSpace | |
filter_thread_tile_options(vector< IntrusivePtr< const LoopNest > > &loop_nests) const | Halide::Internal::Autoscheduler::SearchSpace | |
freeze_lowest_cost_stages(const IntrusivePtr< State > &best) | Halide::Internal::Autoscheduler::SearchSpace | |
generate_children(const IntrusivePtr< State > &state, std::function< void(IntrusivePtr< State > &&)> &accept_child, int pass_idx, bool is_pre_pass) | Halide::Internal::Autoscheduler::SearchSpace | |
generate_compute_root_serial_tilings(const IntrusivePtr< const LoopNest > &pure_stage, const FunctionDAG::Node *node) const | Halide::Internal::Autoscheduler::SearchSpace | |
inlined_nodes | Halide::Internal::Autoscheduler::SearchSpace | |
is_in_partial_schedule(const FunctionDAG::Node *node) const | Halide::Internal::Autoscheduler::SearchSpace | |
memoize_blocks(const FunctionDAG::Node *node, LoopNest *new_root) | Halide::Internal::Autoscheduler::SearchSpace | |
memoized_compute_root_blocks | Halide::Internal::Autoscheduler::SearchSpace | |
params | Halide::Internal::Autoscheduler::SearchSpace | |
partial_schedule | Halide::Internal::Autoscheduler::SearchSpace | |
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) | Halide::Internal::Autoscheduler::SearchSpace | |
rng | Halide::Internal::Autoscheduler::SearchSpace | |
search_space_options | Halide::Internal::Autoscheduler::SearchSpace | |
SearchSpace(const FunctionDAG &dag, const Anderson2021Params ¶ms, const Target &target, std::mt19937 &rng, CostModel *cost_model, Statistics &stats, const LoopNestParser *partial_schedule) | Halide::Internal::Autoscheduler::SearchSpace | |
StateVector typedef | Halide::Internal::Autoscheduler::SearchSpace | |
stats | Halide::Internal::Autoscheduler::SearchSpace | |
target | Halide::Internal::Autoscheduler::SearchSpace | |