Searched refs:next (Results 151 - 175 of 683) sorted by relevance

1234567891011>>

/barrelfish-2018-10-04/usr/eclipseclp/Visualisation/src/com/parctechnologies/eclipse/visualisation/
H A DScenario.java168 EventCommandList ecl = (EventCommandList)(it.next());
212 Command command = (Command)itCommand.next();
213 Integer integer = (Integer)itState.next();
274 Command command = (Command)itCommand.next();
275 Integer integer = (Integer)itState.next();
H A DMultiViewletType.java56 addViewletType((ViewletType)it.next());
77 ViewletType type = (ViewletType)viewletTypeCollection.iterator().next();
91 ViewletType viewletType = (ViewletType) it.next();
145 currentIndex = (java.util.List) indexListIterator.next();
172 ViewletType type = (ViewletType) it.next();
191 ViewletType type = (ViewletType) it.next();
194 List typeResult = (List) resultIt.next();
215 ViewletType type = (ViewletType) it.next();
242 ViewletType type = (ViewletType) it.next();
245 List typeResult = (List) resultIt.next();
[all...]
H A DDefaultViewerBuildingPolicy.java89 Object key = it.next();
100 Object key = it.next();
114 Object key = it.next();
H A DViewableType.java37 Atom fix = (Atom)it.next();
57 // Atom fix = (Atom)it.next();
83 atomListToStringList((Collection) fixIt.next());
84 CompoundTerm elementType = (CompoundTerm) elemIt.next();
/barrelfish-2018-10-04/usr/monitor/capops/
H A Ddeletestep.c181 qn->next = NULL;
185 assert(!pending_tail->next);
186 pending_tail->next = qn;
188 qn->next = NULL;
211 for ( ; curr; curr = curr->next) {
/barrelfish-2018-10-04/lib/barrelfish/
H A Dwaitset.c40 if (chan->next == chan) {
45 chan->prev->next = chan->next;
46 chan->next->prev = chan->prev;
48 *queue = chan->next;
51 chan->prev = chan->next = NULL;
59 chan->next = chan->prev = chan;
61 chan->next = *queue;
63 chan->next->prev = chan;
64 chan->prev->next
124 struct waitset_chanstate *chan, *next; local
[all...]
/barrelfish-2018-10-04/lib/zlib/
H A Dinflate.c38 * - Use local copies of stream next and avail values, as well as local bit
123 state->lencode = state->distcode = state->next = state->codes;
216 static code *next; local
224 next = fixed;
225 lenfix = next;
227 inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
232 distfix = next;
234 inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
407 next = strm->next_in; \
418 strm->next_in = next; \
559 unsigned char FAR *next; /* next input */ local
[all...]
H A Dinftrees.c27 on return points to the next available entry's address. bits is the
54 code FAR *next; /* next available space in table */ local
151 filled is at next and has curr index bits. The code being used is huff
204 next = *table; /* current table to fill in */
235 min = fill; /* save offset to next table */
238 next[(huff >> drop) + fill] = this;
252 /* go to next symbol, update count, len */
266 next += min; /* here min is 1 << curr */
268 /* determine length of next tabl
[all...]
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mlx4/
H A Dsrq.c77 struct mlx4_wqe_srq_next_seg *next; local
153 next = get_wqe(srq, i);
154 next->next_wqe_index =
157 for (scatter = (void *) (next + 1);
158 (void *) scatter < (void *) next + desc_size;
296 struct mlx4_wqe_srq_next_seg *next; local
301 next = get_wqe(srq, srq->tail);
302 next->next_wqe_index = cpu_to_be16(wqe_index);
312 struct mlx4_wqe_srq_next_seg *next; local
321 for (nreq = 0; wr; ++nreq, wr = wr->next) {
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Dmem.c593 *pstack = stack = stack->up; /* go to the next segment */
636 register struct stack_header *next; local
641 next = stack->down;
646 } while (stack = next);
657 _temp_init(struct temp_header *first, struct temp_header *next, uword bytes_needed) argument
669 temp->next = next;
688 if (temp->next &&
689 (char *)(temp->next + 1) + bytes_needed <= temp->next
726 register struct temp_header *next; local
783 _buffer_init(struct buffer_block_header *first, struct buffer_block_header *next, uword words_needed, int *is_nonpage_buffer) argument
906 struct buffer_block_header *this, *next; local
[all...]
H A Dbip_delay.c785 * must contain an upward pointer to the next compound term in the cycle.
787 * it with []). This will stop traversal on the next encounter.
1027 pword *next = v.ptr++; local
1028 Dereference_(next);
1029 if (err = _setuniv(next->val, next->tag))
1452 register pword *p, *next; local
1455 next = vl.ptr + 1;
1456 Dereference_(next);
1457 if (IsList(next
1622 pword *p, *next, *ppp; local
1864 ec_schedule_susps(pword *next) argument
1986 ec_prune_suspensions(pword *next) argument
[all...]
/barrelfish-2018-10-04/lib/hashtable/
H A Dhashtable.c96 entry->next = ht->entries[_index];
156 _e = _e->next;
181 _e = _e->next;
199 ht->entries[_index] = _e->next;
201 _prev->next = _e->next;
207 _e = _e->next;
/barrelfish-2018-10-04/lib/libc/net/
H A Dgetifaddrs.c87 char *next; local
135 for (next = buf; next < buf + needed; next += rtm->rtm_msglen) {
136 rtm = (struct rt_msghdr *)(void *)next;
218 for (next = buf; next < buf + needed; next += rtm->rtm_msglen) {
219 rtm = (struct rt_msghdr *)(void *)next;
/barrelfish-2018-10-04/lib/lwip2/src/core/
H A Dmemp.c107 for (h = t->next; (t != NULL) && (h != NULL); t = t->next,
108 h = ((h->next != NULL) ? h->next->next : NULL)) {
242 memp->next = *desc->tab;
316 *desc->tab = memp->next;
318 memp->next = NULL;
434 memp->next = *desc->tab;
/barrelfish-2018-10-04/usr/skb/octopus/
H A Dskiplist.c235 // update next & prev pointer
264 // update prev->next pointer
299 * \param next Null in case we want to start a fresh intersect
304 char* skip_intersect(struct skip_list** sets, size_t set_count, char* next) argument
307 if (next == NULL) {
342 // no match, continue with next element
394 char* next = NULL; local
395 while( (next = skip_intersect(sets, 3, next)) != NULL) {
396 printf("next i
[all...]
/barrelfish-2018-10-04/lib/lwip/src/api/
H A Dnetbuf.c201 * to the next part.
205 * @return -1 if there is no next part
206 * 1 if moved to the next part but now there is no next part
207 * 0 if moved to the next part and there are still more parts
213 if (buf->ptr->next == NULL) {
216 buf->ptr = buf->ptr->next;
217 if (buf->ptr->next == NULL) {
/barrelfish-2018-10-04/lib/lwip2/src/api/
H A Dnetbuf.c209 * to the next part.
213 * @return -1 if there is no next part
214 * 1 if moved to the next part but now there is no next part
215 * 0 if moved to the next part and there are still more parts
221 if (buf->ptr->next == NULL) {
224 buf->ptr = buf->ptr->next;
225 if (buf->ptr->next == NULL) {
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Dbitmap.c1635 /* Low word might be empty, but then next guaranteed not. */
1788 word next; local
1794 result = next_greater_member(vbm.wptr, vcurr.nint, &next);
1799 Return_Integer(vnext, tnext, next);
1805 /* Returns RES_SLACK if next is not curr+1. */
1812 word next; local
1817 next = curr - offset + 1;
1819 if (next < 0) {
1823 pos = next / BPW;
1835 bits = *bits_ptr & BitsFrom(next
1868 word next; local
1892 word next; local
1948 word next; local
1967 word next; local
2015 word next; local
2034 word next; local
[all...]
/barrelfish-2018-10-04/include/thc/
H A Dthcsync.h24 struct thc_waiter *next; member in struct:thc_waiter
115 // counting up (but not including) until the next queue entry (if any)
128 thc_queue_entry_t *next; member in struct:thc_queue_entry
155 thc_ec_wait_list_t *next; member in struct:thc_ec_wait_list
/barrelfish-2018-10-04/kernel/
H A Dwakeup.c22 /* wrapper to change the head, and update the next wakeup tick */
28 // that we need to update the next tick value
94 struct dcb *d = kcb_current->wakeup_queue_head, *next = NULL; local
95 for (; d != NULL && d->wakeup_time <= now; d = next) {
96 next = d->wakeup_next;
/barrelfish-2018-10-04/include/barrelfish/
H A Dslot_alloc.h38 struct cnode_meta *next; member in struct:cnode_meta
51 struct slot_allocator_list *next; member in struct:slot_allocator_list
71 struct range_slot_allocator *next; ///< Next slot allocator member in struct:range_slot_allocator
/barrelfish-2018-10-04/usr/kaluga/
H A Ddevice_caps.c30 struct allocated_range* next; member in struct:allocated_range
55 iter = iter->next;
71 iter = &(*iter)->next;
/barrelfish-2018-10-04/usr/skb/skb_simple/
H A Doctopus_stubs.c40 struct wait_queue* next; member in struct:wait_queue
89 attr = attr->u.an.next;
118 copy_ast(&(*copy)->u.an.next, ast->u.an.next);
181 struct wait_queue* next = cur->next; local
183 cur = next;
249 struct wait_queue* next = cur->next; local
251 cur = next;
[all...]
/barrelfish-2018-10-04/lib/dma/
H A Ddma_request.c122 * \brief returns the next DMA request of the given request
131 return req->next;
135 * \brief sets the next DMA request of the given request
138 * \param next DMA request
141 struct dma_request *next)
143 req->next = next;
140 dma_request_set_next(struct dma_request *req, struct dma_request *next) argument
/barrelfish-2018-10-04/lib/lwip/src/core/
H A Dpbuf.c25 * pbuf of a packet has a ->next field other than NULL, more packets
29 * loop end condition (tot_len == p->len), NOT (next == NULL).
247 for (pcb = tcp_active_pcbs; NULL != pcb; pcb = pcb->next) {
421 p->next = NULL;
449 /* remember first pbuf for linkage in next iteration */
472 q->next = NULL;
474 r->next = q;
475 /* set total length of this pbuf and next in chain */
489 /* remember this pbuf for linkage in next iteration */
493 /*r->next
[all...]

Completed in 155 milliseconds

1234567891011>>