| 340 | } |
| 341 | |
| 342 | TreeNode *allocTreeNode() |
| 343 | { |
| 344 | if(!gTreeFreeList) |
| 345 | { |
| 346 | PageRecord *newPage = allocPage(TreeNodeAllocCount * sizeof(TreeNode)); |
| 347 | TreeNode *walk = (TreeNode *) newPage->basePtr; |
| 348 | U32 i; |
| 349 | gTreeFreeList = walk; |
| 350 | for(i = 0; i < TreeNodeAllocCount - 1; i++, walk++) |
| 351 | walk->parent = walk + 1; |
| 352 | walk->parent = NULL; |
| 353 | } |
| 354 | TreeNode *ret = gTreeFreeList; |
| 355 | gTreeFreeList = ret->parent; |
| 356 | return ret; |
| 357 | } |
| 358 | |
| 359 | void freeTreeNode(TreeNode *tn) |
| 360 | { |
no test coverage detected