2002-09-03 13:52:59 +02:00
|
|
|
/***************************************************************************
|
2001-11-28 12:09:18 +01:00
|
|
|
* _ _ ____ _
|
|
|
|
* Project ___| | | | _ \| |
|
|
|
|
* / __| | | | |_) | |
|
|
|
|
* | (__| |_| | _ <| |___
|
|
|
|
* \___|\___/|_| \_\_____|
|
|
|
|
*
|
2004-01-07 10:19:33 +01:00
|
|
|
* Copyright (C) 1998 - 2004, Daniel Stenberg, <daniel@haxx.se>, et al.
|
2001-11-28 12:09:18 +01:00
|
|
|
*
|
2002-09-03 13:52:59 +02:00
|
|
|
* This software is licensed as described in the file COPYING, which
|
|
|
|
* you should have received as part of this distribution. The terms
|
|
|
|
* are also available at http://curl.haxx.se/docs/copyright.html.
|
|
|
|
*
|
2001-11-28 12:09:18 +01:00
|
|
|
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
|
|
|
* copies of the Software, and permit persons to whom the Software is
|
2002-09-03 13:52:59 +02:00
|
|
|
* furnished to do so, under the terms of the COPYING file.
|
2001-11-28 12:09:18 +01:00
|
|
|
*
|
|
|
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
|
|
* KIND, either express or implied.
|
|
|
|
*
|
|
|
|
* $Id$
|
2002-09-03 13:52:59 +02:00
|
|
|
***************************************************************************/
|
2001-11-28 12:09:18 +01:00
|
|
|
|
|
|
|
#include "setup.h"
|
2002-01-03 16:01:22 +01:00
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
2003-02-14 10:03:03 +01:00
|
|
|
|
2003-03-13 22:41:02 +01:00
|
|
|
#ifdef HAVE_SYS_TYPES_H
|
|
|
|
#include <sys/types.h>
|
|
|
|
#endif
|
2003-02-14 10:03:03 +01:00
|
|
|
#ifdef HAVE_SYS_SOCKET_H
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#endif
|
2003-06-13 08:48:04 +02:00
|
|
|
#ifdef HAVE_UNISTD_H
|
|
|
|
#include <unistd.h>
|
|
|
|
#endif
|
2003-02-14 10:03:03 +01:00
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
#include <curl/curl.h>
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2002-01-03 16:01:22 +01:00
|
|
|
#include "urldata.h"
|
|
|
|
#include "transfer.h"
|
|
|
|
#include "url.h"
|
2002-08-12 11:43:20 +02:00
|
|
|
#include "connect.h"
|
2003-04-29 20:03:30 +02:00
|
|
|
#include "progress.h"
|
2002-01-03 16:01:22 +01:00
|
|
|
|
2002-04-28 00:21:51 +02:00
|
|
|
/* The last #include file should be: */
|
2003-06-26 13:22:12 +02:00
|
|
|
#ifdef CURLDEBUG
|
2002-04-28 00:21:51 +02:00
|
|
|
#include "memdebug.h"
|
|
|
|
#endif
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
struct Curl_message {
|
|
|
|
/* the 'CURLMsg' is the part that is visible to the external user */
|
|
|
|
struct CURLMsg extmsg;
|
|
|
|
struct Curl_message *next;
|
|
|
|
};
|
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
typedef enum {
|
|
|
|
CURLM_STATE_INIT,
|
2003-08-05 16:40:59 +02:00
|
|
|
CURLM_STATE_CONNECT, /* resolve/connect has been sent off */
|
|
|
|
CURLM_STATE_WAITRESOLVE, /* we're awaiting the resolve to finalize */
|
2002-08-12 11:43:20 +02:00
|
|
|
CURLM_STATE_WAITCONNECT, /* we're awaiting the connect to finalize */
|
|
|
|
CURLM_STATE_DO, /* send off the request (part 1) */
|
|
|
|
CURLM_STATE_DO_MORE, /* send off the request (part 2) */
|
|
|
|
CURLM_STATE_PERFORM, /* transfer data */
|
|
|
|
CURLM_STATE_DONE, /* post data transfer operation */
|
|
|
|
CURLM_STATE_COMPLETED, /* operation complete */
|
2001-11-28 12:09:18 +01:00
|
|
|
|
|
|
|
CURLM_STATE_LAST /* not a true state, never use this */
|
|
|
|
} CURLMstate;
|
|
|
|
|
|
|
|
struct Curl_one_easy {
|
|
|
|
/* first, two fields for the linked list of these */
|
|
|
|
struct Curl_one_easy *next;
|
|
|
|
struct Curl_one_easy *prev;
|
|
|
|
|
2002-01-03 16:01:22 +01:00
|
|
|
struct SessionHandle *easy_handle; /* the easy handle for this unit */
|
|
|
|
struct connectdata *easy_conn; /* the "unit's" connection */
|
|
|
|
|
2001-11-28 16:46:25 +01:00
|
|
|
CURLMstate state; /* the handle's state */
|
|
|
|
CURLcode result; /* previous result */
|
2002-05-28 16:45:50 +02:00
|
|
|
|
|
|
|
struct Curl_message *msg; /* A pointer to one single posted message.
|
|
|
|
Cleanup should be done on this pointer NOT on
|
|
|
|
the linked list in Curl_multi. This message
|
|
|
|
will be deleted when this handle is removed
|
|
|
|
from the multi-handle */
|
|
|
|
int msg_num; /* number of messages left in 'msg' to return */
|
2001-11-28 12:09:18 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
#define CURL_MULTI_HANDLE 0x000bab1e
|
|
|
|
|
2001-12-04 08:47:21 +01:00
|
|
|
#define GOOD_MULTI_HANDLE(x) ((x)&&(((struct Curl_multi *)x)->type == CURL_MULTI_HANDLE))
|
2001-11-28 12:09:18 +01:00
|
|
|
#define GOOD_EASY_HANDLE(x) (x)
|
|
|
|
|
|
|
|
/* This is the struct known as CURLM on the outside */
|
|
|
|
struct Curl_multi {
|
|
|
|
/* First a simple identifier to easier detect if a user mix up
|
|
|
|
this multi handle with an easy handle. Set this to CURL_MULTI_HANDLE. */
|
|
|
|
long type;
|
|
|
|
|
|
|
|
/* We have a linked list with easy handles */
|
2001-11-28 17:00:18 +01:00
|
|
|
struct Curl_one_easy easy;
|
2001-11-28 12:09:18 +01:00
|
|
|
/* This is the amount of entries in the linked list above. */
|
|
|
|
int num_easy;
|
2001-11-28 17:00:18 +01:00
|
|
|
|
2002-05-28 16:45:50 +02:00
|
|
|
int num_msgs; /* total amount of messages in the easy handles */
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2002-01-07 21:52:32 +01:00
|
|
|
/* Hostname cache */
|
|
|
|
curl_hash *hostcache;
|
2001-11-28 12:09:18 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
CURLM *curl_multi_init(void)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi;
|
|
|
|
|
|
|
|
multi = (void *)malloc(sizeof(struct Curl_multi));
|
|
|
|
|
|
|
|
if(multi) {
|
|
|
|
memset(multi, 0, sizeof(struct Curl_multi));
|
|
|
|
multi->type = CURL_MULTI_HANDLE;
|
|
|
|
}
|
2003-09-12 00:14:29 +02:00
|
|
|
|
|
|
|
multi->hostcache = Curl_hash_alloc(7, Curl_freednsinfo);
|
|
|
|
if(!multi->hostcache) {
|
|
|
|
/* failure, free mem and bail out */
|
|
|
|
free(multi);
|
|
|
|
multi = NULL;
|
|
|
|
}
|
2001-11-28 12:09:18 +01:00
|
|
|
return (CURLM *) multi;
|
|
|
|
}
|
|
|
|
|
|
|
|
CURLMcode curl_multi_add_handle(CURLM *multi_handle,
|
|
|
|
CURL *easy_handle)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
|
|
|
struct Curl_one_easy *easy;
|
|
|
|
|
|
|
|
/* First, make some basic checks that the CURLM handle is a good handle */
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
|
|
|
/* Verify that we got a somewhat good easy handle too */
|
|
|
|
if(!GOOD_EASY_HANDLE(easy_handle))
|
|
|
|
return CURLM_BAD_EASY_HANDLE;
|
|
|
|
|
|
|
|
/* Now, time to add an easy handle to the multi stack */
|
|
|
|
easy = (struct Curl_one_easy *)malloc(sizeof(struct Curl_one_easy));
|
|
|
|
if(!easy)
|
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
|
|
|
|
/* clean it all first (just to be sure) */
|
|
|
|
memset(easy, 0, sizeof(struct Curl_one_easy));
|
|
|
|
|
|
|
|
/* set the easy handle */
|
|
|
|
easy->easy_handle = easy_handle;
|
|
|
|
easy->state = CURLM_STATE_INIT;
|
2003-09-12 00:14:29 +02:00
|
|
|
|
|
|
|
/* for multi interface connections, we share DNS cache automaticly */
|
|
|
|
easy->easy_handle->hostcache = multi->hostcache;
|
2001-11-28 12:09:18 +01:00
|
|
|
|
|
|
|
/* We add this new entry first in the list. We make our 'next' point to the
|
|
|
|
previous next and our 'prev' point back to the 'first' struct */
|
2001-11-28 17:00:18 +01:00
|
|
|
easy->next = multi->easy.next;
|
|
|
|
easy->prev = &multi->easy;
|
2001-11-28 12:09:18 +01:00
|
|
|
|
|
|
|
/* make 'easy' the first node in the chain */
|
2001-11-28 17:00:18 +01:00
|
|
|
multi->easy.next = easy;
|
2001-11-28 12:09:18 +01:00
|
|
|
|
|
|
|
/* if there was a next node, make sure its 'prev' pointer links back to
|
|
|
|
the new node */
|
|
|
|
if(easy->next)
|
|
|
|
easy->next->prev = easy;
|
|
|
|
|
|
|
|
/* increase the node-counter */
|
|
|
|
multi->num_easy++;
|
|
|
|
|
2002-01-03 16:01:22 +01:00
|
|
|
return CURLM_CALL_MULTI_PERFORM;
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
CURLMcode curl_multi_remove_handle(CURLM *multi_handle,
|
|
|
|
CURL *curl_handle)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
|
|
|
struct Curl_one_easy *easy;
|
|
|
|
|
|
|
|
/* First, make some basic checks that the CURLM handle is a good handle */
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
|
|
|
/* Verify that we got a somewhat good easy handle too */
|
|
|
|
if(!GOOD_EASY_HANDLE(curl_handle))
|
|
|
|
return CURLM_BAD_EASY_HANDLE;
|
|
|
|
|
|
|
|
/* scan through the list and remove the 'curl_handle' */
|
2001-11-28 17:00:18 +01:00
|
|
|
easy = multi->easy.next;
|
2001-11-28 12:09:18 +01:00
|
|
|
while(easy) {
|
2004-02-05 10:37:04 +01:00
|
|
|
if(easy->easy_handle == (struct SessionHandle *)curl_handle)
|
2001-11-28 12:09:18 +01:00
|
|
|
break;
|
|
|
|
easy=easy->next;
|
|
|
|
}
|
|
|
|
if(easy) {
|
|
|
|
/* If the 'state' is not INIT or COMPLETED, we might need to do something
|
|
|
|
nice to put the easy_handle in a good known state when this returns. */
|
|
|
|
|
2002-06-05 23:29:20 +02:00
|
|
|
/* clear out the usage of the shared DNS cache */
|
|
|
|
easy->easy_handle->hostcache = NULL;
|
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
/* make the previous node point to our next */
|
|
|
|
if(easy->prev)
|
|
|
|
easy->prev->next = easy->next;
|
|
|
|
/* make our next point to our previous node */
|
|
|
|
if(easy->next)
|
|
|
|
easy->next->prev = easy->prev;
|
|
|
|
|
|
|
|
/* NOTE NOTE NOTE
|
|
|
|
We do not touch the easy handle here! */
|
2002-05-28 16:45:50 +02:00
|
|
|
if (easy->msg)
|
|
|
|
free(easy->msg);
|
2001-11-28 12:09:18 +01:00
|
|
|
free(easy);
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
multi->num_easy--; /* one less to care about now */
|
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return CURLM_BAD_EASY_HANDLE; /* twasn't found */
|
|
|
|
}
|
|
|
|
|
|
|
|
CURLMcode curl_multi_fdset(CURLM *multi_handle,
|
|
|
|
fd_set *read_fd_set, fd_set *write_fd_set,
|
|
|
|
fd_set *exc_fd_set, int *max_fd)
|
|
|
|
{
|
|
|
|
/* Scan through all the easy handles to get the file descriptors set.
|
|
|
|
Some easy handles may not have connected to the remote host yet,
|
|
|
|
and then we must make sure that is done. */
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
|
|
|
struct Curl_one_easy *easy;
|
2002-01-03 16:01:22 +01:00
|
|
|
int this_max_fd=-1;
|
2001-11-28 12:09:18 +01:00
|
|
|
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
2002-01-03 16:01:22 +01:00
|
|
|
*max_fd = -1; /* so far none! */
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
easy=multi->easy.next;
|
2001-11-28 12:09:18 +01:00
|
|
|
while(easy) {
|
|
|
|
switch(easy->state) {
|
2002-01-03 16:01:22 +01:00
|
|
|
default:
|
2001-11-28 12:09:18 +01:00
|
|
|
break;
|
2003-08-05 16:40:59 +02:00
|
|
|
case CURLM_STATE_WAITRESOLVE:
|
|
|
|
/* waiting for a resolve to complete */
|
|
|
|
Curl_multi_ares_fdset(easy->easy_conn, read_fd_set, write_fd_set,
|
|
|
|
&this_max_fd);
|
|
|
|
if(this_max_fd > *max_fd)
|
|
|
|
*max_fd = this_max_fd;
|
|
|
|
break;
|
|
|
|
|
2002-08-12 11:43:20 +02:00
|
|
|
case CURLM_STATE_WAITCONNECT:
|
|
|
|
case CURLM_STATE_DO_MORE:
|
|
|
|
{
|
|
|
|
/* when we're waiting for a connect, we wait for the socket to
|
|
|
|
become writable */
|
|
|
|
struct connectdata *conn = easy->easy_conn;
|
|
|
|
int sockfd;
|
|
|
|
|
|
|
|
if(CURLM_STATE_WAITCONNECT == easy->state) {
|
2003-11-24 08:15:37 +01:00
|
|
|
sockfd = conn->sock[FIRSTSOCKET];
|
2002-08-12 11:43:20 +02:00
|
|
|
FD_SET(sockfd, write_fd_set);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* When in DO_MORE state, we could be either waiting for us
|
|
|
|
to connect to a remote site, or we could wait for that site
|
|
|
|
to connect to us. It makes a difference in the way: if we
|
|
|
|
connect to the site we wait for the socket to become writable, if
|
|
|
|
the site connects to us we wait for it to become readable */
|
2003-11-24 08:15:37 +01:00
|
|
|
sockfd = conn->sock[SECONDARYSOCKET];
|
2002-08-12 11:43:20 +02:00
|
|
|
FD_SET(sockfd, write_fd_set);
|
|
|
|
}
|
|
|
|
|
|
|
|
if(sockfd > *max_fd)
|
|
|
|
*max_fd = sockfd;
|
|
|
|
}
|
|
|
|
break;
|
2001-11-28 12:09:18 +01:00
|
|
|
case CURLM_STATE_PERFORM:
|
|
|
|
/* This should have a set of file descriptors for us to set. */
|
|
|
|
/* after the transfer is done, go DONE */
|
2002-01-03 16:01:22 +01:00
|
|
|
|
|
|
|
Curl_single_fdset(easy->easy_conn,
|
|
|
|
read_fd_set, write_fd_set,
|
|
|
|
exc_fd_set, &this_max_fd);
|
|
|
|
|
|
|
|
/* remember the maximum file descriptor */
|
|
|
|
if(this_max_fd > *max_fd)
|
|
|
|
*max_fd = this_max_fd;
|
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
break;
|
|
|
|
}
|
2001-11-28 16:46:25 +01:00
|
|
|
easy = easy->next; /* check next handle */
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
CURLMcode curl_multi_perform(CURLM *multi_handle, int *running_handles)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
|
|
|
struct Curl_one_easy *easy;
|
2001-11-28 17:00:18 +01:00
|
|
|
bool done;
|
2001-12-13 08:16:27 +01:00
|
|
|
CURLMcode result=CURLM_OK;
|
2002-05-28 16:45:50 +02:00
|
|
|
struct Curl_message *msg = NULL;
|
2002-08-12 11:43:20 +02:00
|
|
|
bool connected;
|
2003-08-05 16:40:59 +02:00
|
|
|
bool async;
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2002-01-03 16:01:22 +01:00
|
|
|
*running_handles = 0; /* bump this once for every living handle */
|
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
easy=multi->easy.next;
|
2001-11-28 12:09:18 +01:00
|
|
|
while(easy) {
|
2003-06-26 13:22:12 +02:00
|
|
|
#ifdef CURLDEBUG
|
2002-08-12 11:43:20 +02:00
|
|
|
fprintf(stderr, "HANDLE %p: State: %x\n",
|
|
|
|
(char *)easy, easy->state);
|
|
|
|
#endif
|
2004-01-12 16:26:32 +01:00
|
|
|
do {
|
|
|
|
if (CURLM_STATE_WAITCONNECT <= easy->state &&
|
|
|
|
easy->state <= CURLM_STATE_DO &&
|
|
|
|
easy->easy_handle->change.url_changed) {
|
|
|
|
char *gotourl;
|
|
|
|
Curl_posttransfer(easy->easy_handle);
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
gotourl = strdup(easy->easy_handle->change.url);
|
|
|
|
easy->easy_handle->change.url_changed = FALSE;
|
|
|
|
easy->result = Curl_follow(easy->easy_handle, gotourl);
|
|
|
|
if(CURLE_OK == easy->result)
|
|
|
|
easy->state = CURLM_STATE_CONNECT;
|
|
|
|
else
|
|
|
|
free(gotourl);
|
2001-12-13 08:16:27 +01:00
|
|
|
}
|
2004-01-12 16:26:32 +01:00
|
|
|
|
|
|
|
easy->easy_handle->change.url_changed = FALSE;
|
2003-08-05 16:40:59 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
switch(easy->state) {
|
|
|
|
case CURLM_STATE_INIT:
|
|
|
|
/* init this transfer. */
|
|
|
|
easy->result=Curl_pretransfer(easy->easy_handle);
|
2002-01-03 16:01:22 +01:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
if(CURLE_OK == easy->result) {
|
|
|
|
/* after init, go CONNECT */
|
|
|
|
easy->state = CURLM_STATE_CONNECT;
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
|
|
|
|
easy->easy_handle->state.used_interface = Curl_if_multi;
|
2003-08-05 16:40:59 +02:00
|
|
|
}
|
2004-01-12 16:26:32 +01:00
|
|
|
break;
|
2003-08-05 16:40:59 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
case CURLM_STATE_CONNECT:
|
|
|
|
/* Connect. We get a connection identifier filled in. */
|
|
|
|
Curl_pgrsTime(easy->easy_handle, TIMER_STARTSINGLE);
|
|
|
|
easy->result = Curl_connect(easy->easy_handle, &easy->easy_conn,
|
|
|
|
&async);
|
|
|
|
|
|
|
|
if(CURLE_OK == easy->result) {
|
|
|
|
if(async)
|
|
|
|
/* We're now waiting for an asynchronous name lookup */
|
|
|
|
easy->state = CURLM_STATE_WAITRESOLVE;
|
|
|
|
else {
|
|
|
|
/* after the connect has been sent off, go WAITCONNECT */
|
|
|
|
easy->state = CURLM_STATE_WAITCONNECT;
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CURLM_STATE_WAITRESOLVE:
|
|
|
|
/* awaiting an asynch name resolve to complete */
|
2003-08-05 16:40:59 +02:00
|
|
|
{
|
2003-10-04 16:50:45 +02:00
|
|
|
struct Curl_dns_entry *dns;
|
2003-08-05 16:40:59 +02:00
|
|
|
|
|
|
|
/* check if we have the name resolved by now */
|
2003-10-04 16:50:45 +02:00
|
|
|
easy->result = Curl_is_resolved(easy->easy_conn, &dns);
|
2003-08-05 16:40:59 +02:00
|
|
|
|
2003-10-04 16:50:45 +02:00
|
|
|
if(dns) {
|
2003-08-05 16:40:59 +02:00
|
|
|
/* Perform the next step in the connection phase, and then move on
|
|
|
|
to the WAITCONNECT state */
|
|
|
|
easy->result = Curl_async_resolved(easy->easy_conn);
|
|
|
|
|
2003-10-13 14:21:56 +02:00
|
|
|
if(CURLE_OK != easy->result)
|
|
|
|
/* if Curl_async_resolved() returns failure, the connection struct
|
|
|
|
is already freed and gone */
|
|
|
|
easy->easy_conn = NULL; /* no more connection */
|
|
|
|
|
2003-08-05 16:40:59 +02:00
|
|
|
easy->state = CURLM_STATE_WAITCONNECT;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(CURLE_OK != easy->result) {
|
|
|
|
/* failure detected */
|
2003-09-22 01:10:47 +02:00
|
|
|
Curl_disconnect(easy->easy_conn); /* disconnect properly */
|
2003-08-05 16:40:59 +02:00
|
|
|
easy->easy_conn = NULL; /* no more connection */
|
|
|
|
break;
|
|
|
|
}
|
2001-12-13 08:16:27 +01:00
|
|
|
}
|
2001-11-28 12:09:18 +01:00
|
|
|
break;
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
case CURLM_STATE_WAITCONNECT:
|
|
|
|
/* awaiting a completion of an asynch connect */
|
|
|
|
easy->result = Curl_is_connected(easy->easy_conn,
|
|
|
|
easy->easy_conn->sock[FIRSTSOCKET],
|
|
|
|
&connected);
|
|
|
|
if(connected)
|
|
|
|
easy->result = Curl_protocol_connect(easy->easy_conn, NULL);
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
if(CURLE_OK != easy->result) {
|
|
|
|
/* failure detected */
|
|
|
|
Curl_disconnect(easy->easy_conn); /* close the connection */
|
|
|
|
easy->easy_conn = NULL; /* no more connection */
|
|
|
|
break;
|
|
|
|
}
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
if(connected) {
|
|
|
|
/* after the connect has completed, go DO */
|
|
|
|
easy->state = CURLM_STATE_DO;
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
2002-08-12 11:43:20 +02:00
|
|
|
}
|
2004-01-12 16:26:32 +01:00
|
|
|
break;
|
|
|
|
|
|
|
|
case CURLM_STATE_DO:
|
|
|
|
/* Do the fetch or put request */
|
|
|
|
easy->result = Curl_do(&easy->easy_conn);
|
|
|
|
if(CURLE_OK == easy->result) {
|
|
|
|
|
|
|
|
/* after do, go PERFORM... or DO_MORE */
|
|
|
|
if(easy->easy_conn->bits.do_more) {
|
|
|
|
/* we're supposed to do more, but we need to sit down, relax
|
|
|
|
and wait a little while first */
|
|
|
|
easy->state = CURLM_STATE_DO_MORE;
|
|
|
|
result = CURLM_OK;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* we're done with the DO, now PERFORM */
|
|
|
|
easy->result = Curl_readwrite_init(easy->easy_conn);
|
|
|
|
if(CURLE_OK == easy->result) {
|
|
|
|
easy->state = CURLM_STATE_PERFORM;
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
}
|
2002-08-12 11:43:20 +02:00
|
|
|
}
|
|
|
|
}
|
2004-01-12 16:26:32 +01:00
|
|
|
break;
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
case CURLM_STATE_DO_MORE:
|
2002-08-12 11:43:20 +02:00
|
|
|
/*
|
2004-01-12 16:26:32 +01:00
|
|
|
* First, check if we really are ready to do more.
|
2002-08-12 11:43:20 +02:00
|
|
|
*/
|
2004-01-12 16:26:32 +01:00
|
|
|
easy->result =
|
|
|
|
Curl_is_connected(easy->easy_conn,
|
|
|
|
easy->easy_conn->sock[SECONDARYSOCKET],
|
|
|
|
&connected);
|
|
|
|
if(connected) {
|
|
|
|
/*
|
|
|
|
* When we are connected, DO MORE and then go PERFORM
|
|
|
|
*/
|
|
|
|
easy->result = Curl_do_more(easy->easy_conn);
|
|
|
|
|
|
|
|
if(CURLE_OK == easy->result)
|
|
|
|
easy->result = Curl_readwrite_init(easy->easy_conn);
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
if(CURLE_OK == easy->result) {
|
|
|
|
easy->state = CURLM_STATE_PERFORM;
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
}
|
2002-01-03 16:01:22 +01:00
|
|
|
}
|
2004-01-12 16:26:32 +01:00
|
|
|
break;
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
case CURLM_STATE_PERFORM:
|
|
|
|
/* read/write data if it is ready to do so */
|
|
|
|
easy->result = Curl_readwrite(easy->easy_conn, &done);
|
|
|
|
|
|
|
|
if(easy->result) {
|
|
|
|
/* The transfer phase returned error, we mark the connection to get
|
|
|
|
* closed to prevent being re-used. This is becasue we can't
|
|
|
|
* possibly know if the connection is in a good shape or not now. */
|
|
|
|
easy->easy_conn->bits.close = TRUE;
|
|
|
|
|
|
|
|
if(-1 !=easy->easy_conn->sock[SECONDARYSOCKET]) {
|
|
|
|
/* if we failed anywhere, we must clean up the secondary socket if
|
|
|
|
it was used */
|
|
|
|
sclose(easy->easy_conn->sock[SECONDARYSOCKET]);
|
|
|
|
easy->easy_conn->sock[SECONDARYSOCKET]=-1;
|
|
|
|
}
|
|
|
|
Curl_posttransfer(easy->easy_handle);
|
|
|
|
Curl_done(easy->easy_conn);
|
2002-10-07 15:38:59 +02:00
|
|
|
}
|
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
/* after the transfer is done, go DONE */
|
|
|
|
else if(TRUE == done) {
|
|
|
|
|
|
|
|
/* call this even if the readwrite function returned error */
|
|
|
|
Curl_posttransfer(easy->easy_handle);
|
|
|
|
|
|
|
|
/* When we follow redirects, must to go back to the CONNECT state */
|
|
|
|
if(easy->easy_conn->newurl) {
|
|
|
|
char *newurl = easy->easy_conn->newurl;
|
|
|
|
easy->easy_conn->newurl = NULL;
|
|
|
|
easy->result = Curl_follow(easy->easy_handle, newurl);
|
|
|
|
if(CURLE_OK == easy->result) {
|
|
|
|
easy->state = CURLM_STATE_CONNECT;
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
easy->state = CURLM_STATE_DONE;
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
2002-10-18 17:27:49 +02:00
|
|
|
}
|
2002-10-07 15:38:59 +02:00
|
|
|
}
|
2004-01-12 16:26:32 +01:00
|
|
|
break;
|
|
|
|
case CURLM_STATE_DONE:
|
|
|
|
/* post-transfer command */
|
|
|
|
easy->result = Curl_done(easy->easy_conn);
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
/* after we have DONE what we're supposed to do, go COMPLETED, and
|
|
|
|
it doesn't matter what the Curl_done() returned! */
|
|
|
|
easy->state = CURLM_STATE_COMPLETED;
|
|
|
|
break;
|
2002-05-03 00:12:14 +02:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
case CURLM_STATE_COMPLETED:
|
|
|
|
/* this is a completed transfer, it is likely to still be connected */
|
2001-11-28 16:46:25 +01:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
/* This node should be delinked from the list now and we should post
|
|
|
|
an information message that we are complete. */
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
return CURLM_INTERNAL_ERROR;
|
|
|
|
}
|
2002-01-03 16:01:22 +01:00
|
|
|
|
2004-01-12 16:26:32 +01:00
|
|
|
if(CURLM_STATE_COMPLETED != easy->state) {
|
|
|
|
if(CURLE_OK != easy->result) {
|
|
|
|
/*
|
|
|
|
* If an error was returned, and we aren't in completed state now,
|
|
|
|
* then we go to completed and consider this transfer aborted. */
|
|
|
|
easy->state = CURLM_STATE_COMPLETED;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
/* this one still lives! */
|
|
|
|
(*running_handles)++;
|
2003-04-29 20:03:30 +02:00
|
|
|
}
|
2004-01-12 16:26:32 +01:00
|
|
|
|
|
|
|
} while (easy->easy_handle->change.url_changed);
|
2002-05-28 16:45:50 +02:00
|
|
|
|
|
|
|
if ((CURLM_STATE_COMPLETED == easy->state) && !easy->msg) {
|
|
|
|
/* clear out the usage of the shared DNS cache */
|
|
|
|
easy->easy_handle->hostcache = NULL;
|
|
|
|
|
|
|
|
/* now add a node to the Curl_message linked list with this info */
|
|
|
|
msg = (struct Curl_message *)malloc(sizeof(struct Curl_message));
|
|
|
|
|
|
|
|
if(!msg)
|
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
|
|
|
|
msg->extmsg.msg = CURLMSG_DONE;
|
|
|
|
msg->extmsg.easy_handle = easy->easy_handle;
|
|
|
|
msg->extmsg.data.result = easy->result;
|
|
|
|
msg->next=NULL;
|
|
|
|
|
|
|
|
easy->msg = msg;
|
|
|
|
easy->msg_num = 1; /* there is one unread message here */
|
|
|
|
|
|
|
|
multi->num_msgs++; /* increase message counter */
|
2001-11-28 16:46:25 +01:00
|
|
|
}
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2001-11-28 16:46:25 +01:00
|
|
|
easy = easy->next; /* operate on next handle */
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
2002-05-03 00:12:14 +02:00
|
|
|
|
2002-01-03 16:01:22 +01:00
|
|
|
return result;
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
CURLMcode curl_multi_cleanup(CURLM *multi_handle)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
2002-04-28 00:21:51 +02:00
|
|
|
struct Curl_one_easy *easy;
|
|
|
|
struct Curl_one_easy *nexteasy;
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
if(GOOD_MULTI_HANDLE(multi)) {
|
|
|
|
multi->type = 0; /* not good anymore */
|
2002-04-28 00:21:51 +02:00
|
|
|
Curl_hash_destroy(multi->hostcache);
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
/* remove all easy handles */
|
2002-04-28 00:21:51 +02:00
|
|
|
easy = multi->easy.next;
|
|
|
|
while(easy) {
|
|
|
|
nexteasy=easy->next;
|
2002-05-02 20:07:38 +02:00
|
|
|
/* clear out the usage of the shared DNS cache */
|
|
|
|
easy->easy_handle->hostcache = NULL;
|
|
|
|
|
2002-05-28 16:45:50 +02:00
|
|
|
if (easy->msg)
|
|
|
|
free(easy->msg);
|
2002-04-28 00:21:51 +02:00
|
|
|
free(easy);
|
|
|
|
easy = nexteasy;
|
|
|
|
}
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
free(multi);
|
|
|
|
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
}
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2002-04-28 00:21:51 +02:00
|
|
|
CURLMsg *curl_multi_info_read(CURLM *multi_handle, int *msgs_in_queue)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
|
|
|
|
2003-08-20 15:49:46 +02:00
|
|
|
*msgs_in_queue = 0; /* default to none */
|
|
|
|
|
2002-05-28 16:45:50 +02:00
|
|
|
if(GOOD_MULTI_HANDLE(multi)) {
|
|
|
|
struct Curl_one_easy *easy;
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2002-05-28 16:45:50 +02:00
|
|
|
if(!multi->num_msgs)
|
|
|
|
return NULL; /* no messages left to return */
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2002-05-28 16:45:50 +02:00
|
|
|
easy=multi->easy.next;
|
|
|
|
while(easy) {
|
|
|
|
if(easy->msg_num) {
|
|
|
|
easy->msg_num--;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
easy = easy->next;
|
|
|
|
}
|
|
|
|
if(!easy)
|
|
|
|
return NULL; /* this means internal count confusion really */
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2002-05-28 16:45:50 +02:00
|
|
|
multi->num_msgs--;
|
|
|
|
*msgs_in_queue = multi->num_msgs;
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2002-05-28 16:45:50 +02:00
|
|
|
return &easy->msg->extmsg;
|
2002-04-28 00:21:51 +02:00
|
|
|
}
|
|
|
|
else
|
2002-05-03 14:40:37 +02:00
|
|
|
return NULL;
|
2002-04-28 00:21:51 +02:00
|
|
|
}
|