a collection of allocation configurations that balances speed and performance of allocation. More...

#include <utils_v2.h>

Public Attributes
int	n_best_of_sc_alloc = 1
	Allocator will find the best score out of this number of allocation for a super cluster.

int	n_dfs_steps_sc_alloc = 256

bool	stop_first_succ_empty_normal_container = false

bool	try_byte_aligned_starts_first_for_table_keys = false
	For table match key fields, try byte-aligned container starts first.

Detailed Description

a collection of allocation configurations that balances speed and performance of allocation.

Member Data Documentation

◆ n_best_of_sc_alloc

int PHV::v2::SearchConfig::n_best_of_sc_alloc = 1

Allocator will find the best score out of this number of allocation for a super cluster.

◆ n_dfs_steps_sc_alloc

int PHV::v2::SearchConfig::n_dfs_steps_sc_alloc = 256

The number of DFS steps that allocator can use for each super cluster. This variable sets the upper-bound of searching time. Ideally, each step can place one slice list to a container.

◆ stop_first_succ_empty_normal_container

bool PHV::v2::SearchConfig::stop_first_succ_empty_normal_container = false

Allocator will stop try allocating candiddates to other containers if candidates have been successfully allcoated to an empty normal container.

◆ try_byte_aligned_starts_first_for_table_keys

bool PHV::v2::SearchConfig::try_byte_aligned_starts_first_for_table_keys = false