Searched refs:next (Results 126 - 150 of 683) sorted by relevance

1234567891011>>

/barrelfish-2018-10-04/lib/bulk_transfer/backends/sm/
H A Dws_helpers.c31 item = item->next;
/barrelfish-2018-10-04/usr/monitor/capops/
H A Ddelete_int.h25 struct delete_queue_node *next; member in struct:delete_queue_node
/barrelfish-2018-10-04/usr/proc_mgmt/
H A Dspawnd_state.h28 struct msg_queue_elem *next; member in struct:msg_queue_elem
H A Ddomain.h32 struct domain_waiter *next; member in struct:domain_waiter
39 struct domain_cap_node *next; member in struct:domain_cap_node
/barrelfish-2018-10-04/usr/replay/
H A Dhash.h14 /* pointer to next entry, if NULL this is the last one */
15 struct hash_entry_st *next; member in struct:hash_entry_st
/barrelfish-2018-10-04/usr/skb/include/
H A Dskb_server.h46 struct skb_reply_state *next; member in struct:skb_reply_state
/barrelfish-2018-10-04/usr/skb/octopus/
H A Dbitfield.c90 // Compute union for next character
151 size_t next = -1; local
152 while( (next = bitfield_union(fields, 2, next)) != -1) {
153 printf("union found next: %lu\n", next);
H A Dpredicates.c163 static char* next = NULL; local
178 res = ec_get_string(ec_arg(3), &next);
208 next = NULL;
211 next = skip_intersect(sets, elems, next);
212 OCT_DEBUG("skip_intersect found next: %s\n", next);
213 if(next != NULL) {
214 dident item = ec_did(next, 0);
225 static char* next local
417 static long int next = -1; local
[all...]
/barrelfish-2018-10-04/tools/fastmodels/
H A Dconfig.h27 struct component_config *next; member in struct:component_config
/barrelfish-2018-10-04/lib/lwip2/src/barrelfish/
H A Dpbuf_barrelfish.c30 * pbuf of a packet has a ->next field other than NULL, more packets
34 * loop end condition (tot_len == p->len), NOT (next == NULL).
276 p = p->next;
317 for (p = h; p->next != NULL; p = p->next) {
321 /* { p is last pbuf of first h chain, p->next == NULL } */
323 LWIP_ASSERT("p->next == NULL", p->next == NULL);
327 p->next = t;
328 /* p->next no
[all...]
/barrelfish-2018-10-04/lib/lwip2/src/core/
H A Dpbuf.c30 * pbuf of a packet has a ->next field other than NULL, more packets
34 * loop end condition (tot_len == p->len), NOT (next == NULL).
170 for (pcb = tcp_active_pcbs; NULL != pcb; pcb = pcb->next) {
292 p->next = NULL;
312 /* remember first pbuf for linkage in next iteration */
328 q->next = NULL;
330 r->next = q;
331 /* set total length of this pbuf and next in chain */
345 /* remember this pbuf for linkage in next iteration */
349 /*r->next
[all...]
H A Dtcp.c176 for (pcb = list; pcb != NULL; pcb = pcb->next) {
596 for (cpcb = *tcp_pcb_lists[i]; cpcb != NULL; cpcb = cpcb->next) {
700 for (lpcb = tcp_listen_pcbs.listen_pcbs; lpcb != NULL; lpcb = lpcb->next) {
845 for (pcb = *tcp_pcb_lists[i]; pcb != NULL; pcb = pcb->next) {
919 for (cpcb = *tcp_pcb_lists[i]; cpcb != NULL; cpcb = cpcb->next) {
1008 pcb = pcb->next;
1157 prev->next = pcb->next;
1161 tcp_active_pcbs = pcb->next;
1172 pcb = pcb->next;
1257 struct tcp_pcb *next; local
1373 struct tcp_seg *next = seg->next; local
1985 struct tcp_pcb *next = pcb->next; local
2003 struct tcp_pcb_listen *lpcb, *next; local
[all...]
/barrelfish-2018-10-04/lib/lwip2/src/netif/
H A Dslipif.c134 for (q = p; q != NULL; q = q->next) {
289 /* on to the next pbuf */
291 if (priv->p->next != NULL && priv->p->next->len > 0) {
292 /* p is a chain, on to the next in the chain */
293 priv->p = priv->p->next;
295 /* p is a single pbuf, set it to NULL so next time a new
465 while ((q->len != q->tot_len) && (q->next != NULL)) {
466 q = q->next;
468 priv->rxpackets = q->next;
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/
H A DViewerManager.java173 newViewer = (Viewer) newViewersIterator.next();
232 currentViewer = (Viewer) viewersIterator.next();
273 currentViewer = (Viewer) viewersIterator.next();
305 currentViewer = (Viewer) viewersIterator.next();
306 currentGoalResults = (java.util.List) goalResultsIterator.next();
324 currentViewer = (Viewer) viewersIterator.next();
345 currentViewer = (Viewer) viewersIterator.next();
389 currentViewer = (Viewer) viewersIterator.next();
454 Object name = it.next();
473 Object key = keyIt.next();
[all...]
/barrelfish-2018-10-04/include/lwip/lwip/
H A Dtcp.h144 (((tpcb)->unsent != NULL) && (((tpcb)->unsent->next != NULL) || \
277 type *next; /* for the linked list */ \
309 u32_t rcv_nxt; /* next seqno expected */
340 u32_t snd_nxt; /* next new seqno to be sent */
344 u32_t snd_lbb; /* Sequence number of next byte to be buffered. */
520 struct tcp_seg *next; /* used when putting segements on a queue */ member in struct:tcp_seg
636 tcp_tmp_pcb = tcp_tmp_pcb->next) { \
640 npcb->next = *pcbs; \
641 LWIP_ASSERT("TCP_REG: npcb->next != npcb", npcb->next !
[all...]
/barrelfish-2018-10-04/lib/libc/rpc/
H A Drpcb_prot.c110 rpcblist_ptr next; local
113 next = NULL;
124 * the case of freeing we must remember the next object
128 next = (*rp)->rpcb_next;
134 next_copy = next;
139 * but next itself survives.
193 rpcb_entry_list_ptr next; local
196 next = NULL;
207 * the case of freeing we must remember the next object
211 next
[all...]
/barrelfish-2018-10-04/lib/net/
H A Dnetbufs.c154 nb->pbuf.pbuf.next = bp->pbufs;
161 reg->next = bp->regions;
231 bp->pbufs = bp->pbufs->next;
238 assert(p->next == NULL);
257 if (p->next) {
258 debug_printf("!!!!!! p->NEXT was not NULL (%p)\n", p->next);
277 p->next = bp->pbufs;
305 reg = reg->next;
/barrelfish-2018-10-04/lib/net_device_manager/
H A Dport_management_support.h117 struct buffer_port_translation *next; member in struct:buffer_port_translation
126 struct net_user *next; member in struct:net_user
/barrelfish-2018-10-04/lib/nfs/
H A Dportmap.x17 pmaplist *next;
/barrelfish-2018-10-04/include/tenaciousd/
H A Dlog.h22 uint64_t next; // Only valid on disk member in struct:tenaciousd_log_entry
29 struct tenaciousd_log_iter *next; member in struct:tenaciousd_log_iter
H A Dqueue.h20 uint64_t next; // Only valid on disk member in struct:tenaciousd_queue_element
27 struct tenaciousd_queue_iter *next; member in struct:tenaciousd_queue_iter
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/
H A Dmem_dbg.c157 struct app_mem_info_st *next; /* tail of thread's stack */ member in struct:app_mem_info_st
208 if (inf->next != NULL)
210 app_info_free(inf->next);
369 APP_INFO *next=ret->next; local
371 if (next != NULL)
373 next->references++;
374 (void)lh_APP_INFO_insert(amih,next);
387 ret->next = NULL;
388 if (next !
[all...]
/barrelfish-2018-10-04/lib/barrelfish/arch/x86/
H A Dpmap.c32 for (n = root->u.vnode.children; n; n = n->next) {
45 // all other vnodes do not overlap with us, so go to next
95 for(n = root->u.vnode.children; n != NULL; n = n->next) {
121 for (n = root->u.vnode.children; n; n = n->next) {
141 prev->next = walk->next;
144 root->u.vnode.children = walk->next;
149 walk = walk->next;
208 newvnode->next = root->u.vnode.children;
221 for (struct vnode *n = root->u.vnode.children; n; n = n->next) {
[all...]
/barrelfish-2018-10-04/lib/lwip2/src/core/ipv4/
H A Digmp.c167 struct igmp_group *next = group->next; /* avoid use-after-free below */ local
180 /* move to "next" */
181 group = next;
200 group = group->next;
205 group = group->next;
226 group = group->next;
270 group->next = NULL;
276 group->next = list_head->next;
[all...]
/barrelfish-2018-10-04/lib/lwip2/src/core/ipv6/
H A Dip6_frag.c126 r = r->next;
130 /* get the next pointer before freeing */
131 r = r->next;
183 /* get the next pointer before freeing */
193 reassdatagrams = ipr->next;
197 if (prev->next == ipr) {
200 prev = prev->next;
203 prev->next = ipr->next;
238 r = r->next;
[all...]

Completed in 241 milliseconds

1234567891011>>