Searched refs:childCount (Results 1 - 11 of 11) sorted by relevance
/haiku/src/system/kernel/disk_device_manager/ |
H A D | UserDataWriter.h | 24 user_partition_data *AllocatePartitionData(size_t childCount); 25 user_disk_device_data *AllocateDeviceData(size_t childCount);
|
H A D | UserDataWriter.cpp | 85 UserDataWriter::AllocatePartitionData(size_t childCount) argument 89 + sizeof(user_partition_data*) * ((int32)childCount - 1), 95 UserDataWriter::AllocateDeviceData(size_t childCount) argument 99 + sizeof(user_partition_data*) * ((int32)childCount - 1),
|
/haiku/src/tests/system/kernel/file_corruption/fs/ |
H A D | File.cpp | 55 uint32 childCount; // number of child blocks of the last block of member in struct:File::LevelInfo 455 infos[0].childCount = 0; 462 infos[i].childCount = (blockCount - 1) % kFileBlockMaxCount + 1; 510 infos[level].childCount); 513 if (infos[level].childCount == 0) { 518 infos[level].childCount = kFileBlockMaxCount; 529 uint64 blockIndex = infos[level].blockData[infos[level].childCount - 1]; 547 info.blockData[info.childCount - 1] = 0; 558 infos[level].childCount--; 581 memcpy(infos[0].blockData, blockData, infos[i].childCount * 618 uint32 childCount = infos[0].childCount; local [all...] |
/haiku/src/tests/kits/interface/layout/widget_layout_test/ |
H A D | GroupView.cpp | 339 int32 childCount = CountChildren(); local 342 count = min_c(fLineCount, childCount); 344 count = (childCount + fLineCount - 1) / fLineCount; 353 int32 childCount = CountChildren(); local 356 count = (childCount + fLineCount - 1) / fLineCount; 358 count = min_c(fLineCount, childCount);
|
/haiku/src/kits/debugger/value/ |
H A D | ValueNode.cpp | 61 int32 childCount = CountChildren(); local 62 for (int32 i = 0; i < childCount; i++)
|
/haiku/src/kits/storage/disk_device/ |
H A D | DiskDeviceJobGenerator.cpp | 270 int32 childCount = 0; local 277 MoveInfo& info = fMoveInfos[childCount]; 278 childCount++; 300 if (childCount > 0 && moveForth + moveBack > 0) { 301 qsort(fMoveInfos, childCount, sizeof(MoveInfo), 310 for (int32 i = 0; i < childCount; i++) { 329 for (int32 i = childCount - 1; i >= 0; i--) { 332 if (i == childCount - 1
|
/haiku/src/kits/shared/ |
H A D | ColorQuantizer.cpp | 218 uint32 childCount = 0; local 231 childCount++; 241 *_leafCount -= (childCount - 1);
|
/haiku/src/apps/debugger/user_interface/gui/team_window/ |
H A D | VariablesView.cpp | 1257 int32 childCount = valueNode->CountChildren(); 1258 for (int32 i = 0; i < childCount; i++) { 1262 child->IsInternal(), childCount == 1); 1395 int32 childCount = modelNode->CountChildren(); local 1396 if (childCount == 1) { 1402 return childCount; 1415 int32 childCount = modelNode->CountChildren(); local 1416 if (childCount == 1) { 3028 int32 childCount = isRoot ? fVariableTableModel->CountChildren(parent) local 3030 for (int32 i = 0; i < childCount; 3086 int32 childCount = isRoot ? fVariableTableModel->CountChildren(parent) local [all...] |
/haiku/src/kits/tracker/ |
H A D | VirtualDirectoryManager.cpp | 654 int32 childCount = info->Children().CountItems(); local 655 for (int32 i = childCount -1; i >= 0; i--) {
|
/haiku/src/apps/debuganalyzer/gui/table/ |
H A D | TreeTable.cpp | 1092 int32 childCount = child->CountChildren(); local 1093 if (childCount > 0) 1094 _RemoveChildRows(child, 0, childCount);
|
/haiku/src/kits/interface/ |
H A D | View.cpp | 5205 int32 childCount = CountChildren(); local 5206 for (int32 i = 0; i < childCount; i++) {
|
Completed in 184 milliseconds