Change Details

Introduce the Array-based Red-Black Tree macros: just like the usual tree(3) RB ones, but using an array (preallocated, linear chunk of memory) to store it. This avoids the allocation overhead, improves memory locality, and makes it trivially easy to share/transfer/copy the entire tree without the need for marshalling. The downside is that the size is fixed at initialization time; there is no mechanism to resize it. This is one of the dependencies for the new stats(3) code. Sponsored By: Klara Inc, Netflix Obtained from: Netflix

Introduce the Array-based Red-Black Tree macros (ARB): similar to the traditional tree(3) RB trees, but using an array (preallocated, linear chunk of memory) to store the tree. This avoids allocation overhead, improves memory locality, and makes it trivially easy to share/transfer/copy the entire tree without the need for marshalling. The downside is that the size is fixed at initialization time; there is no mechanism to resize it. This is one of the dependencies for the new stats(3) code. Sponsored By: Klara Inc, Netflix Obtained from: Netflix

Introduce the Array-based Red-Black Tree macros: just like the (ARB): similar to usuthe traditional tree(3) RB onestrees, but using an array (preallocated, linear linear chunk of memory) to store itthe tree. This avoids the allocation overhead, improves memory locality, and makes it trivially easy to share/transfer/copy the entire tree without the need for marshalling. The downside is that the size is fixed at initialization time; there is no mechanism to resize it. This is one of the dependencies for the new stats(3) code. Sponsored By: Klara Inc, Netflix Obtained from: Netflix