/haiku/src/system/libroot/posix/musl/search/ |
H A D | insque.c | 5 struct node *prev; member in struct:node 14 e->next = e->prev = 0; 18 e->prev = p; 21 e->next->prev = e; 29 e->next->prev = e->prev; 30 if (e->prev) 31 e->prev->next = e->next;
|
/haiku/src/add-ons/kernel/bus_managers/scsi/ |
H A D | dl_list.h | 15 if( item->prefix##prev ) \ 16 item->prefix##prev->prefix##next = item->prefix##next; \ 21 item->prefix##next->prefix##prev = item->prefix##prev; \ 27 item->prefix##prev = NULL; \ 30 (head)->prefix##prev = item; \ 37 item->prefix##next->prefix##prev = item->prefix##prev; \ 38 item->prefix##prev->prefix##next = item->prefix##next; \ 56 last = first->prefix##prev; \ [all...] |
H A D | queuing.cpp | 106 last = first->prev; 118 before = before->prev; 142 for( before = last->prev, next = last; 144 next = before, before = before->prev ) 164 new_request->prev = before; 165 next->prev = new_request;
|
/haiku/src/add-ons/kernel/generic/locked_pool/ |
H A D | dl_list.h | 15 if( item->prefix##prev ) \ 16 item->prefix##prev->prefix##next = item->prefix##next; \ 21 item->prefix##next->prefix##prev = item->prefix##prev; \ 27 item->prefix##prev = NULL; \ 30 (head)->prefix##prev = item; \ 37 item->prefix##next->prefix##prev = item->prefix##prev; \ 38 item->prefix##prev->prefix##next = item->prefix##next; \ 56 last = first->prefix##prev; \ [all...] |
/haiku/src/add-ons/kernel/generic/scsi_periph/ |
H A D | dl_list.h | 15 if( item->prefix##prev ) \ 16 item->prefix##prev->prefix##next = item->prefix##next; \ 21 item->prefix##next->prefix##prev = item->prefix##prev; \ 27 item->prefix##prev = NULL; \ 30 (head)->prefix##prev = item; \ 37 item->prefix##next->prefix##prev = item->prefix##prev; \ 38 item->prefix##prev->prefix##next = item->prefix##next; \ 56 last = first->prefix##prev; \ [all...] |
/haiku/src/tools/fs_shell/ |
H A D | list.cpp | 24 list->link.next = list->link.prev = &list->link; 45 link->prev = &list->link; 47 list->link.next->prev = link; 61 link->prev = list->link.prev; 63 list->link.prev->next = link; 64 list->link.prev = link; 77 link->next->prev = link->prev; 78 link->prev [all...] |
/haiku/headers/libs/agg/ |
H A D | agg_shorten_path.h | 50 vertex_type& prev = vs[n-1]; local 52 d = (prev.dist - s) / prev.dist; 53 double x = prev.x + (last.x - prev.x) * d; 54 double y = prev.y + (last.y - prev.y) * d; 57 if(!prev(last)) vs.remove_last();
|
/haiku/src/system/libnetwork/netresolv/include/isc/ |
H A D | list.h | 28 #define LINK(type) struct { type *prev, *next; } 31 (elt)->link.prev = (type *)(-1); \ 36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \ 47 (list).head->link.prev = (elt); \ 50 (elt)->link.prev = NULL; \ 62 (elt)->link.prev = (list).tail; \ 71 (elt)->link.next->link.prev = (elt)->link.prev; \ 74 (list).tail = (elt)->link.prev; \ 76 if ((elt)->link.prev ! [all...] |
/haiku/src/bin/bfs_tools/lib/ |
H A D | Cache.h | 23 prev(NULL), 37 Cacheable *prev,*next; member in class:Cache::Cacheable 63 Cacheable *prev = entry->prev; local 67 entry->next->prev = prev; 68 if (prev) 69 prev->next = entry->next; 72 fLeastRecentlyUsed = prev; 74 fMostRecentlyUsed = prev; [all...] |
/haiku/src/add-ons/kernel/file_systems/websearchfs/ |
H A D | lists.c | 46 struct _slist_entry **prev = NULL; local 50 prev = head; 53 prev = &(curr->next); 56 *prev = NULL; 62 struct _slist_entry **prev = NULL; local 66 prev = head; 68 while (prev && curr) { 70 *prev = curr->next; 74 prev = &(curr->next);
|
H A D | lists2.c | 66 void **prev = NULL; local 70 prev = head; 73 prev = (void **)(((char *)curr)+nextoff); 76 *prev = NULL; 82 void **prev = NULL; local 86 prev = head; 88 while (prev && curr) { 90 *prev = sll_next(nextoff, curr); 94 prev = (void **)(((char *)curr)+nextoff);
|
/haiku/src/system/kernel/util/ |
H A D | list.cpp | 27 list->link.next = list->link.prev = &list->link; 48 link->prev = &list->link; 50 list->link.next->prev = link; 68 link->prev = list->link.prev; 70 list->link.prev->next = link; 71 list->link.prev = link; 74 ASSERT(link->prev != link); 88 link->next->prev = link->prev; [all...] |
/haiku/headers/os/drivers/pcmcia/ |
H A D | cs_timer.h | 35 struct timer_list *next, *prev; member in struct:timer_list
|
/haiku/src/apps/glteapot/ |
H A D | util.h | 26 /* Create a node and insert it in a list right after `prev' */ 27 inline LispNode(LispNode* prev, contents* value) argument 28 : car(value), cdr(prev->cdr) { prev->cdr = this; } 348 thetype* prev; member in struct:DoubleLinkedNode 352 next = prev = NULL; 359 next->prev = n; 362 n->prev = (thetype*)this; 369 prev->next = n; 371 n->prev [all...] |
/haiku/src/add-ons/kernel/drivers/graphics/common/ |
H A D | memory_manager.c | 34 struct mem_block *prev, *next; member in struct:mem_block 63 next->next->prev = block; 76 mem_block *prev, *next; local 79 prev = block->prev; 81 if (prev && !prev->allocated) { 82 block = prev; 83 merge(mem, prev); 150 first->prev [all...] |
/haiku/src/libs/compat/freebsd_wlan/net80211/ |
H A D | ieee80211_ageq.c | 198 struct mbuf *m, **prev, *ohead; local 203 prev = &aq->aq_head; 205 while ((m = *prev) != NULL) { 207 prev = &m->m_nextpkt; 225 aq->aq_tail = (struct mbuf *)((uintptr_t)prev - 229 *prev = m->m_nextpkt;
|
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/ |
H A D | fs_cache_priv.h | 50 *prev; /* points toward lru end of list */ member in struct:cache_ent
|
/haiku/src/libs/agg/src/ |
H A D | agg_vcgen_stroke.cpp | 147 m_src_vertices.prev(m_src_vertex), 150 m_src_vertices.prev(m_src_vertex).dist, 174 m_src_vertices.prev(m_src_vertex), 176 m_src_vertices.prev(m_src_vertex).dist);
|
H A D | agg_vcgen_contour.cpp | 130 m_src_vertices.prev(m_src_vertex), 133 m_src_vertices.prev(m_src_vertex).dist,
|
/haiku/src/add-ons/kernel/file_systems/nfs4/ |
H A D | OpenState.h | 45 void RemoveLock(LockInfo* lock, LockInfo* prev);
|
/haiku/src/system/libnetwork/netresolv/isc/ |
H A D | ev_streams.c | 86 ctx->streams->prev = new; 87 new->prev = NULL; 120 ctx->streams->prev = new; 121 new->prev = NULL; 169 if (old->prev != NULL) 170 old->prev->next = old->next; 174 old->next->prev = old->prev;
|
/haiku/src/kits/media/ |
H A D | TimedEventQueuePrivate.cpp | 87 fFirstEntry->prev = NULL; 97 newentry->prev = NULL; 99 fFirstEntry->prev = newentry; 109 newentry->prev = fLastEntry; 118 for (event_queue_entry *entry = fLastEntry; entry; entry = entry->prev) { 123 newentry->prev = entry; 125 (entry->next)->prev = newentry; 511 if (entry->prev != NULL) 512 (entry->prev)->next = entry->next; 514 (entry->next)->prev [all...] |
/haiku/src/system/libroot/posix/malloc_debug/ |
H A D | heap.cpp | 103 heap_area_s * prev; member in struct:heap_area_s 115 heap_page_s * prev; member in struct:heap_page_s 505 if (page->prev != lastPage) 506 panic("free page entry has invalid prev link\n"); 548 if (area->prev != lastArea) 549 panic("area list entry has invalid prev link\n"); 599 if (page->prev != lastPage) { 600 panic("used page entry has invalid prev link (%p vs %p bin " 601 "%" B_PRIu32 ")\n", page->prev, lastPage, i); 689 area->page_table[i].prev [all...] |
/haiku/src/system/kernel/ |
H A D | heap.cpp | 75 heap_area_s * prev; member in struct:heap_area_s 90 heap_page_s * prev; member in struct:heap_page_s 875 if (page->prev != lastPage) 876 panic("free page entry has invalid prev link\n"); 915 if (area->prev != lastArea) 916 panic("area list entry has invalid prev link\n"); 963 if (page->prev != lastPage) { 964 panic("used page entry has invalid prev link (%p vs %p bin " 965 "%lu)\n", page->prev, lastPage, i); 1055 area->page_table[i].prev [all...] |
/haiku/src/system/libroot/posix/glibc/extensions/ |
H A D | obstack.c | 207 chunk->prev = 0; 267 chunk->prev = 0; 303 new_chunk->prev = old_chunk; 336 new_chunk->prev = old_chunk->prev; 373 plp = lp->prev; 401 plp = lp->prev; 439 plp = lp->prev; 465 for (lp = h->chunk; lp != 0; lp = lp->prev)
|