2002-09-03 07:52:59 -04:00
|
|
|
/***************************************************************************
|
2004-05-17 02:53:41 -04:00
|
|
|
* _ _ ____ _
|
|
|
|
* Project ___| | | | _ \| |
|
|
|
|
* / __| | | | |_) | |
|
|
|
|
* | (__| |_| | _ <| |___
|
2001-11-28 06:09:18 -05:00
|
|
|
* \___|\___/|_| \_\_____|
|
|
|
|
*
|
2011-01-04 17:07:58 -05:00
|
|
|
* Copyright (C) 1998 - 2011, Daniel Stenberg, <daniel@haxx.se>, et al.
|
2001-11-28 06:09:18 -05:00
|
|
|
*
|
2002-09-03 07:52:59 -04: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.
|
2004-05-17 02:53:41 -04:00
|
|
|
*
|
2001-11-28 06:09:18 -05: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 07:52:59 -04:00
|
|
|
* furnished to do so, under the terms of the COPYING file.
|
2001-11-28 06:09:18 -05:00
|
|
|
*
|
|
|
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
|
|
* KIND, either express or implied.
|
|
|
|
*
|
2002-09-03 07:52:59 -04:00
|
|
|
***************************************************************************/
|
2001-11-28 06:09:18 -05:00
|
|
|
|
|
|
|
#include "setup.h"
|
2007-02-25 23:24:26 -05:00
|
|
|
|
2003-02-14 04:03:03 -05:00
|
|
|
#ifdef HAVE_SYS_SOCKET_H
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#endif
|
2003-06-13 02:48:04 -04:00
|
|
|
#ifdef HAVE_UNISTD_H
|
|
|
|
#include <unistd.h>
|
|
|
|
#endif
|
2003-02-14 04:03:03 -05:00
|
|
|
|
2001-11-28 11:00:18 -05:00
|
|
|
#include <curl/curl.h>
|
2001-11-28 06:09:18 -05:00
|
|
|
|
2002-01-03 10:01:22 -05:00
|
|
|
#include "urldata.h"
|
|
|
|
#include "transfer.h"
|
|
|
|
#include "url.h"
|
2002-08-12 05:43:20 -04:00
|
|
|
#include "connect.h"
|
2003-04-29 14:03:30 -04:00
|
|
|
#include "progress.h"
|
2005-01-11 10:25:29 -05:00
|
|
|
#include "easyif.h"
|
|
|
|
#include "multiif.h"
|
2005-02-09 08:06:40 -05:00
|
|
|
#include "sendf.h"
|
2006-04-10 11:00:53 -04:00
|
|
|
#include "timeval.h"
|
2007-02-25 06:38:13 -05:00
|
|
|
#include "http.h"
|
2011-09-25 11:34:12 -04:00
|
|
|
#include "select.h"
|
2011-09-25 13:08:12 -04:00
|
|
|
#include "warnless.h"
|
2002-01-03 10:01:22 -05:00
|
|
|
|
2008-10-25 12:15:21 -04:00
|
|
|
#define _MPRINTF_REPLACE /* use our functions only */
|
|
|
|
#include <curl/mprintf.h>
|
|
|
|
|
2009-04-21 07:46:16 -04:00
|
|
|
#include "curl_memory.h"
|
2002-04-27 18:21:51 -04:00
|
|
|
/* The last #include file should be: */
|
|
|
|
#include "memdebug.h"
|
|
|
|
|
2007-06-26 17:09:28 -04:00
|
|
|
/*
|
|
|
|
CURL_SOCKET_HASH_TABLE_SIZE should be a prime number. Increasing it from 97
|
|
|
|
to 911 takes on a 32-bit machine 4 x 804 = 3211 more bytes. Still, every
|
|
|
|
CURL handle takes 45-50 K memory, therefore this 3K are not significant.
|
|
|
|
*/
|
|
|
|
#ifndef CURL_SOCKET_HASH_TABLE_SIZE
|
|
|
|
#define CURL_SOCKET_HASH_TABLE_SIZE 911
|
|
|
|
#endif
|
|
|
|
|
2001-11-28 11:00:18 -05:00
|
|
|
struct Curl_message {
|
|
|
|
/* the 'CURLMsg' is the part that is visible to the external user */
|
|
|
|
struct CURLMsg extmsg;
|
|
|
|
};
|
|
|
|
|
2007-03-23 18:25:04 -04:00
|
|
|
/* NOTE: if you add a state here, add the name to the statename[] array as
|
|
|
|
well!
|
|
|
|
*/
|
2001-11-28 06:09:18 -05:00
|
|
|
typedef enum {
|
2010-12-13 06:51:48 -05:00
|
|
|
CURLM_STATE_INIT, /* 0 - start in this state */
|
|
|
|
CURLM_STATE_CONNECT, /* 1 - resolve/connect has been sent off */
|
|
|
|
CURLM_STATE_WAITRESOLVE, /* 2 - awaiting the resolve to finalize */
|
|
|
|
CURLM_STATE_WAITCONNECT, /* 3 - awaiting the connect to finalize */
|
|
|
|
CURLM_STATE_WAITPROXYCONNECT, /* 4 - awaiting proxy CONNECT to finalize */
|
|
|
|
CURLM_STATE_PROTOCONNECT, /* 5 - completing the protocol-specific connect
|
|
|
|
phase */
|
|
|
|
CURLM_STATE_WAITDO, /* 6 - wait for our turn to send the request */
|
|
|
|
CURLM_STATE_DO, /* 7 - start send off the request (part 1) */
|
|
|
|
CURLM_STATE_DOING, /* 8 - sending off the request (part 1) */
|
|
|
|
CURLM_STATE_DO_MORE, /* 9 - send off the request (part 2) */
|
|
|
|
CURLM_STATE_DO_DONE, /* 10 - done sending off request */
|
|
|
|
CURLM_STATE_WAITPERFORM, /* 11 - wait for our turn to read the response */
|
|
|
|
CURLM_STATE_PERFORM, /* 12 - transfer data */
|
|
|
|
CURLM_STATE_TOOFAST, /* 13 - wait because limit-rate exceeded */
|
|
|
|
CURLM_STATE_DONE, /* 14 - post data transfer operation */
|
|
|
|
CURLM_STATE_COMPLETED, /* 15 - operation complete */
|
|
|
|
CURLM_STATE_MSGSENT, /* 16 - the operation complete message is sent */
|
|
|
|
CURLM_STATE_LAST /* 17 - not a true state, never use this */
|
2001-11-28 06:09:18 -05:00
|
|
|
} CURLMstate;
|
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
/* we support N sockets per easy handle. Set the corresponding bit to what
|
2006-04-10 11:00:53 -04:00
|
|
|
action we should wait for */
|
2006-09-10 18:15:32 -04:00
|
|
|
#define MAX_SOCKSPEREASYHANDLE 5
|
2006-04-10 11:00:53 -04:00
|
|
|
#define GETSOCK_READABLE (0x00ff)
|
|
|
|
#define GETSOCK_WRITABLE (0xff00)
|
|
|
|
|
2006-09-07 17:49:20 -04:00
|
|
|
struct closure {
|
|
|
|
struct closure *next; /* a simple one-way list of structs */
|
|
|
|
struct SessionHandle *easy_handle;
|
|
|
|
};
|
|
|
|
|
2001-11-28 06:09:18 -05:00
|
|
|
struct Curl_one_easy {
|
|
|
|
/* first, two fields for the linked list of these */
|
|
|
|
struct Curl_one_easy *next;
|
|
|
|
struct Curl_one_easy *prev;
|
2004-05-17 02:53:41 -04:00
|
|
|
|
2002-01-03 10:01:22 -05:00
|
|
|
struct SessionHandle *easy_handle; /* the easy handle for this unit */
|
|
|
|
struct connectdata *easy_conn; /* the "unit's" connection */
|
|
|
|
|
2001-11-28 10:46:25 -05:00
|
|
|
CURLMstate state; /* the handle's state */
|
|
|
|
CURLcode result; /* previous result */
|
2002-05-28 10:45:50 -04:00
|
|
|
|
2010-08-07 19:06:29 -04:00
|
|
|
struct Curl_message msg; /* A single posted message. */
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
/* Array with the plain socket numbers this handle takes care of, in no
|
|
|
|
particular order. Note that all sockets are added to the sockhash, where
|
|
|
|
the state etc are also kept. This array is mostly used to detect when a
|
|
|
|
socket is to be removed from the hash. See singlesocket(). */
|
|
|
|
curl_socket_t sockets[MAX_SOCKSPEREASYHANDLE];
|
|
|
|
int numsocks;
|
2001-11-28 06:09:18 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
#define CURL_MULTI_HANDLE 0x000bab1e
|
|
|
|
|
2006-02-23 07:20:48 -05:00
|
|
|
#define GOOD_MULTI_HANDLE(x) \
|
2011-10-21 10:37:13 -04:00
|
|
|
((x) && (((struct Curl_multi *)(x))->type == CURL_MULTI_HANDLE))
|
2006-09-10 18:15:32 -04:00
|
|
|
#define GOOD_EASY_HANDLE(x) \
|
2011-10-21 10:37:13 -04:00
|
|
|
((x) && (((struct SessionHandle *)(x))->magic == CURLEASY_MAGIC_NUMBER))
|
2001-11-28 06:09:18 -05:00
|
|
|
|
|
|
|
/* 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;
|
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
/* We have a doubly-linked circular list with easy handles */
|
2004-05-17 02:53:41 -04:00
|
|
|
struct Curl_one_easy easy;
|
2001-11-28 11:00:18 -05:00
|
|
|
|
2006-08-02 18:29:29 -04:00
|
|
|
int num_easy; /* amount of entries in the linked list above. */
|
|
|
|
int num_alive; /* amount of easy handles that are added but have not yet
|
|
|
|
reached COMPLETE state */
|
2002-04-27 18:21:51 -04:00
|
|
|
|
2010-08-08 18:01:36 -04:00
|
|
|
struct curl_llist *msglist; /* a list of messages from completed transfers */
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
/* callback function and user data pointer for the *socket() API */
|
|
|
|
curl_socket_callback socket_cb;
|
|
|
|
void *socket_userp;
|
|
|
|
|
2002-01-07 15:52:32 -05:00
|
|
|
/* Hostname cache */
|
2005-01-24 19:06:29 -05:00
|
|
|
struct curl_hash *hostcache;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
/* timetree points to the splay-tree of time nodes to figure out expire
|
|
|
|
times of all currently set timers */
|
|
|
|
struct Curl_tree *timetree;
|
|
|
|
|
|
|
|
/* 'sockhash' is the lookup hash for socket descriptor => easy handles (note
|
|
|
|
the pluralis form, there can be more than one easy handle waiting on the
|
|
|
|
same actual socket) */
|
|
|
|
struct curl_hash *sockhash;
|
2006-09-07 17:49:20 -04:00
|
|
|
|
|
|
|
/* Whether pipelining is enabled for this multi handle */
|
|
|
|
bool pipelining_enabled;
|
|
|
|
|
|
|
|
/* shared connection cache */
|
|
|
|
struct conncache *connc;
|
2007-05-30 16:04:44 -04:00
|
|
|
long maxconnects; /* if >0, a fixed limit of the maximum number of entries
|
|
|
|
we're allowed to grow the connection cache to */
|
2006-09-07 17:49:20 -04:00
|
|
|
|
|
|
|
/* list of easy handles kept around for doing nice connection closures */
|
|
|
|
struct closure *closure;
|
2006-10-12 04:36:47 -04:00
|
|
|
|
|
|
|
/* timer callback and user data pointer for the *socket() API */
|
|
|
|
curl_multi_timer_callback timer_cb;
|
|
|
|
void *timer_userp;
|
2008-05-07 11:41:41 -04:00
|
|
|
struct timeval timer_lastcall; /* the fixed time for the timeout for the
|
|
|
|
previous callback */
|
2001-11-28 06:09:18 -05:00
|
|
|
};
|
|
|
|
|
2010-03-15 18:40:42 -04:00
|
|
|
static void multi_connc_remove_handle(struct Curl_multi *multi,
|
2009-12-10 15:20:15 -05:00
|
|
|
struct SessionHandle *data);
|
2006-09-10 18:15:32 -04:00
|
|
|
static void singlesocket(struct Curl_multi *multi,
|
|
|
|
struct Curl_one_easy *easy);
|
2010-03-15 18:40:42 -04:00
|
|
|
static CURLMcode add_closure(struct Curl_multi *multi,
|
|
|
|
struct SessionHandle *data);
|
2006-10-12 04:36:47 -04:00
|
|
|
static int update_timer(struct Curl_multi *multi);
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2008-01-16 07:24:00 -05:00
|
|
|
static CURLcode addHandleToSendOrPendPipeline(struct SessionHandle *handle,
|
|
|
|
struct connectdata *conn);
|
|
|
|
static int checkPendPipeline(struct connectdata *conn);
|
2009-08-21 03:11:20 -04:00
|
|
|
static void moveHandleFromSendToRecvPipeline(struct SessionHandle *handle,
|
|
|
|
struct connectdata *conn);
|
|
|
|
static void moveHandleFromRecvToDonePipeline(struct SessionHandle *handle,
|
2008-05-28 16:56:19 -04:00
|
|
|
struct connectdata *conn);
|
2008-01-16 07:24:00 -05:00
|
|
|
static bool isHandleAtHead(struct SessionHandle *handle,
|
|
|
|
struct curl_llist *pipeline);
|
2010-08-30 18:08:45 -04:00
|
|
|
static CURLMcode add_next_timeout(struct timeval now,
|
|
|
|
struct Curl_multi *multi,
|
|
|
|
struct SessionHandle *d);
|
2008-01-16 07:24:00 -05:00
|
|
|
|
2009-06-09 22:49:42 -04:00
|
|
|
#ifdef DEBUGBUILD
|
2007-05-02 15:13:56 -04:00
|
|
|
static const char * const statename[]={
|
2006-10-13 03:11:26 -04:00
|
|
|
"INIT",
|
|
|
|
"CONNECT",
|
|
|
|
"WAITRESOLVE",
|
|
|
|
"WAITCONNECT",
|
2007-03-23 18:25:04 -04:00
|
|
|
"WAITPROXYCONNECT",
|
2006-10-13 03:11:26 -04:00
|
|
|
"PROTOCONNECT",
|
|
|
|
"WAITDO",
|
|
|
|
"DO",
|
|
|
|
"DOING",
|
|
|
|
"DO_MORE",
|
|
|
|
"DO_DONE",
|
|
|
|
"WAITPERFORM",
|
|
|
|
"PERFORM",
|
|
|
|
"TOOFAST",
|
|
|
|
"DONE",
|
|
|
|
"COMPLETED",
|
2010-08-18 13:59:46 -04:00
|
|
|
"MSGSENT",
|
2006-10-13 03:11:26 -04:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
2010-08-10 05:02:07 -04:00
|
|
|
static void multi_freetimeout(void *a, void *b);
|
|
|
|
|
2005-02-09 08:06:40 -05:00
|
|
|
/* always use this function to change state, to make debugging easier */
|
|
|
|
static void multistate(struct Curl_one_easy *easy, CURLMstate state)
|
|
|
|
{
|
2009-06-09 22:49:42 -04:00
|
|
|
#ifdef DEBUGBUILD
|
2007-09-26 21:45:22 -04:00
|
|
|
long connectindex = -5000;
|
2005-02-09 08:06:40 -05:00
|
|
|
#endif
|
2006-10-07 17:04:57 -04:00
|
|
|
CURLMstate oldstate = easy->state;
|
|
|
|
|
|
|
|
if(oldstate == state)
|
|
|
|
/* don't bother when the new state is the same as the old state */
|
|
|
|
return;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2005-02-09 08:06:40 -05:00
|
|
|
easy->state = state;
|
|
|
|
|
2009-06-09 22:49:42 -04:00
|
|
|
#ifdef DEBUGBUILD
|
2009-08-21 03:11:20 -04:00
|
|
|
if(easy->easy_conn) {
|
|
|
|
if(easy->state > CURLM_STATE_CONNECT &&
|
|
|
|
easy->state < CURLM_STATE_COMPLETED)
|
|
|
|
connectindex = easy->easy_conn->connectindex;
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2009-08-21 03:11:20 -04:00
|
|
|
infof(easy->easy_handle,
|
|
|
|
"STATE: %s => %s handle %p; (connection #%ld) \n",
|
|
|
|
statename[oldstate], statename[easy->state],
|
|
|
|
(char *)easy, connectindex);
|
|
|
|
}
|
2005-02-09 08:06:40 -05:00
|
|
|
#endif
|
2006-08-02 18:29:29 -04:00
|
|
|
if(state == CURLM_STATE_COMPLETED)
|
|
|
|
/* changing to COMPLETED means there's one less easy handle 'alive' */
|
|
|
|
easy->easy_handle->multi->num_alive--;
|
2005-02-09 08:06:40 -05:00
|
|
|
}
|
2001-11-28 06:09:18 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
/*
|
2006-04-21 09:40:07 -04:00
|
|
|
* We add one of these structs to the sockhash for a particular socket
|
2006-04-10 11:00:53 -04:00
|
|
|
*/
|
|
|
|
|
|
|
|
struct Curl_sh_entry {
|
|
|
|
struct SessionHandle *easy;
|
|
|
|
time_t timestamp;
|
2006-04-21 09:40:07 -04:00
|
|
|
int action; /* what action READ/WRITE this socket waits for */
|
2006-09-10 18:15:32 -04:00
|
|
|
curl_socket_t socket; /* mainly to ease debugging */
|
2006-07-26 18:19:42 -04:00
|
|
|
void *socketp; /* settable by users with curl_multi_assign() */
|
2006-04-10 11:00:53 -04:00
|
|
|
};
|
2006-04-21 09:40:07 -04:00
|
|
|
/* bits for 'action' having no bits means this socket is not expecting any
|
|
|
|
action */
|
|
|
|
#define SH_READ 1
|
2006-05-26 07:26:42 -04:00
|
|
|
#define SH_WRITE 2
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
/* make sure this socket is present in the hash for this handle */
|
2006-09-10 18:15:32 -04:00
|
|
|
static struct Curl_sh_entry *sh_addentry(struct curl_hash *sh,
|
|
|
|
curl_socket_t s,
|
|
|
|
struct SessionHandle *data)
|
2001-11-28 06:09:18 -05:00
|
|
|
{
|
2006-04-10 11:00:53 -04:00
|
|
|
struct Curl_sh_entry *there =
|
|
|
|
Curl_hash_pick(sh, (char *)&s, sizeof(curl_socket_t));
|
|
|
|
struct Curl_sh_entry *check;
|
|
|
|
|
2006-04-21 09:40:07 -04:00
|
|
|
if(there)
|
|
|
|
/* it is present, return fine */
|
2006-09-10 18:15:32 -04:00
|
|
|
return there;
|
2001-11-28 06:09:18 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
/* not present, add it */
|
2009-11-18 05:33:54 -05:00
|
|
|
check = calloc(1, sizeof(struct Curl_sh_entry));
|
2006-04-10 11:00:53 -04:00
|
|
|
if(!check)
|
2006-09-10 18:15:32 -04:00
|
|
|
return NULL; /* major failure */
|
2006-04-10 11:00:53 -04:00
|
|
|
check->easy = data;
|
2006-09-10 18:15:32 -04:00
|
|
|
check->socket = s;
|
2001-11-28 06:09:18 -05:00
|
|
|
|
2006-04-21 09:40:07 -04:00
|
|
|
/* make/add new hash entry */
|
2006-09-10 18:15:32 -04:00
|
|
|
if(NULL == Curl_hash_add(sh, (char *)&s, sizeof(curl_socket_t), check)) {
|
|
|
|
free(check);
|
|
|
|
return NULL; /* major failure */
|
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
return check; /* things are good in sockhash land */
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* delete the given socket + handle from the hash */
|
2006-04-21 09:40:07 -04:00
|
|
|
static void sh_delentry(struct curl_hash *sh, curl_socket_t s)
|
2006-04-10 11:00:53 -04:00
|
|
|
{
|
|
|
|
struct Curl_sh_entry *there =
|
|
|
|
Curl_hash_pick(sh, (char *)&s, sizeof(curl_socket_t));
|
|
|
|
|
2006-04-21 09:40:07 -04:00
|
|
|
if(there) {
|
|
|
|
/* this socket is in the hash */
|
|
|
|
/* We remove the hash entry. (This'll end up in a call to
|
|
|
|
sh_freeentry().) */
|
|
|
|
Curl_hash_delete(sh, (char *)&s, sizeof(curl_socket_t));
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* free a sockhash entry
|
|
|
|
*/
|
|
|
|
static void sh_freeentry(void *freethis)
|
|
|
|
{
|
|
|
|
struct Curl_sh_entry *p = (struct Curl_sh_entry *) freethis;
|
|
|
|
|
2008-10-30 09:45:25 -04:00
|
|
|
if(p)
|
|
|
|
free(p);
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
|
2007-06-26 17:09:28 -04:00
|
|
|
static size_t fd_key_compare(void*k1, size_t k1_len, void*k2, size_t k2_len)
|
|
|
|
{
|
|
|
|
(void) k1_len; (void) k2_len;
|
|
|
|
|
2008-09-10 16:05:45 -04:00
|
|
|
return (*((int* ) k1)) == (*((int* ) k2));
|
2007-06-26 17:09:28 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
static size_t hash_fd(void* key, size_t key_length, size_t slots_num)
|
|
|
|
{
|
|
|
|
int fd = * ((int* ) key);
|
|
|
|
(void) key_length;
|
|
|
|
|
|
|
|
return (fd % (int)slots_num);
|
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
/*
|
|
|
|
* sh_init() creates a new socket hash and returns the handle for it.
|
|
|
|
*
|
|
|
|
* Quote from README.multi_socket:
|
|
|
|
*
|
|
|
|
* "Some tests at 7000 and 9000 connections showed that the socket hash lookup
|
|
|
|
* is somewhat of a bottle neck. Its current implementation may be a bit too
|
|
|
|
* limiting. It simply has a fixed-size array, and on each entry in the array
|
|
|
|
* it has a linked list with entries. So the hash only checks which list to
|
|
|
|
* scan through. The code I had used so for used a list with merely 7 slots
|
|
|
|
* (as that is what the DNS hash uses) but with 7000 connections that would
|
|
|
|
* make an average of 1000 nodes in each list to run through. I upped that to
|
|
|
|
* 97 slots (I believe a prime is suitable) and noticed a significant speed
|
|
|
|
* increase. I need to reconsider the hash implementation or use a rather
|
|
|
|
* large default value like this. At 9000 connections I was still below 10us
|
|
|
|
* per call."
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
static struct curl_hash *sh_init(void)
|
|
|
|
{
|
2007-06-26 17:09:28 -04:00
|
|
|
return Curl_hash_alloc(CURL_SOCKET_HASH_TABLE_SIZE, hash_fd, fd_key_compare,
|
|
|
|
sh_freeentry);
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
|
2010-08-08 18:01:36 -04:00
|
|
|
/*
|
|
|
|
* multi_addmsg()
|
|
|
|
*
|
|
|
|
* Called when a transfer is completed. Adds the given msg pointer to
|
|
|
|
* the list kept in the multi handle.
|
|
|
|
*/
|
|
|
|
static CURLMcode multi_addmsg(struct Curl_multi *multi,
|
|
|
|
struct Curl_message *msg)
|
|
|
|
{
|
|
|
|
if(!Curl_llist_insert_next(multi->msglist, multi->msglist->tail, msg))
|
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* multi_freeamsg()
|
|
|
|
*
|
|
|
|
* Callback used by the llist system when a single list entry is destroyed.
|
|
|
|
*/
|
|
|
|
static void multi_freeamsg(void *a, void *b)
|
|
|
|
{
|
|
|
|
(void)a;
|
|
|
|
(void)b;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
CURLM *curl_multi_init(void)
|
|
|
|
{
|
2009-11-18 05:33:54 -05:00
|
|
|
struct Curl_multi *multi = calloc(1, sizeof(struct Curl_multi));
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
if(!multi)
|
2004-05-13 11:17:49 -04:00
|
|
|
return NULL;
|
2003-09-11 18:14:29 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
multi->type = CURL_MULTI_HANDLE;
|
|
|
|
|
2004-03-30 08:02:31 -05:00
|
|
|
multi->hostcache = Curl_mk_dnscache();
|
2010-08-08 18:01:36 -04:00
|
|
|
if(!multi->hostcache)
|
|
|
|
goto error;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
multi->sockhash = sh_init();
|
2010-08-08 18:01:36 -04:00
|
|
|
if(!multi->sockhash)
|
|
|
|
goto error;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2009-06-11 22:41:16 -04:00
|
|
|
multi->connc = Curl_mk_connc(CONNCACHE_MULTI, -1L);
|
2010-08-08 18:01:36 -04:00
|
|
|
if(!multi->connc)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
multi->msglist = Curl_llist_alloc(multi_freeamsg);
|
|
|
|
if(!multi->msglist)
|
|
|
|
goto error;
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2007-02-21 16:59:40 -05:00
|
|
|
/* Let's make the doubly-linked list a circular list. This makes
|
|
|
|
the linked list code simpler and allows inserting at the end
|
|
|
|
with less work (we didn't keep a tail pointer before). */
|
|
|
|
multi->easy.next = &multi->easy;
|
|
|
|
multi->easy.prev = &multi->easy;
|
|
|
|
|
2001-11-28 06:09:18 -05:00
|
|
|
return (CURLM *) multi;
|
2010-08-08 18:01:36 -04:00
|
|
|
|
|
|
|
error:
|
2011-10-11 13:41:30 -04:00
|
|
|
|
|
|
|
Curl_hash_destroy(multi->sockhash);
|
|
|
|
multi->sockhash = NULL;
|
|
|
|
Curl_hash_destroy(multi->hostcache);
|
|
|
|
multi->hostcache = NULL;
|
|
|
|
Curl_rm_connc(multi->connc);
|
|
|
|
multi->connc = NULL;
|
2010-08-08 18:01:36 -04:00
|
|
|
|
|
|
|
free(multi);
|
|
|
|
return NULL;
|
2001-11-28 06:09:18 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
CURLMcode curl_multi_add_handle(CURLM *multi_handle,
|
|
|
|
CURL *easy_handle)
|
|
|
|
{
|
2011-10-13 12:04:56 -04:00
|
|
|
struct curl_llist *timeoutlist;
|
2001-11-28 06:09:18 -05:00
|
|
|
struct Curl_one_easy *easy;
|
2006-10-04 17:11:08 -04:00
|
|
|
struct closure *cl;
|
2011-10-13 12:04:56 -04:00
|
|
|
struct closure *prev = NULL;
|
|
|
|
struct Curl_multi *multi = (struct Curl_multi *)multi_handle;
|
|
|
|
struct SessionHandle *data = (struct SessionHandle *)easy_handle;
|
2001-11-28 06:09:18 -05:00
|
|
|
|
|
|
|
/* First, make some basic checks that the CURLM handle is a good handle */
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
2004-05-17 02:53:41 -04:00
|
|
|
|
2001-11-28 06:09:18 -05:00
|
|
|
/* Verify that we got a somewhat good easy handle too */
|
|
|
|
if(!GOOD_EASY_HANDLE(easy_handle))
|
|
|
|
return CURLM_BAD_EASY_HANDLE;
|
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
/* Prevent users from adding same easy handle more than
|
|
|
|
once and prevent adding to more than one multi stack */
|
|
|
|
if(data->multi)
|
2006-10-12 10:30:47 -04:00
|
|
|
/* possibly we should create a new unique error code for this condition */
|
|
|
|
return CURLM_BAD_EASY_HANDLE;
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
/* We want the connection cache to have plenty of room. Before we supported
|
|
|
|
the shared cache every single easy handle had 5 entries in their cache
|
|
|
|
by default. */
|
|
|
|
if(((multi->num_easy + 1) * 4) > multi->connc->num) {
|
|
|
|
long newmax = (multi->num_easy + 1) * 4;
|
|
|
|
|
|
|
|
if(multi->maxconnects && (newmax > multi->maxconnects))
|
|
|
|
/* don't grow beyond the allowed size */
|
|
|
|
newmax = multi->maxconnects;
|
|
|
|
|
|
|
|
if(newmax > multi->connc->num) {
|
|
|
|
/* we only do this is we can in fact grow the cache */
|
|
|
|
CURLcode res = Curl_ch_connc(data, multi->connc, newmax);
|
|
|
|
if(res)
|
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Allocate and initialize timeout list for easy handle */
|
|
|
|
timeoutlist = Curl_llist_alloc(multi_freetimeout);
|
|
|
|
if(!timeoutlist)
|
2010-08-10 05:02:07 -04:00
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
/* Allocate new node for the doubly-linked circular list of
|
|
|
|
Curl_one_easy structs that holds pointers to easy handles */
|
2009-11-18 05:33:54 -05:00
|
|
|
easy = calloc(1, sizeof(struct Curl_one_easy));
|
2011-10-13 12:04:56 -04:00
|
|
|
if(!easy) {
|
|
|
|
Curl_llist_destroy(timeoutlist, NULL);
|
2001-11-28 06:09:18 -05:00
|
|
|
return CURLM_OUT_OF_MEMORY;
|
2011-10-13 12:04:56 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
** No failure allowed in this function beyond this point. And
|
|
|
|
** no modification of easy nor multi handle allowed before this
|
|
|
|
** except for potential multi's connection cache growing which
|
|
|
|
** won't be undone in this function no matter what.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* Make easy handle use timeout list initialized above */
|
|
|
|
data->state.timeoutlist = timeoutlist;
|
|
|
|
timeoutlist = NULL;
|
2004-05-17 02:53:41 -04:00
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
/* Remove handle from the list of 'closure handles' in case it is there */
|
2006-10-04 17:11:08 -04:00
|
|
|
cl = multi->closure;
|
|
|
|
while(cl) {
|
|
|
|
struct closure *next = cl->next;
|
2011-10-13 12:04:56 -04:00
|
|
|
if(cl->easy_handle == data) {
|
|
|
|
/* Remove node from list */
|
2006-10-04 17:11:08 -04:00
|
|
|
free(cl);
|
|
|
|
if(prev)
|
|
|
|
prev->next = next;
|
|
|
|
else
|
|
|
|
multi->closure = next;
|
2011-10-13 12:04:56 -04:00
|
|
|
/* No need to continue, handle can only be present once in the list */
|
|
|
|
break;
|
2006-10-04 17:11:08 -04:00
|
|
|
}
|
2007-02-12 07:15:41 -05:00
|
|
|
prev = cl;
|
2006-10-04 17:11:08 -04:00
|
|
|
cl = next;
|
|
|
|
}
|
2001-11-28 06:09:18 -05:00
|
|
|
|
|
|
|
/* set the easy handle */
|
2011-10-13 12:04:56 -04:00
|
|
|
easy->easy_handle = data;
|
2005-02-09 08:06:40 -05:00
|
|
|
multistate(easy, CURLM_STATE_INIT);
|
2003-09-11 18:14:29 -04:00
|
|
|
|
2007-04-01 04:24:23 -04:00
|
|
|
/* set the back pointer to one_easy to assist in removal */
|
|
|
|
easy->easy_handle->multi_pos = easy;
|
|
|
|
|
2006-09-07 17:49:20 -04:00
|
|
|
/* for multi interface connections, we share DNS cache automatically if the
|
2006-07-07 18:58:06 -04:00
|
|
|
easy handle's one is currently private. */
|
2007-11-05 04:45:09 -05:00
|
|
|
if(easy->easy_handle->dns.hostcache &&
|
2009-08-03 07:32:55 -04:00
|
|
|
(easy->easy_handle->dns.hostcachetype == HCACHE_PRIVATE)) {
|
2006-07-07 18:58:06 -04:00
|
|
|
Curl_hash_destroy(easy->easy_handle->dns.hostcache);
|
2006-07-10 12:14:36 -04:00
|
|
|
easy->easy_handle->dns.hostcache = NULL;
|
|
|
|
easy->easy_handle->dns.hostcachetype = HCACHE_NONE;
|
|
|
|
}
|
|
|
|
|
2007-11-05 04:45:09 -05:00
|
|
|
if(!easy->easy_handle->dns.hostcache ||
|
2009-08-03 07:32:55 -04:00
|
|
|
(easy->easy_handle->dns.hostcachetype == HCACHE_NONE)) {
|
2006-07-07 18:58:06 -04:00
|
|
|
easy->easy_handle->dns.hostcache = multi->hostcache;
|
|
|
|
easy->easy_handle->dns.hostcachetype = HCACHE_MULTI;
|
|
|
|
}
|
2004-05-17 02:53:41 -04:00
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
/* On a multi stack the connection cache, owned by the multi handle,
|
|
|
|
is shared between all easy handles within the multi handle. */
|
|
|
|
if(easy->easy_handle->state.connc &&
|
|
|
|
(easy->easy_handle->state.connc->type == CONNCACHE_PRIVATE)) {
|
|
|
|
/* kill old private connection cache */
|
|
|
|
Curl_rm_connc(easy->easy_handle->state.connc);
|
|
|
|
easy->easy_handle->state.connc = NULL;
|
2006-09-07 17:49:20 -04:00
|
|
|
}
|
2011-10-13 12:04:56 -04:00
|
|
|
/* Point now to this multi's connection cache */
|
|
|
|
easy->easy_handle->state.connc = multi->connc;
|
2006-09-07 17:49:20 -04:00
|
|
|
easy->easy_handle->state.connc->type = CONNCACHE_MULTI;
|
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
/* This adds the new entry at the 'end' of the doubly-linked circular
|
|
|
|
list of Curl_one_easy structs to try and maintain a FIFO queue so
|
|
|
|
the pipelined requests are in order. */
|
2007-02-21 16:59:40 -05:00
|
|
|
|
|
|
|
/* We add this new entry last in the list. We make our 'next' point to the
|
|
|
|
'first' struct and our 'prev' point to the previous 'prev' */
|
|
|
|
easy->next = &multi->easy;
|
|
|
|
easy->prev = multi->easy.prev;
|
2001-11-28 06:09:18 -05:00
|
|
|
|
2007-02-21 16:59:40 -05:00
|
|
|
/* make 'easy' the last node in the chain */
|
|
|
|
multi->easy.prev = easy;
|
2001-11-28 06:09:18 -05:00
|
|
|
|
2007-02-21 16:59:40 -05:00
|
|
|
/* if there was a prev node, make sure its 'next' pointer links to
|
2001-11-28 06:09:18 -05:00
|
|
|
the new node */
|
2007-02-21 16:59:40 -05:00
|
|
|
easy->prev->next = easy;
|
2001-11-28 06:09:18 -05:00
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
/* make the SessionHandle refer back to this multi handle */
|
2005-01-10 05:07:07 -05:00
|
|
|
Curl_easy_addmulti(easy_handle, multi_handle);
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
/* make the SessionHandle struct refer back to this struct */
|
|
|
|
easy->easy_handle->set.one_easy = easy;
|
|
|
|
|
2007-05-02 09:47:56 -04:00
|
|
|
/* Set the timeout for this handle to expire really soon so that it will
|
|
|
|
be taken care of even when this handle is added in the midst of operation
|
|
|
|
when only the curl_multi_socket() API is used. During that flow, only
|
|
|
|
sockets that time-out or have actions will be dealt with. Since this
|
|
|
|
handle has no action yet, we make sure it times out to get things to
|
|
|
|
happen. */
|
2008-05-28 16:56:19 -04:00
|
|
|
Curl_expire(easy->easy_handle, 1);
|
2007-05-02 09:47:56 -04:00
|
|
|
|
2001-11-28 06:09:18 -05:00
|
|
|
/* increase the node-counter */
|
|
|
|
multi->num_easy++;
|
2006-09-16 17:50:29 -04:00
|
|
|
|
2006-08-02 18:29:29 -04:00
|
|
|
/* increase the alive-counter */
|
|
|
|
multi->num_alive++;
|
2001-11-28 06:09:18 -05:00
|
|
|
|
2008-10-08 17:42:29 -04:00
|
|
|
/* A somewhat crude work-around for a little glitch in update_timer() that
|
|
|
|
happens if the lastcall time is set to the same time when the handle is
|
|
|
|
removed as when the next handle is added, as then the check in
|
|
|
|
update_timer() that prevents calling the application multiple times with
|
|
|
|
the same timer infor will not trigger and then the new handle's timeout
|
|
|
|
will not be notified to the app.
|
|
|
|
|
|
|
|
The work-around is thus simply to clear the 'lastcall' variable to force
|
|
|
|
update_timer() to always trigger a callback to the app when a new easy
|
|
|
|
handle is added */
|
|
|
|
memset(&multi->timer_lastcall, 0, sizeof(multi->timer_lastcall));
|
|
|
|
|
2006-10-12 04:36:47 -04:00
|
|
|
update_timer(multi);
|
2004-08-31 02:04:43 -04:00
|
|
|
return CURLM_OK;
|
2001-11-28 06:09:18 -05:00
|
|
|
}
|
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
#if 0
|
|
|
|
/* Debug-function, used like this:
|
|
|
|
*
|
|
|
|
* Curl_hash_print(multi->sockhash, debug_print_sock_hash);
|
|
|
|
*
|
|
|
|
* Enable the hash print function first by editing hash.c
|
|
|
|
*/
|
|
|
|
static void debug_print_sock_hash(void *p)
|
|
|
|
{
|
|
|
|
struct Curl_sh_entry *sh = (struct Curl_sh_entry *)p;
|
|
|
|
|
|
|
|
fprintf(stderr, " [easy %p/magic %x/socket %d]",
|
2010-02-04 14:44:31 -05:00
|
|
|
(void *)sh->easy, sh->easy->magic, (int)sh->socket);
|
2006-09-10 18:15:32 -04:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2001-11-28 06:09:18 -05: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;
|
2010-08-10 05:02:07 -04:00
|
|
|
struct SessionHandle *data = curl_handle;
|
2001-11-28 06:09:18 -05:00
|
|
|
|
|
|
|
/* First, make some basic checks that the CURLM handle is a good handle */
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
2004-05-17 02:53:41 -04:00
|
|
|
|
2001-11-28 06:09:18 -05:00
|
|
|
/* Verify that we got a somewhat good easy handle too */
|
|
|
|
if(!GOOD_EASY_HANDLE(curl_handle))
|
|
|
|
return CURLM_BAD_EASY_HANDLE;
|
|
|
|
|
2007-04-01 04:24:23 -04:00
|
|
|
/* pick-up from the 'curl_handle' the kept position in the list */
|
2010-08-10 05:02:07 -04:00
|
|
|
easy = data->multi_pos;
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2001-11-28 06:09:18 -05:00
|
|
|
if(easy) {
|
2011-09-05 14:46:09 -04:00
|
|
|
bool premature = (easy->state < CURLM_STATE_COMPLETED) ? TRUE : FALSE;
|
|
|
|
bool easy_owns_conn = (easy->easy_conn &&
|
|
|
|
(easy->easy_conn->data == easy->easy_handle)) ?
|
|
|
|
TRUE : FALSE;
|
2007-01-16 17:22:10 -05:00
|
|
|
|
2001-11-28 06:09:18 -05:00
|
|
|
/* 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. */
|
2007-01-16 17:22:10 -05:00
|
|
|
if(premature)
|
2006-08-25 09:53:20 -04:00
|
|
|
/* this handle is "alive" so we need to count down the total number of
|
|
|
|
alive connections when this is removed */
|
|
|
|
multi->num_alive--;
|
2001-11-28 06:09:18 -05:00
|
|
|
|
2008-01-23 07:22:04 -05:00
|
|
|
if(easy->easy_conn &&
|
2009-08-03 07:32:55 -04:00
|
|
|
(easy->easy_conn->send_pipe->size +
|
|
|
|
easy->easy_conn->recv_pipe->size > 1) &&
|
|
|
|
easy->state > CURLM_STATE_WAITDO &&
|
|
|
|
easy->state < CURLM_STATE_COMPLETED) {
|
2008-01-21 18:48:58 -05:00
|
|
|
/* If the handle is in a pipeline and has started sending off its
|
2011-04-19 09:54:13 -04:00
|
|
|
request but not received its response yet, we need to close
|
2008-01-21 18:48:58 -05:00
|
|
|
connection. */
|
|
|
|
easy->easy_conn->bits.close = TRUE;
|
2008-01-23 07:22:04 -05:00
|
|
|
/* Set connection owner so that Curl_done() closes it.
|
|
|
|
We can sefely do this here since connection is killed. */
|
|
|
|
easy->easy_conn->data = easy->easy_handle;
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2006-07-17 14:35:58 -04:00
|
|
|
/* The timer must be shut down before easy->multi is set to NULL,
|
|
|
|
else the timenode will remain in the splay tree after
|
|
|
|
curl_easy_cleanup is called. */
|
|
|
|
Curl_expire(easy->easy_handle, 0);
|
|
|
|
|
2010-08-10 05:02:07 -04:00
|
|
|
/* destroy the timeout list that is held in the easy handle */
|
|
|
|
if(data->state.timeoutlist) {
|
|
|
|
Curl_llist_destroy(data->state.timeoutlist, NULL);
|
|
|
|
data->state.timeoutlist = NULL;
|
|
|
|
}
|
|
|
|
|
2006-07-07 18:58:06 -04:00
|
|
|
if(easy->easy_handle->dns.hostcachetype == HCACHE_MULTI) {
|
|
|
|
/* clear out the usage of the shared DNS cache */
|
|
|
|
easy->easy_handle->dns.hostcache = NULL;
|
|
|
|
easy->easy_handle->dns.hostcachetype = HCACHE_NONE;
|
|
|
|
}
|
|
|
|
|
2008-12-03 10:20:27 -05:00
|
|
|
if(easy->easy_conn) {
|
|
|
|
|
|
|
|
/* we must call Curl_done() here (if we still "own it") so that we don't
|
|
|
|
leave a half-baked one around */
|
2011-04-20 09:17:42 -04:00
|
|
|
if(easy_owns_conn) {
|
2006-09-21 16:52:58 -04:00
|
|
|
|
2008-12-03 10:20:27 -05:00
|
|
|
/* Curl_done() clears the conn->data field to lose the association
|
|
|
|
between the easy handle and the connection
|
2008-02-17 08:38:19 -05:00
|
|
|
|
2008-12-03 10:20:27 -05:00
|
|
|
Note that this ignores the return code simply because there's
|
|
|
|
nothing really useful to do with it anyway! */
|
|
|
|
(void)Curl_done(&easy->easy_conn, easy->result, premature);
|
2006-09-21 16:52:58 -04:00
|
|
|
|
2008-12-03 10:20:27 -05:00
|
|
|
if(easy->easy_conn)
|
|
|
|
/* the connection is still alive, set back the association to enable
|
|
|
|
the check below to trigger TRUE */
|
|
|
|
easy->easy_conn->data = easy->easy_handle;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
/* Clear connection pipelines, if Curl_done above was not called */
|
|
|
|
Curl_getoff_all_pipelines(easy->easy_handle, easy->easy_conn);
|
2006-09-07 17:49:20 -04:00
|
|
|
}
|
|
|
|
|
2010-03-15 18:40:42 -04:00
|
|
|
/* figure out if the easy handle is used by one or more connections in the
|
|
|
|
cache */
|
|
|
|
multi_connc_remove_handle(multi, easy->easy_handle);
|
2006-09-28 17:26:06 -04:00
|
|
|
|
|
|
|
if(easy->easy_handle->state.connc->type == CONNCACHE_MULTI) {
|
|
|
|
/* if this was using the shared connection cache we clear the pointer
|
|
|
|
to that since we're not part of that handle anymore */
|
|
|
|
easy->easy_handle->state.connc = NULL;
|
|
|
|
|
2010-07-01 17:32:20 -04:00
|
|
|
/* Since we return the connection back to the communal connection pool
|
|
|
|
we mark the last connection as inaccessible */
|
|
|
|
easy->easy_handle->state.lastconnect = -1;
|
|
|
|
|
2008-12-12 07:21:11 -05:00
|
|
|
/* Modify the connectindex since this handle can't point to the
|
|
|
|
connection cache anymore.
|
|
|
|
|
|
|
|
TODO: consider if this is really what we want. The connection cache
|
|
|
|
is within the multi handle and that owns the connections so we should
|
|
|
|
not need to touch connections like this when we just remove an easy
|
|
|
|
handle...
|
|
|
|
*/
|
|
|
|
if(easy->easy_conn && easy_owns_conn &&
|
2007-04-10 16:46:40 -04:00
|
|
|
(easy->easy_conn->send_pipe->size +
|
|
|
|
easy->easy_conn->recv_pipe->size == 0))
|
2006-09-28 17:26:06 -04:00
|
|
|
easy->easy_conn->connectindex = -1;
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
/* change state without using multistate(), only to make singlesocket() do
|
|
|
|
what we want */
|
|
|
|
easy->state = CURLM_STATE_COMPLETED;
|
|
|
|
singlesocket(multi, easy); /* to let the application know what sockets
|
|
|
|
that vanish with this handle */
|
|
|
|
|
2006-09-07 17:49:20 -04:00
|
|
|
Curl_easy_addmulti(easy->easy_handle, NULL); /* clear the association
|
|
|
|
to this multi handle */
|
2006-02-23 07:20:48 -05:00
|
|
|
|
2010-08-08 18:01:36 -04:00
|
|
|
{
|
|
|
|
/* make sure there's no pending message in the queue sent from this easy
|
|
|
|
handle */
|
|
|
|
struct curl_llist_element *e;
|
|
|
|
|
|
|
|
for(e = multi->msglist->head; e; e = e->next) {
|
|
|
|
struct Curl_message *msg = e->ptr;
|
|
|
|
|
|
|
|
if(msg->extmsg.easy_handle == easy->easy_handle) {
|
|
|
|
Curl_llist_remove(multi->msglist, e, NULL);
|
|
|
|
/* there can only be one from this specific handle */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-11-28 06:09:18 -05: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;
|
2004-05-17 02:53:41 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
easy->easy_handle->set.one_easy = NULL; /* detached */
|
|
|
|
|
2007-04-01 04:24:23 -04:00
|
|
|
/* Null the position in the controlling structure */
|
|
|
|
easy->easy_handle->multi_pos = NULL;
|
|
|
|
|
2001-11-28 06:09:18 -05:00
|
|
|
/* NOTE NOTE NOTE
|
|
|
|
We do not touch the easy handle here! */
|
|
|
|
free(easy);
|
|
|
|
|
2001-11-28 11:00:18 -05:00
|
|
|
multi->num_easy--; /* one less to care about now */
|
|
|
|
|
2006-10-12 04:36:47 -04:00
|
|
|
update_timer(multi);
|
2001-11-28 06:09:18 -05:00
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return CURLM_BAD_EASY_HANDLE; /* twasn't found */
|
|
|
|
}
|
|
|
|
|
2007-08-26 01:53:26 -04:00
|
|
|
bool Curl_multi_canPipeline(const struct Curl_multi* multi)
|
2006-09-07 17:49:20 -04:00
|
|
|
{
|
|
|
|
return multi->pipelining_enabled;
|
|
|
|
}
|
|
|
|
|
2007-04-10 16:46:40 -04:00
|
|
|
void Curl_multi_handlePipeBreak(struct SessionHandle *data)
|
|
|
|
{
|
|
|
|
struct Curl_one_easy *one_easy = data->set.one_easy;
|
|
|
|
|
2007-11-05 04:45:09 -05:00
|
|
|
if(one_easy)
|
2007-04-10 16:46:40 -04:00
|
|
|
one_easy->easy_conn = NULL;
|
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
static int waitconnect_getsock(struct connectdata *conn,
|
|
|
|
curl_socket_t *sock,
|
|
|
|
int numsocks)
|
|
|
|
{
|
|
|
|
if(!numsocks)
|
|
|
|
return GETSOCK_BLANK;
|
|
|
|
|
|
|
|
sock[0] = conn->sock[FIRSTSOCKET];
|
2008-05-09 08:59:24 -04:00
|
|
|
|
|
|
|
/* when we've sent a CONNECT to a proxy, we should rather wait for the
|
|
|
|
socket to become readable to be able to get the response headers */
|
|
|
|
if(conn->bits.tunnel_connecting)
|
|
|
|
return GETSOCK_READSOCK(0);
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
return GETSOCK_WRITESOCK(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int domore_getsock(struct connectdata *conn,
|
|
|
|
curl_socket_t *sock,
|
|
|
|
int numsocks)
|
|
|
|
{
|
|
|
|
if(!numsocks)
|
|
|
|
return GETSOCK_BLANK;
|
|
|
|
|
|
|
|
/* 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 */
|
|
|
|
sock[0] = conn->sock[SECONDARYSOCKET];
|
|
|
|
|
|
|
|
return GETSOCK_WRITESOCK(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* returns bitmapped flags for this handle and its sockets */
|
|
|
|
static int multi_getsock(struct Curl_one_easy *easy,
|
|
|
|
curl_socket_t *socks, /* points to numsocks number
|
2009-08-03 07:32:55 -04:00
|
|
|
of sockets */
|
2006-04-10 11:00:53 -04:00
|
|
|
int numsocks)
|
|
|
|
{
|
2007-03-31 06:56:07 -04:00
|
|
|
/* If the pipe broke, or if there's no connection left for this easy handle,
|
|
|
|
then we MUST bail out now with no bitmask set. The no connection case can
|
|
|
|
happen when this is called from curl_multi_remove_handle() =>
|
|
|
|
singlesocket() => multi_getsock().
|
|
|
|
*/
|
2008-12-19 16:14:52 -05:00
|
|
|
if(easy->easy_handle->state.pipe_broke || !easy->easy_conn)
|
2006-09-07 17:49:20 -04:00
|
|
|
return 0;
|
|
|
|
|
2007-11-05 04:45:09 -05:00
|
|
|
if(easy->state > CURLM_STATE_CONNECT &&
|
2009-08-03 07:32:55 -04:00
|
|
|
easy->state < CURLM_STATE_COMPLETED) {
|
2006-09-07 17:49:20 -04:00
|
|
|
/* Set up ownership correctly */
|
|
|
|
easy->easy_conn->data = easy->easy_handle;
|
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
switch(easy->state) {
|
|
|
|
default:
|
2008-05-19 16:58:01 -04:00
|
|
|
#if 0 /* switch back on these cases to get the compiler to check for all enums
|
|
|
|
to be present */
|
|
|
|
case CURLM_STATE_TOOFAST: /* returns 0, so will not select. */
|
|
|
|
case CURLM_STATE_COMPLETED:
|
2010-08-18 13:59:46 -04:00
|
|
|
case CURLM_STATE_MSGSENT:
|
2008-05-19 16:58:01 -04:00
|
|
|
case CURLM_STATE_INIT:
|
|
|
|
case CURLM_STATE_CONNECT:
|
|
|
|
case CURLM_STATE_WAITDO:
|
|
|
|
case CURLM_STATE_DONE:
|
|
|
|
case CURLM_STATE_LAST:
|
2006-09-10 18:15:32 -04:00
|
|
|
/* this will get called with CURLM_STATE_COMPLETED when a handle is
|
|
|
|
removed */
|
2008-05-19 16:58:01 -04:00
|
|
|
#endif
|
2006-04-10 11:00:53 -04:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
case CURLM_STATE_WAITRESOLVE:
|
2011-01-30 18:10:35 -05:00
|
|
|
return Curl_resolver_getsock(easy->easy_conn, socks, numsocks);
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
case CURLM_STATE_PROTOCONNECT:
|
|
|
|
return Curl_protocol_getsock(easy->easy_conn, socks, numsocks);
|
|
|
|
|
2008-05-19 16:58:01 -04:00
|
|
|
case CURLM_STATE_DO:
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_DOING:
|
|
|
|
return Curl_doing_getsock(easy->easy_conn, socks, numsocks);
|
|
|
|
|
2008-01-18 16:51:10 -05:00
|
|
|
case CURLM_STATE_WAITPROXYCONNECT:
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_WAITCONNECT:
|
|
|
|
return waitconnect_getsock(easy->easy_conn, socks, numsocks);
|
|
|
|
|
|
|
|
case CURLM_STATE_DO_MORE:
|
|
|
|
return domore_getsock(easy->easy_conn, socks, numsocks);
|
|
|
|
|
2008-05-19 16:58:01 -04:00
|
|
|
case CURLM_STATE_DO_DONE: /* since is set after DO is completed, we switch
|
2011-04-02 18:07:32 -04:00
|
|
|
to waiting for the same as the *PERFORM
|
|
|
|
states */
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_PERFORM:
|
2006-09-07 17:49:20 -04:00
|
|
|
case CURLM_STATE_WAITPERFORM:
|
2006-04-10 11:00:53 -04:00
|
|
|
return Curl_single_getsock(easy->easy_conn, socks, numsocks);
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2001-11-28 06:09:18 -05:00
|
|
|
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 10:01:22 -05:00
|
|
|
int this_max_fd=-1;
|
2006-04-10 11:00:53 -04:00
|
|
|
curl_socket_t sockbunch[MAX_SOCKSPEREASYHANDLE];
|
|
|
|
int bitmap;
|
|
|
|
int i;
|
|
|
|
(void)exc_fd_set; /* not used */
|
2001-11-28 06:09:18 -05:00
|
|
|
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
2001-11-28 11:00:18 -05:00
|
|
|
easy=multi->easy.next;
|
2007-02-21 16:59:40 -05:00
|
|
|
while(easy != &multi->easy) {
|
2006-04-10 11:00:53 -04:00
|
|
|
bitmap = multi_getsock(easy, sockbunch, MAX_SOCKSPEREASYHANDLE);
|
2003-08-05 10:40:59 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
for(i=0; i< MAX_SOCKSPEREASYHANDLE; i++) {
|
|
|
|
curl_socket_t s = CURL_SOCKET_BAD;
|
2002-08-12 05:43:20 -04:00
|
|
|
|
2011-09-25 11:34:12 -04:00
|
|
|
if((bitmap & GETSOCK_READSOCK(i)) && VALID_SOCK((sockbunch[i]))) {
|
2006-04-10 11:00:53 -04:00
|
|
|
FD_SET(sockbunch[i], read_fd_set);
|
|
|
|
s = sockbunch[i];
|
|
|
|
}
|
2011-09-25 11:34:12 -04:00
|
|
|
if((bitmap & GETSOCK_WRITESOCK(i)) && VALID_SOCK((sockbunch[i]))) {
|
2006-04-10 11:00:53 -04:00
|
|
|
FD_SET(sockbunch[i], write_fd_set);
|
|
|
|
s = sockbunch[i];
|
|
|
|
}
|
|
|
|
if(s == CURL_SOCKET_BAD)
|
|
|
|
/* this socket is unused, break out of loop */
|
|
|
|
break;
|
|
|
|
else {
|
2006-06-23 18:07:06 -04:00
|
|
|
if((int)s > this_max_fd)
|
2006-04-25 01:32:05 -04:00
|
|
|
this_max_fd = (int)s;
|
2002-08-12 05:43:20 -04:00
|
|
|
}
|
2001-11-28 06:09:18 -05:00
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2001-11-28 10:46:25 -05:00
|
|
|
easy = easy->next; /* check next handle */
|
2001-11-28 06:09:18 -05:00
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
*max_fd = this_max_fd;
|
|
|
|
|
2001-11-28 06:09:18 -05:00
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
static CURLMcode multi_runsingle(struct Curl_multi *multi,
|
2010-09-01 10:52:23 -04:00
|
|
|
struct timeval now,
|
2006-08-03 07:47:42 -04:00
|
|
|
struct Curl_one_easy *easy)
|
2001-11-28 06:09:18 -05:00
|
|
|
{
|
2002-05-28 10:45:50 -04:00
|
|
|
struct Curl_message *msg = NULL;
|
2002-08-12 05:43:20 -04:00
|
|
|
bool connected;
|
2003-08-05 10:40:59 -04:00
|
|
|
bool async;
|
2007-04-13 03:57:31 -04:00
|
|
|
bool protocol_connect = FALSE;
|
2005-02-09 08:06:40 -05:00
|
|
|
bool dophase_done;
|
2008-08-07 21:52:08 -04:00
|
|
|
bool done = FALSE;
|
2006-04-10 11:00:53 -04:00
|
|
|
CURLMcode result = CURLM_OK;
|
2007-11-24 18:16:55 -05:00
|
|
|
struct SingleRequest *k;
|
2010-08-10 08:12:05 -04:00
|
|
|
struct SessionHandle *data;
|
2010-09-01 10:52:23 -04:00
|
|
|
long timeout_ms;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2008-02-20 03:28:02 -05:00
|
|
|
if(!GOOD_EASY_HANDLE(easy->easy_handle))
|
|
|
|
return CURLM_BAD_EASY_HANDLE;
|
|
|
|
|
2010-08-10 08:12:05 -04:00
|
|
|
data = easy->easy_handle;
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
do {
|
2011-09-02 13:40:53 -04:00
|
|
|
/* this is a single-iteration do-while loop just to allow a
|
|
|
|
break to skip to the end of it */
|
2007-04-10 16:46:40 -04:00
|
|
|
bool disconnect_conn = FALSE;
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2007-04-10 16:46:40 -04:00
|
|
|
/* Handle the case when the pipe breaks, i.e., the connection
|
|
|
|
we're using gets cleaned up and we're left with nothing. */
|
2010-08-10 08:12:05 -04:00
|
|
|
if(data->state.pipe_broke) {
|
|
|
|
infof(data, "Pipe broke: handle 0x%p, url = %s\n",
|
|
|
|
easy, data->state.path);
|
2007-04-10 16:46:40 -04:00
|
|
|
|
2010-08-18 13:59:46 -04:00
|
|
|
if(easy->state < CURLM_STATE_COMPLETED) {
|
2006-09-07 17:49:20 -04:00
|
|
|
/* Head back to the CONNECT state */
|
|
|
|
multistate(easy, CURLM_STATE_CONNECT);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
easy->result = CURLE_OK;
|
2007-02-25 06:38:13 -05:00
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2010-08-10 08:12:05 -04:00
|
|
|
data->state.pipe_broke = FALSE;
|
2006-09-07 17:49:20 -04:00
|
|
|
easy->easy_conn = NULL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2009-08-21 03:11:20 -04:00
|
|
|
if(easy->easy_conn && easy->state > CURLM_STATE_CONNECT &&
|
2008-02-20 03:28:02 -05:00
|
|
|
easy->state < CURLM_STATE_COMPLETED)
|
2006-09-07 17:49:20 -04:00
|
|
|
/* Make sure we set the connection's current owner */
|
2010-08-10 08:12:05 -04:00
|
|
|
easy->easy_conn->data = data;
|
2004-01-12 10:26:32 -05:00
|
|
|
|
2010-12-13 06:51:48 -05:00
|
|
|
if(easy->easy_conn &&
|
|
|
|
(easy->state >= CURLM_STATE_CONNECT) &&
|
|
|
|
(easy->state < CURLM_STATE_COMPLETED)) {
|
|
|
|
/* we need to wait for the connect state as only then is the start time
|
|
|
|
stored, but we must not check already completed handles */
|
2010-09-01 10:52:23 -04:00
|
|
|
|
2011-01-04 17:07:58 -05:00
|
|
|
timeout_ms = Curl_timeleft(data, &now,
|
2010-11-26 13:34:10 -05:00
|
|
|
(easy->state <= CURLM_STATE_WAITDO)?
|
|
|
|
TRUE:FALSE);
|
2010-09-01 10:52:23 -04:00
|
|
|
|
|
|
|
if(timeout_ms < 0) {
|
|
|
|
/* Handle timed out */
|
2010-09-20 07:58:51 -04:00
|
|
|
if(easy->state == CURLM_STATE_WAITRESOLVE)
|
|
|
|
failf(data, "Resolving timed out after %ld milliseconds",
|
|
|
|
Curl_tvdiff(now, data->progress.t_startsingle));
|
|
|
|
else if(easy->state == CURLM_STATE_WAITCONNECT)
|
|
|
|
failf(data, "Connection timed out after %ld milliseconds",
|
|
|
|
Curl_tvdiff(now, data->progress.t_startsingle));
|
|
|
|
else {
|
|
|
|
k = &data->req;
|
|
|
|
failf(data, "Operation timed out after %ld milliseconds with %"
|
|
|
|
FORMAT_OFF_T " out of %" FORMAT_OFF_T " bytes received",
|
|
|
|
Curl_tvdiff(now, data->progress.t_startsingle), k->bytecount,
|
|
|
|
k->size);
|
|
|
|
}
|
2011-02-18 17:19:14 -05:00
|
|
|
|
|
|
|
/* Force the connection closed because the server could continue to
|
|
|
|
send us stuff at any time. (The disconnect_conn logic used below
|
|
|
|
doesn't work at this point). */
|
|
|
|
easy->easy_conn->bits.close = TRUE;
|
2010-09-01 10:52:23 -04:00
|
|
|
easy->result = CURLE_OPERATION_TIMEDOUT;
|
|
|
|
multistate(easy, CURLM_STATE_COMPLETED);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
switch(easy->state) {
|
|
|
|
case CURLM_STATE_INIT:
|
|
|
|
/* init this transfer. */
|
2010-08-10 08:12:05 -04:00
|
|
|
easy->result=Curl_pretransfer(data);
|
2005-02-09 08:06:40 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
if(CURLE_OK == easy->result) {
|
|
|
|
/* after init, go CONNECT */
|
|
|
|
multistate(easy, CURLM_STATE_CONNECT);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
2004-01-12 10:26:32 -05:00
|
|
|
|
2010-08-10 08:12:05 -04:00
|
|
|
data->state.used_interface = Curl_if_multi;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
break;
|
2003-08-05 10:40:59 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_CONNECT:
|
|
|
|
/* Connect. We get a connection identifier filled in. */
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_pgrsTime(data, TIMER_STARTSINGLE);
|
|
|
|
easy->result = Curl_connect(data, &easy->easy_conn,
|
2006-04-10 11:00:53 -04:00
|
|
|
&async, &protocol_connect);
|
2003-08-05 10:40:59 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
if(CURLE_OK == easy->result) {
|
2008-01-16 07:24:00 -05:00
|
|
|
/* Add this handle to the send or pend pipeline */
|
2010-08-10 08:12:05 -04:00
|
|
|
easy->result = addHandleToSendOrPendPipeline(data,
|
2008-01-16 07:24:00 -05:00
|
|
|
easy->easy_conn);
|
2011-10-06 14:30:34 -04:00
|
|
|
if(CURLE_OK != easy->result)
|
|
|
|
disconnect_conn = TRUE;
|
|
|
|
else {
|
2008-02-03 07:31:35 -05:00
|
|
|
if(async)
|
|
|
|
/* We're now waiting for an asynchronous name lookup */
|
|
|
|
multistate(easy, CURLM_STATE_WAITRESOLVE);
|
2007-11-03 10:44:38 -04:00
|
|
|
else {
|
2008-02-03 07:31:35 -05:00
|
|
|
/* after the connect has been sent off, go WAITCONNECT unless the
|
|
|
|
protocol connect is already done and we can go directly to
|
2008-05-19 16:58:01 -04:00
|
|
|
WAITDO or DO! */
|
2008-02-03 07:31:35 -05:00
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
|
|
|
|
if(protocol_connect)
|
2008-05-19 16:58:01 -04:00
|
|
|
multistate(easy, multi->pipelining_enabled?
|
|
|
|
CURLM_STATE_WAITDO:CURLM_STATE_DO);
|
2007-11-03 10:44:38 -04:00
|
|
|
else {
|
2007-02-26 21:24:13 -05:00
|
|
|
#ifndef CURL_DISABLE_HTTP
|
2008-02-03 07:31:35 -05:00
|
|
|
if(easy->easy_conn->bits.tunnel_connecting)
|
|
|
|
multistate(easy, CURLM_STATE_WAITPROXYCONNECT);
|
|
|
|
else
|
2007-02-26 21:24:13 -05:00
|
|
|
#endif
|
2008-02-03 07:31:35 -05:00
|
|
|
multistate(easy, CURLM_STATE_WAITCONNECT);
|
2007-11-03 10:44:38 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
break;
|
2004-05-17 02:53:41 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_WAITRESOLVE:
|
|
|
|
/* awaiting an asynch name resolve to complete */
|
|
|
|
{
|
|
|
|
struct Curl_dns_entry *dns = NULL;
|
|
|
|
|
|
|
|
/* check if we have the name resolved by now */
|
2011-01-30 18:10:35 -05:00
|
|
|
easy->result = Curl_resolver_is_resolved(easy->easy_conn, &dns);
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
if(dns) {
|
2008-06-19 17:32:51 -04:00
|
|
|
/* Update sockets here. Mainly because the socket(s) may have been
|
|
|
|
closed and the application thus needs to be told, even if it is
|
|
|
|
likely that the same socket(s) will again be used further down. */
|
|
|
|
singlesocket(multi, easy);
|
|
|
|
|
2006-04-10 11:00:53 -04: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,
|
|
|
|
&protocol_connect);
|
|
|
|
|
|
|
|
if(CURLE_OK != easy->result)
|
|
|
|
/* if Curl_async_resolved() returns failure, the connection struct
|
|
|
|
is already freed and gone */
|
2003-08-05 10:40:59 -04:00
|
|
|
easy->easy_conn = NULL; /* no more connection */
|
2006-04-10 11:00:53 -04:00
|
|
|
else {
|
2006-08-31 08:53:39 -04:00
|
|
|
/* call again please so that we get the next socket setup */
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
if(protocol_connect)
|
2008-05-19 16:58:01 -04:00
|
|
|
multistate(easy, multi->pipelining_enabled?
|
|
|
|
CURLM_STATE_WAITDO:CURLM_STATE_DO);
|
2007-02-25 06:38:13 -05:00
|
|
|
else {
|
2007-02-26 21:24:13 -05:00
|
|
|
#ifndef CURL_DISABLE_HTTP
|
2007-11-05 04:45:09 -05:00
|
|
|
if(easy->easy_conn->bits.tunnel_connecting)
|
2007-02-25 06:38:13 -05:00
|
|
|
multistate(easy, CURLM_STATE_WAITPROXYCONNECT);
|
|
|
|
else
|
2007-02-26 21:24:13 -05:00
|
|
|
#endif
|
2007-02-25 06:38:13 -05:00
|
|
|
multistate(easy, CURLM_STATE_WAITCONNECT);
|
|
|
|
}
|
2003-08-05 10:40:59 -04:00
|
|
|
}
|
2001-12-13 02:16:27 -05:00
|
|
|
}
|
2002-08-12 05:43:20 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
if(CURLE_OK != easy->result) {
|
|
|
|
/* failure detected */
|
2007-04-10 16:46:40 -04:00
|
|
|
disconnect_conn = TRUE;
|
2006-04-10 11:00:53 -04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
2002-08-12 05:43:20 -04:00
|
|
|
|
2007-02-26 21:24:13 -05:00
|
|
|
#ifndef CURL_DISABLE_HTTP
|
2007-02-25 06:38:13 -05:00
|
|
|
case CURLM_STATE_WAITPROXYCONNECT:
|
|
|
|
/* this is HTTP-specific, but sending CONNECT to a proxy is HTTP... */
|
|
|
|
easy->result = Curl_http_connect(easy->easy_conn, &protocol_connect);
|
|
|
|
|
2008-08-23 08:11:38 -04:00
|
|
|
if(easy->easy_conn->bits.proxy_connect_closed) {
|
|
|
|
/* reset the error buffer */
|
2010-08-10 08:12:05 -04:00
|
|
|
if(data->set.errorbuffer)
|
|
|
|
data->set.errorbuffer[0] = '\0';
|
|
|
|
data->state.errorbuf = FALSE;
|
2008-08-23 08:11:38 -04:00
|
|
|
|
2008-10-08 17:42:29 -04:00
|
|
|
easy->result = CURLE_OK;
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
multistate(easy, CURLM_STATE_CONNECT);
|
2008-08-23 08:11:38 -04:00
|
|
|
}
|
2011-04-20 09:17:42 -04:00
|
|
|
else if(CURLE_OK == easy->result) {
|
2007-11-05 04:45:09 -05:00
|
|
|
if(!easy->easy_conn->bits.tunnel_connecting)
|
2007-02-25 06:38:13 -05:00
|
|
|
multistate(easy, CURLM_STATE_WAITCONNECT);
|
|
|
|
}
|
|
|
|
break;
|
2007-02-26 21:24:13 -05:00
|
|
|
#endif
|
2007-02-25 06:38:13 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_WAITCONNECT:
|
|
|
|
/* awaiting a completion of an asynch connect */
|
2006-09-07 17:49:20 -04:00
|
|
|
easy->result = Curl_is_connected(easy->easy_conn,
|
|
|
|
FIRSTSOCKET,
|
2006-04-10 11:00:53 -04:00
|
|
|
&connected);
|
2009-05-08 06:59:40 -04:00
|
|
|
if(connected) {
|
|
|
|
|
|
|
|
if(!easy->result)
|
|
|
|
/* if everything is still fine we do the protocol-specific connect
|
|
|
|
setup */
|
|
|
|
easy->result = Curl_protocol_connect(easy->easy_conn,
|
|
|
|
&protocol_connect);
|
|
|
|
}
|
2002-08-12 05:43:20 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
if(CURLE_OK != easy->result) {
|
|
|
|
/* failure detected */
|
2007-04-10 16:46:40 -04:00
|
|
|
/* Just break, the cleaning up is handled all in one place */
|
|
|
|
disconnect_conn = TRUE;
|
2005-02-09 08:06:40 -05:00
|
|
|
break;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
2005-02-09 08:06:40 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
if(connected) {
|
|
|
|
if(!protocol_connect) {
|
|
|
|
/* We have a TCP connection, but 'protocol_connect' may be false
|
|
|
|
and then we continue to 'STATE_PROTOCONNECT'. If protocol
|
2007-06-14 10:42:21 -04:00
|
|
|
connect is TRUE, we move on to STATE_DO.
|
|
|
|
BUT if we are using a proxy we must change to WAITPROXYCONNECT
|
2009-08-03 07:32:55 -04:00
|
|
|
*/
|
2007-06-14 10:42:21 -04:00
|
|
|
#ifndef CURL_DISABLE_HTTP
|
2007-11-05 04:45:09 -05:00
|
|
|
if(easy->easy_conn->bits.tunnel_connecting)
|
2007-06-14 10:42:21 -04:00
|
|
|
multistate(easy, CURLM_STATE_WAITPROXYCONNECT);
|
|
|
|
else
|
|
|
|
#endif
|
|
|
|
multistate(easy, CURLM_STATE_PROTOCONNECT);
|
2010-01-11 18:05:35 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
2010-01-11 18:05:35 -05:00
|
|
|
else
|
2008-05-19 16:58:01 -04:00
|
|
|
/* after the connect has completed, go WAITDO or DO */
|
|
|
|
multistate(easy, multi->pipelining_enabled?
|
|
|
|
CURLM_STATE_WAITDO:CURLM_STATE_DO);
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2010-01-11 18:05:35 -05:00
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
break;
|
2004-01-12 10:26:32 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_PROTOCONNECT:
|
|
|
|
/* protocol-specific connect phase */
|
|
|
|
easy->result = Curl_protocol_connecting(easy->easy_conn,
|
|
|
|
&protocol_connect);
|
2007-11-03 10:44:38 -04:00
|
|
|
if((easy->result == CURLE_OK) && protocol_connect) {
|
2008-05-19 16:58:01 -04:00
|
|
|
/* after the connect has completed, go WAITDO or DO */
|
|
|
|
multistate(easy, multi->pipelining_enabled?
|
|
|
|
CURLM_STATE_WAITDO:CURLM_STATE_DO);
|
2006-04-10 11:00:53 -04:00
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
}
|
|
|
|
else if(easy->result) {
|
|
|
|
/* failure detected */
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_posttransfer(data);
|
2011-02-17 17:51:43 -05:00
|
|
|
Curl_done(&easy->easy_conn, easy->result, TRUE);
|
2007-04-10 16:46:40 -04:00
|
|
|
disconnect_conn = TRUE;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
break;
|
2005-02-09 08:06:40 -05:00
|
|
|
|
2006-09-07 17:49:20 -04:00
|
|
|
case CURLM_STATE_WAITDO:
|
|
|
|
/* Wait for our turn to DO when we're pipelining requests */
|
2009-06-09 22:49:42 -04:00
|
|
|
#ifdef DEBUGBUILD
|
2010-08-10 08:12:05 -04:00
|
|
|
infof(data, "Conn %ld send pipe %zu inuse %d athead %d\n",
|
2006-09-07 17:49:20 -04:00
|
|
|
easy->easy_conn->connectindex,
|
2006-10-06 17:19:57 -04:00
|
|
|
easy->easy_conn->send_pipe->size,
|
2010-02-04 14:44:31 -05:00
|
|
|
easy->easy_conn->writechannel_inuse?1:0,
|
2010-08-10 08:12:05 -04:00
|
|
|
isHandleAtHead(data,
|
2010-02-04 14:44:31 -05:00
|
|
|
easy->easy_conn->send_pipe)?1:0);
|
2006-10-06 17:19:57 -04:00
|
|
|
#endif
|
2007-11-05 04:45:09 -05:00
|
|
|
if(!easy->easy_conn->writechannel_inuse &&
|
2010-08-10 08:12:05 -04:00
|
|
|
isHandleAtHead(data,
|
2008-01-16 07:24:00 -05:00
|
|
|
easy->easy_conn->send_pipe)) {
|
2006-09-07 17:49:20 -04:00
|
|
|
/* Grab the channel */
|
|
|
|
easy->easy_conn->writechannel_inuse = TRUE;
|
|
|
|
multistate(easy, CURLM_STATE_DO);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_DO:
|
2010-08-10 08:12:05 -04:00
|
|
|
if(data->set.connect_only) {
|
2006-04-10 11:00:53 -04:00
|
|
|
/* keep connection open for application to use the socket */
|
|
|
|
easy->easy_conn->bits.close = FALSE;
|
|
|
|
multistate(easy, CURLM_STATE_DONE);
|
|
|
|
easy->result = CURLE_OK;
|
|
|
|
result = CURLM_OK;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* Perform the protocol's DO action */
|
2006-09-07 17:49:20 -04:00
|
|
|
easy->result = Curl_do(&easy->easy_conn,
|
|
|
|
&dophase_done);
|
2004-01-12 10:26:32 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
if(CURLE_OK == easy->result) {
|
|
|
|
if(!dophase_done) {
|
2010-05-12 09:33:22 -04:00
|
|
|
/* some steps needed for wildcard matching */
|
2010-08-10 08:12:05 -04:00
|
|
|
if(data->set.wildcardmatch) {
|
|
|
|
struct WildcardData *wc = &data->wildcard;
|
2010-05-12 09:33:22 -04:00
|
|
|
if(wc->state == CURLWC_DONE || wc->state == CURLWC_SKIP) {
|
|
|
|
/* skip some states if it is important */
|
|
|
|
Curl_done(&easy->easy_conn, CURLE_OK, FALSE);
|
|
|
|
multistate(easy, CURLM_STATE_DONE);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
/* DO was not completed in one function call, we must continue
|
|
|
|
DOING... */
|
|
|
|
multistate(easy, CURLM_STATE_DOING);
|
|
|
|
result = CURLM_OK;
|
2002-08-12 05:43:20 -04:00
|
|
|
}
|
|
|
|
|
2006-09-07 17:49:20 -04:00
|
|
|
/* after DO, go DO_DONE... or DO_MORE */
|
2006-04-10 11:00:53 -04:00
|
|
|
else 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 */
|
|
|
|
multistate(easy, CURLM_STATE_DO_MORE);
|
|
|
|
result = CURLM_OK;
|
|
|
|
}
|
|
|
|
else {
|
2006-09-07 17:49:20 -04:00
|
|
|
/* we're done with the DO, now DO_DONE */
|
2007-11-15 16:45:45 -05:00
|
|
|
multistate(easy, CURLM_STATE_DO_DONE);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
2005-02-09 08:06:40 -05:00
|
|
|
}
|
2011-04-20 09:17:42 -04:00
|
|
|
else if((CURLE_SEND_ERROR == easy->result) &&
|
|
|
|
easy->easy_conn->bits.reuse) {
|
2009-08-21 03:11:20 -04:00
|
|
|
/*
|
|
|
|
* In this situation, a connection that we were trying to use
|
|
|
|
* may have unexpectedly died. If possible, send the connection
|
|
|
|
* back to the CONNECT phase so we can try again.
|
|
|
|
*/
|
2009-08-24 04:41:17 -04:00
|
|
|
char *newurl = NULL;
|
2009-08-21 03:11:20 -04:00
|
|
|
followtype follow=FOLLOW_NONE;
|
|
|
|
CURLcode drc;
|
2009-08-21 08:01:36 -04:00
|
|
|
bool retry = FALSE;
|
|
|
|
|
|
|
|
drc = Curl_retry_request(easy->easy_conn, &newurl);
|
|
|
|
if(drc) {
|
|
|
|
/* a failure here pretty much implies an out of memory */
|
|
|
|
easy->result = drc;
|
|
|
|
disconnect_conn = TRUE;
|
|
|
|
}
|
|
|
|
else
|
2011-09-05 14:46:09 -04:00
|
|
|
retry = (newurl)?TRUE:FALSE;
|
2009-08-21 03:11:20 -04:00
|
|
|
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_posttransfer(data);
|
2009-08-21 03:11:20 -04:00
|
|
|
drc = Curl_done(&easy->easy_conn, easy->result, FALSE);
|
|
|
|
|
|
|
|
/* When set to retry the connection, we must to go back to
|
|
|
|
* the CONNECT state */
|
|
|
|
if(retry) {
|
2011-04-20 09:17:42 -04:00
|
|
|
if((drc == CURLE_OK) || (drc == CURLE_SEND_ERROR)) {
|
2009-08-21 03:11:20 -04:00
|
|
|
follow = FOLLOW_RETRY;
|
2010-08-10 08:12:05 -04:00
|
|
|
drc = Curl_follow(data, newurl, follow);
|
2009-08-21 03:11:20 -04:00
|
|
|
if(drc == CURLE_OK) {
|
|
|
|
multistate(easy, CURLM_STATE_CONNECT);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
easy->result = CURLE_OK;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* Follow failed */
|
|
|
|
easy->result = drc;
|
|
|
|
free(newurl);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* done didn't return OK or SEND_ERROR */
|
|
|
|
easy->result = drc;
|
|
|
|
free(newurl);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* Have error handler disconnect conn if we can't retry */
|
|
|
|
disconnect_conn = TRUE;
|
|
|
|
}
|
|
|
|
}
|
2005-02-09 08:06:40 -05:00
|
|
|
else {
|
|
|
|
/* failure detected */
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_posttransfer(data);
|
2007-01-16 17:22:10 -05:00
|
|
|
Curl_done(&easy->easy_conn, easy->result, FALSE);
|
2007-04-10 16:46:40 -04:00
|
|
|
disconnect_conn = TRUE;
|
2005-02-09 08:06:40 -05:00
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
break;
|
2004-01-12 10:26:32 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_DOING:
|
|
|
|
/* we continue DOING until the DO phase is complete */
|
2006-09-07 17:49:20 -04:00
|
|
|
easy->result = Curl_protocol_doing(easy->easy_conn,
|
|
|
|
&dophase_done);
|
2006-04-10 11:00:53 -04:00
|
|
|
if(CURLE_OK == easy->result) {
|
|
|
|
if(dophase_done) {
|
|
|
|
/* 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 */
|
|
|
|
multistate(easy, CURLM_STATE_DO_MORE);
|
|
|
|
result = CURLM_OK;
|
|
|
|
}
|
|
|
|
else {
|
2006-09-07 17:49:20 -04:00
|
|
|
/* we're done with the DO, now DO_DONE */
|
2007-11-15 16:45:45 -05:00
|
|
|
multistate(easy, CURLM_STATE_DO_DONE);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
2004-01-12 10:26:32 -05:00
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
} /* dophase_done */
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* failure detected */
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_posttransfer(data);
|
2007-01-16 17:22:10 -05:00
|
|
|
Curl_done(&easy->easy_conn, easy->result, FALSE);
|
2007-04-10 16:46:40 -04:00
|
|
|
disconnect_conn = TRUE;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CURLM_STATE_DO_MORE:
|
|
|
|
/* Ready to do more? */
|
2006-09-07 17:49:20 -04:00
|
|
|
easy->result = Curl_is_connected(easy->easy_conn,
|
|
|
|
SECONDARYSOCKET,
|
2006-04-10 11:00:53 -04:00
|
|
|
&connected);
|
|
|
|
if(connected) {
|
|
|
|
/*
|
2006-09-07 17:49:20 -04:00
|
|
|
* When we are connected, DO MORE and then go DO_DONE
|
2006-04-10 11:00:53 -04:00
|
|
|
*/
|
|
|
|
easy->result = Curl_do_more(easy->easy_conn);
|
|
|
|
|
2007-11-03 10:44:38 -04:00
|
|
|
/* No need to remove ourselves from the send pipeline here since that
|
|
|
|
is done for us in Curl_done() */
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
if(CURLE_OK == easy->result) {
|
2006-09-07 17:49:20 -04:00
|
|
|
multistate(easy, CURLM_STATE_DO_DONE);
|
2006-04-10 11:00:53 -04:00
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
2002-01-03 10:01:22 -05:00
|
|
|
}
|
2007-11-03 10:44:38 -04:00
|
|
|
else {
|
|
|
|
/* failure detected */
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_posttransfer(data);
|
2007-11-03 10:44:38 -04:00
|
|
|
Curl_done(&easy->easy_conn, easy->result, FALSE);
|
|
|
|
disconnect_conn = TRUE;
|
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
break;
|
2002-08-12 05:43:20 -04:00
|
|
|
|
2006-09-07 17:49:20 -04:00
|
|
|
case CURLM_STATE_DO_DONE:
|
2008-01-16 07:24:00 -05:00
|
|
|
/* Move ourselves from the send to recv pipeline */
|
2010-08-10 08:12:05 -04:00
|
|
|
moveHandleFromSendToRecvPipeline(data, easy->easy_conn);
|
2008-01-16 07:24:00 -05:00
|
|
|
/* Check if we can move pending requests to send pipe */
|
|
|
|
checkPendPipeline(easy->easy_conn);
|
2006-09-07 17:49:20 -04:00
|
|
|
multistate(easy, CURLM_STATE_WAITPERFORM);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CURLM_STATE_WAITPERFORM:
|
|
|
|
/* Wait for our turn to PERFORM */
|
2007-11-05 04:45:09 -05:00
|
|
|
if(!easy->easy_conn->readchannel_inuse &&
|
2010-08-10 08:12:05 -04:00
|
|
|
isHandleAtHead(data,
|
2008-01-16 07:24:00 -05:00
|
|
|
easy->easy_conn->recv_pipe)) {
|
2006-09-07 17:49:20 -04:00
|
|
|
/* Grab the channel */
|
|
|
|
easy->easy_conn->readchannel_inuse = TRUE;
|
|
|
|
multistate(easy, CURLM_STATE_PERFORM);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
}
|
2009-06-09 22:49:42 -04:00
|
|
|
#ifdef DEBUGBUILD
|
2009-02-20 03:16:03 -05:00
|
|
|
else {
|
2010-08-10 08:12:05 -04:00
|
|
|
infof(data, "Conn %ld recv pipe %zu inuse %d athead %d\n",
|
2009-02-20 03:16:03 -05:00
|
|
|
easy->easy_conn->connectindex,
|
|
|
|
easy->easy_conn->recv_pipe->size,
|
2010-02-04 14:44:31 -05:00
|
|
|
easy->easy_conn->readchannel_inuse?1:0,
|
2010-08-10 08:12:05 -04:00
|
|
|
isHandleAtHead(data,
|
2010-02-04 14:44:31 -05:00
|
|
|
easy->easy_conn->recv_pipe)?1:0);
|
2009-02-20 03:16:03 -05:00
|
|
|
}
|
|
|
|
#endif
|
2006-09-07 17:49:20 -04:00
|
|
|
break;
|
|
|
|
|
2006-06-22 17:36:53 -04:00
|
|
|
case CURLM_STATE_TOOFAST: /* limit-rate exceeded in either direction */
|
|
|
|
/* if both rates are within spec, resume transfer */
|
2011-02-02 07:41:22 -05:00
|
|
|
Curl_pgrsUpdate(easy->easy_conn);
|
2011-04-22 17:01:30 -04:00
|
|
|
if(( (data->set.max_send_speed == 0) ||
|
|
|
|
(data->progress.ulspeed < data->set.max_send_speed )) &&
|
|
|
|
( (data->set.max_recv_speed == 0) ||
|
|
|
|
(data->progress.dlspeed < data->set.max_recv_speed)))
|
2009-08-03 07:32:55 -04:00
|
|
|
multistate(easy, CURLM_STATE_PERFORM);
|
2006-06-22 17:36:53 -04:00
|
|
|
break;
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_PERFORM:
|
2010-08-10 08:12:05 -04:00
|
|
|
/* check if over send speed */
|
2011-04-22 17:01:30 -04:00
|
|
|
if((data->set.max_send_speed > 0) &&
|
|
|
|
(data->progress.ulspeed > data->set.max_send_speed)) {
|
2010-08-10 08:12:05 -04:00
|
|
|
int buffersize;
|
|
|
|
|
|
|
|
multistate(easy, CURLM_STATE_TOOFAST);
|
|
|
|
|
|
|
|
/* calculate upload rate-limitation timeout. */
|
|
|
|
buffersize = (int)(data->set.buffer_size ?
|
|
|
|
data->set.buffer_size : BUFSIZE);
|
|
|
|
timeout_ms = Curl_sleep_time(data->set.max_send_speed,
|
|
|
|
data->progress.ulspeed, buffersize);
|
|
|
|
Curl_expire(data, timeout_ms);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* check if over recv speed */
|
2011-04-22 17:01:30 -04:00
|
|
|
if((data->set.max_recv_speed > 0) &&
|
|
|
|
(data->progress.dlspeed > data->set.max_recv_speed)) {
|
2010-08-10 08:12:05 -04:00
|
|
|
int buffersize;
|
|
|
|
|
|
|
|
multistate(easy, CURLM_STATE_TOOFAST);
|
|
|
|
|
|
|
|
/* Calculate download rate-limitation timeout. */
|
|
|
|
buffersize = (int)(data->set.buffer_size ?
|
|
|
|
data->set.buffer_size : BUFSIZE);
|
|
|
|
timeout_ms = Curl_sleep_time(data->set.max_recv_speed,
|
|
|
|
data->progress.dlspeed, buffersize);
|
|
|
|
Curl_expire(data, timeout_ms);
|
2006-06-22 17:36:53 -04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
/* read/write data if it is ready to do so */
|
|
|
|
easy->result = Curl_readwrite(easy->easy_conn, &done);
|
|
|
|
|
2010-08-10 08:12:05 -04:00
|
|
|
k = &data->req;
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2009-05-11 03:53:38 -04:00
|
|
|
if(!(k->keepon & KEEP_RECV)) {
|
|
|
|
/* We're done receiving */
|
2008-01-08 09:52:05 -05:00
|
|
|
easy->easy_conn->readchannel_inuse = FALSE;
|
2006-09-07 17:49:20 -04:00
|
|
|
}
|
|
|
|
|
2009-05-11 03:53:38 -04:00
|
|
|
if(!(k->keepon & KEEP_SEND)) {
|
|
|
|
/* We're done sending */
|
2008-01-08 09:52:05 -05:00
|
|
|
easy->easy_conn->writechannel_inuse = FALSE;
|
2006-09-07 17:49:20 -04:00
|
|
|
}
|
|
|
|
|
2010-05-12 09:33:22 -04:00
|
|
|
if(easy->result) {
|
2006-04-10 11:00:53 -04:00
|
|
|
/* The transfer phase returned error, we mark the connection to get
|
2009-02-20 03:16:03 -05:00
|
|
|
* closed to prevent being re-used. This is because we can't possibly
|
|
|
|
* know if the connection is in a good shape or not now. Unless it is
|
|
|
|
* a protocol which uses two "channels" like FTP, as then the error
|
|
|
|
* happened in the data connection.
|
|
|
|
*/
|
2011-03-14 17:22:22 -04:00
|
|
|
if(!(easy->easy_conn->handler->flags & PROTOPT_DUAL))
|
2009-02-20 03:16:03 -05:00
|
|
|
easy->easy_conn->bits.close = TRUE;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_posttransfer(data);
|
2007-01-16 17:22:10 -05:00
|
|
|
Curl_done(&easy->easy_conn, easy->result, FALSE);
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
2011-09-05 14:46:09 -04:00
|
|
|
else if(done) {
|
2009-08-24 04:41:17 -04:00
|
|
|
char *newurl = NULL;
|
2009-08-21 08:01:36 -04:00
|
|
|
bool retry = FALSE;
|
2008-04-30 17:20:08 -04:00
|
|
|
followtype follow=FOLLOW_NONE;
|
2004-01-12 10:26:32 -05:00
|
|
|
|
2009-08-21 08:01:36 -04:00
|
|
|
easy->result = Curl_retry_request(easy->easy_conn, &newurl);
|
|
|
|
if(!easy->result)
|
2011-09-05 14:46:09 -04:00
|
|
|
retry = (newurl)?TRUE:FALSE;
|
2009-08-21 08:01:36 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
/* call this even if the readwrite function returned error */
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_posttransfer(data);
|
2004-01-12 10:26:32 -05:00
|
|
|
|
2011-04-19 09:54:13 -04:00
|
|
|
/* we're no longer receiving */
|
2010-08-10 08:12:05 -04:00
|
|
|
moveHandleFromRecvToDonePipeline(data,
|
2009-08-21 03:11:20 -04:00
|
|
|
easy->easy_conn);
|
2008-05-28 16:56:19 -04:00
|
|
|
|
|
|
|
/* expire the new receiving pipeline head */
|
|
|
|
if(easy->easy_conn->recv_pipe->head)
|
|
|
|
Curl_expire(easy->easy_conn->recv_pipe->head->ptr, 1);
|
|
|
|
|
|
|
|
/* Check if we can move pending requests to send pipe */
|
|
|
|
checkPendPipeline(easy->easy_conn);
|
|
|
|
|
2008-09-29 08:22:10 -04:00
|
|
|
/* When we follow redirects or is set to retry the connection, we must
|
|
|
|
to go back to the CONNECT state */
|
2010-08-10 08:12:05 -04:00
|
|
|
if(data->req.newurl || retry) {
|
2006-04-10 11:00:53 -04:00
|
|
|
if(!retry) {
|
|
|
|
/* if the URL is a follow-location and not just a retried request
|
|
|
|
then figure out the URL here */
|
2010-08-10 08:12:05 -04:00
|
|
|
newurl = data->req.newurl;
|
|
|
|
data->req.newurl = NULL;
|
2008-04-30 17:20:08 -04:00
|
|
|
follow = FOLLOW_REDIR;
|
2004-01-12 10:26:32 -05:00
|
|
|
}
|
2008-04-30 17:20:08 -04:00
|
|
|
else
|
|
|
|
follow = FOLLOW_RETRY;
|
2007-01-16 17:22:10 -05:00
|
|
|
easy->result = Curl_done(&easy->easy_conn, CURLE_OK, FALSE);
|
2006-04-10 11:00:53 -04:00
|
|
|
if(easy->result == CURLE_OK)
|
2010-08-10 08:12:05 -04:00
|
|
|
easy->result = Curl_follow(data, newurl, follow);
|
2006-04-10 11:00:53 -04:00
|
|
|
if(CURLE_OK == easy->result) {
|
|
|
|
multistate(easy, CURLM_STATE_CONNECT);
|
2004-05-17 02:53:41 -04:00
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
2002-10-18 11:27:49 -04:00
|
|
|
}
|
2009-08-21 08:01:36 -04:00
|
|
|
else if(newurl)
|
2006-04-10 11:00:53 -04:00
|
|
|
/* Since we "took it", we are in charge of freeing this on
|
|
|
|
failure */
|
|
|
|
free(newurl);
|
2002-10-07 09:38:59 -04:00
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
else {
|
|
|
|
/* after the transfer is done, go DONE */
|
2008-09-29 08:22:10 -04:00
|
|
|
|
|
|
|
/* but first check to see if we got a location info even though we're
|
|
|
|
not following redirects */
|
2011-04-20 09:17:42 -04:00
|
|
|
if(data->req.location) {
|
2010-08-10 08:12:05 -04:00
|
|
|
newurl = data->req.location;
|
|
|
|
data->req.location = NULL;
|
|
|
|
easy->result = Curl_follow(data, newurl, FOLLOW_FAKE);
|
2011-10-06 14:30:34 -04:00
|
|
|
if(easy->result) {
|
|
|
|
disconnect_conn = TRUE;
|
2008-09-29 08:22:10 -04:00
|
|
|
free(newurl);
|
2011-10-06 14:30:34 -04:00
|
|
|
}
|
2008-09-29 08:22:10 -04:00
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
multistate(easy, CURLM_STATE_DONE);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
}
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
break;
|
2006-06-22 17:36:53 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_DONE:
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2009-08-21 03:11:20 -04:00
|
|
|
if(easy->easy_conn) {
|
|
|
|
/* Remove ourselves from the receive and done pipelines. Handle
|
|
|
|
should be on one of these lists, depending upon how we got here. */
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_removeHandleFromPipeline(data,
|
2009-08-21 03:11:20 -04:00
|
|
|
easy->easy_conn->recv_pipe);
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_removeHandleFromPipeline(data,
|
2009-08-21 03:11:20 -04:00
|
|
|
easy->easy_conn->done_pipe);
|
|
|
|
/* Check if we can move pending requests to send pipe */
|
|
|
|
checkPendPipeline(easy->easy_conn);
|
|
|
|
|
|
|
|
if(easy->easy_conn->bits.stream_was_rewound) {
|
|
|
|
/* This request read past its response boundary so we quickly let
|
|
|
|
the other requests consume those bytes since there is no
|
|
|
|
guarantee that the socket will become active again */
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2009-08-21 03:11:20 -04:00
|
|
|
/* post-transfer command */
|
|
|
|
easy->result = Curl_done(&easy->easy_conn, CURLE_OK, FALSE);
|
|
|
|
/*
|
|
|
|
* If there are other handles on the pipeline, Curl_done won't set
|
|
|
|
* easy_conn to NULL. In such a case, curl_multi_remove_handle() can
|
|
|
|
* access free'd data, if the connection is free'd and the handle
|
|
|
|
* removed before we perform the processing in CURLM_STATE_COMPLETED
|
|
|
|
*/
|
2011-04-20 09:17:42 -04:00
|
|
|
if(easy->easy_conn)
|
2009-08-21 03:11:20 -04:00
|
|
|
easy->easy_conn = NULL;
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2010-08-10 08:12:05 -04:00
|
|
|
if(data->set.wildcardmatch) {
|
|
|
|
if(data->wildcard.state != CURLWC_DONE) {
|
2010-05-16 16:01:17 -04:00
|
|
|
/* if a wildcard is set and we are not ending -> lets start again
|
2010-05-12 09:33:22 -04:00
|
|
|
with CURLM_STATE_INIT */
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
|
|
|
multistate(easy, CURLM_STATE_INIT);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-21 18:48:58 -05:00
|
|
|
/* after we have DONE what we're supposed to do, go COMPLETED, and
|
|
|
|
it doesn't matter what the Curl_done() returned! */
|
|
|
|
multistate(easy, CURLM_STATE_COMPLETED);
|
2002-04-27 18:21:51 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
break;
|
2002-05-02 18:12:14 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
case CURLM_STATE_COMPLETED:
|
|
|
|
/* this is a completed transfer, it is likely to still be connected */
|
2001-11-28 10:46:25 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
/* This node should be delinked from the list now and we should post
|
|
|
|
an information message that we are complete. */
|
2007-04-10 16:46:40 -04:00
|
|
|
|
|
|
|
/* Important: reset the conn pointer so that we don't point to memory
|
|
|
|
that could be freed anytime */
|
|
|
|
easy->easy_conn = NULL;
|
2010-09-28 17:17:34 -04:00
|
|
|
|
|
|
|
Curl_expire(data, 0); /* stop all timers */
|
2006-04-10 11:00:53 -04:00
|
|
|
break;
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2010-08-18 13:59:46 -04:00
|
|
|
case CURLM_STATE_MSGSENT:
|
|
|
|
return CURLM_OK; /* do nothing */
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
default:
|
|
|
|
return CURLM_INTERNAL_ERROR;
|
|
|
|
}
|
2002-01-03 10:01:22 -05:00
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
if(easy->state < CURLM_STATE_COMPLETED) {
|
2006-04-10 11:00:53 -04:00
|
|
|
if(CURLE_OK != easy->result) {
|
|
|
|
/*
|
|
|
|
* If an error was returned, and we aren't in completed state now,
|
2006-09-07 17:49:20 -04:00
|
|
|
* then we go to completed and consider this transfer aborted.
|
|
|
|
*/
|
2007-04-10 16:46:40 -04:00
|
|
|
|
|
|
|
/* NOTE: no attempt to disconnect connections must be made
|
|
|
|
in the case blocks above - cleanup happens only here */
|
|
|
|
|
2010-08-10 08:12:05 -04:00
|
|
|
data->state.pipe_broke = FALSE;
|
2006-10-10 10:23:34 -04:00
|
|
|
|
2006-10-06 17:19:57 -04:00
|
|
|
if(easy->easy_conn) {
|
|
|
|
/* if this has a connection, unsubscribe from the pipelines */
|
|
|
|
easy->easy_conn->writechannel_inuse = FALSE;
|
|
|
|
easy->easy_conn->readchannel_inuse = FALSE;
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_removeHandleFromPipeline(data,
|
2007-04-10 16:46:40 -04:00
|
|
|
easy->easy_conn->send_pipe);
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_removeHandleFromPipeline(data,
|
2007-04-10 16:46:40 -04:00
|
|
|
easy->easy_conn->recv_pipe);
|
2010-08-10 08:12:05 -04:00
|
|
|
Curl_removeHandleFromPipeline(data,
|
2009-08-21 03:11:20 -04:00
|
|
|
easy->easy_conn->done_pipe);
|
2008-01-16 07:24:00 -05:00
|
|
|
/* Check if we can move pending requests to send pipe */
|
|
|
|
checkPendPipeline(easy->easy_conn);
|
2007-04-10 16:46:40 -04:00
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
if(disconnect_conn) {
|
|
|
|
/* disconnect properly */
|
|
|
|
Curl_disconnect(easy->easy_conn, /* dead_connection */ FALSE);
|
2007-04-10 16:46:40 -04:00
|
|
|
|
2011-10-13 12:04:56 -04:00
|
|
|
/* This is where we make sure that the easy_conn pointer is reset.
|
|
|
|
We don't have to do this in every case block above where a
|
|
|
|
failure is detected */
|
|
|
|
easy->easy_conn = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else if(easy->state == CURLM_STATE_CONNECT) {
|
|
|
|
/* Curl_connect() failed */
|
|
|
|
(void)Curl_posttransfer(data);
|
2007-04-10 16:46:40 -04:00
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
multistate(easy, CURLM_STATE_COMPLETED);
|
2003-04-29 14:03:30 -04:00
|
|
|
}
|
2010-06-18 17:46:09 -04:00
|
|
|
/* if there's still a connection to use, call the progress function */
|
2011-09-30 16:59:50 -04:00
|
|
|
else if(easy->easy_conn && Curl_pgrsUpdate(easy->easy_conn)) {
|
2011-10-02 13:28:39 -04:00
|
|
|
/* aborted due to progress callback return code must close the
|
|
|
|
connection */
|
|
|
|
easy->easy_conn->bits.close = TRUE;
|
|
|
|
|
|
|
|
/* if not yet in DONE state, go there, otherwise COMPLETED */
|
|
|
|
multistate(easy, (easy->state < CURLM_STATE_DONE)?
|
|
|
|
CURLM_STATE_DONE: CURLM_STATE_COMPLETED);
|
|
|
|
result = CURLM_CALL_MULTI_PERFORM;
|
2011-09-30 16:59:50 -04:00
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
2011-09-02 13:40:53 -04:00
|
|
|
} WHILE_FALSE; /* just to break out from! */
|
2010-08-08 18:01:36 -04:00
|
|
|
|
|
|
|
if(CURLM_STATE_COMPLETED == easy->state) {
|
2010-08-10 08:12:05 -04:00
|
|
|
if(data->dns.hostcachetype == HCACHE_MULTI) {
|
2006-07-07 18:58:06 -04:00
|
|
|
/* clear out the usage of the shared DNS cache */
|
2010-08-10 08:12:05 -04:00
|
|
|
data->dns.hostcache = NULL;
|
|
|
|
data->dns.hostcachetype = HCACHE_NONE;
|
2006-07-07 18:58:06 -04:00
|
|
|
}
|
2002-05-28 10:45:50 -04:00
|
|
|
|
2010-08-07 19:06:29 -04:00
|
|
|
/* now fill in the Curl_message with this info */
|
|
|
|
msg = &easy->msg;
|
2002-05-28 10:45:50 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
msg->extmsg.msg = CURLMSG_DONE;
|
2010-08-10 08:12:05 -04:00
|
|
|
msg->extmsg.easy_handle = data;
|
2006-04-10 11:00:53 -04:00
|
|
|
msg->extmsg.data.result = easy->result;
|
2002-05-28 10:45:50 -04:00
|
|
|
|
2010-08-08 18:01:36 -04:00
|
|
|
result = multi_addmsg(multi, msg);
|
2010-08-18 13:59:46 -04:00
|
|
|
|
|
|
|
multistate(easy, CURLM_STATE_MSGSENT);
|
2001-11-28 06:09:18 -05:00
|
|
|
}
|
2002-05-02 18:12:14 -04:00
|
|
|
|
2002-01-03 10:01:22 -05:00
|
|
|
return result;
|
2001-11-28 06:09:18 -05:00
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
CURLMcode curl_multi_perform(CURLM *multi_handle, int *running_handles)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
|
|
|
struct Curl_one_easy *easy;
|
|
|
|
CURLMcode returncode=CURLM_OK;
|
|
|
|
struct Curl_tree *t;
|
2010-07-12 13:19:31 -04:00
|
|
|
struct timeval now = Curl_tvnow();
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
|
|
|
easy=multi->easy.next;
|
2007-02-21 16:59:40 -05:00
|
|
|
while(easy != &multi->easy) {
|
2006-09-07 17:49:20 -04:00
|
|
|
CURLMcode result;
|
2010-05-12 09:33:22 -04:00
|
|
|
struct WildcardData *wc = &easy->easy_handle->wildcard;
|
|
|
|
|
|
|
|
if(easy->easy_handle->set.wildcardmatch) {
|
|
|
|
if(!wc->filelist) {
|
|
|
|
CURLcode ret = Curl_wildcard_init(wc); /* init wildcard structures */
|
|
|
|
if(ret)
|
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
}
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2010-02-01 16:42:44 -05:00
|
|
|
do
|
2010-09-01 10:52:23 -04:00
|
|
|
result = multi_runsingle(multi, now, easy);
|
2011-04-20 09:17:42 -04:00
|
|
|
while(CURLM_CALL_MULTI_PERFORM == result);
|
2010-02-01 16:42:44 -05:00
|
|
|
|
2010-05-12 09:33:22 -04:00
|
|
|
if(easy->easy_handle->set.wildcardmatch) {
|
|
|
|
/* destruct wildcard structures if it is needed */
|
|
|
|
if(wc->state == CURLWC_DONE || result)
|
|
|
|
Curl_wildcard_dtor(wc);
|
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
if(result)
|
|
|
|
returncode = result;
|
|
|
|
|
|
|
|
easy = easy->next; /* operate on next handle */
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Simply remove all expired timers from the splay since handles are dealt
|
|
|
|
* with unconditionally by this function and curl_multi_timeout() requires
|
|
|
|
* that already passed/handled expire times are removed from the splay.
|
2010-07-12 13:19:31 -04:00
|
|
|
*
|
|
|
|
* It is important that the 'now' value is set at the entry of this function
|
|
|
|
* and not for the current time as it may have ticked a little while since
|
|
|
|
* then and then we risk this loop to remove timers that actually have not
|
|
|
|
* been handled!
|
2006-04-10 11:00:53 -04:00
|
|
|
*/
|
|
|
|
do {
|
2008-05-07 11:41:41 -04:00
|
|
|
multi->timetree = Curl_splaygetbest(now, multi->timetree, &t);
|
2010-08-30 18:08:45 -04:00
|
|
|
if(t)
|
|
|
|
/* the removed may have another timeout in queue */
|
|
|
|
(void)add_next_timeout(now, multi, t->payload);
|
2006-07-17 14:35:58 -04:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
} while(t);
|
|
|
|
|
2006-08-02 18:29:29 -04:00
|
|
|
*running_handles = multi->num_alive;
|
|
|
|
|
2011-04-22 17:01:30 -04:00
|
|
|
if(CURLM_OK >= returncode)
|
2006-10-12 04:36:47 -04:00
|
|
|
update_timer(multi);
|
2008-12-19 17:58:22 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
return returncode;
|
|
|
|
}
|
|
|
|
|
2001-11-28 11:00:18 -05:00
|
|
|
CURLMcode curl_multi_cleanup(CURLM *multi_handle)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
2002-04-27 18:21:51 -04:00
|
|
|
struct Curl_one_easy *easy;
|
|
|
|
struct Curl_one_easy *nexteasy;
|
2006-09-07 17:49:20 -04:00
|
|
|
int i;
|
|
|
|
struct closure *cl;
|
|
|
|
struct closure *n;
|
2002-04-27 18:21:51 -04:00
|
|
|
|
2001-11-28 11:00:18 -05:00
|
|
|
if(GOOD_MULTI_HANDLE(multi)) {
|
|
|
|
multi->type = 0; /* not good anymore */
|
2002-04-27 18:21:51 -04:00
|
|
|
Curl_hash_destroy(multi->hostcache);
|
2006-04-10 11:00:53 -04:00
|
|
|
Curl_hash_destroy(multi->sockhash);
|
2008-10-19 16:17:16 -04:00
|
|
|
multi->hostcache = NULL;
|
|
|
|
multi->sockhash = NULL;
|
2002-04-27 18:21:51 -04:00
|
|
|
|
2006-09-07 17:49:20 -04:00
|
|
|
/* go over all connections that have close actions */
|
|
|
|
for(i=0; i< multi->connc->num; i++) {
|
|
|
|
if(multi->connc->connects[i] &&
|
2011-03-14 17:22:22 -04:00
|
|
|
multi->connc->connects[i]->handler->flags & PROTOPT_CLOSEACTION) {
|
2011-04-02 18:07:32 -04:00
|
|
|
Curl_disconnect(multi->connc->connects[i], FALSE);
|
2006-09-28 17:26:06 -04:00
|
|
|
multi->connc->connects[i] = NULL;
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
}
|
|
|
|
/* now walk through the list of handles we kept around only to be
|
|
|
|
able to close connections "properly" */
|
|
|
|
cl = multi->closure;
|
|
|
|
while(cl) {
|
|
|
|
cl->easy_handle->state.shared_conn = NULL; /* no more shared */
|
2006-09-28 17:26:06 -04:00
|
|
|
if(cl->easy_handle->state.closed)
|
|
|
|
/* close handle only if curl_easy_cleanup() already has been called
|
|
|
|
for this easy handle */
|
|
|
|
Curl_close(cl->easy_handle);
|
2006-09-07 17:49:20 -04:00
|
|
|
n = cl->next;
|
|
|
|
free(cl);
|
|
|
|
cl= n;
|
|
|
|
}
|
|
|
|
|
|
|
|
Curl_rm_connc(multi->connc);
|
2011-10-11 13:41:30 -04:00
|
|
|
multi->connc = NULL;
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2010-08-08 18:01:36 -04:00
|
|
|
/* remove the pending list of messages */
|
|
|
|
Curl_llist_destroy(multi->msglist, NULL);
|
2011-10-07 14:50:57 -04:00
|
|
|
multi->msglist = NULL;
|
2010-08-08 18:01:36 -04:00
|
|
|
|
2001-11-28 11:00:18 -05:00
|
|
|
/* remove all easy handles */
|
2002-04-27 18:21:51 -04:00
|
|
|
easy = multi->easy.next;
|
2007-02-21 16:59:40 -05:00
|
|
|
while(easy != &multi->easy) {
|
2002-04-27 18:21:51 -04:00
|
|
|
nexteasy=easy->next;
|
2006-07-07 18:58:06 -04:00
|
|
|
if(easy->easy_handle->dns.hostcachetype == HCACHE_MULTI) {
|
|
|
|
/* clear out the usage of the shared DNS cache */
|
|
|
|
easy->easy_handle->dns.hostcache = NULL;
|
|
|
|
easy->easy_handle->dns.hostcachetype = HCACHE_NONE;
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
|
|
|
|
/* Clear the pointer to the connection cache */
|
|
|
|
easy->easy_handle->state.connc = NULL;
|
|
|
|
|
2005-01-10 06:42:20 -05:00
|
|
|
Curl_easy_addmulti(easy->easy_handle, NULL); /* clear the association */
|
2002-05-02 14:07:38 -04:00
|
|
|
|
2002-04-27 18:21:51 -04:00
|
|
|
free(easy);
|
|
|
|
easy = nexteasy;
|
|
|
|
}
|
|
|
|
|
2001-11-28 11:00:18 -05:00
|
|
|
free(multi);
|
|
|
|
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
}
|
2001-11-28 06:09:18 -05:00
|
|
|
|
2010-08-08 18:01:36 -04:00
|
|
|
/*
|
|
|
|
* curl_multi_info_read()
|
|
|
|
*
|
|
|
|
* This function is the primary way for a multi/multi_socket application to
|
|
|
|
* figure out if a transfer has ended. We MUST make this function as fast as
|
|
|
|
* possible as it will be polled frequently and we MUST NOT scan any lists in
|
|
|
|
* here to figure out things. We must scale fine to thousands of handles and
|
|
|
|
* beyond. The current design is fully O(1).
|
|
|
|
*/
|
|
|
|
|
2002-04-27 18:21:51 -04:00
|
|
|
CURLMsg *curl_multi_info_read(CURLM *multi_handle, int *msgs_in_queue)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
2010-08-08 18:01:36 -04:00
|
|
|
struct Curl_message *msg;
|
2002-04-27 18:21:51 -04:00
|
|
|
|
2003-08-20 09:49:46 -04:00
|
|
|
*msgs_in_queue = 0; /* default to none */
|
|
|
|
|
2010-08-08 18:01:36 -04:00
|
|
|
if(GOOD_MULTI_HANDLE(multi) && Curl_llist_count(multi->msglist)) {
|
|
|
|
/* there is one or more messages in the list */
|
|
|
|
struct curl_llist_element *e;
|
2004-05-17 02:53:41 -04:00
|
|
|
|
2010-08-08 18:01:36 -04:00
|
|
|
/* extract the head of the list to return */
|
|
|
|
e = multi->msglist->head;
|
2002-04-27 18:21:51 -04:00
|
|
|
|
2010-08-08 18:01:36 -04:00
|
|
|
msg = e->ptr;
|
|
|
|
|
|
|
|
/* remove the extracted entry */
|
|
|
|
Curl_llist_remove(multi->msglist, e, NULL);
|
2002-04-27 18:21:51 -04:00
|
|
|
|
2010-11-24 20:58:59 -05:00
|
|
|
*msgs_in_queue = curlx_uztosi(Curl_llist_count(multi->msglist));
|
2002-04-27 18:21:51 -04:00
|
|
|
|
2010-08-08 18:01:36 -04:00
|
|
|
return &msg->extmsg;
|
2002-04-27 18:21:51 -04:00
|
|
|
}
|
|
|
|
else
|
2002-05-03 08:40:37 -04:00
|
|
|
return NULL;
|
2002-04-27 18:21:51 -04:00
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
/*
|
2006-04-21 09:40:07 -04:00
|
|
|
* singlesocket() checks what sockets we deal with and their "action state"
|
|
|
|
* and if we have a different state in any of those sockets from last time we
|
|
|
|
* call the callback accordingly.
|
2006-04-10 11:00:53 -04:00
|
|
|
*/
|
|
|
|
static void singlesocket(struct Curl_multi *multi,
|
|
|
|
struct Curl_one_easy *easy)
|
|
|
|
{
|
2006-10-13 03:11:26 -04:00
|
|
|
curl_socket_t socks[MAX_SOCKSPEREASYHANDLE];
|
2006-04-10 11:00:53 -04:00
|
|
|
int i;
|
2006-09-10 18:15:32 -04:00
|
|
|
struct Curl_sh_entry *entry;
|
|
|
|
curl_socket_t s;
|
|
|
|
int num;
|
2006-10-13 03:11:26 -04:00
|
|
|
unsigned int curraction;
|
2008-12-20 17:03:22 -05:00
|
|
|
struct Curl_one_easy *easy_by_hash;
|
|
|
|
bool remove_sock_from_hash;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
for(i=0; i< MAX_SOCKSPEREASYHANDLE; i++)
|
2006-10-13 03:11:26 -04:00
|
|
|
socks[i] = CURL_SOCKET_BAD;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
/* Fill in the 'current' struct with the state as it is now: what sockets to
|
|
|
|
supervise and for what actions */
|
2006-10-13 03:11:26 -04:00
|
|
|
curraction = multi_getsock(easy, socks, MAX_SOCKSPEREASYHANDLE);
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
/* We have 0 .. N sockets already and we get to know about the 0 .. M
|
|
|
|
sockets we should have from now on. Detect the differences, remove no
|
|
|
|
longer supervised ones and add new ones */
|
2006-04-21 09:40:07 -04:00
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
/* walk over the sockets we got right now */
|
|
|
|
for(i=0; (i< MAX_SOCKSPEREASYHANDLE) &&
|
2006-10-13 03:11:26 -04:00
|
|
|
(curraction & (GETSOCK_READSOCK(i) | GETSOCK_WRITESOCK(i)));
|
2006-09-10 18:15:32 -04:00
|
|
|
i++) {
|
|
|
|
int action = CURL_POLL_NONE;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-10-13 03:11:26 -04:00
|
|
|
s = socks[i];
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
/* get it from the hash */
|
|
|
|
entry = Curl_hash_pick(multi->sockhash, (char *)&s, sizeof(s));
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-10-13 03:11:26 -04:00
|
|
|
if(curraction & GETSOCK_READSOCK(i))
|
2006-09-10 18:15:32 -04:00
|
|
|
action |= CURL_POLL_IN;
|
2006-10-13 03:11:26 -04:00
|
|
|
if(curraction & GETSOCK_WRITESOCK(i))
|
2006-09-10 18:15:32 -04:00
|
|
|
action |= CURL_POLL_OUT;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
if(entry) {
|
|
|
|
/* yeps, already present so check if it has the same action set */
|
|
|
|
if(entry->action == action)
|
|
|
|
/* same, continue */
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* this is a socket we didn't have before, add it! */
|
|
|
|
entry = sh_addentry(multi->sockhash, s, easy->easy_handle);
|
|
|
|
if(!entry)
|
|
|
|
/* fatal */
|
|
|
|
return;
|
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2010-06-02 17:11:59 -04:00
|
|
|
/* we know (entry != NULL) at this point, see the logic above */
|
2006-09-10 18:15:32 -04:00
|
|
|
multi->socket_cb(easy->easy_handle,
|
|
|
|
s,
|
|
|
|
action,
|
|
|
|
multi->socket_userp,
|
2010-06-02 17:11:59 -04:00
|
|
|
entry->socketp);
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
entry->action = action; /* store the current action state */
|
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-09-10 18:15:32 -04:00
|
|
|
num = i; /* number of sockets */
|
|
|
|
|
|
|
|
/* when we've walked over all the sockets we should have right now, we must
|
|
|
|
make sure to detect sockets that are removed */
|
|
|
|
for(i=0; i< easy->numsocks; i++) {
|
|
|
|
int j;
|
|
|
|
s = easy->sockets[i];
|
|
|
|
for(j=0; j<num; j++) {
|
2006-10-13 03:11:26 -04:00
|
|
|
if(s == socks[j]) {
|
2006-09-10 18:15:32 -04:00
|
|
|
/* this is still supervised */
|
|
|
|
s = CURL_SOCKET_BAD;
|
|
|
|
break;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
2006-09-10 18:15:32 -04:00
|
|
|
}
|
|
|
|
if(s != CURL_SOCKET_BAD) {
|
2008-12-20 17:03:22 -05:00
|
|
|
|
|
|
|
/* this socket has been removed. Tell the app to remove it */
|
|
|
|
remove_sock_from_hash = TRUE;
|
2006-09-10 18:15:32 -04:00
|
|
|
|
|
|
|
entry = Curl_hash_pick(multi->sockhash, (char *)&s, sizeof(s));
|
|
|
|
if(entry) {
|
2008-12-20 17:03:22 -05:00
|
|
|
/* check if the socket to be removed serves a connection which has
|
|
|
|
other easy-s in a pipeline. In this case the socket should not be
|
|
|
|
removed. */
|
|
|
|
struct connectdata *easy_conn;
|
|
|
|
|
|
|
|
easy_by_hash = entry->easy->multi_pos;
|
|
|
|
easy_conn = easy_by_hash->easy_conn;
|
|
|
|
if(easy_conn) {
|
2011-04-20 09:17:42 -04:00
|
|
|
if(easy_conn->recv_pipe && easy_conn->recv_pipe->size > 1) {
|
2008-12-20 17:03:22 -05:00
|
|
|
/* the handle should not be removed from the pipe yet */
|
|
|
|
remove_sock_from_hash = FALSE;
|
|
|
|
|
|
|
|
/* Update the sockhash entry to instead point to the next in line
|
|
|
|
for the recv_pipe, or the first (in case this particular easy
|
|
|
|
isn't already) */
|
2011-04-20 09:17:42 -04:00
|
|
|
if(entry->easy == easy->easy_handle) {
|
|
|
|
if(isHandleAtHead(easy->easy_handle, easy_conn->recv_pipe))
|
2008-12-20 17:03:22 -05:00
|
|
|
entry->easy = easy_conn->recv_pipe->head->next->ptr;
|
|
|
|
else
|
|
|
|
entry->easy = easy_conn->recv_pipe->head->ptr;
|
|
|
|
}
|
|
|
|
}
|
2011-04-20 09:17:42 -04:00
|
|
|
if(easy_conn->send_pipe && easy_conn->send_pipe->size > 1) {
|
2008-12-20 17:03:22 -05:00
|
|
|
/* the handle should not be removed from the pipe yet */
|
|
|
|
remove_sock_from_hash = FALSE;
|
|
|
|
|
|
|
|
/* Update the sockhash entry to instead point to the next in line
|
|
|
|
for the send_pipe, or the first (in case this particular easy
|
|
|
|
isn't already) */
|
2011-04-20 09:17:42 -04:00
|
|
|
if(entry->easy == easy->easy_handle) {
|
|
|
|
if(isHandleAtHead(easy->easy_handle, easy_conn->send_pipe))
|
2008-12-20 17:03:22 -05:00
|
|
|
entry->easy = easy_conn->send_pipe->head->next->ptr;
|
|
|
|
else
|
|
|
|
entry->easy = easy_conn->send_pipe->head->ptr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* Don't worry about overwriting recv_pipe head with send_pipe_head,
|
|
|
|
when action will be asked on the socket (see multi_socket()), the
|
|
|
|
head of the correct pipe will be taken according to the
|
|
|
|
action. */
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
2006-09-10 18:15:32 -04:00
|
|
|
/* just a precaution, this socket really SHOULD be in the hash already
|
|
|
|
but in case it isn't, we don't have to tell the app to remove it
|
|
|
|
either since it never got to know about it */
|
2008-12-20 17:03:22 -05:00
|
|
|
remove_sock_from_hash = FALSE;
|
|
|
|
|
2011-04-20 09:17:42 -04:00
|
|
|
if(remove_sock_from_hash) {
|
2006-04-10 11:00:53 -04:00
|
|
|
multi->socket_cb(easy->easy_handle,
|
|
|
|
s,
|
2006-09-10 18:15:32 -04:00
|
|
|
CURL_POLL_REMOVE,
|
2006-07-26 18:19:42 -04:00
|
|
|
multi->socket_userp,
|
2006-07-30 18:44:07 -04:00
|
|
|
entry ? entry->socketp : NULL);
|
2006-04-21 09:40:07 -04:00
|
|
|
sh_delentry(multi->sockhash, s);
|
2006-09-10 18:15:32 -04:00
|
|
|
}
|
2008-12-20 17:03:22 -05:00
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-10-13 03:11:26 -04:00
|
|
|
memcpy(easy->sockets, socks, num*sizeof(curl_socket_t));
|
2006-09-10 18:15:32 -04:00
|
|
|
easy->numsocks = num;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
|
2010-08-30 18:08:45 -04:00
|
|
|
/*
|
|
|
|
* add_next_timeout()
|
|
|
|
*
|
|
|
|
* Each SessionHandle has a list of timeouts. The add_next_timeout() is called
|
|
|
|
* when it has just been removed from the splay tree because the timeout has
|
|
|
|
* expired. This function is then to advance in the list to pick the next
|
|
|
|
* timeout to use (skip the already expired ones) and add this node back to
|
|
|
|
* the splay tree again.
|
|
|
|
*
|
|
|
|
* The splay tree only has each sessionhandle as a single node and the nearest
|
|
|
|
* timeout is used to sort it on.
|
|
|
|
*/
|
|
|
|
static CURLMcode add_next_timeout(struct timeval now,
|
|
|
|
struct Curl_multi *multi,
|
|
|
|
struct SessionHandle *d)
|
|
|
|
{
|
|
|
|
struct timeval *tv = &d->state.expiretime;
|
|
|
|
struct curl_llist *list = d->state.timeoutlist;
|
|
|
|
struct curl_llist_element *e;
|
|
|
|
|
|
|
|
/* move over the timeout list for this specific handle and remove all
|
|
|
|
timeouts that are now passed tense and store the next pending
|
|
|
|
timeout in *tv */
|
|
|
|
for(e = list->head; e; ) {
|
|
|
|
struct curl_llist_element *n = e->next;
|
|
|
|
long diff = curlx_tvdiff(*(struct timeval *)e->ptr, now);
|
|
|
|
if(diff <= 0)
|
|
|
|
/* remove outdated entry */
|
|
|
|
Curl_llist_remove(list, e, NULL);
|
|
|
|
else
|
|
|
|
/* the list is sorted so get out on the first mismatch */
|
|
|
|
break;
|
|
|
|
e = n;
|
|
|
|
}
|
|
|
|
if(!list->size) {
|
|
|
|
/* clear the expire times within the handles that we remove from the
|
|
|
|
splay tree */
|
|
|
|
tv->tv_sec = 0;
|
|
|
|
tv->tv_usec = 0;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
e = list->head;
|
|
|
|
/* copy the first entry to 'tv' */
|
|
|
|
memcpy(tv, e->ptr, sizeof(*tv));
|
|
|
|
|
|
|
|
/* remove first entry from list */
|
|
|
|
Curl_llist_remove(list, e, NULL);
|
|
|
|
|
|
|
|
/* insert this node again into the splay */
|
|
|
|
multi->timetree = Curl_splayinsert(*tv, multi->timetree,
|
|
|
|
&d->state.timenode);
|
|
|
|
}
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
static CURLMcode multi_socket(struct Curl_multi *multi,
|
|
|
|
bool checkall,
|
2006-07-30 18:44:07 -04:00
|
|
|
curl_socket_t s,
|
2007-04-16 12:34:08 -04:00
|
|
|
int ev_bitmask,
|
2006-07-30 18:44:07 -04:00
|
|
|
int *running_handles)
|
2006-04-10 11:00:53 -04:00
|
|
|
{
|
|
|
|
CURLMcode result = CURLM_OK;
|
|
|
|
struct SessionHandle *data = NULL;
|
|
|
|
struct Curl_tree *t;
|
2010-09-01 10:52:23 -04:00
|
|
|
struct timeval now = Curl_tvnow();
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
if(checkall) {
|
|
|
|
struct Curl_one_easy *easyp;
|
2006-08-02 18:29:29 -04:00
|
|
|
/* *perform() deals with running_handles on its own */
|
2006-07-30 18:44:07 -04:00
|
|
|
result = curl_multi_perform(multi, running_handles);
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
/* walk through each easy handle and do the socket state change magic
|
|
|
|
and callbacks */
|
|
|
|
easyp=multi->easy.next;
|
2007-02-21 16:59:40 -05:00
|
|
|
while(easyp != &multi->easy) {
|
2006-04-10 11:00:53 -04:00
|
|
|
singlesocket(multi, easyp);
|
|
|
|
easyp = easyp->next;
|
|
|
|
}
|
|
|
|
|
2006-04-21 09:40:07 -04:00
|
|
|
/* or should we fall-through and do the timer-based stuff? */
|
2006-04-10 11:00:53 -04:00
|
|
|
return result;
|
|
|
|
}
|
2007-11-05 04:45:09 -05:00
|
|
|
else if(s != CURL_SOCKET_TIMEOUT) {
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
struct Curl_sh_entry *entry =
|
|
|
|
Curl_hash_pick(multi->sockhash, (char *)&s, sizeof(s));
|
|
|
|
|
|
|
|
if(!entry)
|
2008-05-19 16:58:01 -04:00
|
|
|
/* Unmatched socket, we can't act on it but we ignore this fact. In
|
|
|
|
real-world tests it has been proved that libevent can in fact give
|
|
|
|
the application actions even though the socket was just previously
|
|
|
|
asked to get removed, so thus we better survive stray socket actions
|
|
|
|
and just move on. */
|
|
|
|
;
|
|
|
|
else {
|
|
|
|
data = entry->easy;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2008-05-19 16:58:01 -04:00
|
|
|
if(data->magic != CURLEASY_MAGIC_NUMBER)
|
|
|
|
/* bad bad bad bad bad bad bad */
|
|
|
|
return CURLM_INTERNAL_ERROR;
|
2006-09-10 18:15:32 -04:00
|
|
|
|
2008-12-20 17:03:22 -05:00
|
|
|
/* If the pipeline is enabled, take the handle which is in the head of
|
|
|
|
the pipeline. If we should write into the socket, take the send_pipe
|
|
|
|
head. If we should read from the socket, take the recv_pipe head. */
|
2011-04-02 17:44:11 -04:00
|
|
|
if(data->set.one_easy->easy_conn) {
|
2011-04-20 09:17:42 -04:00
|
|
|
if((ev_bitmask & CURL_POLL_OUT) &&
|
|
|
|
data->set.one_easy->easy_conn->send_pipe &&
|
|
|
|
data->set.one_easy->easy_conn->send_pipe->head)
|
2011-04-02 17:44:11 -04:00
|
|
|
data = data->set.one_easy->easy_conn->send_pipe->head->ptr;
|
2011-04-20 09:17:42 -04:00
|
|
|
else if((ev_bitmask & CURL_POLL_IN) &&
|
|
|
|
data->set.one_easy->easy_conn->recv_pipe &&
|
|
|
|
data->set.one_easy->easy_conn->recv_pipe->head)
|
2011-04-02 17:44:11 -04:00
|
|
|
data = data->set.one_easy->easy_conn->recv_pipe->head->ptr;
|
2008-12-20 17:03:22 -05:00
|
|
|
}
|
|
|
|
|
2011-04-02 18:07:32 -04:00
|
|
|
if(data->set.one_easy->easy_conn &&
|
|
|
|
!(data->set.one_easy->easy_conn->handler->flags & PROTOPT_DIRLOCK))
|
2011-03-13 18:21:03 -04:00
|
|
|
/* set socket event bitmask if they're not locked */
|
2011-04-02 17:44:11 -04:00
|
|
|
data->set.one_easy->easy_conn->cselect_bits = ev_bitmask;
|
2007-04-16 12:34:08 -04:00
|
|
|
|
2010-02-01 16:42:44 -05:00
|
|
|
do
|
2010-09-01 10:52:23 -04:00
|
|
|
result = multi_runsingle(multi, now, data->set.one_easy);
|
2011-04-20 09:17:42 -04:00
|
|
|
while(CURLM_CALL_MULTI_PERFORM == result);
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2011-04-02 18:07:32 -04:00
|
|
|
if(data->set.one_easy->easy_conn &&
|
|
|
|
!(data->set.one_easy->easy_conn->handler->flags & PROTOPT_DIRLOCK))
|
2011-03-13 18:21:03 -04:00
|
|
|
/* clear the bitmask only if not locked */
|
2011-04-02 17:44:11 -04:00
|
|
|
data->set.one_easy->easy_conn->cselect_bits = 0;
|
2007-04-16 12:34:08 -04:00
|
|
|
|
2008-05-19 16:58:01 -04:00
|
|
|
if(CURLM_OK >= result)
|
|
|
|
/* get the socket(s) and check if the state has been changed since
|
|
|
|
last */
|
|
|
|
singlesocket(multi, data->set.one_easy);
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2008-05-19 16:58:01 -04:00
|
|
|
/* Now we fall-through and do the timer-based stuff, since we don't want
|
|
|
|
to force the user to have to deal with timeouts as long as at least
|
|
|
|
one connection in fact has traffic. */
|
2006-08-04 10:39:19 -04:00
|
|
|
|
2008-05-19 16:58:01 -04:00
|
|
|
data = NULL; /* set data to NULL again to avoid calling
|
|
|
|
multi_runsingle() in case there's no need to */
|
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
|
2010-09-01 10:52:23 -04:00
|
|
|
now.tv_usec += 40000; /* compensate for bad precision timers that might've
|
|
|
|
triggered too early */
|
2010-11-28 14:49:40 -05:00
|
|
|
if(now.tv_usec >= 1000000) {
|
2010-09-01 10:52:23 -04:00
|
|
|
now.tv_sec++;
|
|
|
|
now.tv_usec -= 1000000;
|
|
|
|
}
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
/*
|
|
|
|
* The loop following here will go on as long as there are expire-times left
|
|
|
|
* to process in the splay and 'data' will be re-assigned for every expired
|
|
|
|
* handle we deal with.
|
|
|
|
*/
|
|
|
|
do {
|
|
|
|
/* the first loop lap 'data' can be NULL */
|
|
|
|
if(data) {
|
2010-02-01 16:42:44 -05:00
|
|
|
do
|
2010-09-01 10:52:23 -04:00
|
|
|
result = multi_runsingle(multi, now, data->set.one_easy);
|
2011-04-20 09:17:42 -04:00
|
|
|
while(CURLM_CALL_MULTI_PERFORM == result);
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2007-06-01 17:24:34 -04:00
|
|
|
if(CURLM_OK >= result)
|
2006-04-10 11:00:53 -04:00
|
|
|
/* get the socket(s) and check if the state has been changed since
|
|
|
|
last */
|
|
|
|
singlesocket(multi, data->set.one_easy);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Check if there's one (more) expired timer to deal with! This function
|
|
|
|
extracts a matching node if there is one */
|
|
|
|
|
2008-05-07 11:41:41 -04:00
|
|
|
multi->timetree = Curl_splaygetbest(now, multi->timetree, &t);
|
2010-09-01 10:52:23 -04:00
|
|
|
if(t) {
|
|
|
|
data = t->payload; /* assign this for next loop */
|
2010-08-30 18:08:45 -04:00
|
|
|
(void)add_next_timeout(now, multi, t->payload);
|
2010-09-01 10:52:23 -04:00
|
|
|
}
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
} while(t);
|
|
|
|
|
2006-08-02 18:29:29 -04:00
|
|
|
*running_handles = multi->num_alive;
|
2006-04-10 11:00:53 -04:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2008-03-18 04:14:37 -04:00
|
|
|
#undef curl_multi_setopt
|
2006-04-10 11:00:53 -04:00
|
|
|
CURLMcode curl_multi_setopt(CURLM *multi_handle,
|
|
|
|
CURLMoption option, ...)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
|
|
|
CURLMcode res = CURLM_OK;
|
|
|
|
va_list param;
|
|
|
|
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
|
|
|
va_start(param, option);
|
|
|
|
|
|
|
|
switch(option) {
|
|
|
|
case CURLMOPT_SOCKETFUNCTION:
|
|
|
|
multi->socket_cb = va_arg(param, curl_socket_callback);
|
|
|
|
break;
|
|
|
|
case CURLMOPT_SOCKETDATA:
|
|
|
|
multi->socket_userp = va_arg(param, void *);
|
|
|
|
break;
|
2006-09-07 17:49:20 -04:00
|
|
|
case CURLMOPT_PIPELINING:
|
2011-09-05 14:46:09 -04:00
|
|
|
multi->pipelining_enabled = (0 != va_arg(param, long)) ? TRUE : FALSE;
|
2006-09-07 17:49:20 -04:00
|
|
|
break;
|
2006-10-12 04:36:47 -04:00
|
|
|
case CURLMOPT_TIMERFUNCTION:
|
|
|
|
multi->timer_cb = va_arg(param, curl_multi_timer_callback);
|
|
|
|
break;
|
|
|
|
case CURLMOPT_TIMERDATA:
|
|
|
|
multi->timer_userp = va_arg(param, void *);
|
|
|
|
break;
|
2007-05-30 16:04:44 -04:00
|
|
|
case CURLMOPT_MAXCONNECTS:
|
|
|
|
multi->maxconnects = va_arg(param, long);
|
|
|
|
break;
|
2006-04-10 11:00:53 -04:00
|
|
|
default:
|
|
|
|
res = CURLM_UNKNOWN_OPTION;
|
2006-10-12 04:36:47 -04:00
|
|
|
break;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
va_end(param);
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2007-04-16 12:34:08 -04:00
|
|
|
/* we define curl_multi_socket() in the public multi.h header */
|
|
|
|
#undef curl_multi_socket
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2006-07-30 18:44:07 -04:00
|
|
|
CURLMcode curl_multi_socket(CURLM *multi_handle, curl_socket_t s,
|
|
|
|
int *running_handles)
|
2006-04-10 11:00:53 -04:00
|
|
|
{
|
2006-10-12 04:36:47 -04:00
|
|
|
CURLMcode result = multi_socket((struct Curl_multi *)multi_handle, FALSE, s,
|
2007-04-16 12:34:08 -04:00
|
|
|
0, running_handles);
|
2007-11-05 04:45:09 -05:00
|
|
|
if(CURLM_OK >= result)
|
2007-04-16 12:34:08 -04:00
|
|
|
update_timer((struct Curl_multi *)multi_handle);
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
|
|
|
CURLMcode curl_multi_socket_action(CURLM *multi_handle, curl_socket_t s,
|
2009-08-03 07:32:55 -04:00
|
|
|
int ev_bitmask, int *running_handles)
|
2007-04-16 12:34:08 -04:00
|
|
|
{
|
|
|
|
CURLMcode result = multi_socket((struct Curl_multi *)multi_handle, FALSE, s,
|
|
|
|
ev_bitmask, running_handles);
|
2007-11-05 04:45:09 -05:00
|
|
|
if(CURLM_OK >= result)
|
2006-10-12 04:36:47 -04:00
|
|
|
update_timer((struct Curl_multi *)multi_handle);
|
|
|
|
return result;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
|
2006-07-30 18:44:07 -04:00
|
|
|
CURLMcode curl_multi_socket_all(CURLM *multi_handle, int *running_handles)
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
{
|
2006-10-12 04:36:47 -04:00
|
|
|
CURLMcode result = multi_socket((struct Curl_multi *)multi_handle,
|
2007-04-16 12:34:08 -04:00
|
|
|
TRUE, CURL_SOCKET_BAD, 0, running_handles);
|
2007-11-05 04:45:09 -05:00
|
|
|
if(CURLM_OK >= result)
|
2006-10-12 04:36:47 -04:00
|
|
|
update_timer((struct Curl_multi *)multi_handle);
|
|
|
|
return result;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
|
2006-10-12 04:36:47 -04:00
|
|
|
static CURLMcode multi_timeout(struct Curl_multi *multi,
|
|
|
|
long *timeout_ms)
|
2006-04-10 11:00:53 -04:00
|
|
|
{
|
2008-05-07 11:41:41 -04:00
|
|
|
static struct timeval tv_zero = {0,0};
|
|
|
|
|
2006-04-10 11:00:53 -04:00
|
|
|
if(multi->timetree) {
|
|
|
|
/* we have a tree of expire times */
|
|
|
|
struct timeval now = Curl_tvnow();
|
|
|
|
|
|
|
|
/* splay the lowest to the bottom */
|
2008-05-07 11:41:41 -04:00
|
|
|
multi->timetree = Curl_splay(tv_zero, multi->timetree);
|
2006-04-10 11:00:53 -04:00
|
|
|
|
2008-12-19 17:58:22 -05:00
|
|
|
if(Curl_splaycomparekeys(multi->timetree->key, now) > 0) {
|
2008-05-07 11:41:41 -04:00
|
|
|
/* some time left before expiration */
|
|
|
|
*timeout_ms = curlx_tvdiff(multi->timetree->key, now);
|
2008-12-19 17:58:22 -05:00
|
|
|
if(!*timeout_ms)
|
|
|
|
/*
|
|
|
|
* Since we only provide millisecond resolution on the returned value
|
|
|
|
* and the diff might be less than one millisecond here, we don't
|
|
|
|
* return zero as that may cause short bursts of busyloops on fast
|
|
|
|
* processors while the diff is still present but less than one
|
|
|
|
* millisecond! instead we return 1 until the time is ripe.
|
|
|
|
*/
|
|
|
|
*timeout_ms=1;
|
|
|
|
}
|
2008-05-07 11:41:41 -04:00
|
|
|
else
|
2006-04-10 11:00:53 -04:00
|
|
|
/* 0 means immediately */
|
|
|
|
*timeout_ms = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
*timeout_ms = -1;
|
|
|
|
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
|
2006-10-12 04:36:47 -04:00
|
|
|
CURLMcode curl_multi_timeout(CURLM *multi_handle,
|
|
|
|
long *timeout_ms)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
|
|
|
|
|
|
|
/* First, make some basic checks that the CURLM handle is a good handle */
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
|
|
|
return multi_timeout(multi, timeout_ms);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Tell the application it should update its timers, if it subscribes to the
|
|
|
|
* update timer callback.
|
|
|
|
*/
|
|
|
|
static int update_timer(struct Curl_multi *multi)
|
|
|
|
{
|
|
|
|
long timeout_ms;
|
2010-09-01 10:52:23 -04:00
|
|
|
|
2007-11-05 04:45:09 -05:00
|
|
|
if(!multi->timer_cb)
|
2006-10-12 04:36:47 -04:00
|
|
|
return 0;
|
2010-09-01 10:52:23 -04:00
|
|
|
if(multi_timeout(multi, &timeout_ms)) {
|
2006-10-12 04:36:47 -04:00
|
|
|
return -1;
|
2010-09-01 10:52:23 -04:00
|
|
|
}
|
2011-04-22 17:01:30 -04:00
|
|
|
if(timeout_ms < 0) {
|
2010-09-01 10:52:23 -04:00
|
|
|
static const struct timeval none={0,0};
|
|
|
|
if(Curl_splaycomparekeys(none, multi->timer_lastcall)) {
|
|
|
|
multi->timer_lastcall = none;
|
|
|
|
/* there's no timeout now but there was one previously, tell the app to
|
|
|
|
disable it */
|
|
|
|
return multi->timer_cb((CURLM*)multi, -1, multi->timer_userp);
|
|
|
|
}
|
2006-10-12 04:36:47 -04:00
|
|
|
return 0;
|
2010-09-01 10:52:23 -04:00
|
|
|
}
|
2006-10-12 04:36:47 -04:00
|
|
|
|
|
|
|
/* When multi_timeout() is done, multi->timetree points to the node with the
|
|
|
|
* timeout we got the (relative) time-out time for. We can thus easily check
|
|
|
|
* if this is the same (fixed) time as we got in a previous call and then
|
|
|
|
* avoid calling the callback again. */
|
2008-05-07 11:41:41 -04:00
|
|
|
if(Curl_splaycomparekeys(multi->timetree->key, multi->timer_lastcall) == 0)
|
2006-10-12 04:36:47 -04:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
multi->timer_lastcall = multi->timetree->key;
|
|
|
|
|
|
|
|
return multi->timer_cb((CURLM*)multi, timeout_ms, multi->timer_userp);
|
|
|
|
}
|
|
|
|
|
2008-01-16 07:24:00 -05:00
|
|
|
static CURLcode addHandleToSendOrPendPipeline(struct SessionHandle *handle,
|
|
|
|
struct connectdata *conn)
|
|
|
|
{
|
|
|
|
size_t pipeLen = conn->send_pipe->size + conn->recv_pipe->size;
|
2010-06-17 09:46:27 -04:00
|
|
|
struct curl_llist_element *sendhead = conn->send_pipe->head;
|
2008-01-16 07:24:00 -05:00
|
|
|
struct curl_llist *pipeline;
|
2010-06-17 09:46:27 -04:00
|
|
|
CURLcode rc;
|
2008-01-16 07:24:00 -05:00
|
|
|
|
|
|
|
if(!Curl_isPipeliningEnabled(handle) ||
|
|
|
|
pipeLen == 0)
|
|
|
|
pipeline = conn->send_pipe;
|
|
|
|
else {
|
|
|
|
if(conn->server_supports_pipelining &&
|
|
|
|
pipeLen < MAX_PIPELINE_LENGTH)
|
|
|
|
pipeline = conn->send_pipe;
|
|
|
|
else
|
|
|
|
pipeline = conn->pend_pipe;
|
|
|
|
}
|
|
|
|
|
2010-06-17 09:46:27 -04:00
|
|
|
rc = Curl_addHandleToPipeline(handle, pipeline);
|
|
|
|
|
2011-04-20 09:17:42 -04:00
|
|
|
if(pipeline == conn->send_pipe && sendhead != conn->send_pipe->head) {
|
|
|
|
/* this is a new one as head, expire it */
|
|
|
|
conn->writechannel_inuse = FALSE; /* not in use yet */
|
2010-12-22 09:29:21 -05:00
|
|
|
#ifdef DEBUGBUILD
|
2011-04-20 09:17:42 -04:00
|
|
|
infof(conn->data, "%p is at send pipe head!\n",
|
|
|
|
conn->send_pipe->head->ptr);
|
2010-12-22 09:29:21 -05:00
|
|
|
#endif
|
2011-04-20 09:17:42 -04:00
|
|
|
Curl_expire(conn->send_pipe->head->ptr, 1);
|
2010-06-17 09:46:27 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
return rc;
|
2008-01-16 07:24:00 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
static int checkPendPipeline(struct connectdata *conn)
|
|
|
|
{
|
|
|
|
int result = 0;
|
2008-05-28 16:56:19 -04:00
|
|
|
struct curl_llist_element *sendhead = conn->send_pipe->head;
|
2008-01-16 07:24:00 -05:00
|
|
|
|
2008-09-08 08:15:09 -04:00
|
|
|
size_t pipeLen = conn->send_pipe->size + conn->recv_pipe->size;
|
2011-04-20 09:17:42 -04:00
|
|
|
if(conn->server_supports_pipelining || pipeLen == 0) {
|
2008-01-16 07:24:00 -05:00
|
|
|
struct curl_llist_element *curr = conn->pend_pipe->head;
|
2008-09-08 08:15:09 -04:00
|
|
|
const size_t maxPipeLen =
|
|
|
|
conn->server_supports_pipelining ? MAX_PIPELINE_LENGTH : 1;
|
2008-01-16 07:24:00 -05:00
|
|
|
|
2008-09-08 08:15:09 -04:00
|
|
|
while(pipeLen < maxPipeLen && curr) {
|
2008-01-16 07:24:00 -05:00
|
|
|
Curl_llist_move(conn->pend_pipe, curr,
|
|
|
|
conn->send_pipe, conn->send_pipe->tail);
|
2008-06-13 17:16:10 -04:00
|
|
|
Curl_pgrsTime(curr->ptr, TIMER_PRETRANSFER);
|
2008-01-16 07:24:00 -05:00
|
|
|
++result; /* count how many handles we moved */
|
|
|
|
curr = conn->pend_pipe->head;
|
|
|
|
++pipeLen;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-20 09:17:42 -04:00
|
|
|
if(result) {
|
2008-09-08 08:15:09 -04:00
|
|
|
conn->now = Curl_tvnow();
|
2008-05-28 16:56:19 -04:00
|
|
|
/* something moved, check for a new send pipeline leader */
|
|
|
|
if(sendhead != conn->send_pipe->head) {
|
|
|
|
/* this is a new one as head, expire it */
|
|
|
|
conn->writechannel_inuse = FALSE; /* not in use yet */
|
2010-12-22 09:29:21 -05:00
|
|
|
#ifdef DEBUGBUILD
|
2008-05-28 16:56:19 -04:00
|
|
|
infof(conn->data, "%p is at send pipe head!\n",
|
|
|
|
conn->send_pipe->head->ptr);
|
2010-12-22 09:29:21 -05:00
|
|
|
#endif
|
2008-05-28 16:56:19 -04:00
|
|
|
Curl_expire(conn->send_pipe->head->ptr, 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-16 07:24:00 -05:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2008-05-28 16:56:19 -04:00
|
|
|
/* Move this transfer from the sending list to the receiving list.
|
|
|
|
|
|
|
|
Pay special attention to the new sending list "leader" as it needs to get
|
|
|
|
checked to update what sockets it acts on.
|
|
|
|
|
2009-08-03 07:32:55 -04:00
|
|
|
*/
|
2008-05-28 16:56:19 -04:00
|
|
|
static void moveHandleFromSendToRecvPipeline(struct SessionHandle *handle,
|
2009-08-03 07:32:55 -04:00
|
|
|
struct connectdata *conn)
|
2008-01-16 07:24:00 -05:00
|
|
|
{
|
|
|
|
struct curl_llist_element *curr;
|
|
|
|
|
|
|
|
curr = conn->send_pipe->head;
|
|
|
|
while(curr) {
|
|
|
|
if(curr->ptr == handle) {
|
|
|
|
Curl_llist_move(conn->send_pipe, curr,
|
|
|
|
conn->recv_pipe, conn->recv_pipe->tail);
|
2008-05-28 16:56:19 -04:00
|
|
|
|
|
|
|
if(conn->send_pipe->head) {
|
|
|
|
/* Since there's a new easy handle at the start of the send pipeline,
|
|
|
|
set its timeout value to 1ms to make it trigger instantly */
|
|
|
|
conn->writechannel_inuse = FALSE; /* not used now */
|
2010-12-22 09:29:21 -05:00
|
|
|
#ifdef DEBUGBUILD
|
2008-05-28 16:56:19 -04:00
|
|
|
infof(conn->data, "%p is at send pipe head B!\n",
|
|
|
|
conn->send_pipe->head->ptr);
|
2010-12-22 09:29:21 -05:00
|
|
|
#endif
|
2008-05-28 16:56:19 -04:00
|
|
|
Curl_expire(conn->send_pipe->head->ptr, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* The receiver's list is not really interesting here since either this
|
|
|
|
handle is now first in the list and we'll deal with it soon, or
|
|
|
|
another handle is already first and thus is already taken care of */
|
|
|
|
|
|
|
|
break; /* we're done! */
|
2008-01-16 07:24:00 -05:00
|
|
|
}
|
|
|
|
curr = curr->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-08-21 03:11:20 -04:00
|
|
|
static void moveHandleFromRecvToDonePipeline(struct SessionHandle *handle,
|
|
|
|
struct connectdata *conn)
|
|
|
|
{
|
|
|
|
struct curl_llist_element *curr;
|
|
|
|
|
|
|
|
curr = conn->recv_pipe->head;
|
|
|
|
while(curr) {
|
|
|
|
if(curr->ptr == handle) {
|
|
|
|
Curl_llist_move(conn->recv_pipe, curr,
|
|
|
|
conn->done_pipe, conn->done_pipe->tail);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
curr = curr->next;
|
|
|
|
}
|
|
|
|
}
|
2008-01-16 07:24:00 -05:00
|
|
|
static bool isHandleAtHead(struct SessionHandle *handle,
|
|
|
|
struct curl_llist *pipeline)
|
|
|
|
{
|
|
|
|
struct curl_llist_element *curr = pipeline->head;
|
|
|
|
if(curr)
|
2011-09-05 14:46:09 -04:00
|
|
|
return (curr->ptr == handle) ? TRUE : FALSE;
|
2008-01-16 07:24:00 -05:00
|
|
|
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
2010-08-10 05:02:07 -04:00
|
|
|
/*
|
|
|
|
* multi_freetimeout()
|
|
|
|
*
|
|
|
|
* Callback used by the llist system when a single timeout list entry is
|
|
|
|
* destroyed.
|
|
|
|
*/
|
|
|
|
static void multi_freetimeout(void *user, void *entryptr)
|
|
|
|
{
|
|
|
|
(void)user;
|
|
|
|
|
|
|
|
/* the entry was plain malloc()'ed */
|
|
|
|
free(entryptr);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* multi_addtimeout()
|
|
|
|
*
|
|
|
|
* Add a timestamp to the list of timeouts. Keep the list sorted so that head
|
|
|
|
* of list is always the timeout nearest in time.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
static CURLMcode
|
|
|
|
multi_addtimeout(struct curl_llist *timeoutlist,
|
|
|
|
struct timeval *stamp)
|
|
|
|
{
|
|
|
|
struct curl_llist_element *e;
|
|
|
|
struct timeval *timedup;
|
|
|
|
struct curl_llist_element *prev = NULL;
|
|
|
|
|
|
|
|
timedup = malloc(sizeof(*timedup));
|
|
|
|
if(!timedup)
|
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
|
|
|
|
/* copy the timestamp */
|
|
|
|
memcpy(timedup, stamp, sizeof(*timedup));
|
|
|
|
|
|
|
|
if(Curl_llist_count(timeoutlist)) {
|
|
|
|
/* find the correct spot in the list */
|
|
|
|
for(e = timeoutlist->head; e; e = e->next) {
|
|
|
|
struct timeval *checktime = e->ptr;
|
|
|
|
long diff = curlx_tvdiff(*checktime, *timedup);
|
|
|
|
if(diff > 0)
|
|
|
|
break;
|
|
|
|
prev = e;
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
/* else
|
|
|
|
this is the first timeout on the list */
|
|
|
|
|
2010-08-19 02:08:18 -04:00
|
|
|
if(!Curl_llist_insert_next(timeoutlist, prev, timedup)) {
|
|
|
|
free(timedup);
|
2010-08-10 05:02:07 -04:00
|
|
|
return CURLM_OUT_OF_MEMORY;
|
2010-08-19 02:08:18 -04:00
|
|
|
}
|
2010-08-10 05:02:07 -04:00
|
|
|
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
2008-12-19 16:14:52 -05:00
|
|
|
|
2010-08-10 05:02:07 -04:00
|
|
|
/*
|
|
|
|
* Curl_expire()
|
|
|
|
*
|
|
|
|
* given a number of milliseconds from now to use to set the 'act before
|
|
|
|
* this'-time for the transfer, to be extracted by curl_multi_timeout()
|
|
|
|
*
|
|
|
|
* Note that the timeout will be added to a queue of timeouts if it defines a
|
|
|
|
* moment in time that is later than the current head of queue.
|
|
|
|
*
|
|
|
|
* Pass zero to clear all timeout values for this handle.
|
2008-12-19 16:14:52 -05:00
|
|
|
*/
|
2006-04-10 11:00:53 -04:00
|
|
|
void Curl_expire(struct SessionHandle *data, long milli)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi = data->multi;
|
|
|
|
struct timeval *nowp = &data->state.expiretime;
|
2006-05-27 18:26:16 -04:00
|
|
|
int rc;
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
/* this is only interesting for multi-interface using libcurl, and only
|
|
|
|
while there is still a multi interface struct remaining! */
|
|
|
|
if(!multi)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if(!milli) {
|
|
|
|
/* No timeout, clear the time data. */
|
2008-05-07 11:41:41 -04:00
|
|
|
if(nowp->tv_sec || nowp->tv_usec) {
|
2006-04-10 11:00:53 -04:00
|
|
|
/* Since this is an cleared time, we must remove the previous entry from
|
|
|
|
the splay tree */
|
2010-08-10 05:02:07 -04:00
|
|
|
struct curl_llist *list = data->state.timeoutlist;
|
|
|
|
|
2006-05-27 18:26:16 -04:00
|
|
|
rc = Curl_splayremovebyaddr(multi->timetree,
|
|
|
|
&data->state.timenode,
|
|
|
|
&multi->timetree);
|
|
|
|
if(rc)
|
|
|
|
infof(data, "Internal error clearing splay node = %d\n", rc);
|
2010-08-10 05:02:07 -04:00
|
|
|
|
|
|
|
/* flush the timeout list too */
|
|
|
|
while(list->size > 0)
|
|
|
|
Curl_llist_remove(list, list->tail, NULL);
|
|
|
|
|
2010-12-22 09:29:21 -05:00
|
|
|
#ifdef DEBUGBUILD
|
2006-04-10 11:00:53 -04:00
|
|
|
infof(data, "Expire cleared\n");
|
2010-12-22 09:29:21 -05:00
|
|
|
#endif
|
2006-07-13 14:44:24 -04:00
|
|
|
nowp->tv_sec = 0;
|
2006-07-13 14:57:34 -04:00
|
|
|
nowp->tv_usec = 0;
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
struct timeval set;
|
|
|
|
|
|
|
|
set = Curl_tvnow();
|
|
|
|
set.tv_sec += milli/1000;
|
|
|
|
set.tv_usec += (milli%1000)*1000;
|
|
|
|
|
2010-11-28 14:49:40 -05:00
|
|
|
if(set.tv_usec >= 1000000) {
|
2006-04-10 11:00:53 -04:00
|
|
|
set.tv_sec++;
|
|
|
|
set.tv_usec -= 1000000;
|
|
|
|
}
|
|
|
|
|
2008-05-07 11:41:41 -04:00
|
|
|
if(nowp->tv_sec || nowp->tv_usec) {
|
2006-05-27 18:26:16 -04:00
|
|
|
/* This means that the struct is added as a node in the splay tree.
|
|
|
|
Compare if the new time is earlier, and only remove-old/add-new if it
|
|
|
|
is. */
|
2006-04-10 11:00:53 -04:00
|
|
|
long diff = curlx_tvdiff(set, *nowp);
|
2010-08-10 05:02:07 -04:00
|
|
|
if(diff > 0) {
|
|
|
|
/* the new expire time was later so just add it to the queue
|
|
|
|
and get out */
|
|
|
|
multi_addtimeout(data->state.timeoutlist, &set);
|
2006-04-10 11:00:53 -04:00
|
|
|
return;
|
2010-08-10 05:02:07 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* the new time is newer than the presently set one, so add the current
|
|
|
|
to the queue and update the head */
|
|
|
|
multi_addtimeout(data->state.timeoutlist, nowp);
|
2006-04-10 11:00:53 -04:00
|
|
|
|
|
|
|
/* Since this is an updated time, we must remove the previous entry from
|
|
|
|
the splay tree first and then re-add the new value */
|
2006-05-27 18:26:16 -04:00
|
|
|
rc = Curl_splayremovebyaddr(multi->timetree,
|
|
|
|
&data->state.timenode,
|
|
|
|
&multi->timetree);
|
|
|
|
if(rc)
|
|
|
|
infof(data, "Internal error removing splay node = %d\n", rc);
|
2006-04-10 11:00:53 -04:00
|
|
|
}
|
|
|
|
|
|
|
|
*nowp = set;
|
|
|
|
data->state.timenode.payload = data;
|
2008-05-07 11:41:41 -04:00
|
|
|
multi->timetree = Curl_splayinsert(*nowp,
|
2006-04-10 11:00:53 -04:00
|
|
|
multi->timetree,
|
|
|
|
&data->state.timenode);
|
|
|
|
}
|
|
|
|
#if 0
|
|
|
|
Curl_splayprint(multi->timetree, 0, TRUE);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2006-07-26 18:19:42 -04:00
|
|
|
CURLMcode curl_multi_assign(CURLM *multi_handle,
|
|
|
|
curl_socket_t s, void *hashp)
|
|
|
|
{
|
|
|
|
struct Curl_sh_entry *there = NULL;
|
|
|
|
struct Curl_multi *multi = (struct Curl_multi *)multi_handle;
|
|
|
|
|
|
|
|
if(s != CURL_SOCKET_BAD)
|
|
|
|
there = Curl_hash_pick(multi->sockhash, (char *)&s, sizeof(curl_socket_t));
|
|
|
|
|
|
|
|
if(!there)
|
|
|
|
return CURLM_BAD_SOCKET;
|
|
|
|
|
|
|
|
there->socketp = hashp;
|
|
|
|
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2010-03-15 18:40:42 -04:00
|
|
|
static void multi_connc_remove_handle(struct Curl_multi *multi,
|
2009-12-10 15:20:15 -05:00
|
|
|
struct SessionHandle *data)
|
2006-09-07 17:49:20 -04:00
|
|
|
{
|
2009-12-10 15:20:15 -05:00
|
|
|
/* a connection in the connection cache pointing to the given 'data' ? */
|
2006-09-07 17:49:20 -04:00
|
|
|
int i;
|
|
|
|
|
|
|
|
for(i=0; i< multi->connc->num; i++) {
|
2010-03-15 18:40:42 -04:00
|
|
|
struct connectdata * conn = multi->connc->connects[i];
|
|
|
|
|
|
|
|
if(conn && conn->data == data) {
|
|
|
|
/* If this easy_handle was the last one in charge for one or more
|
|
|
|
connections in the shared connection cache, we might need to keep
|
|
|
|
this handle around until either A) the connection is closed and
|
|
|
|
killed properly, or B) another easy_handle uses the connection.
|
|
|
|
|
|
|
|
The reason why we need to have a easy_handle associated with a live
|
|
|
|
connection is simply that some connections will need a handle to get
|
|
|
|
closed down properly. Currently, the only connections that need to
|
|
|
|
keep a easy_handle handle around are using FTP(S). Such connections
|
|
|
|
have the PROT_CLOSEACTION bit set.
|
|
|
|
|
|
|
|
Thus, we need to check for all connections in the shared cache that
|
|
|
|
points to this handle and are using PROT_CLOSEACTION. If there's any,
|
|
|
|
we need to add this handle to the list of "easy handles kept around
|
|
|
|
for nice connection closures".
|
|
|
|
*/
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2011-03-14 17:22:22 -04:00
|
|
|
if(conn->handler->flags & PROTOPT_CLOSEACTION) {
|
2010-03-15 18:40:42 -04:00
|
|
|
/* this handle is still being used by a shared connection and
|
|
|
|
thus we leave it around for now */
|
|
|
|
if(add_closure(multi, data) == CURLM_OK)
|
|
|
|
data->state.shared_conn = multi;
|
|
|
|
else {
|
|
|
|
/* out of memory - so much for graceful shutdown */
|
2010-11-19 07:43:20 -05:00
|
|
|
Curl_disconnect(conn, /* dead_connection */ FALSE);
|
2010-03-15 18:40:42 -04:00
|
|
|
multi->connc->connects[i] = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
/* disconect the easy handle from the connection since the connection
|
|
|
|
will now remain but this easy handle is going */
|
|
|
|
conn->data = NULL;
|
|
|
|
}
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
}
|
|
|
|
|
2006-10-04 17:11:08 -04:00
|
|
|
/* Add the given data pointer to the list of 'closure handles' that are kept
|
|
|
|
around only to be able to close some connections nicely - just make sure
|
|
|
|
that this handle isn't already added, like for the cases when an easy
|
|
|
|
handle is removed, added and removed again... */
|
2010-03-15 18:40:42 -04:00
|
|
|
static CURLMcode add_closure(struct Curl_multi *multi,
|
|
|
|
struct SessionHandle *data)
|
2006-09-07 17:49:20 -04:00
|
|
|
{
|
2010-03-15 18:40:42 -04:00
|
|
|
struct closure *cl = multi->closure;
|
|
|
|
struct closure *p = NULL;
|
|
|
|
bool add = TRUE;
|
2006-09-07 17:49:20 -04:00
|
|
|
|
2010-03-15 18:40:42 -04:00
|
|
|
/* Before adding, scan through all the other currently kept handles and see
|
|
|
|
if there are any connections still referring to them and kill them if
|
|
|
|
not. */
|
2006-09-07 17:49:20 -04:00
|
|
|
while(cl) {
|
2010-03-15 18:40:42 -04:00
|
|
|
struct closure *n;
|
2006-09-07 17:49:20 -04:00
|
|
|
bool inuse = FALSE;
|
2010-03-15 18:40:42 -04:00
|
|
|
int i;
|
|
|
|
|
2006-09-07 17:49:20 -04:00
|
|
|
for(i=0; i< multi->connc->num; i++) {
|
|
|
|
if(multi->connc->connects[i] &&
|
|
|
|
(multi->connc->connects[i]->data == cl->easy_handle)) {
|
|
|
|
inuse = TRUE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
n = cl->next;
|
|
|
|
|
|
|
|
if(!inuse) {
|
|
|
|
/* cl->easy_handle is now killable */
|
2010-03-23 08:18:30 -04:00
|
|
|
|
2006-09-07 17:49:20 -04:00
|
|
|
/* unmark it as not having a connection around that uses it anymore */
|
|
|
|
cl->easy_handle->state.shared_conn= NULL;
|
2010-03-23 08:18:30 -04:00
|
|
|
|
|
|
|
if(cl->easy_handle->state.closed) {
|
|
|
|
infof(data, "Delayed kill of easy handle %p\n", cl->easy_handle);
|
|
|
|
/* close handle only if curl_easy_cleanup() already has been called
|
|
|
|
for this easy handle */
|
|
|
|
Curl_close(cl->easy_handle);
|
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
if(p)
|
|
|
|
p->next = n;
|
|
|
|
else
|
|
|
|
multi->closure = n;
|
|
|
|
free(cl);
|
2011-04-20 09:17:42 -04:00
|
|
|
}
|
|
|
|
else {
|
2010-03-15 18:40:42 -04:00
|
|
|
if(cl->easy_handle == data)
|
|
|
|
add = FALSE;
|
|
|
|
|
2006-09-07 17:49:20 -04:00
|
|
|
p = cl;
|
2010-03-15 18:40:42 -04:00
|
|
|
}
|
2006-09-07 17:49:20 -04:00
|
|
|
|
|
|
|
cl = n;
|
|
|
|
}
|
|
|
|
|
2011-04-20 09:17:42 -04:00
|
|
|
if(add) {
|
2010-03-15 18:40:42 -04:00
|
|
|
cl = calloc(1, sizeof(struct closure));
|
|
|
|
if(!cl)
|
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
|
|
|
|
cl->easy_handle = data;
|
|
|
|
cl->next = multi->closure;
|
|
|
|
multi->closure = cl;
|
|
|
|
}
|
|
|
|
|
|
|
|
return CURLM_OK;
|
2006-09-07 17:49:20 -04:00
|
|
|
}
|
2006-10-13 03:11:26 -04:00
|
|
|
|
2009-06-09 22:49:42 -04:00
|
|
|
#ifdef DEBUGBUILD
|
2008-09-13 11:59:14 -04:00
|
|
|
void Curl_multi_dump(const struct Curl_multi *multi_handle)
|
2006-10-13 03:11:26 -04:00
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
|
|
|
struct Curl_one_easy *easy;
|
|
|
|
int i;
|
|
|
|
fprintf(stderr, "* Multi status: %d handles, %d alive\n",
|
|
|
|
multi->num_easy, multi->num_alive);
|
2007-03-25 04:16:16 -04:00
|
|
|
for(easy=multi->easy.next; easy != &multi->easy; easy = easy->next) {
|
2010-08-18 13:59:46 -04:00
|
|
|
if(easy->state < CURLM_STATE_COMPLETED) {
|
2006-10-13 03:11:26 -04:00
|
|
|
/* only display handles that are not completed */
|
|
|
|
fprintf(stderr, "handle %p, state %s, %d sockets\n",
|
2006-10-13 10:54:36 -04:00
|
|
|
(void *)easy->easy_handle,
|
|
|
|
statename[easy->state], easy->numsocks);
|
2006-10-13 03:11:26 -04:00
|
|
|
for(i=0; i < easy->numsocks; i++) {
|
|
|
|
curl_socket_t s = easy->sockets[i];
|
|
|
|
struct Curl_sh_entry *entry =
|
|
|
|
Curl_hash_pick(multi->sockhash, (char *)&s, sizeof(s));
|
|
|
|
|
|
|
|
fprintf(stderr, "%d ", (int)s);
|
|
|
|
if(!entry) {
|
|
|
|
fprintf(stderr, "INTERNAL CONFUSION\n");
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
fprintf(stderr, "[%s %s] ",
|
|
|
|
entry->action&CURL_POLL_IN?"RECVING":"",
|
|
|
|
entry->action&CURL_POLL_OUT?"SENDING":"");
|
|
|
|
}
|
|
|
|
if(easy->numsocks)
|
|
|
|
fprintf(stderr, "\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|