Lines Matching refs:next
465 data->next = NULL; /* end of the line */
468 last->next = data;
483 /* make the previous node point to our next */
485 data->prev->next = data->next;
487 multi->easyp = data->next; /* point to first node */
489 /* make our next point to our previous node */
490 if(data->next)
491 data->next->prev = data->prev;
495 data->prev = data->next = NULL;
554 is removed as when the next handle is added, as then the check in
935 for(e = multi->msglist.head; e; e = e->next) {
1175 for(data = multi->easyp; data; data = data->next) {
1251 for(data = multi->easyp; data; data = data->next) {
1293 for(data = multi->easyp; data; data = data->next) {
1433 for(data = multi->easyp; data; data = data->next) {
1818 sending more data on the existing connection until the next transfer
2086 /* Perform the next step in the connection phase, and then move on
2095 /* call again please so that we get the next socket setup */
2769 /* Do the loop and only alter the signal ignore state if the next handle
2772 /* the current node might be unlinked in multi_runsingle(), get the next
2774 struct Curl_easy *datanext = data->next;
2783 data = datanext; /* operate on next handle */
2842 nextdata = data->next;
3080 /* Remember for next time */
3139 * expired. This function is then to advance in the list to pick the next
3156 timeouts that are now passed tense and store the next pending
3159 struct Curl_llist_element *n = e->next;
3214 data = data->next;
3303 data = t->payload; /* assign this for next loop */
3538 for(e = timeoutlist->head; e; e = e->next) {
3574 for(e = timeoutlist->head; e; e = e->next) {
3816 e = e->next;