/haiku/src/apps/diskusage/ |
H A D | Snapshot.cpp | 34 children() 41 while (children.size() != 0) { 42 FileInfo* child = *children.begin(); 44 children.erase(children.begin()); 65 vector<FileInfo*>::const_iterator i = children.begin(); 66 while (i != children.end()) { 90 if (s != B_OK && children.size() > 0) {
|
H A D | Scanner.cpp | 133 vector<FileInfo*>::iterator i = currentDir->children.begin(); 135 while (!contains && i != currentDir->children.end()) { 195 vector<FileInfo *>::iterator i = parent->children.begin(); 204 while (i != parent->children.end() && *i != startInfo) 207 int idx = i - parent->children.begin(); 208 parent->children[idx] = newInfo; 259 thisDir->children.push_back(child); 271 thisDir->children.push_back(_GetFileInfo(&childDir, thisDir)); 276 vector<FileInfo *>::iterator i = thisDir->children.begin(); 277 while (i != thisDir->children [all...] |
H A D | Snapshot.h | 39 std::vector<FileInfo*> children; member in struct:FileInfo
|
/haiku/src/tests/add-ons/print/ppd/model/ |
H A D | StatementListVisitor.cpp | 32 StatementList* children = statement->GetChildren(); local 33 if (children != NULL) { 34 Visit(children);
|
/haiku/src/system/kernel/ |
H A D | cpu.cpp | 208 node->children[id] = newNode; 213 newNode->children 215 if (newNode->children == NULL) 218 memset(newNode->children, 0, 222 newNode->children = NULL; 232 if (node->children == NULL) 237 if (node->children[i] == NULL) 241 node->children[count] = node->children[i]; 243 if (node->children[coun [all...] |
/haiku/src/servers/notification/ |
H A D | AppGroupView.cpp | 141 int32 children = fInfo.size(); local 142 for (int32 i = 0; i < children; i++) { 155 int32 children = fInfo.size(); local 157 for (int32 i = 0; i < children; i++) { 163 for (int32 i = 0; i < children; i++) { 218 int32 children = fInfo.size(); local 219 for (int32 i = 0; i < children; i++) { 231 // Invalidate all children to show or hide the close buttons in the 233 int32 children = fInfo.size(); local 234 for (int32 i = 0; i < children; [all...] |
/haiku/src/kits/package/hpkg/ |
H A D | WriterImplBase.cpp | 205 children.Add(child); 212 while (PackageAttribute* child = children.RemoveHead()) 449 RegisterPackageVersion(provides->children, resolvable->Version()); 452 RegisterPackageVersion(provides->children, 493 attribute->children.Add(isDirectoryAttribute); 502 attribute->children.Add(updateTypeAttribute); 521 attribute->children.Add(isDirectoryAttribute); 525 info->TemplatePath(), attribute->children); 538 attribute->children); 541 attribute->children); [all...] |
/haiku/src/libs/glut/ |
H A D | glutGet.cpp | 70 GlutWindow *children = gState.currentWindow->children; local 71 while (children) { 73 children = children->siblings;
|
H A D | glutWindow.cpp | 84 // set up parent/children relationships 87 siblings = parent->children; 88 parent->children = this; 92 children = 0; 250 // first, find all children recursively and set their entries to 0 251 GlutWindow *cur = window->children; 258 /* Remove from parent's children list (only necessary for 262 GlutWindow **prev = &parent->children; 263 cur = parent->children; 282 /*! Destroy window and all its children [all...] |
/haiku/src/kits/interface/ |
H A D | LayoutItem.cpp | 92 BLayoutItem::InvalidateLayout(bool children) argument 94 LayoutInvalidated(children); 96 fLayout->InvalidateLayout(children); 214 BLayoutItem::LayoutInvalidated(bool children) argument
|
H A D | ViewLayoutItem.h | 47 virtual void LayoutInvalidated(bool children);
|
H A D | Layout.cpp | 301 BLayout::InvalidateLayout(bool children) argument 304 // this, children, (unsigned int)fState, fInvalidationDisabled); 314 LayoutInvalidated(children); 316 if (children) { 318 ItemAt(i)->InvalidateLayout(children); 322 fOwner->InvalidateLayout(children); 533 BLayout::LayoutInvalidated(bool children) argument
|
H A D | AbstractLayoutItem.cpp | 172 BAbstractLayoutItem::LayoutInvalidated(bool children) argument 174 BLayoutItem::LayoutInvalidated(children);
|
H A D | ViewLayoutItem.cpp | 217 BViewLayoutItem::LayoutInvalidated(bool children) argument 219 fView->InvalidateLayout(children);
|
/haiku/src/add-ons/kernel/drivers/disk/nvme/libnvme/ |
H A D | nvme_request.c | 139 * Only memset up to (but not including) the children TAILQ_ENTRY. 145 memset(req, 0, offsetof(struct nvme_request, children)); 197 * Defer initialization of the children TAILQ since it falls 202 TAILQ_INIT(&parent->children); 208 TAILQ_INSERT_TAIL(&parent->children, child, child_tailq); 221 TAILQ_REMOVE(&parent->children, child, child_tailq);
|
/haiku/headers/private/system/ |
H A D | ddm_userland_interface_defs.h | 40 user_partition_data* children[1]; member in struct:user_partition_data
|
/haiku/headers/os/interface/ |
H A D | LayoutItem.h | 51 virtual void InvalidateLayout(bool children = false); 69 virtual void LayoutInvalidated(bool children);
|
H A D | Layout.h | 51 virtual void InvalidateLayout(bool children = false); 79 virtual void LayoutInvalidated(bool children);
|
H A D | AbstractLayoutItem.h | 44 virtual void LayoutInvalidated(bool children);
|
/haiku/src/libs/compat/freebsd_network/ |
H A D | fbsd_mii.c | 137 device_t *children; local 141 if (device_get_children(dev, &children, &nchildren) == 0) { 143 ma = device_get_ivars(children[i]); 146 free(children, M_TEMP); 149 device_printf(dev, "cannot get children\n"); 198 * its PHY children. 240 device_t *children, phy; local 246 if (device_get_children(dev, &children, &nchildren) != 0) 250 args = device_get_ivars(children[i]); 256 free(children, M_TEM 373 device_t *children, phy; local [all...] |
H A D | shared.h | 25 struct list children; member in struct:device
|
H A D | device.c | 39 list_init_etc(&device->children, offsetof(struct device, link)); 195 while ((child = list_get_next_item(&dev->children, child)) != NULL) { 210 while ((child = list_get_next_item(&dev->children, child)) != NULL) { 396 list_add_item(&parent->children, child); 415 /*! Delete the child and all of its children. Detach as necessary. 426 list_remove_item(&parent->children, child); 431 // the children, and will then detach the device. 433 // as you don't know if one of the children deletes its own children this 440 // detach children [all...] |
/haiku/src/apps/debuganalyzer/gui/ |
H A D | AbstractWaitObjectsPage.h | 358 BObjectList<Node>& children local 363 if (!children.AddItem(_CreateGroupNode(group))) 369 if (children.CountItems() < 2) { 370 NodeContainerNode::fChildren.AddList(&children); 375 children.SortItems(&Node::CompareByName); 378 int32 nodeCount = children.CountItems(); 380 Node* previousNode = children.ItemAt(0); 383 Node* node = children.ItemAt(i);
|
/haiku/src/apps/mediaconverter/ |
H A D | MediaFileInfoView.h | 27 virtual void InvalidateLayout(bool children = false);
|
/haiku/src/tests/add-ons/kernel/partitioning_systems/ |
H A D | PartitioningSystemsTest.cpp | 29 PartitionVector children; member in struct:partition_entry 248 if (index < 0 || index >= (int32)partition->children.size()) 251 return partition->children[index]; 278 child->index = parent->children.size(); 280 parent->children.push_back(child);
|