Lines Matching refs:childNum
329 CF_INLINE CFStorageNode *__CFStorageFindChild(const CFStorageNode * restrict node, CFIndex byteNum, bool forInsertionOrDeletion, CFIndex * restrict childNum, CFIndex * restrict relativeByteNum) {
333 if (byteNum < result->numBytes) *childNum = 0;
337 if (byteNum < result->numBytes) *childNum = 1;
340 *childNum = 2;
362 CFIndex childNum;
364 CFStorageNode *child = __CFStorageFindChild(node, byteNum, false, &childNum, &relativeByteNum);
369 __CFStorageSetChild(node, childNum, unfrozenReplacement);
714 CFIndex childNum;
715 CFStorageNode *child = __CFStorageFindChild(node, byteNum, true, &childNum, &relativeByteNum);
716 ASSERT(childNum >= 0 && childNum <= 2);
723 if (newChildren[childNum] != childReturn.child) {
724 __CFStorageReleaseNode(storage, newChildren[childNum]);
725 newChildren[childNum] = childReturn.child; // Transfers the retain
728 if (childNum < 2) newChildren[3] = newChildren[2];
729 if (childNum < 1) newChildren[2] = newChildren[1];
730 newChildren[childNum + 1] = childReturn.sibling; // Transfers the retain
823 CFIndex childNum; // we will insert after childNum, i.e. if childNum is 0, any new node becomes index 1. This can have value 0, 1, or 2.
824 CFStorageNode *childNode = __CFStorageFindChild(node, byteNum, true, &childNum, &relativeByteNum);
833 __CFStorageSetChild(node, childNum, newNodes.child);
843 if (childNum == 0) __CFStorageSetChild(node, 2, node->info.notLeaf.child[1]); // Make room
844 __CFStorageSetChild(node, childNum+1, newChild);
848 if (childNum == 0) { // Last two children go to new node
853 } else if (childNum == 1) { // Last child goes to new node