Lines Matching defs:list
348 * it has a linked list with entries. So the hash only checks which list to
349 * scan through. The code I had used so for used a list with merely 7 slots
351 * make an average of 1000 nodes in each list to run through. I upped that to
368 * the list kept in the multi handle.
373 &msg->list);
454 list */
464 /* We add the new easy entry last in the list. */
479 /* unlink the given easy handle from the linked list of easy handles */
528 /* Initialize timeout list for this handle */
2008 /* add this handle to the list of connect-pending handles */
2011 /* unlink from the main list */
2641 /* handles in these states should NOT be in this list */
2736 /* add this handle to the list of msgsent handles */
2739 /* unlink from the main list */
2912 /* there is one or more messages in the list */
2915 /* extract the head of the list to return */
3137 * Each Curl_easy has a list of timeouts. The add_next_timeout() is called
3139 * expired. This function is then to advance in the list to pick the next
3151 struct Curl_llist *list = &d->state.timeoutlist;
3155 /* move over the timeout list for this specific handle and remove all
3158 for(e = list->head; e;) {
3165 Curl_llist_remove(list, e, NULL);
3167 /* the list is sorted so get out on the first mismatch */
3171 e = list->head;
3182 /* Insert this node again into the splay. Keep the timer in the list in
3530 * Remove a given timestamp from the list of timeouts.
3537 /* find and remove the specific node from the list */
3550 * Add a timestamp to the list of timeouts. Keep the list sorted so that head
3551 * of list is always the timeout nearest in time.
3573 /* find the correct spot in the list */
3584 this is the first timeout on the list */
3586 Curl_llist_insert_next(timeoutlist, prev, node, &node->list);
3626 /* Add it to the timer list. It must stay in the list until it has expired
3689 struct Curl_llist *list = &data->state.timeoutlist;
3697 /* flush the timeout list too */
3698 while(list->size > 0) {
3699 Curl_llist_remove(list, list->tail, NULL);
3757 back into the main list and change state to CONNECT */
3766 /* put it back into the main list */
3771 /* Remove this node from the list */