Searched refs:fChildren (Results 1 - 25 of 40) sorted by last modified time

12

/haiku/src/system/kernel/device_manager/
H A Ddevice_manager.cpp136 const NodeList& Children() const { return fChildren; }
184 NodeList fChildren; member in struct:device_node
1337 while (device_node* child = fChildren.RemoveHead()) {
1477 NodeList::Iterator iterator = fChildren.GetIterator();
1487 fChildren.InsertBefore(before, node);
1495 fChildren.Remove(node);
1542 if (!fChildren.IsEmpty()) {
1963 NodeList::Iterator iterator = fChildren.GetIterator();
1975 NodeList::Iterator iterator = fChildren.GetIterator();
1981 return fChildren
[all...]
H A DIORequest.cpp870 fChildren.Add(subRequest);
882 while (IORequestChunk* chunk = fChildren.RemoveHead())
966 ASSERT(fChildren.IsEmpty()
967 || dynamic_cast<IOOperation*>(fChildren.Head()) == NULL);
1046 fChildren.Remove(operation);
1164 return dynamic_cast<IORequest*>(fChildren.Head());
1173 return dynamic_cast<IORequest*>(fChildren.GetNext(previous));
1182 fChildren.Add(operation);
1191 fChildren.Remove(operation);
1474 IORequestChunkList::ConstIterator iterator = fChildren
[all...]
H A DIORequest.h340 IORequestChunkList fChildren; member in struct:IORequest
/haiku/src/kits/debugger/dwarf/
H A DDebugInfoEntries.cpp1893 fChildren.Add(child);
2698 fChildren.Add(child);
2743 fChildren.Add(child);
2789 fChildren.Add(child);
H A DDebugInfoEntries.h1232 { return fChildren; }
1237 DebugInfoEntryList fChildren; member in class:DIENamespace
1686 { return fChildren; }
1692 DebugInfoEntryList fChildren; member in class:DIETemplateTypeParameterPack
1708 { return fChildren; }
1714 DebugInfoEntryList fChildren; member in class:DIETemplateValueParameterPack
1730 { return fChildren; }
1736 DebugInfoEntryList fChildren; member in class:DIECallSite
1752 { return fChildren; }
1758 DebugInfoEntryList fChildren; member in class:DIECallSiteParameter
[all...]
/haiku/src/add-ons/kernel/bus_managers/usb/
H A Dusb_private.h656 { return fChildren[index]; }
686 Device * fChildren[USB_MAX_PORT_COUNT]; member in class:Hub
H A DHub.cpp29 fChildren[i] = NULL;
116 if (fChildren[i] == NULL)
119 fChildren[i]->Changed(changeList, false);
120 fChildren[i] = NULL;
211 fChildren[i], fChildren[i] != NULL
212 ? fChildren[i]->USBID() : 0);
218 && fChildren[i] == NULL)) {
256 if (fChildren[i] != NULL) {
259 fChildren[
[all...]
/haiku/src/kits/storage/disk_device/
H A DMutablePartition.cpp338 index = fChildren.CountItems();
339 else if (index > fChildren.CountItems())
358 if (!fChildren.AddItem(child, index)) {
365 fChildren.RemoveItem(child);
420 BMutablePartition* child = (BMutablePartition*)fChildren.RemoveItem(index);
464 return (BMutablePartition*)fChildren.ItemAt(index);
472 return fChildren.CountItems();
482 return fChildren.IndexOf(child);
550 if (!fParent->fChildren.AddItem(this))
/haiku/src/apps/debugger/user_interface/gui/team_window/
H A DVariablesView.cpp292 for (int32 i = 0; ModelNode* child = fChildren.ItemAt(i); i++)
500 return fChildren.CountItems();
505 return fChildren.ItemAt(index);
510 return fChildren.IndexOf(child);
515 if (!fChildren.AddItem(child))
524 if (!fChildren.RemoveItem(child))
533 for (int32 i = 0; i < fChildren.CountItems(); i++)
534 RemoveChild(fChildren.ItemAt(i));
573 ChildList fChildren; member in class:VariablesView::ModelNode
/haiku/src/system/kernel/disk_device_manager/
H A DKPartition.cpp58 fChildren(),
876 status_t error = fChildren.Insert(partition, index);
880 fChildren.Erase(index);
942 KPartition* partition = fChildren.ElementAt(index);
945 || !fChildren.Erase(index)) {
948 _UpdateChildIndices(index, fChildren.Count());
965 int32 index = fChildren.IndexOf(child);
988 return index >= 0 && index < fChildren.Count()
989 ? fChildren.ElementAt(index) : NULL;
1610 fChildren
[all...]
/haiku/headers/private/kernel/disk_device_manager/
H A DKPartition.h224 PartitionVector fChildren; member in class:BPrivate::DiskDevice::KPartition
/haiku/headers/private/storage/
H A DMutablePartition.h101 BList fChildren; member in class:BMutablePartition
/haiku/src/kits/package/hpkg/
H A DPackageWriterImpl.cpp324 fChildren.Add(child);
329 while (Entry* child = fChildren.RemoveHead())
335 EntryList::ConstIterator it = fChildren.GetIterator();
346 return fChildren.GetIterator();
354 EntryList fChildren; member in struct:BPackageKit::BHPKG::BPrivate::PackageWriterImpl::Entry
/haiku/src/add-ons/kernel/drivers/input/hid_shared/
H A DHIDCollection.cpp49 for (int32 i = 0; i < fChildren.Count(); i++)
50 delete fChildren[i];
75 if (fChildren.PushBack(child) == B_NO_MEMORY) {
86 int32 count = fChildren.Count();
90 return fChildren[index];
101 for (int32 i = 0; i < fChildren.Count(); i++) {
102 HIDCollection *child = fChildren[i];
146 for (int32 i = 0; i < fChildren.Count(); i++) {
147 HIDCollection *child = fChildren[i];
208 TRACE_ALWAYS("%s\tchild count: %" B_PRIu32 "\n", indent, fChildren
[all...]
H A DHIDCollection.h29 uint32 CountChildren() { return fChildren.Count(); };
58 Vector<HIDCollection *> fChildren; member in class:HIDCollection
/haiku/src/add-ons/kernel/file_systems/packagefs/package/
H A DPackageDirectory.cpp25 while (PackageNode* child = fChildren.RemoveHead())
33 fChildren.Add(node);
41 fChildren.Remove(node);
H A DPackageDirectory.h30 { return fChildren; }
36 PackageNodeList fChildren; member in class:PackageDirectory
43 return fChildren.First();
50 return fChildren.GetNext(node);
/haiku/src/kits/debugger/value/value_nodes/
H A DBMessageValueNode.cpp125 for (int32 i = 0; i < fChildren.CountItems(); i++)
126 fChildren.ItemAt(i)->ReleaseReference();
341 fChildren.AddItem(whatNode);
367 fChildren.AddItem(node);
382 return fChildren.CountItems();
389 return fChildren.ItemAt(index);
667 fChildren.AddItem(child);
682 return fChildren.CountItems();
688 return fChildren.ItemAt(index);
H A DBListValueNode.cpp178 for (int32 i = 0; i < fChildren.CountItems(); i++)
179 fChildren.ItemAt(i)->ReleaseReference();
309 return fChildren.CountItems();
316 return fChildren.ItemAt(index);
337 fChildren.MakeEmpty();
365 fChildren.AddItem(countChild);
398 fChildren.AddItem(child);
/haiku/src/apps/debuganalyzer/gui/
H A DAbstractWaitObjectsPage.h281 fChildren(20, true)
287 fChildren(20, true)
289 fChildren.AddList(&nodes);
295 for (int32 i = 0; Node* node = fChildren.ItemAt(i); i++) {
303 Node* child = fChildren.ItemAt(0);
309 Node* child = fChildren.ItemAt(0);
335 return fChildren.CountItems();
340 return fChildren.ItemAt(index);
344 BObjectList<Node> fChildren; member in struct:AbstractWaitObjectsPage::WaitObjectsTreeModel::NodeContainerNode
359 = groupByName ? tempChildren : NodeContainerNode::fChildren;
[all...]
/haiku/src/add-ons/kernel/network/ppp/shared/libkernelppp/
H A DKPPPInterface.cpp1187 if (fChildren.HasItem(child) || !fChildren.AddItem(child))
1204 if (!fChildren.RemoveItem(child))
1225 KPPPInterface *child = fChildren.ItemAt(index);
1227 if (child == fChildren.GetDefaultItem())
/haiku/src/system/boot/loader/
H A Dpartitions.cpp156 if (!p->fChildren.IsEmpty()) {
157 Partition *c = Lookup(id, &p->fChildren);
248 fChildren.Add(child);
397 NodeIterator iterator = fChildren.GetIterator();
410 fChildren.Remove(child);
417 while ((child = (Partition *)fChildren.Head()) != NULL) {
418 fChildren.Remove(child);
/haiku/src/kits/debugger/value/
H A DValueNodeContainer.cpp20 fChildren(20, false),
43 return fChildren.CountItems();
50 return fChildren.ItemAt(index);
59 if (!fChildren.AddItem(child))
72 if (child->Container() != this || !fChildren.RemoveItem(child))
90 fChildren.MakeEmpty();
/haiku/src/apps/debuganalyzer/gui/table/
H A DTreeTable.cpp466 NodeList* fChildren; member in class:TreeTableNode
474 fChildren(NULL)
481 delete fChildren;
516 if (fChildren != NULL) {
517 for (int32 i = 0; TreeTableNode* child = fChildren->ItemAt(i); i++)
534 if (fChildren == NULL) {
535 fChildren = new(std::nothrow) NodeList(10, true);
536 if (fChildren == NULL)
540 return fChildren->AddItem(child, index);
547 return fChildren !
[all...]
/haiku/headers/private/kernel/boot/
H A Dpartitions.h48 NodeList fChildren; member in class:boot::Partition

Completed in 389 milliseconds

12