Searched refs:nChildren (Results 1 – 3 of 3) sorted by relevance
162 for (k = 0; k < root->nChildren; k++) { in skipTree()211 if (cur->nChildren == 0) { in FindChild()223 if (index >= cur->nChildren) { in FindChild()321 for (k = 0; k < nodeP->nChildren; ++k) { in find_entry()437 if (iter->currentIndex >= iter->currentScope->nChildren) { in SecureDTIterateEntries()
85 uint32_t nChildren; // Number of children[] elements member
1182 for (idx = 0; idx < entry->nChildren; idx++) { in MergeDeviceTree()