static bits64 rWriteIndexLevel(bits16 blockSize, int childNodeSize,
struct rTree *tree, int curLevel, int destLevel,
bits64 offsetOfFirstChild, FILE *f)
/* Recursively write an index level, skipping levels below destLevel,
* writing out destLevel. */
{
// uglyf("rWriteIndexLevel blockSize=%d, childNodeSize=%d, offsetOfFirstChild=%llu, curLevel=%d, destLevel=%d slCount(tree)=%d\n", blockSize, childNodeSize, offsetOfFirstChild, curLevel, destLevel, slCount(tree->children));
struct rTree *el;
bits64 offset = offsetOfFirstChild;
if (curLevel == destLevel)
{
/* We've reached the right level, write out a node header */
UBYTE reserved = 0;
UBYTE isLeaf = FALSE;
bits16 countOne = slCount(tree->children);
writeOne(f, isLeaf);
writeOne(f, reserved);
writeOne(f, countOne);
/* Write out elements of this node. */
for (el = tree->children; el != NULL; el = el->next)
{
writeOne(f, el->startChromIx);
writeOne(f, el->startBase);
writeOne(f, el->endChromIx);
writeOne(f, el->endBase);
writeOne(f, offset);
offset += childNodeSize;
}
/* Write out zeroes for empty slots in node. */
int i;
for (i=countOne; i<blockSize; ++i)
repeatCharOut(f, 0, indexSlotSize);
}
else
{
/* Otherwise recurse on children. */
for (el = tree->children; el != NULL; el = el->next)
offset = rWriteIndexLevel(blockSize, childNodeSize, el, curLevel+1, destLevel,
offset, f);
}
return offset;
}
static void writeIndexLevel(int blockSize, int childNodeSize,
struct rTree *tree, bits64 offsetOfFirstChild, int level, FILE *f)
/* Write out a non-leaf level nodes at given level. */
{
rWriteIndexLevel(blockSize, childNodeSize, tree, 0, level, offsetOfFirstChild, f);
}