Algorithm parameters; default values are tuned on real-world binaries. More...

#include "llvm/Support/BalancedPartitioning.h"

Public Attributes
unsigned	SplitDepth = 18
	The depth of the recursive bisection.
unsigned	IterationsPerSplit = 40
	The maximum number of bp iterations per split.
float	SkipProbability = 0.1f
	The probability for a vertex to skip a move from its current bucket to another bucket; it often helps to escape from a local optima.
unsigned	TaskSplitDepth = 9
	Recursive subtasks up to the given depth are added to the queue and distributed among threads by ThreadPool; all subsequent calls are executed on the same thread.

Detailed Description

Algorithm parameters; default values are tuned on real-world binaries.

Definition at line 87 of file BalancedPartitioning.h.

Member Data Documentation

◆ IterationsPerSplit

unsigned llvm::BalancedPartitioningConfig::IterationsPerSplit = 40

The maximum number of bp iterations per split.

Definition at line 91 of file BalancedPartitioning.h.

◆ SkipProbability

float llvm::BalancedPartitioningConfig::SkipProbability = 0.1f

The probability for a vertex to skip a move from its current bucket to another bucket; it often helps to escape from a local optima.

Definition at line 94 of file BalancedPartitioning.h.

◆ SplitDepth

unsigned llvm::BalancedPartitioningConfig::SplitDepth = 18

The depth of the recursive bisection.

Definition at line 89 of file BalancedPartitioning.h.

◆ TaskSplitDepth

unsigned llvm::BalancedPartitioningConfig::TaskSplitDepth = 9

Recursive subtasks up to the given depth are added to the queue and distributed among threads by ThreadPool; all subsequent calls are executed on the same thread.

Definition at line 98 of file BalancedPartitioning.h.

The documentation for this struct was generated from the following file: