Searched refs:childNum (Results 1 - 3 of 3) sorted by last modified time

/macosx-10.9.5/CF-855.17/
H A DCFStorage.c329 CF_INLINE CFStorageNode *__CFStorageFindChild(const CFStorageNode * restrict node, CFIndex byteNum, bool forInsertionOrDeletion, CFIndex * restrict childNum, CFIndex * restrict relativeByteNum) { argument
333 if (byteNum < result->numBytes) *childNum = 0;
337 if (byteNum < result->numBytes) *childNum = 1;
340 *childNum = 2;
362 CFIndex childNum; local
364 CFStorageNode *child = __CFStorageFindChild(node, byteNum, false, &childNum, &relativeByteNum);
369 __CFStorageSetChild(node, childNum, unfrozenReplacement);
714 CFIndex childNum; local
715 CFStorageNode *child = __CFStorageFindChild(node, byteNum, true, &childNum, &relativeByteNum);
716 ASSERT(childNum >
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. local
[all...]
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/ADT/
H A DSCCIterator.h91 unsigned childNum = nodeVisitNumbers[childN]; local
92 if (MinVisitNumStack.back() > childNum)
93 MinVisitNumStack.back() = childNum;
/macosx-10.9.5/tcl-102/tcl_ext/tclxml/tcldom/tests/
H A Dperf-1.tcl1 # Create $childNum^2 elements
3 set childNum 50
4 catch {set childNum $numChildren}
11 for {set i 0} {$i < $childNum} {incr i} {
13 for {set j 0} {$j < $childNum} {incr j} {

Completed in 119 milliseconds