ΒΆllvm::IntervalMapImpl::IdxPair distribute(
    unsigned int Nodes,
    unsigned int Elements,
    unsigned int Capacity,
    const unsigned int* CurSize,
    unsigned int* NewSize,
    unsigned int Position,
    bool Grow)

Description

IntervalMapImpl::distribute - Compute a new distribution of node elements after an overflow or underflow. Reserve space for a new element at Position, and compute the node that will hold Position after redistributing node elements. It is required that Elements == sum(CurSize), and Elements + Grow < = Nodes * Capacity. NewSize[] will be filled in such that: sum(NewSize) == Elements, and NewSize[i] < = Capacity. The returned index is the node where Position will go, so: sum(NewSize[0..idx-1]) < = Position sum(NewSize[0..idx]) >= Position The last equality, sum(NewSize[0..idx]) == Position, can only happen when Grow is set and NewSize[idx] == Capacity-1. The index points to the node before the one holding the Position'th element where there is room for an insertion.

Declared at: llvm/include/llvm/ADT/IntervalMap.h:414

Parameters

unsigned int Nodes
The number of nodes.
unsigned int Elements
Total elements in all nodes.
unsigned int Capacity
The capacity of each node.
const unsigned int* CurSize
Array[Nodes] of current node sizes, or NULL.
unsigned int* NewSize
Array[Nodes] to receive the new node sizes.
unsigned int Position
Insert position.
bool Grow
Reserve space for a new element at Position.

Returns

(node, offset) for Position.