Root segment storage

DEDB root segments are stored as prescribed by the randomizing routine, and are chained in ascending key sequence from each anchor point.

Each CI in the base section of a UOW in an area has a single anchor point. Sequential processing using GN calls processes the roots in the following order:

1. Ascending area number
2. Ascending UOW
3. Ascending key in each anchor point chain

Each root segment contains, in ascending key sequence, a PTF pointer containing the RBA of the next root.