Searched refs:next (Results 226 - 250 of 546) sorted by path

1234567891011>>

/haiku/headers/private/kernel/
H A Dthread_types.h151 struct free_user_thread* next; member in struct:free_user_thread
222 Team *hash_next; // next in hash
223 Team *siblings_next; // next in parent's list; protected by
669 struct ProcessGroup *next; // next in hash member in struct:BKernel::ProcessGroup
H A Dvfs.h314 StackableAsyncIOCallback(AsyncIOCallback* next);
H A Dwait_for_objects.h18 struct select_info* next; member in struct:select_info
/haiku/headers/private/kernel/util/
H A DAVLTreeBase.h178 AVLTreeNode* next)
182 fNext(next)
177 AVLTreeIterator(const AVLTreeBase* parent, AVLTreeNode* current, AVLTreeNode* next) argument
H A DDoublyLinkedList.h29 Element* next; member in class:DoublyLinkedListLink
407 elLink->next = NULL;
409 sGetLink(fLast)->next = element;
416 elLink->next = fFirst;
446 link->next = before;
451 sGetLink(link->previous)->next = element;
477 link->next = afterLink->next;
478 afterLink->next = element;
480 if (link->next !
[all...]
H A DDoublyLinkedQueue.h184 elLink->next = fFirst;
206 link->next = before;
209 sGetLink(link->previous)->next = element;
239 fFirst = elLink->next;
241 sGetLink(elLink->previous)->next = elLink->next;
243 if (elLink->next)
244 sGetLink(elLink->next)->previous = elLink->previous;
246 elLink->next = elLink->previous = NULL;
259 Element *aNext = aLink->next;
[all...]
H A DOpenHashTable.h231 ValueType* next = _Link(slot); local
235 _Link(previous) = next;
237 fTable[index] = next;
242 slot = next;
454 ValueType* next = _Link(bucket); local
456 bucket = next;
/haiku/headers/private/net/
H A Dnet_protocol.h47 struct net_protocol* next; member in struct:net_protocol
/haiku/headers/private/runtime_loader/
H A Druntime_loader.h97 struct image_t *next; member in struct:image_t
/haiku/headers/private/userlandfs/fuse/
H A Dfuse.h56 * @param off offset of the next entry or zero
794 * @return the number of seconds until the next cleanup
944 struct fuse_module *next; member in struct:fuse_module
/haiku/headers/private/virtio/
H A Dvirtio_defs.h88 uint16 next; member in struct:VirtioDesc
/haiku/src/add-ons/decorators/BeDecorator/
H A DBeDecorator.cpp899 decorator_bitmap* next; member in struct:decorator_bitmap
950 current = current->next;
1350 entry->next = sBitmapList;
/haiku/src/add-ons/decorators/FlatDecorator/
H A DFlatDecorator.cpp822 decorator_bitmap* next; member in struct:decorator_bitmap
844 current = current->next;
917 entry->next = sBitmapList;
/haiku/src/add-ons/kernel/bluetooth/btCoreData/
H A DConnectionInterface.cpp120 if (conn->GetDoublyLinkedListLink()->next != NULL
149 if (conn->GetDoublyLinkedListLink()->next != NULL
/haiku/src/add-ons/kernel/bus_managers/agp_gart/
H A Dagp_gart.cpp70 aperture_memory *next; member in struct:aperture_memory
292 uint8 next = get_pci_config(info, address + 1, 1) & ~0x3; local
300 if (next == 0) {
305 address = next;
752 last->next = current->next;
754 fFirstMemory = current->next;
760 current = current->next;
770 aperture_memory *next; local
790 next
[all...]
/haiku/src/add-ons/kernel/bus_managers/firewire/
H A Dfirewire.cpp978 struct fw_xfer *xfer, *next;
998 for (xfer = STAILQ_FIRST(&fwb->xferlist); xfer != NULL; xfer = next) {
999 next = STAILQ_NEXT(xfer, link);
1034 struct fw_xfer *xfer, *next; local
1036 for (xfer = STAILQ_FIRST(q); xfer != NULL; xfer = next) {
1037 next = STAILQ_NEXT(xfer, link);
1870 struct fw_device *fwdev, *next; local
1877 for (fwdev = STAILQ_FIRST(&fc->devices); fwdev != NULL; fwdev = next) {
1878 next = STAILQ_NEXT(fwdev, link);
H A Dfwohci.cpp2332 struct fwohcidb *curr = NULL, *prev, *next = NULL; local
2373 next = np->db;
2375 next = NULL;
2397 print_db(np, next, ch, dbch->ndesc);
/haiku/src/add-ons/kernel/bus_managers/pci/
H A Dpci.cpp787 dev = dev->next;
998 for (PCIDev *dev = bus->child; dev; dev = dev->next) {
1035 for (PCIDev *dev = bus->child; dev; dev = dev->next) {
1193 newDev->next = NULL;
1213 while (sub->next)
1214 sub = sub->next;
1215 sub->next = newDev;
1544 for (PCIDev *dev = bus->child; dev; dev = dev->next) {
1817 child = child->next) {
H A Dpci.h34 PCIDev * next; member in struct:PCIDev
H A Dpci_root.cpp53 for (PCIDev* dev = bus->child; dev != NULL; dev = dev->next) {
/haiku/src/add-ons/kernel/bus_managers/scsi/
H A Ddpc.cpp57 dpc->next = bus->dpc_list;
84 bus->dpc_list = dpc->next;
H A Dqueuing.cpp56 scsi_ccb *first, *last, *before, *next; local
142 for( before = last->prev, next = last;
144 next = before, before = before->prev )
146 if( before->sort <= new_request->sort && new_request->sort <= next->sort )
158 before, before->sort, next, next->sort );
163 new_request->next = next;
165 next->prev = new_request;
166 before->next
[all...]
H A Dscsi_internal.h67 struct scsi_dpc_info *next; member in struct:scsi_dpc_info
/haiku/src/add-ons/kernel/bus_managers/usb/
H A DStack.cpp247 change_item *next = changeItem->link; local
249 changeItem = next;
388 rescan_item *next = rescanItem->link; local
390 rescanItem = next;
/haiku/src/add-ons/kernel/bus_managers/virtio/
H A DVirtioQueue.cpp104 fIndirect[i].next = i + 1;
105 fIndirect[indirectMaxSize - 1].next = UINT16_MAX;
169 fRing.desc[i].next = i + 1;
170 fRing.desc[fRingSize - 1].next = UINT16_MAX;
279 index = fRing.desc[index].next;
287 fRing.desc[index].next = fRingHeadIndex;
349 fRingHeadIndex = fRing.desc[insertIndex].next;
378 for (size_t i = 0; i < total; i++, index = desc[index].next) {

Completed in 166 milliseconds

1234567891011>>