Searched refs:prev (Results 1 - 25 of 285) sorted by relevance

1234567891011>>

/haiku-fatelf/src/system/libroot/posix/glibc/misc/
H A Dinsremque.c25 insque (void *elem, void *prev) argument
27 struct qelem *next = ((struct qelem *) prev)->q_forw;
28 ((struct qelem *) prev)->q_forw = (struct qelem *) elem;
32 ((struct qelem *) elem)->q_back = (struct qelem *) prev;
41 struct qelem *prev = ((struct qelem *) elem)->q_back; local
43 next->q_back = prev;
44 if (prev != NULL)
45 prev->q_forw = (struct qelem *) next;
/haiku-fatelf/headers/private/kernel/util/
H A Dkqueue.h17 struct quehead *prev; member in struct:quehead
32 head->next = head->prev = head;
45 element->prev = head;
47 element->next->prev = element;
58 element->next->prev = element->prev;
59 element->prev->next = element->next;
60 element->prev = 0;
/haiku-fatelf/src/add-ons/kernel/bus_managers/scsi/
H A Ddl_list.h15 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-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dlist.h33 * sometimes we already know the next/prev entries and we can
38 struct list_head *next, *prev; member in struct:list_head
47 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
53 * @prev:
56 * This is only for internal list manipulation where we know the prev/next
60 struct list_head * prev, struct list_head * next)
62 next->prev = new;
64 new->prev = prev;
65 prev
59 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument
104 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/haiku-fatelf/src/add-ons/kernel/generic/locked_pool/
H A Ddl_list.h15 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-fatelf/src/add-ons/kernel/generic/scsi_periph/
H A Ddl_list.h15 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-fatelf/src/system/kernel/util/
H A Dlist.cpp21 list->link.next = list->link.prev = &list->link;
42 link->prev = &list->link;
44 list->link.next->prev = link;
58 link->prev = list->link.prev;
60 list->link.prev->next = link;
61 list->link.prev = link;
74 link->next->prev = link->prev;
75 link->prev
[all...]
/haiku-fatelf/src/tools/fs_shell/
H A Dlist.cpp24 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-fatelf/headers/libs/agg/
H A Dagg_shorten_path.h50 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-fatelf/src/libs/pdflib/libs/tiff/
H A Dtif_error.c35 TIFFErrorHandler prev = _TIFFerrorHandler; local
37 return (prev);
H A Dtif_warning.c35 TIFFErrorHandler prev = _TIFFwarningHandler; local
37 return (prev);
/haiku-fatelf/src/tests/system/libroot/posix/posixtestsuite/conformance/interfaces/sigaction/
H A Dgentests.pl18 my (%testcases, $prev);
20 $prev = "SIGALRM";
44 $line =~ s/%%MYSIG2%%/$prev/;
49 $prev = $signal;
/haiku-fatelf/src/bin/bash/
H A Dlist.c66 register GENERIC_LIST *next, *prev; local
68 for (prev = (GENERIC_LIST *)NULL; list; )
71 list->next = prev;
72 prev = list;
75 return (prev);
121 register GENERIC_LIST *prev, *temp; local
123 for (prev = (GENERIC_LIST *)NULL, temp = *list; temp; prev = temp, temp = temp->next)
127 if (prev)
128 prev
[all...]
/haiku-fatelf/src/kits/network/libbind/include/isc/
H A Dlist.h26 #define LINK(type) struct { type *prev, *next; }
29 (elt)->link.prev = (type *)(-1); \
34 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
45 (list).head->link.prev = (elt); \
48 (elt)->link.prev = NULL; \
60 (elt)->link.prev = (list).tail; \
69 (elt)->link.next->link.prev = (elt)->link.prev; \
72 (list).tail = (elt)->link.prev; \
74 if ((elt)->link.prev !
[all...]
/haiku-fatelf/src/bin/bfs_tools/lib/
H A DCache.h22 prev(NULL),
36 Cacheable *prev,*next; member in class:Cache::Cacheable
62 Cacheable *prev = entry->prev; local
66 entry->next->prev = prev;
67 if (prev)
68 prev->next = entry->next;
71 fLeastRecentlyUsed = prev;
73 fMostRecentlyUsed = prev;
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/googlefs/
H A Dlists.c46 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 Dlists2.c63 void **prev = NULL; local
67 prev = head;
70 prev = (void **)(((char *)curr)+nextoff);
73 *prev = NULL;
79 void **prev = NULL; local
83 prev = head;
85 while (prev && curr) {
87 *prev = sll_next(nextoff, curr);
91 prev = (void **)(((char *)curr)+nextoff);
/haiku-fatelf/src/libs/tiff/
H A Dtif_error.c37 TIFFErrorHandler prev = _TIFFerrorHandler; local
39 return (prev);
45 TIFFErrorHandlerExt prev = _TIFFerrorHandlerExt; local
47 return (prev);
H A Dtif_warning.c37 TIFFErrorHandler prev = _TIFFwarningHandler; local
39 return (prev);
45 TIFFErrorHandlerExt prev = _TIFFwarningHandlerExt; local
47 return (prev);
/haiku-fatelf/src/libs/fluidsynth/src/
H A Dfluid_list.c108 fluid_list_t *prev; local
110 prev = NULL;
115 if (prev) {
116 prev->next = tmp->next;
127 prev = tmp;
138 fluid_list_t *prev; local
140 prev = NULL;
145 if (prev) {
146 prev->next = tmp->next;
155 prev
238 fluid_list_t *prev = NULL; local
[all...]
/haiku-fatelf/src/kits/network/libbind/isc/
H A Dev_waits.c108 evWait *this, *prev; local
116 for (prev = NULL, this = wl->first;
118 prev = this, this = this->next)
121 if (prev != NULL)
122 prev->next = this->next;
126 wl->last = prev;
135 for (prev = NULL, this = ctx->waitDone.first;
137 prev = this, this = this->next)
140 if (prev != NULL)
141 prev
[all...]
/haiku-fatelf/src/system/kernel/scheduler/
H A Dscheduler_simple.cpp88 Thread *curr, *prev; local
89 for (curr = sRunQueue, prev = NULL; curr
92 if (prev)
93 prev = prev->queue_next;
95 prev = sRunQueue;
98 T(EnqueueThread(thread, prev, curr));
101 if (prev)
102 prev->queue_next = thread;
143 Thread *item, *prev; local
[all...]
/haiku-fatelf/headers/os/drivers/pcmcia/
H A Dcs_timer.h35 struct timer_list *next, *prev; member in struct:timer_list
/haiku-fatelf/src/bin/coreutils/lib/
H A Dclose-hook.c80 struct close_hook *prev = link->private_prev; local
82 if (next != NULL && prev != NULL)
85 prev->private_next = next;
86 next->private_prev = prev;
/haiku-fatelf/src/libs/ncurses/form/
H A Dfld_ftchoice.c61 typ->prev = prev_choice;

Completed in 220 milliseconds

1234567891011>>