Searched refs:next (Results 1 – 22 of 22) sorted by relevance
25 for ((q) = (h)->next; (q) != (h); (q) = (q)->next)28 q->next = q; in uv__queue_init()37 return q->next; in uv__queue_head()41 return q->next; in uv__queue_next()45 h->prev->next = n->next; in uv__queue_add()48 h->prev->next = h; in uv__queue_add()56 n->next = q; in uv__queue_split()71 q->next = h->next; in uv__queue_insert_head()74 h->next = q; in uv__queue_insert_head()79 q->next = h; in uv__queue_insert_tail()[all …]
415 uint16_t next; in uv__get_surrogate_value() local419 next = w_source_ptr[1]; in uv__get_surrogate_value()420 if (next >= 0xDC00 && next <= 0xDFFF) in uv__get_surrogate_value()421 return 0x10000 + ((u - 0xD800) << 10) + (next - 0xDC00); in uv__get_surrogate_value()
60 struct uv__fd_hash_entry_group_s* next; member116 for (group_ptr = group_ptr->next; \118 group_ptr = group_ptr->next) \153 new_group_ptr->next = bucket_ptr->data; in uv__fd_hash_add()187 bucket_ptr->data = old_group_ptr->next; in uv__fd_hash_remove()
144 uv_req_t* next; in uv__process_reqs() local150 next = first; in uv__process_reqs()153 while (next != NULL) { in uv__process_reqs()154 req = next; in uv__process_reqs()155 next = req->next_req != first ? req->next_req : NULL; in uv__process_reqs()
311 struct req_list_s* next; member323 req_freelist = req->next; in req_alloc()335 req->next = req_freelist; in req_free()346 struct buf_list_s* next; member358 buf_freelist = ab->next; in buf_alloc()371 ab->next = buf_freelist; in buf_free()
42 struct buf_s* next; member61 buf_freelist = ab->next; in buf_alloc()74 ab->next = buf_freelist; in buf_free()
40 struct buf_s* next; member
41 If `timeout` is zero, the callback fires on the next event loop iteration.75 then the old repeat value will have been used to schedule the next timeout.
73 most part. There are cases, however, in which calling such a callback is deferred for the next105 #. Due timers are run. Note that 'now' is not updated again until the next loop iteration.
108 values for the next process to take over.
127 possible. This will happen not sooner than the next loop iteration.
156 may be pending on the next input event on that TTY on Windows, and does not
150 `close_cb` will still be deferred to the next iteration of the event loop.
325 get `ent` populated with the next directory entry data. When there are no
14 stop running is *on the next iteration*, possibly later. This means that events
44 * If the timer is repeating, the next timeout has already been scheduled, so229 it. ``start_timeout`` is called by libcurl to notify us of the next timeout
21 e = get the next event
87 simply drives the next read. Thus read and write proceed in lockstep via
402 ``main()``), that we accept the client socket and pass it along to the next
1800 goto next; in uv_cpu_info()1820 goto next; in uv_cpu_info()1828 next: in uv_cpu_info()
64 struct uv__queue* next; member
466 * barrier: wait for prior out before next in (Jameson Nash)4176 * windows: defer reporting TCP write failure until next tick (Saúl Ibarra
Completed in 128 milliseconds
