Searched defs:prev (Results 51 - 75 of 182) sorted by relevance

12345678

/vbox/src/VBox/Devices/Network/lwip-new/src/core/ipv4/
H A Dip_frag.c112 static void ip_reass_dequeue_datagram(struct ip_reassdata *ipr, struct ip_reassdata *prev);
113 static int ip_reass_free_complete_datagram(struct ip_reassdata *ipr, struct ip_reassdata *prev);
124 struct ip_reassdata *r, *prev = NULL; local
133 prev = r;
143 ip_reass_free_complete_datagram(tmp, prev);
154 * @param prev the previous datagram in the linked list
158 ip_reass_free_complete_datagram(struct ip_reassdata *ipr, struct ip_reassdata *prev) argument
165 LWIP_ASSERT("prev != ipr", prev != ipr);
166 if (prev !
226 struct ip_reassdata *r, *oldest, *prev; local
304 ip_reass_dequeue_datagram(struct ip_reassdata *ipr, struct ip_reassdata *prev) argument
[all...]
/vbox/src/VBox/Devices/Network/lwip-new/src/core/
H A Dmem.c159 /** index (-> ram[prev]) of the previous struct */
160 mem_size_t prev; member in struct:mem
255 ((struct mem *)(void *)&ram[nmem->next])->prev = (mem_size_t)((u8_t *)mem - ram);
259 pmem = (struct mem *)(void *)&ram[mem->prev];
261 /* if mem->prev is unused, combine mem and mem->prev */
266 ((struct mem *)(void *)&ram[mem->next])->prev = (mem_size_t)((u8_t *)pmem - ram);
286 mem->prev = 0;
292 ram_end->prev = MEM_SIZE_ALIGNED;
350 /* finally, see if prev o
[all...]
H A Dtcp_in.c129 struct tcp_pcb *pcb, *prev; local
202 prev = NULL;
218 if (prev != NULL) {
219 prev->next = pcb->next;
226 prev = pcb;
266 prev = NULL;
274 lpcb_prev = prev;
288 lpcb_prev = prev;
295 prev = (struct tcp_pcb *)lpcb;
302 prev
1119 struct tcp_seg *prev, *cseg; local
[all...]
H A Dudp.c166 struct udp_pcb *pcb, *prev; local
234 prev = NULL;
293 if (prev != NULL) {
296 prev->next = pcb->next;
304 prev = pcb;
/vbox/src/VBox/Devices/Network/lwip-new/src/core/snmp/
H A Dmsg_in.c203 vb->prev = NULL;
316 vb->prev = NULL;
1326 vb->prev = NULL;
1399 struct snmp_varbind *vb, *prev; local
1404 prev = vb->prev;
1406 vb = prev;
1426 vb->prev = root->tail;
1441 root->tail = vb->prev;
1442 vb->prev
[all...]
/vbox/src/VBox/Devices/Network/lwip-new/src/include/lwip/
H A Dsnmp_structs.h164 struct mib_list_node *prev; member in struct:mib_list_node
/vbox/src/VBox/Devices/PC/ipxe/src/core/
H A Dmalloc.c120 VALGRIND_MAKE_MEM_DEFINED ( &free_blocks.prev->next,
121 sizeof ( free_blocks.prev->next ) );
124 VALGRIND_MAKE_MEM_DEFINED ( &free_blocks.next->next->prev,
125 sizeof ( free_blocks.next->next->prev ) );
136 VALGRIND_MAKE_MEM_DEFINED ( &block->list.next->next->prev,
137 sizeof ( block->list.next->next->prev ) );
147 struct memory_block *prev = NULL; local
163 if ( prev )
164 VALGRIND_MAKE_MEM_NOACCESS ( prev, sizeof ( *prev ) );
[all...]
/vbox/src/VBox/GuestHost/OpenGL/util/
H A Dlist.c13 CRListIterator *prev; member in struct:CRListIterator
34 l->head->prev = NULL;
37 l->tail->prev = l->head;
55 t2->prev = NULL;
85 p->prev = iter->prev;
87 p->prev->next = p;
88 iter->prev = p;
102 iter->next->prev = iter->prev;
[all...]
/vbox/src/VBox/Devices/PC/ipxe/src/include/ipxe/
H A Data.h84 uint8_t prev; member in struct:ata_fifo::__anon15481
86 uint8_t prev;
/vbox/src/VBox/ExtPacks/VBoxDTrace/onnv/uts/i86pc/os/
H A Ddtrace_subr.c72 dtrace_invop_hdlr_t *hdlr = dtrace_invop_hdlr, *prev = NULL; local
81 prev = hdlr;
85 if (prev == NULL) {
90 prev->dtih_next = hdlr->dtih_next;
/vbox/src/VBox/Additions/WINNT/Graphics/Wine_new/wined3d/
H A Dresource.c348 DWORD prev = resource->priority; local
350 TRACE("resource %p, new priority %u, returning old priority %u.\n", resource, priority, prev);
351 return prev;
/vbox/src/VBox/Additions/x11/x11include/mesa-7.2/src/mesa/drivers/dri/common/
H A Dtexmem.h60 struct dri_texture_object * prev; member in struct:dri_texture_object
/vbox/src/VBox/Additions/WINNT/Graphics/Wine/include/wine/
H A Dexception.h216 EXCEPTION_REGISTRATION_RECORD *prev; local
220 : "=&r" (prev) : "r" (frame) : "memory" );
221 return prev;
/vbox/src/libs/libxml2-2.6.31/
H A Derror.c548 xmlNodePtr prev = baseptr; local
550 while (prev != NULL) {
551 if (prev->prev == NULL)
552 prev = prev->parent;
554 prev = prev->prev;
555 if (prev
[all...]
H A Dlist.c34 struct _xmlLink *prev; member in struct:_xmlLink
61 (lk->prev)->next = lk->next;
62 (lk->next)->prev = lk->prev;
124 for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev);
207 l->sentinel->prev = l->sentinel;
288 lkPlace = lkPlace->prev;
290 (lkPlace->next)->prev = lkNew;
292 lkNew->prev
[all...]
/vbox/src/libs/xpcom18a4/ipc/ipcd/extensions/lock/src/module/
H A DipcLockModule.cpp198 ipcLockContext *prev; local
200 prev = ctx;
206 prev->mNextPending = ctx->mNextPending;
/vbox/src/libs/xpcom18a4/nsprpub/pr/src/md/os2/
H A Dos2cv.c105 thred->md.prev = cv->waitTail;
132 _MDNotified *notified, *prev = NULL; local
189 if (cv->waitHead->md.prev != NULL) {
190 cv->waitHead->md.prev->md.next = NULL;
191 cv->waitHead->md.prev = NULL;
222 thred->md.prev = thred->md.next = NULL;
228 prev = notified;
230 if (&post != prev) PR_DELETE(prev);
349 cv->waitHead->md.prev
[all...]
/vbox/src/libs/xpcom18a4/nsprpub/pr/src/md/windows/
H A Dw32poll.c176 PRPollDesc *prev; local
177 for (prev = pds; prev < pd; prev++)
179 prev->out_flags = 0;
231 PRPollDesc *prev; local
232 for (prev = pds; prev < pd; prev++)
234 prev
[all...]
/vbox/src/libs/zlib-1.2.6/contrib/amd64/
H A Damd64-match.S33 #define prev rcx define
79 printf("#define dsPrev (%3u)(%%rdi)\n",(int)(((char*)&(s->prev))-((char*)s)));
224 /* Posf *prev = s->prev; */
228 mov dsPrev, %prev
242 * } while ((cur_match = prev[cur_match & wmask]) > limit
251 movzwl (%prev, %curmatch, 2), %curmatchd
264 /* %scan is the string under scrutiny, and %prev to the string we */
272 lea MAX_MATCH_8(%scan, %scanalign), %prev
276 prefetcht1 (%prev,
[all...]
/vbox/src/libs/zlib-1.2.6/examples/
H A Dgun.c213 unsigned prev; /* previous code */ local
250 final = prev = (unsigned)last; /* low 8 bits of code */
313 we drop through (prev) will be a valid index so that random
319 In any case, the prev > end check must be retained. */
320 if (code != end + 1 || prev > end) {
325 code = prev;
341 prefix[end] = (unsigned short)prev;
346 prev = temp;
364 /* loop for next code with final and prev as the last match, rem and
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.16.0/
H A Dexa.h71 ExaOffscreenArea *prev; /* Double-linked list for defragmentation */ member in struct:_ExaOffscreenArea
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.17.1/
H A Dexa.h71 ExaOffscreenArea *prev; /* Double-linked list for defragmentation */ member in struct:_ExaOffscreenArea
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.7.7/
H A Dexa.h70 ExaOffscreenArea *prev; /* Double-linked list for defragmentation */ member in struct:_ExaOffscreenArea
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.8.0/
H A Dexa.h70 ExaOffscreenArea *prev; /* Double-linked list for defragmentation */ member in struct:_ExaOffscreenArea
/vbox/src/VBox/Additions/x11/x11include/xorg-server-1.9.0/
H A Dexa.h70 ExaOffscreenArea *prev; /* Double-linked list for defragmentation */ member in struct:_ExaOffscreenArea

Completed in 133 milliseconds

12345678