dejavu
Fast probabilistic symmetry detection.
|
Creates cell selectors. More...
#include <ir.h>
Public Types | |
enum | selector_style { SELECT_SPARSE , SELECT_COMB , SELECT_SMALL , SELECT_DRY_LAND } |
Public Member Functions | |
int | cell_selector (const coloring *c, const int base_pos) |
std::function< type_selector_hook > * | get_selector_hook () |
big_number | get_ir_size_estimate () |
void | make_cell_selector (sgraph *g, controller *state, controller *state_probe, const selector_style style, const int h_seed, const int h_budget) |
void | find_sparse_optimized_base (sgraph *g, controller *state) |
void | find_first_base (sgraph *g, controller *state) |
void | find_sparse_optimized_base_recurse (sgraph *g, controller *state, int perturbe) |
void | find_small_optimized_base (sgraph *g, controller *state, int perturbe) |
void | find_combinatorial_optimized_base (sgraph *g, controller *state) |
void | find_combinatorial_optimized_base_recurse (sgraph *g, controller *state, int perturbe) |
void | find_early_trace_deviation_base (sgraph *g, controller *state, controller *state_probe, int perturbe) |
Creates cell selectors.
Heuristics which enable the creation of different cell selectors, as well as moving an controller to a leaf of the IR tree.
|
inline |
|
inline |
|
inline |
Find a base/selector for a given graph g
from state state
. Attemtps to find a good base for combinatorial graphs solved by bfs/random walks (i.e., by choosing large colors).
R | A refinement workspace. |
g | The graph. |
state | The IR state from which a base is created. |
|
inline |
Find a base/selector for a given graph g
from state state
. Attemtps to find a good base for combinatorial graphs solved by bfs/random walks (i.e., by choosing large colors).
R | A refinement workspace. |
g | The graph. |
state | The IR state from which a base is created. |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |