Searched refs:children (Results 1 - 25 of 65) sorted by last modified time

123

/haiku/src/system/kernel/
H A Dint.cpp420 node = node->children[nextID % levelSize];
H A Dteam.cpp159 // A list of process groups of children of dying session leaders that need to
434 hash_next = siblings_next = parent = children = group_next = NULL;
450 dead_children.condition_variable.Init(&dead_children, "team children");
1158 kprintf("children: %p\n", team->children);
1288 team->siblings_next = parent->children;
1289 parent->children = team;
1307 for (child = parent->children; child != NULL;
1311 parent->children = child->siblings_next;
2322 /*! Returns if the specified team \a parent has any children belongin
2354 get_job_control_entry(team_job_control_children& children, pid_t id) argument
[all...]
H A Dcpu.cpp208 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...]
H A Dsystem_info.cpp417 count_topology_nodes(node->children[i], count);
426 node = node->children[0];
455 topology = generate_topology_array(topology, node->children[i], count);
/haiku/src/system/kernel/scheduler/
H A Dscheduler.cpp610 traverse_topology_tree(node->children[i], packageID, coreID);
/haiku/src/system/kernel/device_manager/
H A Ddevfs.cpp288 // and has children
841 devfs_vnode* children = vnode->stream.u.dir.dir_head; local
842 while (children != NULL) {
843 kprintf(" %p, id %" B_PRIdINO "\n", children, children->id);
844 children = children->dir_next;
/haiku/headers/private/kernel/
H A Dthread_types.h227 Team *children; // protected by this team's fLock; member in struct:BKernel::Team
H A Dcpu.h44 cpu_topology_node** children; member in struct:cpu_topology_node
/haiku/src/add-ons/kernel/file_systems/websearchfs/
H A Dwebsearchfs.h66 struct fs_node *parent, *children; member in struct:fs_node
H A Dwebsearchfs.c254 TRACE("SLL_REMOVE(node->parent->children %p, next, %p)\n", node->parent->children, node);
255 SLL_REMOVE(node->parent->children, next, node);
338 n = (fs_node *)SLL_FIND(base->children, next,
454 for (n = node->children; n && index; n = n->next, index--); //XXX: care about n->hidden || n->deleted
697 n = (fs_node *)SLL_FIND(dir->children, next,
711 n = (fs_node *)SLL_FIND(dir->children, next,
748 err = SLL_INSERT(dir->children, next, n);
815 n = (fs_node *)SLL_FIND(dir->children, next,
818 if (n->children)
[all...]
/haiku/src/kits/storage/disk_device/
H A DPartition.cpp1289 // create and init children
1294 error = child->_SetTo(fDevice, this, fPartitionData->children[i]);
1311 // delete children
1330 // remove all children not longer persistent
1340 if (data->children[k]->id == child->ID()) {
1344 data->children[k], updated);
1350 data->children[k]->user_data = child;
1389 // add new children and update existing ones
1392 user_partition_data* childData = data->children[i];
1426 // delete the BPartition and its children
[all...]
/haiku/src/system/kernel/disk_device_manager/
H A DKPartition.cpp1194 // children
1314 // children
1319 data->children[i] = childData;
1320 writer.AddRelocationEntry(&data->children[i]);
/haiku/headers/private/system/
H A Dddm_userland_interface_defs.h40 user_partition_data* children[1]; member in struct:user_partition_data
/haiku/src/libs/compat/freebsd_network/
H A Ddevice.c39 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/kits/package/hpkg/
H A DPackageWriterImpl.cpp70 DoublyLinkedList<Attribute> children; member in struct:BPackageKit::BHPKG::BPrivate::PackageWriterImpl::Attribute
85 children.Add(child);
90 children.Remove(child);
95 while (Attribute* child = children.RemoveHead())
102 = children.GetIterator(); Attribute* child = it.Next();) {
125 = children.GetIterator(); Attribute* child = it.Next();) {
141 = children.GetIterator(); Attribute* child = it.Next();) {
414 = attribute->children.GetIterator();
1129 // directory -- recursively add children
1243 = attribute->children
[all...]
H A DWriterImplBase.cpp205 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/add-ons/kernel/drivers/network/ether/sis900/dev/sis/
H A Dif_sis.c2367 struct sysctl_oid_list *children; local
2371 children = SYSCTL_CHILDREN(device_get_sysctl_tree(sc->sis_dev));
2382 SYSCTL_ADD_INT(ctx, children, OID_AUTO, "manual_pad",
/haiku/src/add-ons/kernel/drivers/network/ether/rtl81xx/dev/re/
H A Dif_re.c3975 struct sysctl_oid_list *children; local
3979 children = SYSCTL_CHILDREN(device_get_sysctl_tree(sc->rl_dev));
3981 SYSCTL_ADD_PROC(ctx, children, OID_AUTO, "stats",
3987 SYSCTL_ADD_PROC(ctx, children, OID_AUTO, "int_rx_mod",
/haiku/src/add-ons/kernel/drivers/network/ether/rtl8139/dev/rl/
H A Dif_rl.c644 struct sysctl_oid_list *children; local
658 children = SYSCTL_CHILDREN(device_get_sysctl_tree(sc->rl_dev));
659 SYSCTL_ADD_INT(ctx, children, OID_AUTO, "twister_enable", CTLFLAG_RD,
/haiku/src/add-ons/kernel/drivers/network/ether/broadcom570x/dev/bge/
H A Dif_bge.c6252 struct sysctl_oid_list *children; local
6256 children = SYSCTL_CHILDREN(device_get_sysctl_tree(sc->bge_dev));
6259 SYSCTL_ADD_PROC(ctx, children, OID_AUTO, "debug_info",
6263 SYSCTL_ADD_PROC(ctx, children, OID_AUTO, "reg_read",
6267 SYSCTL_ADD_PROC(ctx, children, OID_AUTO, "ape_read",
6271 SYSCTL_ADD_PROC(ctx, children, OID_AUTO, "mem_read",
6291 SYSCTL_ADD_INT(ctx, children, OID_AUTO, "forced_collapse",
6297 SYSCTL_ADD_INT(ctx, children, OID_AUTO, "msi",
6311 SYSCTL_ADD_INT(ctx, children, OID_AUTO, "forced_udpcsum",
6317 bge_add_sysctl_stats_regs(sc, ctx, children);
6332 struct sysctl_oid_list *children, *schildren; local
[all...]
/haiku/src/add-ons/kernel/drivers/disk/nvme/libnvme/
H A Dnvme_internal.h268 TAILQ_HEAD(, nvme_request) children; member in struct:nvme_request
H A Dnvme_qpair.c1025 * children but not the parent request itself, since the
1028 TAILQ_FOREACH_SAFE(child_req, &req->children, child_tailq, tmp) {
H A Dnvme_request.c139 * 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/src/libs/alm/
H A DALMLayout.cpp1276 BALMLayout::LayoutInvalidated(bool children) argument
1285 fSolver->Invalidate(children);
/haiku/src/kits/interface/
H A DCardLayout.cpp184 BCardLayout::LayoutInvalidated(bool children) argument
197 // this cannot be done when we are viewless, as our children

Completed in 340 milliseconds

123