Lines Matching defs:node
470 multi->easylp = data; /* the new last node */
473 /* first node, make prev NULL! */
483 /* make the previous node point to our next */
487 multi->easyp = data->next; /* point to first node */
489 /* make our next point to our previous node */
493 multi->easylp = data->prev; /* point to last node */
596 /* increase the node-counter */
2772 /* the current node might be unlinked in multi_runsingle(), get the next
3140 * timeout to use (skip the already expired ones) and add this node back to
3143 * The splay tree only has each sessionhandle as a single node and the nearest
3153 struct time_node *node = NULL;
3161 node = (struct time_node *)e->ptr;
3162 diff = Curl_timediff_us(node->time, now);
3180 memcpy(tv, &node->time, sizeof(*tv));
3182 /* Insert this node again into the splay. Keep the timer in the list in
3299 extracts a matching node if there is one */
3508 /* When multi_timeout() is done, multi->timetree points to the node with the
3537 /* find and remove the specific node from the list */
3560 struct time_node *node;
3565 node = &data->state.expires[eid];
3568 memcpy(&node->time, stamp, sizeof(*stamp));
3569 node->eid = eid; /* also marks it as in use */
3576 timediff_t diff = Curl_timediff(check->time, node->time);
3586 Curl_llist_insert_next(timeoutlist, prev, node, &node->list);
3631 /* This means that the struct is added as a node in the splay tree.
3648 infof(data, "Internal error removing splay node = %d", rc);
3695 infof(data, "Internal error clearing splay node = %d", rc);
3771 /* Remove this node from the list */