/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/infiniband/core/ |
H A D | uverbs_cmd.c | 1438 struct ib_send_wr *wr = NULL, *last, *next, *bad_wr; local 1478 next = kmalloc(ALIGN(sizeof *next, sizeof (struct ib_sge)) + 1481 if (!next) { 1487 wr = next; 1489 last->next = next; 1490 last = next; 1492 next->next 1594 struct ib_recv_wr *wr = NULL, *last, *next; local 1678 struct ib_recv_wr *wr, *next, *bad_wr; local 1727 struct ib_recv_wr *wr, *next, *bad_wr; local [all...] |
/barrelfish-2018-10-04/lib/lwip/src/core/ |
H A D | udp.c | 169 for (pcb = udp_pcbs; pcb != NULL; pcb = pcb->next) { 209 found faster next time */ 210 prev->next = pcb->next; 211 pcb->next = udp_pcbs; 656 for (ipcb = udp_pcbs; ipcb != NULL; ipcb = ipcb->next) { 692 pcb->next = udp_pcbs; 770 for (ipcb = udp_pcbs; ipcb != NULL; ipcb = ipcb->next) { 777 pcb->next = udp_pcbs; 831 udp_pcbs = udp_pcbs->next; [all...] |
/barrelfish-2018-10-04/lib/virtio/ |
H A D | virtqueue_host.c | 40 struct vring_mem_info *next; member in struct:vring_mem_info 96 *queue = buf->next; 104 buf->next = *queue; 113 while(last->next) { 114 last = last->next; 117 last->next = *queue; 155 meminfo->next = vq->mem; 161 current = current->next; 165 meminfo->next = current; 166 prev->next [all...] |
H A D | vbuffer.c | 349 bl->tail->next = buf; 354 buf->next = NULL; 378 buf->next = bl->head; 408 bl->head = buf->next; 414 buf->next = NULL; 444 bl->tail->next = NULL; 449 buf->next = NULL;
|
/barrelfish-2018-10-04/lib/libc/isc/ |
H A D | ev_streams.c | 87 new->next = ctx->streams; 121 new->next = ctx->streams; 169 old->prev->next = old->next; 171 ctx->streams = old->next; 172 if (old->next != NULL) 173 old->next->prev = old->prev;
|
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/controller/ehci/ |
H A D | usb_ehci.c | 436 uint32_t curr, next; local 444 next = (curr ^ bit) | (bit / 2); 447 qh_next = hc->qh_intr_last[next]; 476 next = i | (USB_EHCI_VFRAMELIST_COUNT / 2); 477 sitd->sitd_next = hc->qh_intr_last[next]->qh_self; 500 next = i & (USB_EHCI_VFRAMELIST_COUNT - 1); 501 (pframes[i]) = hc->qh_itd_hs_last[next]->itd_self;
|
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/rxspencer/ |
H A D | regcomp.c | 20 char *next; /* next character in RE */ member in struct:parse 41 #define PEEK() (*p->next) 42 #define PEEK2() (*(p->next+1)) 43 #define MORE() (p->next < p->end) 44 #define MORE2() (p->next+1 < p->end) 49 #define NEXT() (p->next++) 50 #define NEXT2() (p->next += 2) 51 #define NEXTn(n) (p->next += (n)) 52 #define GETNEXT() (*p->next [all...] |
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/ |
H A D | usb_xfer.c | 46 queue->head.last_next, xfer->wait_entry.next, 47 &xfer->wait_entry.next, xfer->wait_entry.prev_next); 53 xfer->wait_entry.next = NULL; 57 queue->head.last_next = &(xfer->wait_entry.next); 82 if ((xfer->wait_entry.next) != NULL) 83 xfer->wait_entry.next->wait_entry.prev_next = xfer->wait_entry 89 *xfer->wait_entry.prev_next = xfer->wait_entry.next; 95 queue->head.last_next, xfer->wait_entry.next, 96 &xfer->wait_entry.next, xfer->wait_entry.prev_next); 192 * start the next transfe [all...] |
/barrelfish-2018-10-04/lib/lua/src/ |
H A D | lstring.c | 78 GCObject *next = gch(p)->next; /* save next */ local 80 gch(p)->next = tb->hash[h]; /* chain it */ 83 p = next; 139 o = gch(o)->next) {
|
/barrelfish-2018-10-04/lib/lwip/src/core/ipv4/ |
H A D | inet_chksum.c | 292 for (q = p; q != NULL; q = q->next) { 294 ("inet_chksum_pseudo(): checksumming pbuf %p (has next %p) \n", 295 (void *) q, (void *) q->next)); 298 /* just executing this next line is probably faster that the if statement needed 353 for (q = p; (q != NULL) && (chksum_len > 0); q = q->next) { 355 ("inet_chksum_pseudo(): checksumming pbuf %p (has next %p) \n", 356 (void *) q, (void *) q->next)); 424 for (q = p; q != NULL; q = q->next) {
|
H A D | ip_frag.c | 133 r = r->next; 140 /* get the next pointer before freeing */ 141 r = r->next; 167 LWIP_ASSERT("prev->next == ipr", prev->next == ipr); 194 /* get the next pointer before freeing */ 246 if (r->next != NULL) { 249 r = r->next; 290 ipr->next = reassdatagrams; 309 reassdatagrams = ipr->next; [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/ |
H A D | AbstractViewletDataStore.java | 218 public Object next() { method in class:AbstractViewletDataStore.ViewletDataIterator 219 List index = (List)(it.next()); 442 currentComb.addAll((List) subCombsIterator.next()); 474 ((ViewletDataStoreListener)(listenerIt.next())).rangeUpdated(store,range); 483 List index = (List)it.next();
|
/barrelfish-2018-10-04/usr/drivers/usb/usb_manager/controller/ohci/ |
H A D | usb_ohci.c | 220 uint16_t next; local 224 next = (current ^ bit) | (bit / 2); 227 usb_ohci_ed_t *ed_next = hc->qh_intr_last[next]; 228 ed_current->next = NULL; 240 intr_ed->next = hc->qh_isoc_last;
|
H A D | usb_ohci_bus.c | 59 (((xfer))->wait_entry.next)) { 131 (xfer) = (((xfer))->wait_entry.next)) { 169 (xfer) = (((xfer))->wait_entry.next)) {
|
/barrelfish-2018-10-04/usr/drivers/virtio/block/ |
H A D | request.c | 84 req->next = req+1; 132 queue->head = req->next; 138 req->next = NULL; 153 assert(req->next == NULL); 159 queue->tail->next = req;
|
/barrelfish-2018-10-04/lib/arranet/ |
H A D | inet_chksum.c | 284 for(q = p; q != NULL; q = q->next) { 285 LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): checksumming pbuf %p (has next %p) \n", 286 (void *)q, (void *)q->next)); 289 /* just executing this next line is probably faster that the if statement needed 345 for(q = p; (q != NULL) && (chksum_len > 0); q = q->next) { 346 LWIP_DEBUGF(INET_DEBUG, ("inet_chksum_pseudo(): checksumming pbuf %p (has next %p) \n", 347 (void *)q, (void *)q->next)); 418 for(q = p; q != NULL; q = q->next) {
|
/barrelfish-2018-10-04/lib/barrelfish/vspace/ |
H A D | memobj_one_frame.c | 36 data->next = walk; 72 prev->next = walk->next; 76 one_frame->vregion_list = walk->next; 83 walk = walk->next;
|
/barrelfish-2018-10-04/usr/tests/net_tests/posix-sockets/ |
H A D | main.c | 63 struct client *next; member in struct:client 137 client->next = NULL; 140 client->next = clients; 202 for (client = clients; client != NULL; client = client->next) { 219 for (client = clients; client != NULL; client = client->next) {
|
/barrelfish-2018-10-04/usr/eclipseclp/Pds/src/ |
H A D | amsg.c | 310 struct amsg_buffer_scratch * next; member in struct:amsg_buffer_scratch 341 struct aport * next; /* next port */ member in struct:aport 358 struct aport * next; /* next port */ member in struct:aport 383 port->next = (port_t *) 0; 679 (p)->last->next = (m); \ 684 (m)->next = (amsg_buffer_scratch_t *) 0; \ 688 (p)->last->next = (m); \ 706 (p)->first = (p)->first->next; \ 825 port_t * next; local [all...] |
/barrelfish-2018-10-04/lib/libc/stdio/ |
H A D | findfp.c | 150 g->next = NULL; 174 for (g = &__sglue; g != NULL; g = g->next) { 183 SET_GLUE_PTR(lastglue->next, g); /* atomically append glue to list */
|
/barrelfish-2018-10-04/lib/libc/stdlib/ |
H A D | atexit.c | 69 struct atexit *next; /* next in list */ member in struct:atexit 70 int ind; /* next index in this table */ 118 p->next = __atexit; 215 for (p = __atexit; p; p = p->next) {
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/megalog/ |
H A D | database-lst.tex | 55 \item[del_tup(?TupleTerm)]{Tuple at a time retrieval with deletion. On backtracking the next tuple is retrieved and deleted.} 57 \item[del_tup(+RelationName, ?Tuple)]{Tuple at a time retrieval with deletion. On backtracking the next tuple is retrieved and deleted.} 59 \item[del_tup(+RelationName, ?Tuple, +Selection)]{Tuple at a time retrieval with deletion. On backtracking the next tuple is retrieved and deleted.} 77 \item[retr_tup(?TupleTerm)]{Tuple at a time retrieval. On backtracking the next tuple is retrieved.} 79 \item[retr_tup(+RelationName, ?Tuple)]{Tuple at a time retrieval. On backtracking the next tuple is retrieved.} 81 \item[retr_tup(+RelationName, ?Tuple, +Selection)]{Tuple at a time retrieval. On backtracking the next tuple is retrieved.}
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/rsa/ |
H A D | rsa_test.c | 274 goto next; 280 goto next; 326 next:
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/test/ |
H A D | rsa_test.c | 274 goto next; 280 goto next; 326 next:
|
/barrelfish-2018-10-04/lib/thc/ |
H A D | thcstubs.c | 96 rxi = rxi->next; 133 rxi->next = NULL; 206 rxi->next = NULL; 245 // Cause the next "n" messages to be discarded on receipt 272 rxi->next = recv->r; 302 *rxip = rxi -> next; 306 rxip = &((*rxip)->next); 361 *rxip = rxi -> next; 365 rxip = &((*rxip)->next); 386 *rxip = rxi -> next; [all...] |