2002-09-03 13:52:59 +02:00
|
|
|
/***************************************************************************
|
2004-05-17 08:53:41 +02:00
|
|
|
* _ _ ____ _
|
|
|
|
* Project ___| | | | _ \| |
|
|
|
|
* / __| | | | |_) | |
|
|
|
|
* | (__| |_| | _ <| |___
|
2001-11-28 12:09:18 +01:00
|
|
|
* \___|\___/|_| \_\_____|
|
|
|
|
*
|
2014-01-02 23:24:26 +01:00
|
|
|
* Copyright (C) 1998 - 2014, Daniel Stenberg, <daniel@haxx.se>, et al.
|
2001-11-28 12:09:18 +01:00
|
|
|
*
|
2002-09-03 13:52:59 +02:00
|
|
|
* This software is licensed as described in the file COPYING, which
|
|
|
|
* you should have received as part of this distribution. The terms
|
|
|
|
* are also available at http://curl.haxx.se/docs/copyright.html.
|
2004-05-17 08:53:41 +02:00
|
|
|
*
|
2001-11-28 12:09:18 +01:00
|
|
|
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
|
|
|
* copies of the Software, and permit persons to whom the Software is
|
2002-09-03 13:52:59 +02:00
|
|
|
* furnished to do so, under the terms of the COPYING file.
|
2001-11-28 12:09:18 +01:00
|
|
|
*
|
|
|
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
|
|
* KIND, either express or implied.
|
|
|
|
*
|
2002-09-03 13:52:59 +02:00
|
|
|
***************************************************************************/
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2013-01-06 19:06:49 +01:00
|
|
|
#include "curl_setup.h"
|
2007-02-26 05:24:26 +01:00
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
#include <curl/curl.h>
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2013-01-04 02:50:28 +01:00
|
|
|
#include "urldata.h"
|
|
|
|
#include "transfer.h"
|
|
|
|
#include "url.h"
|
|
|
|
#include "connect.h"
|
|
|
|
#include "progress.h"
|
|
|
|
#include "easyif.h"
|
2014-08-20 23:31:53 +02:00
|
|
|
#include "share.h"
|
2013-01-04 02:50:28 +01:00
|
|
|
#include "multiif.h"
|
|
|
|
#include "sendf.h"
|
|
|
|
#include "timeval.h"
|
|
|
|
#include "http.h"
|
|
|
|
#include "select.h"
|
|
|
|
#include "warnless.h"
|
|
|
|
#include "speedcheck.h"
|
|
|
|
#include "conncache.h"
|
|
|
|
#include "bundles.h"
|
2013-01-17 12:59:23 +01:00
|
|
|
#include "multihandle.h"
|
2013-02-15 11:50:45 +01:00
|
|
|
#include "pipeline.h"
|
2013-11-25 15:43:21 +01:00
|
|
|
#include "sigpipe.h"
|
2002-01-03 16:01:22 +01:00
|
|
|
|
2008-10-25 18:15:21 +02:00
|
|
|
#define _MPRINTF_REPLACE /* use our functions only */
|
|
|
|
#include <curl/mprintf.h>
|
|
|
|
|
2009-04-21 13:46:16 +02:00
|
|
|
#include "curl_memory.h"
|
2002-04-28 00:21:51 +02:00
|
|
|
/* The last #include file should be: */
|
2013-01-04 02:50:28 +01:00
|
|
|
#include "memdebug.h"
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2007-06-26 23:09:28 +02: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
|
|
|
|
|
2013-04-26 22:23:08 +02:00
|
|
|
#define CURL_CONNECTION_HASH_SIZE 97
|
2001-11-28 12:09:18 +01:00
|
|
|
|
|
|
|
#define CURL_MULTI_HANDLE 0x000bab1e
|
|
|
|
|
2006-02-23 13:20:48 +01:00
|
|
|
#define GOOD_MULTI_HANDLE(x) \
|
2011-10-21 16:37:13 +02:00
|
|
|
((x) && (((struct Curl_multi *)(x))->type == CURL_MULTI_HANDLE))
|
2006-09-11 00:15:32 +02:00
|
|
|
#define GOOD_EASY_HANDLE(x) \
|
2011-10-21 16:37:13 +02:00
|
|
|
((x) && (((struct SessionHandle *)(x))->magic == CURLEASY_MAGIC_NUMBER))
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2006-09-11 00:15:32 +02:00
|
|
|
static void singlesocket(struct Curl_multi *multi,
|
2013-08-12 13:52:58 +02:00
|
|
|
struct SessionHandle *data);
|
2006-10-12 10:36:47 +02:00
|
|
|
static int update_timer(struct Curl_multi *multi);
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2008-01-16 13:24:00 +01:00
|
|
|
static bool isHandleAtHead(struct SessionHandle *handle,
|
|
|
|
struct curl_llist *pipeline);
|
2010-08-31 00:08:45 +02:00
|
|
|
static CURLMcode add_next_timeout(struct timeval now,
|
|
|
|
struct Curl_multi *multi,
|
|
|
|
struct SessionHandle *d);
|
2013-06-03 20:19:51 +02:00
|
|
|
static CURLMcode multi_timeout(struct Curl_multi *multi,
|
|
|
|
long *timeout_ms);
|
2008-01-16 13:24:00 +01:00
|
|
|
|
2009-06-10 04:49:42 +02:00
|
|
|
#ifdef DEBUGBUILD
|
2007-05-02 21:13:56 +02:00
|
|
|
static const char * const statename[]={
|
2006-10-13 09:11:26 +02:00
|
|
|
"INIT",
|
2013-02-15 11:50:45 +01:00
|
|
|
"CONNECT_PEND",
|
2006-10-13 09:11:26 +02:00
|
|
|
"CONNECT",
|
|
|
|
"WAITRESOLVE",
|
|
|
|
"WAITCONNECT",
|
2007-03-23 23:25:04 +01:00
|
|
|
"WAITPROXYCONNECT",
|
2006-10-13 09:11:26 +02:00
|
|
|
"PROTOCONNECT",
|
|
|
|
"WAITDO",
|
|
|
|
"DO",
|
|
|
|
"DOING",
|
|
|
|
"DO_MORE",
|
|
|
|
"DO_DONE",
|
|
|
|
"WAITPERFORM",
|
|
|
|
"PERFORM",
|
|
|
|
"TOOFAST",
|
|
|
|
"DONE",
|
|
|
|
"COMPLETED",
|
2010-08-18 19:59:46 +02:00
|
|
|
"MSGSENT",
|
2006-10-13 09:11:26 +02:00
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
2010-08-10 11:02:07 +02:00
|
|
|
static void multi_freetimeout(void *a, void *b);
|
|
|
|
|
2005-02-09 14:06:40 +01:00
|
|
|
/* always use this function to change state, to make debugging easier */
|
2013-08-12 13:52:58 +02:00
|
|
|
static void mstate(struct SessionHandle *data, CURLMstate state
|
2013-01-17 12:59:23 +01:00
|
|
|
#ifdef DEBUGBUILD
|
|
|
|
, int lineno
|
|
|
|
#endif
|
|
|
|
)
|
2005-02-09 14:06:40 +01:00
|
|
|
{
|
2009-06-10 04:49:42 +02:00
|
|
|
#ifdef DEBUGBUILD
|
2012-12-06 12:12:04 +01:00
|
|
|
long connection_id = -5000;
|
2005-02-09 14:06:40 +01:00
|
|
|
#endif
|
2013-08-12 13:52:58 +02:00
|
|
|
CURLMstate oldstate = data->mstate;
|
2006-10-07 23:04:57 +02:00
|
|
|
|
|
|
|
if(oldstate == state)
|
|
|
|
/* don't bother when the new state is the same as the old state */
|
|
|
|
return;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
data->mstate = state;
|
2005-02-09 14:06:40 +01:00
|
|
|
|
2009-06-10 04:49:42 +02:00
|
|
|
#ifdef DEBUGBUILD
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->mstate >= CURLM_STATE_CONNECT_PEND &&
|
|
|
|
data->mstate < CURLM_STATE_COMPLETED) {
|
|
|
|
if(data->easy_conn)
|
|
|
|
connection_id = data->easy_conn->connection_id;
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
infof(data,
|
2013-01-17 12:59:23 +01:00
|
|
|
"STATE: %s => %s handle %p; line %d (connection #%ld) \n",
|
2013-08-12 13:52:58 +02:00
|
|
|
statename[oldstate], statename[data->mstate],
|
|
|
|
(void *)data, lineno, connection_id);
|
2009-08-21 09:11:20 +02:00
|
|
|
}
|
2005-02-09 14:06:40 +01:00
|
|
|
#endif
|
2006-08-03 00:29:29 +02:00
|
|
|
if(state == CURLM_STATE_COMPLETED)
|
|
|
|
/* changing to COMPLETED means there's one less easy handle 'alive' */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->multi->num_alive--;
|
2005-02-09 14:06:40 +01:00
|
|
|
}
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2013-01-17 12:59:23 +01:00
|
|
|
#ifndef DEBUGBUILD
|
|
|
|
#define multistate(x,y) mstate(x,y)
|
|
|
|
#else
|
|
|
|
#define multistate(x,y) mstate(x,y, __LINE__)
|
|
|
|
#endif
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
/*
|
2006-04-21 15:40:07 +02:00
|
|
|
* We add one of these structs to the sockhash for a particular socket
|
2006-04-10 17:00:53 +02:00
|
|
|
*/
|
|
|
|
|
|
|
|
struct Curl_sh_entry {
|
|
|
|
struct SessionHandle *easy;
|
|
|
|
time_t timestamp;
|
2006-04-21 15:40:07 +02:00
|
|
|
int action; /* what action READ/WRITE this socket waits for */
|
2006-09-11 00:15:32 +02:00
|
|
|
curl_socket_t socket; /* mainly to ease debugging */
|
2006-07-27 00:19:42 +02:00
|
|
|
void *socketp; /* settable by users with curl_multi_assign() */
|
2006-04-10 17:00:53 +02:00
|
|
|
};
|
2006-04-21 15:40:07 +02:00
|
|
|
/* bits for 'action' having no bits means this socket is not expecting any
|
|
|
|
action */
|
|
|
|
#define SH_READ 1
|
2006-05-26 13:26:42 +02:00
|
|
|
#define SH_WRITE 2
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
/* make sure this socket is present in the hash for this handle */
|
2006-09-11 00:15:32 +02:00
|
|
|
static struct Curl_sh_entry *sh_addentry(struct curl_hash *sh,
|
|
|
|
curl_socket_t s,
|
|
|
|
struct SessionHandle *data)
|
2001-11-28 12:09:18 +01:00
|
|
|
{
|
2006-04-10 17:00:53 +02:00
|
|
|
struct Curl_sh_entry *there =
|
|
|
|
Curl_hash_pick(sh, (char *)&s, sizeof(curl_socket_t));
|
|
|
|
struct Curl_sh_entry *check;
|
|
|
|
|
2006-04-21 15:40:07 +02:00
|
|
|
if(there)
|
|
|
|
/* it is present, return fine */
|
2006-09-11 00:15:32 +02:00
|
|
|
return there;
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
/* not present, add it */
|
2009-11-18 11:33:54 +01:00
|
|
|
check = calloc(1, sizeof(struct Curl_sh_entry));
|
2006-04-10 17:00:53 +02:00
|
|
|
if(!check)
|
2006-09-11 00:15:32 +02:00
|
|
|
return NULL; /* major failure */
|
2014-11-18 21:25:05 +01:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
check->easy = data;
|
2006-09-11 00:15:32 +02:00
|
|
|
check->socket = s;
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2006-04-21 15:40:07 +02:00
|
|
|
/* make/add new hash entry */
|
2014-11-18 21:25:05 +01:00
|
|
|
if(!Curl_hash_add(sh, (char *)&s, sizeof(curl_socket_t), check)) {
|
2006-09-11 00:15:32 +02:00
|
|
|
free(check);
|
|
|
|
return NULL; /* major failure */
|
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2006-09-11 00:15:32 +02:00
|
|
|
return check; /* things are good in sockhash land */
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* delete the given socket + handle from the hash */
|
2006-04-21 15:40:07 +02:00
|
|
|
static void sh_delentry(struct curl_hash *sh, curl_socket_t s)
|
2006-04-10 17:00:53 +02:00
|
|
|
{
|
|
|
|
struct Curl_sh_entry *there =
|
|
|
|
Curl_hash_pick(sh, (char *)&s, sizeof(curl_socket_t));
|
|
|
|
|
2006-04-21 15:40:07 +02: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 17:00:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* free a sockhash entry
|
|
|
|
*/
|
|
|
|
static void sh_freeentry(void *freethis)
|
|
|
|
{
|
|
|
|
struct Curl_sh_entry *p = (struct Curl_sh_entry *) freethis;
|
|
|
|
|
2008-10-30 14:45:25 +01:00
|
|
|
if(p)
|
|
|
|
free(p);
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
2013-03-21 20:14:03 +01:00
|
|
|
static size_t fd_key_compare(void *k1, size_t k1_len, void *k2, size_t k2_len)
|
2007-06-26 23:09:28 +02:00
|
|
|
{
|
|
|
|
(void) k1_len; (void) k2_len;
|
|
|
|
|
2013-03-21 20:14:03 +01:00
|
|
|
return (*((int *) k1)) == (*((int *) k2));
|
2007-06-26 23:09:28 +02:00
|
|
|
}
|
|
|
|
|
2013-03-21 20:14:03 +01:00
|
|
|
static size_t hash_fd(void *key, size_t key_length, size_t slots_num)
|
2007-06-26 23:09:28 +02:00
|
|
|
{
|
2013-03-21 20:14:03 +01:00
|
|
|
int fd = *((int *) key);
|
2007-06-26 23:09:28 +02:00
|
|
|
(void) key_length;
|
|
|
|
|
|
|
|
return (fd % (int)slots_num);
|
|
|
|
}
|
|
|
|
|
2006-04-10 17:00:53 +02: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."
|
|
|
|
*
|
|
|
|
*/
|
2013-04-26 22:23:08 +02:00
|
|
|
static struct curl_hash *sh_init(int hashsize)
|
2006-04-10 17:00:53 +02:00
|
|
|
{
|
2013-04-26 22:23:08 +02:00
|
|
|
return Curl_hash_alloc(hashsize, hash_fd, fd_key_compare,
|
2007-06-26 23:09:28 +02:00
|
|
|
sh_freeentry);
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
2010-08-09 00:01:36 +02: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;
|
|
|
|
}
|
|
|
|
|
2013-04-26 22:23:08 +02:00
|
|
|
struct Curl_multi *Curl_multi_handle(int hashsize, /* socket hash */
|
|
|
|
int chashsize) /* connection hash */
|
2006-04-10 17:00:53 +02:00
|
|
|
{
|
2009-11-18 11:33:54 +01:00
|
|
|
struct Curl_multi *multi = calloc(1, sizeof(struct Curl_multi));
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
if(!multi)
|
2004-05-13 17:17:49 +02:00
|
|
|
return NULL;
|
2003-09-12 00:14:29 +02:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
multi->type = CURL_MULTI_HANDLE;
|
|
|
|
|
2004-03-30 15:02:31 +02:00
|
|
|
multi->hostcache = Curl_mk_dnscache();
|
2010-08-09 00:01:36 +02:00
|
|
|
if(!multi->hostcache)
|
|
|
|
goto error;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2013-04-26 22:23:08 +02:00
|
|
|
multi->sockhash = sh_init(hashsize);
|
2010-08-09 00:01:36 +02:00
|
|
|
if(!multi->sockhash)
|
|
|
|
goto error;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2013-04-26 22:23:08 +02:00
|
|
|
multi->conn_cache = Curl_conncache_init(chashsize);
|
2012-12-06 12:12:04 +01:00
|
|
|
if(!multi->conn_cache)
|
2010-08-09 00:01:36 +02:00
|
|
|
goto error;
|
|
|
|
|
|
|
|
multi->msglist = Curl_llist_alloc(multi_freeamsg);
|
|
|
|
if(!multi->msglist)
|
|
|
|
goto error;
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2014-09-02 09:29:50 +02:00
|
|
|
multi->pending = Curl_llist_alloc(multi_freeamsg);
|
|
|
|
if(!multi->pending)
|
|
|
|
goto error;
|
|
|
|
|
2013-08-20 14:48:08 +02:00
|
|
|
/* allocate a new easy handle to use when closing cached connections */
|
|
|
|
multi->closure_handle = curl_easy_init();
|
|
|
|
if(!multi->closure_handle)
|
|
|
|
goto error;
|
|
|
|
|
|
|
|
multi->closure_handle->multi = multi;
|
|
|
|
multi->closure_handle->state.conn_cache = multi->conn_cache;
|
|
|
|
|
2013-02-15 11:50:45 +01:00
|
|
|
multi->max_pipeline_length = 5;
|
2014-02-17 06:44:00 +01:00
|
|
|
|
|
|
|
/* -1 means it not set by user, use the default value */
|
|
|
|
multi->maxconnects = -1;
|
2001-11-28 12:09:18 +01:00
|
|
|
return (CURLM *) multi;
|
2010-08-09 00:01:36 +02:00
|
|
|
|
|
|
|
error:
|
2011-10-11 19:41:30 +02:00
|
|
|
|
|
|
|
Curl_hash_destroy(multi->sockhash);
|
|
|
|
multi->sockhash = NULL;
|
|
|
|
Curl_hash_destroy(multi->hostcache);
|
|
|
|
multi->hostcache = NULL;
|
2012-12-06 12:12:04 +01:00
|
|
|
Curl_conncache_destroy(multi->conn_cache);
|
|
|
|
multi->conn_cache = NULL;
|
2013-08-20 14:48:08 +02:00
|
|
|
Curl_close(multi->closure_handle);
|
|
|
|
multi->closure_handle = NULL;
|
2014-01-24 00:22:08 +01:00
|
|
|
Curl_llist_destroy(multi->msglist, NULL);
|
2014-09-02 09:29:50 +02:00
|
|
|
Curl_llist_destroy(multi->pending, NULL);
|
2010-08-09 00:01:36 +02:00
|
|
|
|
|
|
|
free(multi);
|
|
|
|
return NULL;
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
|
|
|
|
2013-04-26 22:23:08 +02:00
|
|
|
CURLM *curl_multi_init(void)
|
|
|
|
{
|
|
|
|
return Curl_multi_handle(CURL_SOCKET_HASH_TABLE_SIZE,
|
|
|
|
CURL_CONNECTION_HASH_SIZE);
|
|
|
|
}
|
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
CURLMcode curl_multi_add_handle(CURLM *multi_handle,
|
|
|
|
CURL *easy_handle)
|
|
|
|
{
|
2011-10-13 18:04:56 +02:00
|
|
|
struct curl_llist *timeoutlist;
|
|
|
|
struct Curl_multi *multi = (struct Curl_multi *)multi_handle;
|
|
|
|
struct SessionHandle *data = (struct SessionHandle *)easy_handle;
|
2001-11-28 12:09:18 +01: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 08:53:41 +02:00
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
/* Verify that we got a somewhat good easy handle too */
|
|
|
|
if(!GOOD_EASY_HANDLE(easy_handle))
|
|
|
|
return CURLM_BAD_EASY_HANDLE;
|
|
|
|
|
2013-08-08 13:01:16 +02:00
|
|
|
/* Prevent users from adding same easy handle more than once and prevent
|
|
|
|
adding to more than one multi stack */
|
2011-10-13 18:04:56 +02:00
|
|
|
if(data->multi)
|
2013-08-20 12:27:50 +02:00
|
|
|
return CURLM_ADDED_ALREADY;
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2011-10-13 18:04:56 +02:00
|
|
|
/* Allocate and initialize timeout list for easy handle */
|
|
|
|
timeoutlist = Curl_llist_alloc(multi_freetimeout);
|
|
|
|
if(!timeoutlist)
|
2010-08-10 11:02:07 +02:00
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
|
2011-10-13 18:04:56 +02:00
|
|
|
/*
|
2013-08-20 14:48:08 +02: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.
|
|
|
|
*/
|
2012-12-19 19:52:11 +01:00
|
|
|
|
2011-10-13 18:04:56 +02:00
|
|
|
/* Make easy handle use timeout list initialized above */
|
|
|
|
data->state.timeoutlist = timeoutlist;
|
|
|
|
timeoutlist = NULL;
|
2004-05-17 08:53:41 +02:00
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
/* set the easy handle */
|
2013-08-08 13:01:16 +02:00
|
|
|
multistate(data, CURLM_STATE_INIT);
|
|
|
|
|
|
|
|
if((data->set.global_dns_cache) &&
|
|
|
|
(data->dns.hostcachetype != HCACHE_GLOBAL)) {
|
|
|
|
/* global dns cache was requested but still isn't */
|
|
|
|
struct curl_hash *global = Curl_global_host_cache_init();
|
|
|
|
if(global) {
|
|
|
|
/* only do this if the global cache init works */
|
|
|
|
data->dns.hostcache = global;
|
|
|
|
data->dns.hostcachetype = HCACHE_GLOBAL;
|
|
|
|
}
|
|
|
|
}
|
2006-09-07 23:49:20 +02:00
|
|
|
/* for multi interface connections, we share DNS cache automatically if the
|
2013-01-17 12:59:23 +01:00
|
|
|
easy handle's one is currently not set. */
|
2013-08-08 13:01:16 +02:00
|
|
|
else if(!data->dns.hostcache ||
|
|
|
|
(data->dns.hostcachetype == HCACHE_NONE)) {
|
|
|
|
data->dns.hostcache = multi->hostcache;
|
|
|
|
data->dns.hostcachetype = HCACHE_MULTI;
|
2006-07-08 00:58:06 +02:00
|
|
|
}
|
2004-05-17 08:53:41 +02:00
|
|
|
|
2013-01-17 12:59:23 +01:00
|
|
|
/* Point to the multi's connection cache */
|
2013-08-08 13:01:16 +02:00
|
|
|
data->state.conn_cache = multi->conn_cache;
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2014-04-15 13:49:18 +02:00
|
|
|
data->state.infilesize = data->set.filesize;
|
|
|
|
|
2011-10-13 18:04:56 +02:00
|
|
|
/* This adds the new entry at the 'end' of the doubly-linked circular
|
2013-08-02 12:21:11 +02:00
|
|
|
list of SessionHandle structs to try and maintain a FIFO queue so
|
2011-10-13 18:04:56 +02:00
|
|
|
the pipelined requests are in order. */
|
2007-02-21 22:59:40 +01:00
|
|
|
|
2013-08-02 00:09:59 +02:00
|
|
|
/* We add this new entry last in the list. */
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2013-08-08 13:01:16 +02:00
|
|
|
data->next = NULL; /* end of the line */
|
2013-08-02 00:09:59 +02:00
|
|
|
if(multi->easyp) {
|
2013-08-02 12:21:11 +02:00
|
|
|
struct SessionHandle *last = multi->easylp;
|
2013-08-08 13:01:16 +02:00
|
|
|
last->next = data;
|
|
|
|
data->prev = last;
|
|
|
|
multi->easylp = data; /* the new last node */
|
2013-08-02 00:09:59 +02:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* first node, make both prev and next be NULL! */
|
2013-08-08 13:01:16 +02:00
|
|
|
data->next = NULL;
|
|
|
|
data->prev = NULL;
|
|
|
|
multi->easylp = multi->easyp = data; /* both first and last */
|
2013-08-02 00:09:59 +02:00
|
|
|
}
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2011-10-13 18:04:56 +02:00
|
|
|
/* make the SessionHandle refer back to this multi handle */
|
2013-08-20 14:48:08 +02:00
|
|
|
data->multi = multi_handle;
|
2005-01-10 11:07:07 +01:00
|
|
|
|
2007-05-02 15:47:56 +02: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. */
|
2013-08-08 13:01:16 +02:00
|
|
|
Curl_expire(data, 1);
|
2007-05-02 15:47:56 +02:00
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
/* increase the node-counter */
|
|
|
|
multi->num_easy++;
|
2006-09-16 23:50:29 +02:00
|
|
|
|
2006-08-03 00:29:29 +02:00
|
|
|
/* increase the alive-counter */
|
|
|
|
multi->num_alive++;
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2008-10-08 23:42:29 +02: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 10:36:47 +02:00
|
|
|
update_timer(multi);
|
2004-08-31 08:04:43 +02:00
|
|
|
return CURLM_OK;
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
|
|
|
|
2006-09-11 00:15:32 +02:00
|
|
|
#if 0
|
|
|
|
/* Debug-function, used like this:
|
|
|
|
*
|
|
|
|
* Curl_hash_print(multi->sockhash, debug_print_sock_hash);
|
|
|
|
*
|
2013-01-04 02:50:28 +01:00
|
|
|
* Enable the hash print function first by editing hash.c
|
2006-09-11 00:15:32 +02:00
|
|
|
*/
|
|
|
|
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]",
|
2013-08-12 13:52:58 +02:00
|
|
|
(void *)sh->data, sh->data->magic, (int)sh->socket);
|
2006-09-11 00:15:32 +02:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
CURLMcode curl_multi_remove_handle(CURLM *multi_handle,
|
|
|
|
CURL *curl_handle)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
2013-08-02 12:12:20 +02:00
|
|
|
struct SessionHandle *easy = curl_handle;
|
|
|
|
struct SessionHandle *data = easy;
|
2014-10-03 23:46:10 +02:00
|
|
|
bool premature;
|
|
|
|
bool easy_owns_conn;
|
|
|
|
struct curl_llist_element *e;
|
2001-11-28 12:09:18 +01: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 08:53:41 +02:00
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
/* Verify that we got a somewhat good easy handle too */
|
|
|
|
if(!GOOD_EASY_HANDLE(curl_handle))
|
|
|
|
return CURLM_BAD_EASY_HANDLE;
|
|
|
|
|
2013-08-29 22:08:01 +02:00
|
|
|
/* Prevent users from trying to remove same easy handle more than once */
|
|
|
|
if(!data->multi)
|
|
|
|
return CURLM_OK; /* it is already removed so let's say it is fine! */
|
|
|
|
|
2006-07-17 20:35:58 +02:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
premature = (data->mstate < CURLM_STATE_COMPLETED) ? TRUE : FALSE;
|
|
|
|
easy_owns_conn = (data->easy_conn && (data->easy_conn->data == easy)) ?
|
|
|
|
TRUE : FALSE;
|
2010-08-10 11:02:07 +02:00
|
|
|
|
2014-10-03 23:46:10 +02: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. */
|
|
|
|
if(premature)
|
|
|
|
/* this handle is "alive" so we need to count down the total number of
|
|
|
|
alive connections when this is removed */
|
|
|
|
multi->num_alive--;
|
2006-07-08 00:58:06 +02:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
if(data->easy_conn &&
|
2014-11-16 21:53:56 +01:00
|
|
|
data->mstate > CURLM_STATE_DO &&
|
2014-10-03 23:46:10 +02:00
|
|
|
data->mstate < CURLM_STATE_COMPLETED) {
|
|
|
|
/* If the handle is in a pipeline and has started sending off its
|
|
|
|
request but not received its response yet, we need to close
|
|
|
|
connection. */
|
|
|
|
connclose(data->easy_conn, "Removed with partial response");
|
|
|
|
/* Set connection owner so that Curl_done() closes it.
|
2014-11-18 23:02:40 +01:00
|
|
|
We can safely do this here since connection is killed. */
|
2014-10-03 23:46:10 +02:00
|
|
|
data->easy_conn->data = easy;
|
2014-11-16 21:53:56 +01:00
|
|
|
easy_owns_conn = TRUE;
|
2014-10-03 23:46:10 +02:00
|
|
|
}
|
2008-12-03 16:20:27 +01:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
/* The timer must be shut down before data->multi is set to NULL,
|
|
|
|
else the timenode will remain in the splay tree after
|
|
|
|
curl_easy_cleanup is called. */
|
|
|
|
Curl_expire(data, 0);
|
2006-09-21 22:52:58 +02:00
|
|
|
|
2014-10-03 23:46:10 +02: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;
|
|
|
|
}
|
2008-02-17 14:38:19 +01:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
if(data->dns.hostcachetype == HCACHE_MULTI) {
|
|
|
|
/* stop using the multi handle's DNS cache */
|
|
|
|
data->dns.hostcache = NULL;
|
|
|
|
data->dns.hostcachetype = HCACHE_NONE;
|
|
|
|
}
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
if(data->easy_conn) {
|
2014-01-29 22:40:57 +01:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
/* we must call Curl_done() here (if we still "own it") so that we don't
|
|
|
|
leave a half-baked one around */
|
|
|
|
if(easy_owns_conn) {
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
/* Curl_done() clears the conn->data field to lose the association
|
|
|
|
between the easy handle and the connection
|
2006-09-11 00:15:32 +02:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
Note that this ignores the return code simply because there's
|
|
|
|
nothing really useful to do with it anyway! */
|
|
|
|
(void)Curl_done(&data->easy_conn, data->result, premature);
|
2012-12-06 12:12:04 +01:00
|
|
|
}
|
2014-10-03 23:46:10 +02:00
|
|
|
else
|
|
|
|
/* Clear connection pipelines, if Curl_done above was not called */
|
|
|
|
Curl_getoff_all_pipelines(data, data->easy_conn);
|
|
|
|
}
|
2012-12-06 12:12:04 +01:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
Curl_wildcard_dtor(&data->wildcard);
|
2010-08-09 00:01:36 +02:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
/* as this was using a shared connection cache we clear the pointer to that
|
|
|
|
since we're not part of that multi handle anymore */
|
|
|
|
data->state.conn_cache = NULL;
|
2010-08-09 00:01:36 +02:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
/* change state without using multistate(), only to make singlesocket() do
|
|
|
|
what we want */
|
|
|
|
data->mstate = CURLM_STATE_COMPLETED;
|
|
|
|
singlesocket(multi, easy); /* to let the application know what sockets that
|
|
|
|
vanish with this handle */
|
2010-08-09 00:01:36 +02:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
/* Remove the association between the connection and the handle */
|
|
|
|
if(data->easy_conn) {
|
|
|
|
data->easy_conn->data = NULL;
|
|
|
|
data->easy_conn = NULL;
|
|
|
|
}
|
2013-08-02 00:09:59 +02:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
data->multi = NULL; /* clear the association to this multi handle */
|
2004-05-17 08:53:41 +02:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
/* make sure there's no pending message in the queue sent from this easy
|
|
|
|
handle */
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
for(e = multi->msglist->head; e; e = e->next) {
|
|
|
|
struct Curl_message *msg = e->ptr;
|
2001-11-28 17:00:18 +01:00
|
|
|
|
2014-10-03 23:46:10 +02:00
|
|
|
if(msg->extmsg.easy_handle == easy) {
|
|
|
|
Curl_llist_remove(multi->msglist, e, NULL);
|
|
|
|
/* there can only be one from this specific handle */
|
|
|
|
break;
|
|
|
|
}
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
2014-10-03 23:46:10 +02:00
|
|
|
|
|
|
|
/* make the previous node point to our next */
|
|
|
|
if(data->prev)
|
|
|
|
data->prev->next = data->next;
|
2001-11-28 12:09:18 +01:00
|
|
|
else
|
2014-10-03 23:46:10 +02:00
|
|
|
multi->easyp = data->next; /* point to first node */
|
|
|
|
|
|
|
|
/* make our next point to our previous node */
|
|
|
|
if(data->next)
|
|
|
|
data->next->prev = data->prev;
|
|
|
|
else
|
|
|
|
multi->easylp = data->prev; /* point to last node */
|
|
|
|
|
|
|
|
/* NOTE NOTE NOTE
|
|
|
|
We do not touch the easy handle here! */
|
|
|
|
multi->num_easy--; /* one less to care about now */
|
|
|
|
|
|
|
|
update_timer(multi);
|
|
|
|
return CURLM_OK;
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
|
|
|
|
2013-03-21 20:14:03 +01:00
|
|
|
bool Curl_multi_pipeline_enabled(const struct Curl_multi *multi)
|
2006-09-07 23:49:20 +02:00
|
|
|
{
|
2013-03-21 08:33:45 +01:00
|
|
|
return (multi && multi->pipelining_enabled) ? TRUE : FALSE;
|
2006-09-07 23:49:20 +02:00
|
|
|
}
|
|
|
|
|
2007-04-10 22:46:40 +02:00
|
|
|
void Curl_multi_handlePipeBreak(struct SessionHandle *data)
|
|
|
|
{
|
2013-08-02 12:25:18 +02:00
|
|
|
data->easy_conn = NULL;
|
2007-04-10 22:46:40 +02:00
|
|
|
}
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
static int waitconnect_getsock(struct connectdata *conn,
|
|
|
|
curl_socket_t *sock,
|
|
|
|
int numsocks)
|
|
|
|
{
|
2013-10-26 14:17:33 +02:00
|
|
|
int i;
|
|
|
|
int s=0;
|
|
|
|
int rc=0;
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
if(!numsocks)
|
|
|
|
return GETSOCK_BLANK;
|
|
|
|
|
2013-10-26 14:17:33 +02:00
|
|
|
for(i=0; i<2; i++) {
|
|
|
|
if(conn->tempsock[i] != CURL_SOCKET_BAD) {
|
|
|
|
sock[s] = conn->tempsock[i];
|
|
|
|
rc |= GETSOCK_WRITESOCK(s++);
|
|
|
|
}
|
|
|
|
}
|
2008-05-09 14:59:24 +02: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 */
|
2013-11-11 23:43:48 +01:00
|
|
|
if(conn->tunnel_state[FIRSTSOCKET] == TUNNEL_CONNECT) {
|
|
|
|
sock[0] = conn->sock[FIRSTSOCKET];
|
2013-11-12 10:59:22 +01:00
|
|
|
rc = GETSOCK_READSOCK(0);
|
2013-11-11 23:43:48 +01:00
|
|
|
}
|
2008-05-09 14:59:24 +02:00
|
|
|
|
2013-10-26 14:17:33 +02:00
|
|
|
return rc;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
static int domore_getsock(struct connectdata *conn,
|
2011-10-21 23:36:54 +02:00
|
|
|
curl_socket_t *socks,
|
2006-04-10 17:00:53 +02:00
|
|
|
int numsocks)
|
|
|
|
{
|
2011-10-21 23:36:54 +02:00
|
|
|
if(conn && conn->handler->domore_getsock)
|
|
|
|
return conn->handler->domore_getsock(conn, socks, numsocks);
|
|
|
|
return GETSOCK_BLANK;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* returns bitmapped flags for this handle and its sockets */
|
2013-08-12 13:52:58 +02:00
|
|
|
static int multi_getsock(struct SessionHandle *data,
|
2006-04-10 17:00:53 +02:00
|
|
|
curl_socket_t *socks, /* points to numsocks number
|
2009-08-03 13:32:55 +02:00
|
|
|
of sockets */
|
2006-04-10 17:00:53 +02:00
|
|
|
int numsocks)
|
|
|
|
{
|
2007-03-31 12:56:07 +02: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().
|
|
|
|
*/
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->state.pipe_broke || !data->easy_conn)
|
2006-09-07 23:49:20 +02:00
|
|
|
return 0;
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->mstate > CURLM_STATE_CONNECT &&
|
|
|
|
data->mstate < CURLM_STATE_COMPLETED) {
|
2006-09-07 23:49:20 +02:00
|
|
|
/* Set up ownership correctly */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->data = data;
|
2006-09-07 23:49:20 +02:00
|
|
|
}
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
switch(data->mstate) {
|
2006-04-10 17:00:53 +02:00
|
|
|
default:
|
2008-05-19 22:58:01 +02: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 19:59:46 +02:00
|
|
|
case CURLM_STATE_MSGSENT:
|
2008-05-19 22:58:01 +02:00
|
|
|
case CURLM_STATE_INIT:
|
|
|
|
case CURLM_STATE_CONNECT:
|
|
|
|
case CURLM_STATE_WAITDO:
|
|
|
|
case CURLM_STATE_DONE:
|
|
|
|
case CURLM_STATE_LAST:
|
2006-09-11 00:15:32 +02:00
|
|
|
/* this will get called with CURLM_STATE_COMPLETED when a handle is
|
|
|
|
removed */
|
2008-05-19 22:58:01 +02:00
|
|
|
#endif
|
2006-04-10 17:00:53 +02:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
case CURLM_STATE_WAITRESOLVE:
|
2013-08-12 13:52:58 +02:00
|
|
|
return Curl_resolver_getsock(data->easy_conn, socks, numsocks);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
case CURLM_STATE_PROTOCONNECT:
|
2013-08-12 13:52:58 +02:00
|
|
|
return Curl_protocol_getsock(data->easy_conn, socks, numsocks);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2008-05-19 22:58:01 +02:00
|
|
|
case CURLM_STATE_DO:
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_DOING:
|
2013-08-12 13:52:58 +02:00
|
|
|
return Curl_doing_getsock(data->easy_conn, socks, numsocks);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2008-01-18 22:51:10 +01:00
|
|
|
case CURLM_STATE_WAITPROXYCONNECT:
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_WAITCONNECT:
|
2013-08-12 13:52:58 +02:00
|
|
|
return waitconnect_getsock(data->easy_conn, socks, numsocks);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
case CURLM_STATE_DO_MORE:
|
2013-08-12 13:52:58 +02:00
|
|
|
return domore_getsock(data->easy_conn, socks, numsocks);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2008-05-19 22:58:01 +02:00
|
|
|
case CURLM_STATE_DO_DONE: /* since is set after DO is completed, we switch
|
2011-04-03 00:07:32 +02:00
|
|
|
to waiting for the same as the *PERFORM
|
|
|
|
states */
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_PERFORM:
|
2006-09-07 23:49:20 +02:00
|
|
|
case CURLM_STATE_WAITPERFORM:
|
2013-08-12 13:52:58 +02:00
|
|
|
return Curl_single_getsock(data->easy_conn, socks, numsocks);
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2001-11-28 12:09:18 +01: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;
|
2013-08-12 13:52:58 +02:00
|
|
|
struct SessionHandle *data;
|
2002-01-03 16:01:22 +01:00
|
|
|
int this_max_fd=-1;
|
2006-04-10 17:00:53 +02:00
|
|
|
curl_socket_t sockbunch[MAX_SOCKSPEREASYHANDLE];
|
|
|
|
int bitmap;
|
|
|
|
int i;
|
|
|
|
(void)exc_fd_set; /* not used */
|
2001-11-28 12:09:18 +01:00
|
|
|
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
data=multi->easyp;
|
|
|
|
while(data) {
|
|
|
|
bitmap = multi_getsock(data, sockbunch, MAX_SOCKSPEREASYHANDLE);
|
2003-08-05 16:40:59 +02:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
for(i=0; i< MAX_SOCKSPEREASYHANDLE; i++) {
|
|
|
|
curl_socket_t s = CURL_SOCKET_BAD;
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2011-09-25 17:34:12 +02:00
|
|
|
if((bitmap & GETSOCK_READSOCK(i)) && VALID_SOCK((sockbunch[i]))) {
|
2006-04-10 17:00:53 +02:00
|
|
|
FD_SET(sockbunch[i], read_fd_set);
|
|
|
|
s = sockbunch[i];
|
|
|
|
}
|
2011-09-25 17:34:12 +02:00
|
|
|
if((bitmap & GETSOCK_WRITESOCK(i)) && VALID_SOCK((sockbunch[i]))) {
|
2006-04-10 17:00:53 +02: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-24 00:07:06 +02:00
|
|
|
if((int)s > this_max_fd)
|
2006-04-25 07:32:05 +02:00
|
|
|
this_max_fd = (int)s;
|
2002-08-12 11:43:20 +02:00
|
|
|
}
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
data = data->next; /* check next handle */
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
*max_fd = this_max_fd;
|
|
|
|
|
2001-11-28 12:09:18 +01:00
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
|
2012-08-27 21:48:55 +02:00
|
|
|
CURLMcode curl_multi_wait(CURLM *multi_handle,
|
|
|
|
struct curl_waitfd extra_fds[],
|
|
|
|
unsigned int extra_nfds,
|
2012-09-15 19:38:52 +02:00
|
|
|
int timeout_ms,
|
|
|
|
int *ret)
|
2012-08-27 21:48:55 +02:00
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
2013-08-12 13:52:58 +02:00
|
|
|
struct SessionHandle *data;
|
2012-08-27 21:48:55 +02:00
|
|
|
curl_socket_t sockbunch[MAX_SOCKSPEREASYHANDLE];
|
|
|
|
int bitmap;
|
2013-07-18 23:36:59 +02:00
|
|
|
unsigned int i;
|
2013-03-09 22:26:07 +01:00
|
|
|
unsigned int nfds = 0;
|
|
|
|
unsigned int curlfds;
|
2012-12-23 21:06:40 +01:00
|
|
|
struct pollfd *ufds = NULL;
|
2013-06-03 20:19:51 +02:00
|
|
|
long timeout_internal;
|
2012-08-27 21:48:55 +02:00
|
|
|
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
2013-06-03 20:19:51 +02:00
|
|
|
/* If the internally desired timeout is actually shorter than requested from
|
2013-06-04 13:22:40 +02:00
|
|
|
the outside, then use the shorter time! But only if the internal timer
|
2013-10-30 23:48:08 +01:00
|
|
|
is actually larger than -1! */
|
2013-06-03 20:19:51 +02:00
|
|
|
(void)multi_timeout(multi, &timeout_internal);
|
2013-10-30 23:48:08 +01:00
|
|
|
if((timeout_internal >= 0) && (timeout_internal < (long)timeout_ms))
|
2013-06-03 20:19:51 +02:00
|
|
|
timeout_ms = (int)timeout_internal;
|
|
|
|
|
2012-08-27 21:48:55 +02:00
|
|
|
/* Count up how many fds we have from the multi handle */
|
2013-08-12 13:52:58 +02:00
|
|
|
data=multi->easyp;
|
|
|
|
while(data) {
|
|
|
|
bitmap = multi_getsock(data, sockbunch, MAX_SOCKSPEREASYHANDLE);
|
2012-08-27 21:48:55 +02:00
|
|
|
|
|
|
|
for(i=0; i< MAX_SOCKSPEREASYHANDLE; i++) {
|
|
|
|
curl_socket_t s = CURL_SOCKET_BAD;
|
|
|
|
|
|
|
|
if(bitmap & GETSOCK_READSOCK(i)) {
|
|
|
|
++nfds;
|
|
|
|
s = sockbunch[i];
|
|
|
|
}
|
|
|
|
if(bitmap & GETSOCK_WRITESOCK(i)) {
|
|
|
|
++nfds;
|
|
|
|
s = sockbunch[i];
|
|
|
|
}
|
|
|
|
if(s == CURL_SOCKET_BAD) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
data = data->next; /* check next handle */
|
2012-08-27 21:48:55 +02:00
|
|
|
}
|
|
|
|
|
2013-03-09 22:26:07 +01:00
|
|
|
curlfds = nfds; /* number of internal file descriptors */
|
|
|
|
nfds += extra_nfds; /* add the externally provided ones */
|
|
|
|
|
2014-04-19 16:02:14 +02:00
|
|
|
if(nfds || extra_nfds) {
|
2012-12-23 21:10:45 +01:00
|
|
|
ufds = malloc(nfds * sizeof(struct pollfd));
|
|
|
|
if(!ufds)
|
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
}
|
2012-08-27 21:48:55 +02:00
|
|
|
nfds = 0;
|
|
|
|
|
2013-03-09 22:26:07 +01:00
|
|
|
/* only do the second loop if we found descriptors in the first stage run
|
|
|
|
above */
|
2012-08-27 21:48:55 +02:00
|
|
|
|
2013-03-09 22:26:07 +01:00
|
|
|
if(curlfds) {
|
|
|
|
/* Add the curl handles to our pollfds first */
|
2013-08-12 13:52:58 +02:00
|
|
|
data=multi->easyp;
|
|
|
|
while(data) {
|
|
|
|
bitmap = multi_getsock(data, sockbunch, MAX_SOCKSPEREASYHANDLE);
|
2012-08-27 21:48:55 +02:00
|
|
|
|
2013-03-09 22:26:07 +01:00
|
|
|
for(i=0; i< MAX_SOCKSPEREASYHANDLE; i++) {
|
|
|
|
curl_socket_t s = CURL_SOCKET_BAD;
|
|
|
|
|
|
|
|
if(bitmap & GETSOCK_READSOCK(i)) {
|
|
|
|
ufds[nfds].fd = sockbunch[i];
|
|
|
|
ufds[nfds].events = POLLIN;
|
|
|
|
++nfds;
|
|
|
|
s = sockbunch[i];
|
|
|
|
}
|
|
|
|
if(bitmap & GETSOCK_WRITESOCK(i)) {
|
|
|
|
ufds[nfds].fd = sockbunch[i];
|
|
|
|
ufds[nfds].events = POLLOUT;
|
|
|
|
++nfds;
|
|
|
|
s = sockbunch[i];
|
|
|
|
}
|
|
|
|
if(s == CURL_SOCKET_BAD) {
|
|
|
|
break;
|
|
|
|
}
|
2012-08-27 21:48:55 +02:00
|
|
|
}
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
data = data->next; /* check next handle */
|
2013-03-09 22:26:07 +01:00
|
|
|
}
|
2012-08-27 21:48:55 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Add external file descriptions from poll-like struct curl_waitfd */
|
|
|
|
for(i = 0; i < extra_nfds; i++) {
|
|
|
|
ufds[nfds].fd = extra_fds[i].fd;
|
2012-11-26 16:20:53 +01:00
|
|
|
ufds[nfds].events = 0;
|
|
|
|
if(extra_fds[i].events & CURL_WAIT_POLLIN)
|
|
|
|
ufds[nfds].events |= POLLIN;
|
|
|
|
if(extra_fds[i].events & CURL_WAIT_POLLPRI)
|
|
|
|
ufds[nfds].events |= POLLPRI;
|
|
|
|
if(extra_fds[i].events & CURL_WAIT_POLLOUT)
|
|
|
|
ufds[nfds].events |= POLLOUT;
|
2012-08-27 21:48:55 +02:00
|
|
|
++nfds;
|
|
|
|
}
|
|
|
|
|
2013-07-18 23:36:59 +02:00
|
|
|
if(nfds) {
|
2012-10-09 22:19:49 +02:00
|
|
|
/* wait... */
|
2013-10-29 11:51:25 +01:00
|
|
|
infof(data, "Curl_poll(%d ds, %d ms)\n", nfds, timeout_ms);
|
2012-10-09 22:19:49 +02:00
|
|
|
i = Curl_poll(ufds, nfds, timeout_ms);
|
2013-07-18 23:36:59 +02:00
|
|
|
|
|
|
|
if(i) {
|
|
|
|
unsigned int j;
|
|
|
|
/* copy revents results from the poll to the curl_multi_wait poll
|
|
|
|
struct, the bit values of the actual underlying poll() implementation
|
|
|
|
may not be the same as the ones in the public libcurl API! */
|
|
|
|
for(j = 0; j < extra_nfds; j++) {
|
|
|
|
unsigned short mask = 0;
|
|
|
|
unsigned r = ufds[curlfds + j].revents;
|
|
|
|
|
|
|
|
if(r & POLLIN)
|
|
|
|
mask |= CURL_WAIT_POLLIN;
|
|
|
|
if(r & POLLOUT)
|
|
|
|
mask |= CURL_WAIT_POLLOUT;
|
|
|
|
if(r & POLLPRI)
|
|
|
|
mask |= CURL_WAIT_POLLPRI;
|
|
|
|
|
|
|
|
extra_fds[j].revents = mask;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2012-10-09 22:19:49 +02:00
|
|
|
else
|
|
|
|
i = 0;
|
|
|
|
|
2012-12-23 21:06:40 +01:00
|
|
|
Curl_safefree(ufds);
|
2012-09-15 19:38:52 +02:00
|
|
|
if(ret)
|
|
|
|
*ret = i;
|
2012-08-27 21:48:55 +02:00
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
static CURLMcode multi_runsingle(struct Curl_multi *multi,
|
2010-09-01 16:52:23 +02:00
|
|
|
struct timeval now,
|
2013-08-12 13:52:58 +02:00
|
|
|
struct SessionHandle *data)
|
2001-11-28 12:09:18 +01:00
|
|
|
{
|
2002-05-28 16:45:50 +02:00
|
|
|
struct Curl_message *msg = NULL;
|
2002-08-12 11:43:20 +02:00
|
|
|
bool connected;
|
2003-08-05 16:40:59 +02:00
|
|
|
bool async;
|
2007-04-13 09:57:31 +02:00
|
|
|
bool protocol_connect = FALSE;
|
2013-01-17 12:59:23 +01:00
|
|
|
bool dophase_done = FALSE;
|
2008-08-08 03:52:08 +02:00
|
|
|
bool done = FALSE;
|
2014-11-18 14:37:57 +01:00
|
|
|
CURLMcode rc;
|
2014-11-18 15:18:21 +01:00
|
|
|
CURLcode result = CURLE_OK;
|
2007-11-25 00:16:55 +01:00
|
|
|
struct SingleRequest *k;
|
2010-09-01 16:52:23 +02:00
|
|
|
long timeout_ms;
|
2013-08-05 23:49:53 +02:00
|
|
|
int control;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(!GOOD_EASY_HANDLE(data))
|
2008-02-20 09:28:02 +01:00
|
|
|
return CURLM_BAD_EASY_HANDLE;
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
do {
|
2007-04-10 22:46:40 +02:00
|
|
|
bool disconnect_conn = FALSE;
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_OK;
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2007-04-10 22:46:40 +02: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 14:12:05 +02:00
|
|
|
if(data->state.pipe_broke) {
|
2014-11-18 23:02:40 +01:00
|
|
|
infof(data, "Pipe broke: handle %p, url = %s\n",
|
2013-08-12 13:52:58 +02:00
|
|
|
(void *)data, data->state.path);
|
2007-04-10 22:46:40 +02:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->mstate < CURLM_STATE_COMPLETED) {
|
2006-09-07 23:49:20 +02:00
|
|
|
/* Head back to the CONNECT state */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_CONNECT);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_OK;
|
2007-02-25 12:38:13 +01:00
|
|
|
}
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2010-08-10 14:12:05 +02:00
|
|
|
data->state.pipe_broke = FALSE;
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn = NULL;
|
2014-11-18 20:51:54 +01:00
|
|
|
continue;
|
2006-09-07 23:49:20 +02:00
|
|
|
}
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(!data->easy_conn &&
|
|
|
|
data->mstate > CURLM_STATE_CONNECT &&
|
|
|
|
data->mstate < CURLM_STATE_DONE) {
|
|
|
|
/* In all these states, the code will blindly access 'data->easy_conn'
|
2012-07-15 20:31:37 +02:00
|
|
|
so this is precaution that it isn't NULL. And it silences static
|
|
|
|
analyzers. */
|
2013-08-12 13:52:58 +02:00
|
|
|
failf(data, "In state %d with no easy_conn, bail out!\n", data->mstate);
|
2012-07-15 20:31:37 +02:00
|
|
|
return CURLM_INTERNAL_ERROR;
|
|
|
|
}
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn && data->mstate > CURLM_STATE_CONNECT &&
|
|
|
|
data->mstate < CURLM_STATE_COMPLETED)
|
2006-09-07 23:49:20 +02:00
|
|
|
/* Make sure we set the connection's current owner */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->data = data;
|
2004-01-12 16:26:32 +01:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn &&
|
|
|
|
(data->mstate >= CURLM_STATE_CONNECT) &&
|
|
|
|
(data->mstate < CURLM_STATE_COMPLETED)) {
|
2010-12-13 12:51:48 +01:00
|
|
|
/* 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 16:52:23 +02:00
|
|
|
|
2011-01-04 23:07:58 +01:00
|
|
|
timeout_ms = Curl_timeleft(data, &now,
|
2013-08-12 13:52:58 +02:00
|
|
|
(data->mstate <= CURLM_STATE_WAITDO)?
|
2010-11-26 19:34:10 +01:00
|
|
|
TRUE:FALSE);
|
2010-09-01 16:52:23 +02:00
|
|
|
|
|
|
|
if(timeout_ms < 0) {
|
|
|
|
/* Handle timed out */
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->mstate == CURLM_STATE_WAITRESOLVE)
|
2010-09-20 13:58:51 +02:00
|
|
|
failf(data, "Resolving timed out after %ld milliseconds",
|
|
|
|
Curl_tvdiff(now, data->progress.t_startsingle));
|
2013-08-12 13:52:58 +02:00
|
|
|
else if(data->mstate == CURLM_STATE_WAITCONNECT)
|
2010-09-20 13:58:51 +02:00
|
|
|
failf(data, "Connection timed out after %ld milliseconds",
|
|
|
|
Curl_tvdiff(now, data->progress.t_startsingle));
|
|
|
|
else {
|
|
|
|
k = &data->req;
|
2014-01-13 16:00:38 +01:00
|
|
|
if(k->size != -1) {
|
|
|
|
failf(data, "Operation timed out after %ld milliseconds with %"
|
|
|
|
CURL_FORMAT_CURL_OFF_T " out of %"
|
|
|
|
CURL_FORMAT_CURL_OFF_T " bytes received",
|
|
|
|
Curl_tvdiff(k->now, data->progress.t_startsingle),
|
|
|
|
k->bytecount, k->size);
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
failf(data, "Operation timed out after %ld milliseconds with %"
|
|
|
|
CURL_FORMAT_CURL_OFF_T " bytes received",
|
|
|
|
Curl_tvdiff(now, data->progress.t_startsingle),
|
|
|
|
k->bytecount);
|
|
|
|
}
|
2010-09-20 13:58:51 +02:00
|
|
|
}
|
2011-02-18 23:19:14 +01:00
|
|
|
|
2014-11-16 21:53:56 +01:00
|
|
|
/* Force connection closed if the connection has indeed been used */
|
|
|
|
if(data->mstate > CURLM_STATE_DO) {
|
|
|
|
connclose(data->easy_conn, "Disconnected with pending data");
|
|
|
|
disconnect_conn = TRUE;
|
|
|
|
}
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_OPERATION_TIMEDOUT;
|
2014-11-16 21:53:56 +01:00
|
|
|
/* Skip the statemachine and go directly to error handling section. */
|
|
|
|
goto statemachine_end;
|
2010-09-01 16:52:23 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
switch(data->mstate) {
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_INIT:
|
|
|
|
/* init this transfer. */
|
2014-11-18 15:18:21 +01:00
|
|
|
result=Curl_pretransfer(data);
|
2005-02-09 14:06:40 +01:00
|
|
|
|
2014-11-18 15:18:21 +01:00
|
|
|
if(!result) {
|
2006-04-10 17:00:53 +02:00
|
|
|
/* after init, go CONNECT */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_CONNECT);
|
2014-05-15 20:43:32 +02:00
|
|
|
Curl_pgrsTime(data, TIMER_STARTOP);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
break;
|
2003-08-05 16:40:59 +02:00
|
|
|
|
2013-02-15 11:50:45 +01:00
|
|
|
case CURLM_STATE_CONNECT_PEND:
|
|
|
|
/* We will stay here until there is a connection available. Then
|
|
|
|
we try again in the CURLM_STATE_CONNECT state. */
|
|
|
|
break;
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_CONNECT:
|
2013-02-15 11:50:45 +01:00
|
|
|
/* Connect. We want to get a connection identifier filled in. */
|
2014-05-15 20:43:32 +02:00
|
|
|
Curl_pgrsTime(data, TIMER_STARTSINGLE);
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_connect(data, &data->easy_conn,
|
|
|
|
&async, &protocol_connect);
|
|
|
|
if(CURLE_NO_CONNECTION_AVAILABLE == result) {
|
2013-02-15 11:50:45 +01:00
|
|
|
/* There was no connection available. We will go to the pending
|
|
|
|
state and wait for an available connection. */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_CONNECT_PEND);
|
2014-09-02 09:29:50 +02:00
|
|
|
|
|
|
|
/* add this handle to the list of connect-pending handles */
|
|
|
|
if(!Curl_llist_insert_next(multi->pending, multi->pending->tail, data))
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_OUT_OF_MEMORY;
|
2014-09-02 09:29:50 +02:00
|
|
|
else
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_OK;
|
2013-02-15 11:50:45 +01:00
|
|
|
break;
|
|
|
|
}
|
2003-08-05 16:40:59 +02:00
|
|
|
|
2014-11-18 15:18:21 +01:00
|
|
|
if(!result) {
|
2008-01-16 13:24:00 +01:00
|
|
|
/* Add this handle to the send or pend pipeline */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_add_handle_to_pipeline(data, data->easy_conn);
|
2014-11-18 21:25:05 +01:00
|
|
|
if(result)
|
2011-10-06 20:30:34 +02:00
|
|
|
disconnect_conn = TRUE;
|
|
|
|
else {
|
2008-02-03 13:31:35 +01:00
|
|
|
if(async)
|
|
|
|
/* We're now waiting for an asynchronous name lookup */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_WAITRESOLVE);
|
2007-11-03 15:44:38 +01:00
|
|
|
else {
|
2008-02-03 13:31:35 +01: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 22:58:01 +02:00
|
|
|
WAITDO or DO! */
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2008-02-03 13:31:35 +01:00
|
|
|
|
|
|
|
if(protocol_connect)
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, multi->pipelining_enabled?
|
2008-05-19 22:58:01 +02:00
|
|
|
CURLM_STATE_WAITDO:CURLM_STATE_DO);
|
2007-11-03 15:44:38 +01:00
|
|
|
else {
|
2007-02-27 03:24:13 +01:00
|
|
|
#ifndef CURL_DISABLE_HTTP
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn->tunnel_state[FIRSTSOCKET] == TUNNEL_CONNECT)
|
|
|
|
multistate(data, CURLM_STATE_WAITPROXYCONNECT);
|
2008-02-03 13:31:35 +01:00
|
|
|
else
|
2007-02-27 03:24:13 +01:00
|
|
|
#endif
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_WAITCONNECT);
|
2007-11-03 15:44:38 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
break;
|
2004-05-17 08:53:41 +02:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_WAITRESOLVE:
|
|
|
|
/* awaiting an asynch name resolve to complete */
|
|
|
|
{
|
|
|
|
struct Curl_dns_entry *dns = NULL;
|
2014-08-20 23:31:53 +02:00
|
|
|
struct connectdata *conn = data->easy_conn;
|
|
|
|
int stale;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
/* check if we have the name resolved by now */
|
2014-08-20 23:31:53 +02:00
|
|
|
if(data->share)
|
|
|
|
Curl_share_lock(data, CURL_LOCK_DATA_DNS, CURL_LOCK_ACCESS_SINGLE);
|
|
|
|
|
|
|
|
dns = Curl_fetch_addr(conn, conn->host.name, (int)conn->port, &stale);
|
|
|
|
|
|
|
|
if(dns) {
|
|
|
|
dns->inuse++; /* we use it! */
|
|
|
|
#ifdef CURLRES_ASYNCH
|
|
|
|
conn->async.dns = dns;
|
|
|
|
conn->async.done = TRUE;
|
|
|
|
#endif
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_OK;
|
2014-08-20 23:31:53 +02:00
|
|
|
infof(data, "Hostname was found in DNS cache\n");
|
|
|
|
}
|
|
|
|
if(stale)
|
|
|
|
infof(data, "Hostname in DNS cache was stale, zapped\n");
|
|
|
|
|
|
|
|
if(data->share)
|
|
|
|
Curl_share_unlock(data, CURL_LOCK_DATA_DNS);
|
|
|
|
|
|
|
|
if(!dns)
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_resolver_is_resolved(data->easy_conn, &dns);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2011-11-30 21:23:44 +01:00
|
|
|
/* Update sockets here, 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. If the name has not yet been resolved, it is likely
|
|
|
|
that new sockets have been opened in an attempt to contact
|
|
|
|
another resolver. */
|
2013-08-12 13:52:58 +02:00
|
|
|
singlesocket(multi, data);
|
2008-06-19 23:32:51 +02:00
|
|
|
|
2011-11-30 21:23:44 +01:00
|
|
|
if(dns) {
|
2006-04-10 17:00:53 +02:00
|
|
|
/* Perform the next step in the connection phase, and then move on
|
|
|
|
to the WAITCONNECT state */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_async_resolved(data->easy_conn, &protocol_connect);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2014-11-18 15:18:21 +01:00
|
|
|
if(result)
|
2006-04-10 17:00:53 +02:00
|
|
|
/* if Curl_async_resolved() returns failure, the connection struct
|
|
|
|
is already freed and gone */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn = NULL; /* no more connection */
|
2006-04-10 17:00:53 +02:00
|
|
|
else {
|
2006-08-31 14:53:39 +02:00
|
|
|
/* call again please so that we get the next socket setup */
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-08-31 14:53:39 +02:00
|
|
|
if(protocol_connect)
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, multi->pipelining_enabled?
|
2008-05-19 22:58:01 +02:00
|
|
|
CURLM_STATE_WAITDO:CURLM_STATE_DO);
|
2007-02-25 12:38:13 +01:00
|
|
|
else {
|
2007-02-27 03:24:13 +01:00
|
|
|
#ifndef CURL_DISABLE_HTTP
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn->tunnel_state[FIRSTSOCKET] == TUNNEL_CONNECT)
|
|
|
|
multistate(data, CURLM_STATE_WAITPROXYCONNECT);
|
2007-02-25 12:38:13 +01:00
|
|
|
else
|
2007-02-27 03:24:13 +01:00
|
|
|
#endif
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_WAITCONNECT);
|
2007-02-25 12:38:13 +01:00
|
|
|
}
|
2003-08-05 16:40:59 +02:00
|
|
|
}
|
2001-12-13 08:16:27 +01:00
|
|
|
}
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2014-11-18 21:25:05 +01:00
|
|
|
if(result) {
|
2006-04-10 17:00:53 +02:00
|
|
|
/* failure detected */
|
2007-04-10 22:46:40 +02:00
|
|
|
disconnect_conn = TRUE;
|
2006-04-10 17:00:53 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
break;
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2007-02-27 03:24:13 +01:00
|
|
|
#ifndef CURL_DISABLE_HTTP
|
2007-02-25 12:38:13 +01:00
|
|
|
case CURLM_STATE_WAITPROXYCONNECT:
|
|
|
|
/* this is HTTP-specific, but sending CONNECT to a proxy is HTTP... */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_http_connect(data->easy_conn, &protocol_connect);
|
2007-02-25 12:38:13 +01:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn->bits.proxy_connect_closed) {
|
2014-07-19 23:58:58 +02:00
|
|
|
/* connect back to proxy again */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_OK;
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_CONNECT);
|
2008-08-23 14:11:38 +02:00
|
|
|
}
|
2014-11-18 15:18:21 +01:00
|
|
|
else if(!result) {
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn->tunnel_state[FIRSTSOCKET] == TUNNEL_COMPLETE)
|
|
|
|
multistate(data, CURLM_STATE_WAITCONNECT);
|
2007-02-25 12:38:13 +01:00
|
|
|
}
|
|
|
|
break;
|
2007-02-27 03:24:13 +01:00
|
|
|
#endif
|
2007-02-25 12:38:13 +01:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_WAITCONNECT:
|
|
|
|
/* awaiting a completion of an asynch connect */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_is_connected(data->easy_conn,
|
|
|
|
FIRSTSOCKET,
|
|
|
|
&connected);
|
2009-05-08 12:59:40 +02:00
|
|
|
if(connected) {
|
|
|
|
|
2014-11-18 15:18:21 +01:00
|
|
|
if(!result)
|
2009-05-08 12:59:40 +02:00
|
|
|
/* if everything is still fine we do the protocol-specific connect
|
|
|
|
setup */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_protocol_connect(data->easy_conn,
|
|
|
|
&protocol_connect);
|
2009-05-08 12:59:40 +02:00
|
|
|
}
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2014-07-19 23:58:58 +02:00
|
|
|
if(data->easy_conn->bits.proxy_connect_closed) {
|
|
|
|
/* connect back to proxy again since it was closed in a proxy CONNECT
|
|
|
|
setup */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_OK;
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2014-07-19 23:58:58 +02:00
|
|
|
multistate(data, CURLM_STATE_CONNECT);
|
|
|
|
break;
|
|
|
|
}
|
2014-11-18 21:25:05 +01:00
|
|
|
else if(result) {
|
2006-04-10 17:00:53 +02:00
|
|
|
/* failure detected */
|
2007-04-10 22:46:40 +02:00
|
|
|
/* Just break, the cleaning up is handled all in one place */
|
|
|
|
disconnect_conn = TRUE;
|
2005-02-09 14:06:40 +01:00
|
|
|
break;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
2005-02-09 14:06:40 +01:00
|
|
|
|
2006-04-10 17:00:53 +02: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 16:42:21 +02: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 13:32:55 +02:00
|
|
|
*/
|
2007-06-14 16:42:21 +02:00
|
|
|
#ifndef CURL_DISABLE_HTTP
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn->tunnel_state[FIRSTSOCKET] == TUNNEL_CONNECT)
|
|
|
|
multistate(data, CURLM_STATE_WAITPROXYCONNECT);
|
2007-06-14 16:42:21 +02:00
|
|
|
else
|
|
|
|
#endif
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_PROTOCONNECT);
|
2010-01-12 00:05:35 +01:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
2010-01-12 00:05:35 +01:00
|
|
|
else
|
2008-05-19 22:58:01 +02:00
|
|
|
/* after the connect has completed, go WAITDO or DO */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, multi->pipelining_enabled?
|
2008-05-19 22:58:01 +02:00
|
|
|
CURLM_STATE_WAITDO:CURLM_STATE_DO);
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
break;
|
2004-01-12 16:26:32 +01:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_PROTOCONNECT:
|
|
|
|
/* protocol-specific connect phase */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_protocol_connecting(data->easy_conn, &protocol_connect);
|
|
|
|
if(!result && protocol_connect) {
|
2008-05-19 22:58:01 +02:00
|
|
|
/* after the connect has completed, go WAITDO or DO */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, multi->pipelining_enabled?
|
2008-05-19 22:58:01 +02:00
|
|
|
CURLM_STATE_WAITDO:CURLM_STATE_DO);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
2014-11-18 15:18:21 +01:00
|
|
|
else if(result) {
|
2006-04-10 17:00:53 +02:00
|
|
|
/* failure detected */
|
2010-08-10 14:12:05 +02:00
|
|
|
Curl_posttransfer(data);
|
2014-11-18 15:18:21 +01:00
|
|
|
Curl_done(&data->easy_conn, result, TRUE);
|
2007-04-10 22:46:40 +02:00
|
|
|
disconnect_conn = TRUE;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
break;
|
2005-02-09 14:06:40 +01:00
|
|
|
|
2006-09-07 23:49:20 +02:00
|
|
|
case CURLM_STATE_WAITDO:
|
|
|
|
/* Wait for our turn to DO when we're pipelining requests */
|
2009-06-10 04:49:42 +02:00
|
|
|
#ifdef DEBUGBUILD
|
2013-07-24 16:43:13 +02:00
|
|
|
infof(data, "WAITDO: Conn %ld send pipe %zu inuse %s athead %s\n",
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->connection_id,
|
|
|
|
data->easy_conn->send_pipe->size,
|
|
|
|
data->easy_conn->writechannel_inuse?"TRUE":"FALSE",
|
2010-08-10 14:12:05 +02:00
|
|
|
isHandleAtHead(data,
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->send_pipe)?"TRUE":"FALSE");
|
2006-10-06 23:19:57 +02:00
|
|
|
#endif
|
2013-08-12 13:52:58 +02:00
|
|
|
if(!data->easy_conn->writechannel_inuse &&
|
2010-08-10 14:12:05 +02:00
|
|
|
isHandleAtHead(data,
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->send_pipe)) {
|
2006-09-07 23:49:20 +02:00
|
|
|
/* Grab the channel */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->writechannel_inuse = TRUE;
|
|
|
|
multistate(data, CURLM_STATE_DO);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-09-07 23:49:20 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_DO:
|
2010-08-10 14:12:05 +02:00
|
|
|
if(data->set.connect_only) {
|
2006-04-10 17:00:53 +02:00
|
|
|
/* keep connection open for application to use the socket */
|
2014-05-20 10:32:23 +02:00
|
|
|
connkeep(data->easy_conn, "CONNECT_ONLY");
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_DONE);
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_OK;
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* Perform the protocol's DO action */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_do(&data->easy_conn, &dophase_done);
|
2013-03-09 18:05:28 +01:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
/* When Curl_do() returns failure, data->easy_conn might be NULL! */
|
2004-01-12 16:26:32 +01:00
|
|
|
|
2014-11-18 15:18:21 +01:00
|
|
|
if(!result) {
|
2006-04-10 17:00:53 +02:00
|
|
|
if(!dophase_done) {
|
2010-05-12 15:33:22 +02:00
|
|
|
/* some steps needed for wildcard matching */
|
2010-08-10 14:12:05 +02:00
|
|
|
if(data->set.wildcardmatch) {
|
|
|
|
struct WildcardData *wc = &data->wildcard;
|
2010-05-12 15:33:22 +02:00
|
|
|
if(wc->state == CURLWC_DONE || wc->state == CURLWC_SKIP) {
|
|
|
|
/* skip some states if it is important */
|
2013-08-12 13:52:58 +02:00
|
|
|
Curl_done(&data->easy_conn, CURLE_OK, FALSE);
|
|
|
|
multistate(data, CURLM_STATE_DONE);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2010-05-12 15:33:22 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
/* DO was not completed in one function call, we must continue
|
|
|
|
DOING... */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_DOING);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_OK;
|
2002-08-12 11:43:20 +02:00
|
|
|
}
|
|
|
|
|
2006-09-07 23:49:20 +02:00
|
|
|
/* after DO, go DO_DONE... or DO_MORE */
|
2013-08-12 13:52:58 +02:00
|
|
|
else if(data->easy_conn->bits.do_more) {
|
2006-04-10 17:00:53 +02:00
|
|
|
/* we're supposed to do more, but we need to sit down, relax
|
|
|
|
and wait a little while first */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_DO_MORE);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_OK;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
else {
|
2006-09-07 23:49:20 +02:00
|
|
|
/* we're done with the DO, now DO_DONE */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_DO_DONE);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
2005-02-09 14:06:40 +01:00
|
|
|
}
|
2014-11-18 15:18:21 +01:00
|
|
|
else if((CURLE_SEND_ERROR == result) &&
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->bits.reuse) {
|
2009-08-21 09:11:20 +02: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 10:41:17 +02:00
|
|
|
char *newurl = NULL;
|
2009-08-21 09:11:20 +02:00
|
|
|
followtype follow=FOLLOW_NONE;
|
|
|
|
CURLcode drc;
|
2009-08-21 14:01:36 +02:00
|
|
|
bool retry = FALSE;
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
drc = Curl_retry_request(data->easy_conn, &newurl);
|
2009-08-21 14:01:36 +02:00
|
|
|
if(drc) {
|
|
|
|
/* a failure here pretty much implies an out of memory */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = drc;
|
2009-08-21 14:01:36 +02:00
|
|
|
disconnect_conn = TRUE;
|
|
|
|
}
|
|
|
|
else
|
2011-09-05 20:46:09 +02:00
|
|
|
retry = (newurl)?TRUE:FALSE;
|
2009-08-21 09:11:20 +02:00
|
|
|
|
2010-08-10 14:12:05 +02:00
|
|
|
Curl_posttransfer(data);
|
2014-11-18 15:18:21 +01:00
|
|
|
drc = Curl_done(&data->easy_conn, result, FALSE);
|
2009-08-21 09:11:20 +02:00
|
|
|
|
|
|
|
/* When set to retry the connection, we must to go back to
|
|
|
|
* the CONNECT state */
|
|
|
|
if(retry) {
|
2014-10-23 22:56:35 +02:00
|
|
|
if(!drc || (drc == CURLE_SEND_ERROR)) {
|
2009-08-21 09:11:20 +02:00
|
|
|
follow = FOLLOW_RETRY;
|
2010-08-10 14:12:05 +02:00
|
|
|
drc = Curl_follow(data, newurl, follow);
|
2014-10-23 22:56:35 +02:00
|
|
|
if(!drc) {
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_CONNECT);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_OK;
|
2009-08-21 09:11:20 +02:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* Follow failed */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = drc;
|
2009-08-21 09:11:20 +02:00
|
|
|
free(newurl);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* done didn't return OK or SEND_ERROR */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = drc;
|
2009-08-21 09:11:20 +02:00
|
|
|
free(newurl);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* Have error handler disconnect conn if we can't retry */
|
|
|
|
disconnect_conn = TRUE;
|
2014-10-07 13:57:13 +02:00
|
|
|
free(newurl);
|
2009-08-21 09:11:20 +02:00
|
|
|
}
|
|
|
|
}
|
2005-02-09 14:06:40 +01:00
|
|
|
else {
|
|
|
|
/* failure detected */
|
2010-08-10 14:12:05 +02:00
|
|
|
Curl_posttransfer(data);
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn)
|
2014-11-18 15:18:21 +01:00
|
|
|
Curl_done(&data->easy_conn, result, FALSE);
|
2007-04-10 22:46:40 +02:00
|
|
|
disconnect_conn = TRUE;
|
2005-02-09 14:06:40 +01:00
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
break;
|
2004-01-12 16:26:32 +01:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_DOING:
|
|
|
|
/* we continue DOING until the DO phase is complete */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_protocol_doing(data->easy_conn,
|
|
|
|
&dophase_done);
|
|
|
|
if(!result) {
|
2006-04-10 17:00:53 +02:00
|
|
|
if(dophase_done) {
|
2011-10-27 12:46:29 +02:00
|
|
|
/* after DO, go DO_DONE or DO_MORE */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, data->easy_conn->bits.do_more?
|
2011-10-27 12:46:29 +02:00
|
|
|
CURLM_STATE_DO_MORE:
|
|
|
|
CURLM_STATE_DO_DONE);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-04-10 17:00:53 +02:00
|
|
|
} /* dophase_done */
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* failure detected */
|
2010-08-10 14:12:05 +02:00
|
|
|
Curl_posttransfer(data);
|
2014-11-18 15:18:21 +01:00
|
|
|
Curl_done(&data->easy_conn, result, FALSE);
|
2007-04-10 22:46:40 +02:00
|
|
|
disconnect_conn = TRUE;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case CURLM_STATE_DO_MORE:
|
2011-12-20 12:52:24 +01:00
|
|
|
/*
|
|
|
|
* When we are connected, DO MORE and then go DO_DONE
|
|
|
|
*/
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_do_more(data->easy_conn, &control);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2011-12-20 12:52:24 +01:00
|
|
|
/* No need to remove this handle from the send pipeline here since that
|
|
|
|
is done in Curl_done() */
|
2014-11-18 15:18:21 +01:00
|
|
|
if(!result) {
|
2013-08-05 23:49:53 +02:00
|
|
|
if(control) {
|
|
|
|
/* if positive, advance to DO_DONE
|
|
|
|
if negative, go back to DOING */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, control==1?
|
2013-08-05 23:49:53 +02:00
|
|
|
CURLM_STATE_DO_DONE:
|
|
|
|
CURLM_STATE_DOING);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2002-01-03 16:01:22 +01:00
|
|
|
}
|
2011-12-20 12:52:24 +01:00
|
|
|
else
|
|
|
|
/* stay in DO_MORE */
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_OK;
|
2011-12-20 12:52:24 +01:00
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* failure detected */
|
|
|
|
Curl_posttransfer(data);
|
2014-11-18 15:18:21 +01:00
|
|
|
Curl_done(&data->easy_conn, result, FALSE);
|
2011-12-20 12:52:24 +01:00
|
|
|
disconnect_conn = TRUE;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
break;
|
2002-08-12 11:43:20 +02:00
|
|
|
|
2006-09-07 23:49:20 +02:00
|
|
|
case CURLM_STATE_DO_DONE:
|
2008-01-16 13:24:00 +01:00
|
|
|
/* Move ourselves from the send to recv pipeline */
|
2013-08-12 13:52:58 +02:00
|
|
|
Curl_move_handle_from_send_to_recv_pipe(data, data->easy_conn);
|
2008-01-16 13:24:00 +01:00
|
|
|
/* Check if we can move pending requests to send pipe */
|
2013-02-15 11:50:45 +01:00
|
|
|
Curl_multi_process_pending_handles(multi);
|
2013-12-22 23:36:11 +01:00
|
|
|
|
|
|
|
/* Only perform the transfer if there's a good socket to work with.
|
|
|
|
Having both BAD is a signal to skip immediately to DONE */
|
|
|
|
if((data->easy_conn->sockfd != CURL_SOCKET_BAD) ||
|
|
|
|
(data->easy_conn->writesockfd != CURL_SOCKET_BAD))
|
|
|
|
multistate(data, CURLM_STATE_WAITPERFORM);
|
|
|
|
else
|
|
|
|
multistate(data, CURLM_STATE_DONE);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-09-07 23:49:20 +02:00
|
|
|
break;
|
|
|
|
|
|
|
|
case CURLM_STATE_WAITPERFORM:
|
|
|
|
/* Wait for our turn to PERFORM */
|
2013-08-12 13:52:58 +02:00
|
|
|
if(!data->easy_conn->readchannel_inuse &&
|
2010-08-10 14:12:05 +02:00
|
|
|
isHandleAtHead(data,
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->recv_pipe)) {
|
2006-09-07 23:49:20 +02:00
|
|
|
/* Grab the channel */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->readchannel_inuse = TRUE;
|
|
|
|
multistate(data, CURLM_STATE_PERFORM);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-09-07 23:49:20 +02:00
|
|
|
}
|
2009-06-10 04:49:42 +02:00
|
|
|
#ifdef DEBUGBUILD
|
2009-02-20 09:16:03 +01:00
|
|
|
else {
|
2013-07-24 16:43:13 +02:00
|
|
|
infof(data, "WAITPERFORM: Conn %ld recv pipe %zu inuse %s athead %s\n",
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->connection_id,
|
|
|
|
data->easy_conn->recv_pipe->size,
|
|
|
|
data->easy_conn->readchannel_inuse?"TRUE":"FALSE",
|
2010-08-10 14:12:05 +02:00
|
|
|
isHandleAtHead(data,
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->recv_pipe)?"TRUE":"FALSE");
|
2009-02-20 09:16:03 +01:00
|
|
|
}
|
|
|
|
#endif
|
2006-09-07 23:49:20 +02:00
|
|
|
break;
|
|
|
|
|
2006-06-22 23:36:53 +02:00
|
|
|
case CURLM_STATE_TOOFAST: /* limit-rate exceeded in either direction */
|
|
|
|
/* if both rates are within spec, resume transfer */
|
2013-08-12 13:52:58 +02:00
|
|
|
if(Curl_pgrsUpdate(data->easy_conn))
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_ABORTED_BY_CALLBACK;
|
2012-10-02 00:16:20 +02:00
|
|
|
else
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_speedcheck(data, now);
|
2012-10-02 00:16:20 +02:00
|
|
|
|
2011-04-22 23:01:30 +02: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)))
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_PERFORM);
|
2006-06-22 23:36:53 +02:00
|
|
|
break;
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_PERFORM:
|
2014-11-18 15:18:21 +01:00
|
|
|
{
|
2012-11-30 14:52:38 +01:00
|
|
|
char *newurl = NULL;
|
|
|
|
bool retry = FALSE;
|
|
|
|
|
2010-08-10 14:12:05 +02:00
|
|
|
/* check if over send speed */
|
2011-04-22 23:01:30 +02:00
|
|
|
if((data->set.max_send_speed > 0) &&
|
|
|
|
(data->progress.ulspeed > data->set.max_send_speed)) {
|
2010-08-10 14:12:05 +02:00
|
|
|
int buffersize;
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_TOOFAST);
|
2010-08-10 14:12:05 +02:00
|
|
|
|
|
|
|
/* 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);
|
2014-08-25 11:34:14 +02:00
|
|
|
Curl_expire_latest(data, timeout_ms);
|
2010-08-10 14:12:05 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* check if over recv speed */
|
2011-04-22 23:01:30 +02:00
|
|
|
if((data->set.max_recv_speed > 0) &&
|
|
|
|
(data->progress.dlspeed > data->set.max_recv_speed)) {
|
2010-08-10 14:12:05 +02:00
|
|
|
int buffersize;
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_TOOFAST);
|
2010-08-10 14:12:05 +02:00
|
|
|
|
2014-11-18 15:18:21 +01:00
|
|
|
/* Calculate download rate-limitation timeout. */
|
2010-08-10 14:12:05 +02:00
|
|
|
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);
|
2014-08-25 11:34:14 +02:00
|
|
|
Curl_expire_latest(data, timeout_ms);
|
2006-06-22 23:36:53 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
/* read/write data if it is ready to do so */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_readwrite(data->easy_conn, &done);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2010-08-10 14:12:05 +02:00
|
|
|
k = &data->req;
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2009-05-11 09:53:38 +02:00
|
|
|
if(!(k->keepon & KEEP_RECV)) {
|
|
|
|
/* We're done receiving */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->readchannel_inuse = FALSE;
|
2006-09-07 23:49:20 +02:00
|
|
|
}
|
|
|
|
|
2009-05-11 09:53:38 +02:00
|
|
|
if(!(k->keepon & KEEP_SEND)) {
|
|
|
|
/* We're done sending */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->writechannel_inuse = FALSE;
|
2006-09-07 23:49:20 +02:00
|
|
|
}
|
|
|
|
|
2014-11-18 15:18:21 +01:00
|
|
|
if(done || (result == CURLE_RECV_ERROR)) {
|
2012-11-30 14:52:38 +01:00
|
|
|
/* If CURLE_RECV_ERROR happens early enough, we assume it was a race
|
|
|
|
* condition and the server closed the re-used connection exactly when
|
|
|
|
* we wanted to use it, so figure out if that is indeed the case.
|
|
|
|
*/
|
2013-08-12 13:52:58 +02:00
|
|
|
CURLcode ret = Curl_retry_request(data->easy_conn, &newurl);
|
2012-11-30 14:52:38 +01:00
|
|
|
if(!ret)
|
|
|
|
retry = (newurl)?TRUE:FALSE;
|
|
|
|
|
2013-01-17 12:59:23 +01:00
|
|
|
if(retry) {
|
|
|
|
/* if we are to retry, set the result to OK and consider the
|
|
|
|
request as done */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_OK;
|
2013-01-17 12:59:23 +01:00
|
|
|
done = TRUE;
|
|
|
|
}
|
2012-11-30 14:52:38 +01:00
|
|
|
}
|
|
|
|
|
2014-11-18 15:18:21 +01:00
|
|
|
if(result) {
|
2012-11-30 14:52:38 +01:00
|
|
|
/*
|
|
|
|
* The transfer phase returned error, we mark the connection to get
|
2009-02-20 09:16:03 +01: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.
|
|
|
|
*/
|
2012-11-30 14:52:38 +01:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(!(data->easy_conn->handler->flags & PROTOPT_DUAL))
|
2014-05-20 10:32:23 +02:00
|
|
|
connclose(data->easy_conn, "Transfer returned error");
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2010-08-10 14:12:05 +02:00
|
|
|
Curl_posttransfer(data);
|
2014-11-18 15:18:21 +01:00
|
|
|
Curl_done(&data->easy_conn, result, FALSE);
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
2011-09-05 20:46:09 +02:00
|
|
|
else if(done) {
|
2008-04-30 23:20:08 +02:00
|
|
|
followtype follow=FOLLOW_NONE;
|
2004-01-12 16:26:32 +01:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
/* call this even if the readwrite function returned error */
|
2010-08-10 14:12:05 +02:00
|
|
|
Curl_posttransfer(data);
|
2004-01-12 16:26:32 +01:00
|
|
|
|
2011-04-19 15:54:13 +02:00
|
|
|
/* we're no longer receiving */
|
2013-08-12 13:52:58 +02:00
|
|
|
Curl_removeHandleFromPipeline(data, data->easy_conn->recv_pipe);
|
2008-05-28 22:56:19 +02:00
|
|
|
|
|
|
|
/* expire the new receiving pipeline head */
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn->recv_pipe->head)
|
2014-08-25 11:34:14 +02:00
|
|
|
Curl_expire_latest(data->easy_conn->recv_pipe->head->ptr, 1);
|
2008-05-28 22:56:19 +02:00
|
|
|
|
|
|
|
/* Check if we can move pending requests to send pipe */
|
2013-02-15 11:50:45 +01:00
|
|
|
Curl_multi_process_pending_handles(multi);
|
2008-05-28 22:56:19 +02:00
|
|
|
|
2008-09-29 14:22:10 +02:00
|
|
|
/* When we follow redirects or is set to retry the connection, we must
|
|
|
|
to go back to the CONNECT state */
|
2010-08-10 14:12:05 +02:00
|
|
|
if(data->req.newurl || retry) {
|
2006-04-10 17:00:53 +02:00
|
|
|
if(!retry) {
|
|
|
|
/* if the URL is a follow-location and not just a retried request
|
|
|
|
then figure out the URL here */
|
2014-10-02 23:22:01 +02:00
|
|
|
if(newurl)
|
|
|
|
free(newurl);
|
2010-08-10 14:12:05 +02:00
|
|
|
newurl = data->req.newurl;
|
|
|
|
data->req.newurl = NULL;
|
2008-04-30 23:20:08 +02:00
|
|
|
follow = FOLLOW_REDIR;
|
2004-01-12 16:26:32 +01:00
|
|
|
}
|
2008-04-30 23:20:08 +02:00
|
|
|
else
|
|
|
|
follow = FOLLOW_RETRY;
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_done(&data->easy_conn, CURLE_OK, FALSE);
|
|
|
|
if(!result) {
|
|
|
|
result = Curl_follow(data, newurl, follow);
|
|
|
|
if(!result) {
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_CONNECT);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2013-05-30 23:34:33 +02:00
|
|
|
newurl = NULL; /* handed over the memory ownership to
|
|
|
|
Curl_follow(), make sure we don't free() it
|
|
|
|
here */
|
|
|
|
}
|
2002-10-18 17:27:49 +02:00
|
|
|
}
|
2002-10-07 15:38:59 +02:00
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
else {
|
|
|
|
/* after the transfer is done, go DONE */
|
2008-09-29 14:22:10 +02:00
|
|
|
|
|
|
|
/* but first check to see if we got a location info even though we're
|
|
|
|
not following redirects */
|
2011-04-20 15:17:42 +02:00
|
|
|
if(data->req.location) {
|
2012-11-30 14:52:38 +01:00
|
|
|
if(newurl)
|
|
|
|
free(newurl);
|
2010-08-10 14:12:05 +02:00
|
|
|
newurl = data->req.location;
|
|
|
|
data->req.location = NULL;
|
2014-11-18 15:18:21 +01:00
|
|
|
result = Curl_follow(data, newurl, FOLLOW_FAKE);
|
|
|
|
if(!result)
|
2012-12-21 19:48:07 +01:00
|
|
|
newurl = NULL; /* allocation was handed over Curl_follow() */
|
|
|
|
else
|
2011-10-06 20:30:34 +02:00
|
|
|
disconnect_conn = TRUE;
|
2008-09-29 14:22:10 +02:00
|
|
|
}
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_DONE);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
}
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2012-11-30 14:52:38 +01:00
|
|
|
if(newurl)
|
|
|
|
free(newurl);
|
2006-04-10 17:00:53 +02:00
|
|
|
break;
|
2014-11-18 15:18:21 +01:00
|
|
|
}
|
2006-06-22 23:36:53 +02:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_DONE:
|
2013-08-21 23:08:38 +02:00
|
|
|
/* this state is highly transient, so run another loop after this */
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn) {
|
2014-01-02 23:24:26 +01:00
|
|
|
CURLcode res;
|
|
|
|
|
2013-02-15 11:50:45 +01:00
|
|
|
/* Remove ourselves from the receive pipeline, if we are there. */
|
2013-08-21 23:08:38 +02:00
|
|
|
Curl_removeHandleFromPipeline(data, data->easy_conn->recv_pipe);
|
2009-08-21 09:11:20 +02:00
|
|
|
/* Check if we can move pending requests to send pipe */
|
2013-02-15 11:50:45 +01:00
|
|
|
Curl_multi_process_pending_handles(multi);
|
2009-08-21 09:11:20 +02:00
|
|
|
|
|
|
|
/* post-transfer command */
|
2014-11-18 15:18:21 +01:00
|
|
|
res = Curl_done(&data->easy_conn, result, FALSE);
|
2014-01-02 23:24:26 +01:00
|
|
|
|
|
|
|
/* allow a previously set error code take precedence */
|
2014-11-18 15:18:21 +01:00
|
|
|
if(!result)
|
|
|
|
result = res;
|
2014-01-02 23:24:26 +01:00
|
|
|
|
2009-08-21 09:11:20 +02:00
|
|
|
/*
|
|
|
|
* 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
|
|
|
|
*/
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn)
|
|
|
|
data->easy_conn = NULL;
|
2009-08-21 09:11:20 +02:00
|
|
|
}
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2010-08-10 14:12:05 +02:00
|
|
|
if(data->set.wildcardmatch) {
|
|
|
|
if(data->wildcard.state != CURLWC_DONE) {
|
2010-05-16 22:01:17 +02:00
|
|
|
/* if a wildcard is set and we are not ending -> lets start again
|
2010-05-12 15:33:22 +02:00
|
|
|
with CURLM_STATE_INIT */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_INIT);
|
2010-05-12 15:33:22 +02:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-01-22 00:48:58 +01:00
|
|
|
/* after we have DONE what we're supposed to do, go COMPLETED, and
|
|
|
|
it doesn't matter what the Curl_done() returned! */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_COMPLETED);
|
2006-04-10 17:00:53 +02:00
|
|
|
break;
|
2002-05-03 00:12:14 +02:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
case CURLM_STATE_COMPLETED:
|
|
|
|
/* this is a completed transfer, it is likely to still be connected */
|
2001-11-28 16:46:25 +01:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
/* This node should be delinked from the list now and we should post
|
|
|
|
an information message that we are complete. */
|
2007-04-10 22:46:40 +02:00
|
|
|
|
|
|
|
/* Important: reset the conn pointer so that we don't point to memory
|
|
|
|
that could be freed anytime */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn = NULL;
|
2010-09-28 23:17:34 +02:00
|
|
|
|
|
|
|
Curl_expire(data, 0); /* stop all timers */
|
2006-04-10 17:00:53 +02:00
|
|
|
break;
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2010-08-18 19:59:46 +02:00
|
|
|
case CURLM_STATE_MSGSENT:
|
2014-11-18 15:18:21 +01:00
|
|
|
data->result = result;
|
2010-08-18 19:59:46 +02:00
|
|
|
return CURLM_OK; /* do nothing */
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
default:
|
|
|
|
return CURLM_INTERNAL_ERROR;
|
|
|
|
}
|
2014-11-18 15:18:21 +01:00
|
|
|
statemachine_end:
|
2002-01-03 16:01:22 +01:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->mstate < CURLM_STATE_COMPLETED) {
|
2014-11-18 21:25:05 +01:00
|
|
|
if(result) {
|
2006-04-10 17:00:53 +02:00
|
|
|
/*
|
|
|
|
* If an error was returned, and we aren't in completed state now,
|
2006-09-07 23:49:20 +02:00
|
|
|
* then we go to completed and consider this transfer aborted.
|
|
|
|
*/
|
2007-04-10 22:46:40 +02:00
|
|
|
|
|
|
|
/* NOTE: no attempt to disconnect connections must be made
|
|
|
|
in the case blocks above - cleanup happens only here */
|
|
|
|
|
2010-08-10 14:12:05 +02:00
|
|
|
data->state.pipe_broke = FALSE;
|
2006-10-10 16:23:34 +02:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->easy_conn) {
|
2006-10-06 23:19:57 +02:00
|
|
|
/* if this has a connection, unsubscribe from the pipelines */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn->writechannel_inuse = FALSE;
|
|
|
|
data->easy_conn->readchannel_inuse = FALSE;
|
2014-11-18 15:18:21 +01:00
|
|
|
Curl_removeHandleFromPipeline(data, data->easy_conn->send_pipe);
|
|
|
|
Curl_removeHandleFromPipeline(data, data->easy_conn->recv_pipe);
|
2008-01-16 13:24:00 +01:00
|
|
|
/* Check if we can move pending requests to send pipe */
|
2013-02-15 11:50:45 +01:00
|
|
|
Curl_multi_process_pending_handles(multi);
|
2007-04-10 22:46:40 +02:00
|
|
|
|
2011-10-13 18:04:56 +02:00
|
|
|
if(disconnect_conn) {
|
2014-11-16 21:53:56 +01:00
|
|
|
/* Don't attempt to send data over a connection that timed out */
|
2014-11-18 15:18:21 +01:00
|
|
|
bool dead_connection = result == CURLE_OPERATION_TIMEDOUT;
|
2011-10-13 18:04:56 +02:00
|
|
|
/* disconnect properly */
|
2014-11-16 21:53:56 +01:00
|
|
|
Curl_disconnect(data->easy_conn, dead_connection);
|
2007-04-10 22:46:40 +02:00
|
|
|
|
2011-10-13 18:04:56 +02: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 */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->easy_conn = NULL;
|
2011-10-13 18:04:56 +02:00
|
|
|
}
|
|
|
|
}
|
2013-08-12 13:52:58 +02:00
|
|
|
else if(data->mstate == CURLM_STATE_CONNECT) {
|
2011-10-13 18:04:56 +02:00
|
|
|
/* Curl_connect() failed */
|
|
|
|
(void)Curl_posttransfer(data);
|
2007-04-10 22:46:40 +02:00
|
|
|
}
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, CURLM_STATE_COMPLETED);
|
2003-04-29 20:03:30 +02:00
|
|
|
}
|
2010-06-18 23:46:09 +02:00
|
|
|
/* if there's still a connection to use, call the progress function */
|
2013-08-12 13:52:58 +02:00
|
|
|
else if(data->easy_conn && Curl_pgrsUpdate(data->easy_conn)) {
|
2011-10-02 19:28:39 +02:00
|
|
|
/* aborted due to progress callback return code must close the
|
|
|
|
connection */
|
2014-11-18 15:18:21 +01:00
|
|
|
result = CURLE_ABORTED_BY_CALLBACK;
|
2014-05-20 10:32:23 +02:00
|
|
|
connclose(data->easy_conn, "Aborted by callback");
|
2011-10-02 19:28:39 +02:00
|
|
|
|
|
|
|
/* if not yet in DONE state, go there, otherwise COMPLETED */
|
2013-08-12 13:52:58 +02:00
|
|
|
multistate(data, (data->mstate < CURLM_STATE_DONE)?
|
2011-10-02 19:28:39 +02:00
|
|
|
CURLM_STATE_DONE: CURLM_STATE_COMPLETED);
|
2014-11-18 14:37:57 +01:00
|
|
|
rc = CURLM_CALL_MULTI_PERFORM;
|
2011-09-30 22:59:50 +02:00
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
2010-08-09 00:01:36 +02:00
|
|
|
|
2014-11-18 20:51:54 +01:00
|
|
|
if(CURLM_STATE_COMPLETED == data->mstate) {
|
|
|
|
/* now fill in the Curl_message with this info */
|
|
|
|
msg = &data->msg;
|
|
|
|
|
|
|
|
msg->extmsg.msg = CURLMSG_DONE;
|
|
|
|
msg->extmsg.easy_handle = data;
|
|
|
|
msg->extmsg.data.result = result;
|
2014-11-18 15:18:21 +01:00
|
|
|
|
2014-11-18 20:51:54 +01:00
|
|
|
rc = multi_addmsg(multi, msg);
|
2002-05-28 16:45:50 +02:00
|
|
|
|
2014-11-18 20:51:54 +01:00
|
|
|
multistate(data, CURLM_STATE_MSGSENT);
|
|
|
|
}
|
|
|
|
} while(rc == CURLM_CALL_MULTI_PERFORM);
|
2002-05-28 16:45:50 +02:00
|
|
|
|
2014-11-18 20:51:54 +01:00
|
|
|
data->result = result;
|
2010-08-18 19:59:46 +02:00
|
|
|
|
2002-05-03 00:12:14 +02:00
|
|
|
|
2014-11-18 14:37:57 +01:00
|
|
|
return rc;
|
2001-11-28 12:09:18 +01:00
|
|
|
}
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
CURLMcode curl_multi_perform(CURLM *multi_handle, int *running_handles)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
2013-08-12 13:52:58 +02:00
|
|
|
struct SessionHandle *data;
|
2006-04-10 17:00:53 +02:00
|
|
|
CURLMcode returncode=CURLM_OK;
|
|
|
|
struct Curl_tree *t;
|
2010-07-12 19:19:31 +02:00
|
|
|
struct timeval now = Curl_tvnow();
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
if(!GOOD_MULTI_HANDLE(multi))
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
data=multi->easyp;
|
|
|
|
while(data) {
|
2006-09-07 23:49:20 +02:00
|
|
|
CURLMcode result;
|
2013-08-12 13:52:58 +02:00
|
|
|
struct WildcardData *wc = &data->wildcard;
|
2014-02-17 10:35:21 +01:00
|
|
|
SIGPIPE_VARIABLE(pipe_st);
|
2010-05-12 15:33:22 +02:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->set.wildcardmatch) {
|
2010-05-12 15:33:22 +02:00
|
|
|
if(!wc->filelist) {
|
|
|
|
CURLcode ret = Curl_wildcard_init(wc); /* init wildcard structures */
|
|
|
|
if(ret)
|
|
|
|
return CURLM_OUT_OF_MEMORY;
|
|
|
|
}
|
|
|
|
}
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2014-02-17 10:35:21 +01:00
|
|
|
sigpipe_ignore(data, &pipe_st);
|
2014-11-18 14:34:55 +01:00
|
|
|
result = multi_runsingle(multi, now, data);
|
2014-02-17 10:35:21 +01:00
|
|
|
sigpipe_restore(&pipe_st);
|
2010-02-01 22:42:44 +01:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->set.wildcardmatch) {
|
2010-05-12 15:33:22 +02:00
|
|
|
/* destruct wildcard structures if it is needed */
|
|
|
|
if(wc->state == CURLWC_DONE || result)
|
|
|
|
Curl_wildcard_dtor(wc);
|
|
|
|
}
|
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
if(result)
|
|
|
|
returncode = result;
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
data = data->next; /* operate on next handle */
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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 19:19:31 +02: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 17:00:53 +02:00
|
|
|
*/
|
|
|
|
do {
|
2008-05-07 17:41:41 +02:00
|
|
|
multi->timetree = Curl_splaygetbest(now, multi->timetree, &t);
|
2010-08-31 00:08:45 +02:00
|
|
|
if(t)
|
|
|
|
/* the removed may have another timeout in queue */
|
|
|
|
(void)add_next_timeout(now, multi, t->payload);
|
2006-07-17 20:35:58 +02:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
} while(t);
|
|
|
|
|
2006-08-03 00:29:29 +02:00
|
|
|
*running_handles = multi->num_alive;
|
|
|
|
|
2011-04-22 23:01:30 +02:00
|
|
|
if(CURLM_OK >= returncode)
|
2006-10-12 10:36:47 +02:00
|
|
|
update_timer(multi);
|
2008-12-19 23:58:22 +01:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
return returncode;
|
|
|
|
}
|
|
|
|
|
2012-12-06 12:12:04 +01:00
|
|
|
static void close_all_connections(struct Curl_multi *multi)
|
|
|
|
{
|
|
|
|
struct connectdata *conn;
|
|
|
|
|
|
|
|
conn = Curl_conncache_find_first_connection(multi->conn_cache);
|
|
|
|
while(conn) {
|
2014-05-05 12:47:46 +02:00
|
|
|
SIGPIPE_VARIABLE(pipe_st);
|
2012-12-06 12:12:04 +01:00
|
|
|
conn->data = multi->closure_handle;
|
|
|
|
|
2014-05-05 12:47:46 +02:00
|
|
|
sigpipe_ignore(conn->data, &pipe_st);
|
2012-12-06 12:12:04 +01:00
|
|
|
/* This will remove the connection from the cache */
|
|
|
|
(void)Curl_disconnect(conn, FALSE);
|
2014-05-05 12:47:46 +02:00
|
|
|
sigpipe_restore(&pipe_st);
|
2012-12-06 12:12:04 +01:00
|
|
|
|
|
|
|
conn = Curl_conncache_find_first_connection(multi->conn_cache);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
CURLMcode curl_multi_cleanup(CURLM *multi_handle)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
2013-08-12 13:52:58 +02:00
|
|
|
struct SessionHandle *data;
|
|
|
|
struct SessionHandle *nextdata;
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
if(GOOD_MULTI_HANDLE(multi)) {
|
2013-11-25 15:43:21 +01:00
|
|
|
bool restore_pipe = FALSE;
|
2013-12-01 21:22:44 +01:00
|
|
|
SIGPIPE_VARIABLE(pipe_st);
|
2013-11-25 15:43:21 +01:00
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
multi->type = 0; /* not good anymore */
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2012-12-06 12:12:04 +01:00
|
|
|
/* Close all the connections in the connection cache */
|
|
|
|
close_all_connections(multi);
|
|
|
|
|
2013-02-10 22:57:58 +01:00
|
|
|
if(multi->closure_handle) {
|
2013-12-01 21:22:44 +01:00
|
|
|
sigpipe_ignore(multi->closure_handle, &pipe_st);
|
2013-11-25 15:43:21 +01:00
|
|
|
restore_pipe = TRUE;
|
|
|
|
|
2013-02-10 22:57:58 +01:00
|
|
|
multi->closure_handle->dns.hostcache = multi->hostcache;
|
2013-08-08 13:01:16 +02:00
|
|
|
Curl_hostcache_clean(multi->closure_handle,
|
|
|
|
multi->closure_handle->dns.hostcache);
|
2013-01-17 12:59:23 +01:00
|
|
|
|
2013-02-10 22:57:58 +01:00
|
|
|
Curl_close(multi->closure_handle);
|
|
|
|
}
|
2006-09-07 23:49:20 +02:00
|
|
|
|
2011-10-27 17:08:02 +02:00
|
|
|
Curl_hash_destroy(multi->sockhash);
|
2012-12-06 12:12:04 +01:00
|
|
|
Curl_conncache_destroy(multi->conn_cache);
|
2010-08-09 00:01:36 +02:00
|
|
|
Curl_llist_destroy(multi->msglist, NULL);
|
2014-09-02 09:29:50 +02:00
|
|
|
Curl_llist_destroy(multi->pending, NULL);
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
/* remove all easy handles */
|
2013-08-12 13:52:58 +02:00
|
|
|
data = multi->easyp;
|
|
|
|
while(data) {
|
|
|
|
nextdata=data->next;
|
|
|
|
if(data->dns.hostcachetype == HCACHE_MULTI) {
|
2006-07-08 00:58:06 +02:00
|
|
|
/* clear out the usage of the shared DNS cache */
|
2013-08-12 13:52:58 +02:00
|
|
|
Curl_hostcache_clean(data, data->dns.hostcache);
|
|
|
|
data->dns.hostcache = NULL;
|
|
|
|
data->dns.hostcachetype = HCACHE_NONE;
|
2006-07-08 00:58:06 +02:00
|
|
|
}
|
2006-09-07 23:49:20 +02:00
|
|
|
|
|
|
|
/* Clear the pointer to the connection cache */
|
2013-08-12 13:52:58 +02:00
|
|
|
data->state.conn_cache = NULL;
|
2013-08-20 14:48:08 +02:00
|
|
|
data->multi = NULL; /* clear the association */
|
2002-05-02 20:07:38 +02:00
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
data = nextdata;
|
2002-04-28 00:21:51 +02:00
|
|
|
}
|
|
|
|
|
2012-11-18 16:17:37 +01:00
|
|
|
Curl_hash_destroy(multi->hostcache);
|
|
|
|
|
2013-02-15 11:50:45 +01:00
|
|
|
/* Free the blacklists by setting them to NULL */
|
|
|
|
Curl_pipeline_set_site_blacklist(NULL, &multi->pipelining_site_bl);
|
|
|
|
Curl_pipeline_set_server_blacklist(NULL, &multi->pipelining_server_bl);
|
|
|
|
|
2001-11-28 17:00:18 +01:00
|
|
|
free(multi);
|
2013-11-25 15:43:21 +01:00
|
|
|
if(restore_pipe)
|
2013-12-01 21:22:44 +01:00
|
|
|
sigpipe_restore(&pipe_st);
|
2001-11-28 17:00:18 +01:00
|
|
|
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return CURLM_BAD_HANDLE;
|
|
|
|
}
|
2001-11-28 12:09:18 +01:00
|
|
|
|
2010-08-09 00:01:36 +02: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-28 00:21:51 +02:00
|
|
|
CURLMsg *curl_multi_info_read(CURLM *multi_handle, int *msgs_in_queue)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
2010-08-09 00:01:36 +02:00
|
|
|
struct Curl_message *msg;
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2003-08-20 15:49:46 +02:00
|
|
|
*msgs_in_queue = 0; /* default to none */
|
|
|
|
|
2010-08-09 00:01:36 +02: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 08:53:41 +02:00
|
|
|
|
2010-08-09 00:01:36 +02:00
|
|
|
/* extract the head of the list to return */
|
|
|
|
e = multi->msglist->head;
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2010-08-09 00:01:36 +02:00
|
|
|
msg = e->ptr;
|
|
|
|
|
|
|
|
/* remove the extracted entry */
|
|
|
|
Curl_llist_remove(multi->msglist, e, NULL);
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2010-11-25 02:58:59 +01:00
|
|
|
*msgs_in_queue = curlx_uztosi(Curl_llist_count(multi->msglist));
|
2002-04-28 00:21:51 +02:00
|
|
|
|
2010-08-09 00:01:36 +02:00
|
|
|
return &msg->extmsg;
|
2002-04-28 00:21:51 +02:00
|
|
|
}
|
|
|
|
else
|
2002-05-03 14:40:37 +02:00
|
|
|
return NULL;
|
2002-04-28 00:21:51 +02:00
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
/*
|
2006-04-21 15:40:07 +02: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 17:00:53 +02:00
|
|
|
*/
|
|
|
|
static void singlesocket(struct Curl_multi *multi,
|
2013-08-12 13:52:58 +02:00
|
|
|
struct SessionHandle *data)
|
2006-04-10 17:00:53 +02:00
|
|
|
{
|
2006-10-13 09:11:26 +02:00
|
|
|
curl_socket_t socks[MAX_SOCKSPEREASYHANDLE];
|
2006-04-10 17:00:53 +02:00
|
|
|
int i;
|
2006-09-11 00:15:32 +02:00
|
|
|
struct Curl_sh_entry *entry;
|
|
|
|
curl_socket_t s;
|
|
|
|
int num;
|
2006-10-13 09:11:26 +02:00
|
|
|
unsigned int curraction;
|
2008-12-20 23:03:22 +01:00
|
|
|
bool remove_sock_from_hash;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
for(i=0; i< MAX_SOCKSPEREASYHANDLE; i++)
|
2006-10-13 09:11:26 +02:00
|
|
|
socks[i] = CURL_SOCKET_BAD;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2006-09-11 00:15:32 +02:00
|
|
|
/* Fill in the 'current' struct with the state as it is now: what sockets to
|
|
|
|
supervise and for what actions */
|
2013-08-12 13:52:58 +02:00
|
|
|
curraction = multi_getsock(data, socks, MAX_SOCKSPEREASYHANDLE);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2006-09-11 00:15:32 +02: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 15:40:07 +02:00
|
|
|
|
2006-09-11 00:15:32 +02:00
|
|
|
/* walk over the sockets we got right now */
|
|
|
|
for(i=0; (i< MAX_SOCKSPEREASYHANDLE) &&
|
2006-10-13 09:11:26 +02:00
|
|
|
(curraction & (GETSOCK_READSOCK(i) | GETSOCK_WRITESOCK(i)));
|
2006-09-11 00:15:32 +02:00
|
|
|
i++) {
|
|
|
|
int action = CURL_POLL_NONE;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2006-10-13 09:11:26 +02:00
|
|
|
s = socks[i];
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2006-09-11 00:15:32 +02:00
|
|
|
/* get it from the hash */
|
|
|
|
entry = Curl_hash_pick(multi->sockhash, (char *)&s, sizeof(s));
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2006-10-13 09:11:26 +02:00
|
|
|
if(curraction & GETSOCK_READSOCK(i))
|
2006-09-11 00:15:32 +02:00
|
|
|
action |= CURL_POLL_IN;
|
2006-10-13 09:11:26 +02:00
|
|
|
if(curraction & GETSOCK_WRITESOCK(i))
|
2006-09-11 00:15:32 +02:00
|
|
|
action |= CURL_POLL_OUT;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2006-09-11 00:15:32 +02: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! */
|
2013-08-12 13:52:58 +02:00
|
|
|
entry = sh_addentry(multi->sockhash, s, data);
|
2006-09-11 00:15:32 +02:00
|
|
|
if(!entry)
|
|
|
|
/* fatal */
|
|
|
|
return;
|
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2010-06-02 23:11:59 +02:00
|
|
|
/* we know (entry != NULL) at this point, see the logic above */
|
2011-12-02 21:10:28 +01:00
|
|
|
if(multi->socket_cb)
|
2013-08-12 13:52:58 +02:00
|
|
|
multi->socket_cb(data,
|
2011-12-02 21:10:28 +01:00
|
|
|
s,
|
|
|
|
action,
|
|
|
|
multi->socket_userp,
|
|
|
|
entry->socketp);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2006-09-11 00:15:32 +02:00
|
|
|
entry->action = action; /* store the current action state */
|
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2006-09-11 00:15:32 +02: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 */
|
2013-08-12 13:52:58 +02:00
|
|
|
for(i=0; i< data->numsocks; i++) {
|
2006-09-11 00:15:32 +02:00
|
|
|
int j;
|
2013-08-12 13:52:58 +02:00
|
|
|
s = data->sockets[i];
|
2006-09-11 00:15:32 +02:00
|
|
|
for(j=0; j<num; j++) {
|
2006-10-13 09:11:26 +02:00
|
|
|
if(s == socks[j]) {
|
2006-09-11 00:15:32 +02:00
|
|
|
/* this is still supervised */
|
|
|
|
s = CURL_SOCKET_BAD;
|
|
|
|
break;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
2006-09-11 00:15:32 +02:00
|
|
|
}
|
|
|
|
if(s != CURL_SOCKET_BAD) {
|
2008-12-20 23:03:22 +01:00
|
|
|
|
|
|
|
/* this socket has been removed. Tell the app to remove it */
|
|
|
|
remove_sock_from_hash = TRUE;
|
2006-09-11 00:15:32 +02:00
|
|
|
|
|
|
|
entry = Curl_hash_pick(multi->sockhash, (char *)&s, sizeof(s));
|
|
|
|
if(entry) {
|
2008-12-20 23:03:22 +01: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. */
|
2013-08-12 13:52:58 +02:00
|
|
|
struct connectdata *easy_conn = data->easy_conn;
|
2008-12-20 23:03:22 +01:00
|
|
|
if(easy_conn) {
|
2011-04-20 15:17:42 +02:00
|
|
|
if(easy_conn->recv_pipe && easy_conn->recv_pipe->size > 1) {
|
2008-12-20 23:03:22 +01: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) */
|
2013-08-12 13:52:58 +02:00
|
|
|
if(entry->easy == data) {
|
|
|
|
if(isHandleAtHead(data, easy_conn->recv_pipe))
|
2008-12-20 23:03:22 +01:00
|
|
|
entry->easy = easy_conn->recv_pipe->head->next->ptr;
|
|
|
|
else
|
|
|
|
entry->easy = easy_conn->recv_pipe->head->ptr;
|
|
|
|
}
|
|
|
|
}
|
2011-04-20 15:17:42 +02:00
|
|
|
if(easy_conn->send_pipe && easy_conn->send_pipe->size > 1) {
|
2008-12-20 23:03:22 +01: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) */
|
2013-08-12 13:52:58 +02:00
|
|
|
if(entry->easy == data) {
|
|
|
|
if(isHandleAtHead(data, easy_conn->send_pipe))
|
2008-12-20 23:03:22 +01: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-11 00:15:32 +02: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 23:03:22 +01:00
|
|
|
remove_sock_from_hash = FALSE;
|
|
|
|
|
2011-04-20 15:17:42 +02:00
|
|
|
if(remove_sock_from_hash) {
|
2012-06-12 23:04:04 +02:00
|
|
|
/* in this case 'entry' is always non-NULL */
|
2011-12-02 21:10:28 +01:00
|
|
|
if(multi->socket_cb)
|
2013-08-12 13:52:58 +02:00
|
|
|
multi->socket_cb(data,
|
2011-12-02 21:10:28 +01:00
|
|
|
s,
|
|
|
|
CURL_POLL_REMOVE,
|
|
|
|
multi->socket_userp,
|
2012-06-12 23:04:04 +02:00
|
|
|
entry->socketp);
|
2006-04-21 15:40:07 +02:00
|
|
|
sh_delentry(multi->sockhash, s);
|
2006-09-11 00:15:32 +02:00
|
|
|
}
|
2008-12-20 23:03:22 +01:00
|
|
|
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
memcpy(data->sockets, socks, num*sizeof(curl_socket_t));
|
|
|
|
data->numsocks = num;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
2013-06-19 23:54:28 +02:00
|
|
|
/*
|
|
|
|
* Curl_multi_closed()
|
|
|
|
*
|
|
|
|
* Used by the connect code to tell the multi_socket code that one of the
|
2014-11-14 19:32:47 +01:00
|
|
|
* sockets we were using is about to be closed. This function will then
|
2013-06-19 23:54:28 +02:00
|
|
|
* remove it from the sockethash for this handle to make the multi_socket API
|
|
|
|
* behave properly, especially for the case when libcurl will create another
|
|
|
|
* socket again and it gets the same file descriptor number.
|
|
|
|
*/
|
|
|
|
|
|
|
|
void Curl_multi_closed(struct connectdata *conn, curl_socket_t s)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi = conn->data->multi;
|
|
|
|
if(multi) {
|
|
|
|
/* this is set if this connection is part of a handle that is added to
|
|
|
|
a multi handle, and only then this is necessary */
|
|
|
|
struct Curl_sh_entry *entry =
|
|
|
|
Curl_hash_pick(multi->sockhash, (char *)&s, sizeof(s));
|
|
|
|
|
|
|
|
if(entry) {
|
|
|
|
if(multi->socket_cb)
|
|
|
|
multi->socket_cb(conn->data, s, CURL_POLL_REMOVE,
|
|
|
|
multi->socket_userp,
|
|
|
|
entry->socketp);
|
|
|
|
|
|
|
|
/* now remove it from the socket hash */
|
|
|
|
sh_delentry(multi->sockhash, s);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-08-31 00:08:45 +02: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;
|
|
|
|
}
|
2012-08-08 14:50:32 +02:00
|
|
|
e = list->head;
|
|
|
|
if(!e) {
|
2010-08-31 00:08:45 +02:00
|
|
|
/* clear the expire times within the handles that we remove from the
|
|
|
|
splay tree */
|
|
|
|
tv->tv_sec = 0;
|
|
|
|
tv->tv_usec = 0;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
/* 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 17:00:53 +02:00
|
|
|
static CURLMcode multi_socket(struct Curl_multi *multi,
|
|
|
|
bool checkall,
|
2006-07-31 00:44:07 +02:00
|
|
|
curl_socket_t s,
|
2007-04-16 18:34:08 +02:00
|
|
|
int ev_bitmask,
|
2006-07-31 00:44:07 +02:00
|
|
|
int *running_handles)
|
2006-04-10 17:00:53 +02:00
|
|
|
{
|
|
|
|
CURLMcode result = CURLM_OK;
|
|
|
|
struct SessionHandle *data = NULL;
|
|
|
|
struct Curl_tree *t;
|
2010-09-01 16:52:23 +02:00
|
|
|
struct timeval now = Curl_tvnow();
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
if(checkall) {
|
2006-08-03 00:29:29 +02:00
|
|
|
/* *perform() deals with running_handles on its own */
|
2006-07-31 00:44:07 +02:00
|
|
|
result = curl_multi_perform(multi, running_handles);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
/* walk through each easy handle and do the socket state change magic
|
|
|
|
and callbacks */
|
2014-01-05 20:01:33 +01:00
|
|
|
if(result != CURLM_BAD_HANDLE) {
|
|
|
|
data=multi->easyp;
|
|
|
|
while(data) {
|
|
|
|
singlesocket(multi, data);
|
|
|
|
data = data->next;
|
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
2006-04-21 15:40:07 +02:00
|
|
|
/* or should we fall-through and do the timer-based stuff? */
|
2006-04-10 17:00:53 +02:00
|
|
|
return result;
|
|
|
|
}
|
2007-11-05 10:45:09 +01:00
|
|
|
else if(s != CURL_SOCKET_TIMEOUT) {
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
struct Curl_sh_entry *entry =
|
|
|
|
Curl_hash_pick(multi->sockhash, (char *)&s, sizeof(s));
|
|
|
|
|
|
|
|
if(!entry)
|
2008-05-19 22:58:01 +02: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 {
|
2014-02-17 10:35:21 +01:00
|
|
|
SIGPIPE_VARIABLE(pipe_st);
|
|
|
|
|
2008-05-19 22:58:01 +02:00
|
|
|
data = entry->easy;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2008-05-19 22:58:01 +02:00
|
|
|
if(data->magic != CURLEASY_MAGIC_NUMBER)
|
|
|
|
/* bad bad bad bad bad bad bad */
|
|
|
|
return CURLM_INTERNAL_ERROR;
|
2006-09-11 00:15:32 +02:00
|
|
|
|
2008-12-20 23:03:22 +01: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. */
|
2013-08-02 12:25:18 +02:00
|
|
|
if(data->easy_conn) {
|
2011-04-20 15:17:42 +02:00
|
|
|
if((ev_bitmask & CURL_POLL_OUT) &&
|
2013-08-02 12:25:18 +02:00
|
|
|
data->easy_conn->send_pipe &&
|
|
|
|
data->easy_conn->send_pipe->head)
|
|
|
|
data = data->easy_conn->send_pipe->head->ptr;
|
2011-04-20 15:17:42 +02:00
|
|
|
else if((ev_bitmask & CURL_POLL_IN) &&
|
2013-08-02 12:25:18 +02:00
|
|
|
data->easy_conn->recv_pipe &&
|
|
|
|
data->easy_conn->recv_pipe->head)
|
|
|
|
data = data->easy_conn->recv_pipe->head->ptr;
|
2008-12-20 23:03:22 +01:00
|
|
|
}
|
|
|
|
|
2013-08-02 12:25:18 +02:00
|
|
|
if(data->easy_conn &&
|
|
|
|
!(data->easy_conn->handler->flags & PROTOPT_DIRLOCK))
|
2011-03-13 23:21:03 +01:00
|
|
|
/* set socket event bitmask if they're not locked */
|
2013-08-02 12:25:18 +02:00
|
|
|
data->easy_conn->cselect_bits = ev_bitmask;
|
2007-04-16 18:34:08 +02:00
|
|
|
|
2014-02-17 10:35:21 +01:00
|
|
|
sigpipe_ignore(data, &pipe_st);
|
2014-11-18 14:34:55 +01:00
|
|
|
result = multi_runsingle(multi, now, data);
|
2014-02-17 10:35:21 +01:00
|
|
|
sigpipe_restore(&pipe_st);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2013-08-02 12:25:18 +02:00
|
|
|
if(data->easy_conn &&
|
|
|
|
!(data->easy_conn->handler->flags & PROTOPT_DIRLOCK))
|
2011-03-13 23:21:03 +01:00
|
|
|
/* clear the bitmask only if not locked */
|
2013-08-02 12:25:18 +02:00
|
|
|
data->easy_conn->cselect_bits = 0;
|
2007-04-16 18:34:08 +02:00
|
|
|
|
2008-05-19 22:58:01 +02:00
|
|
|
if(CURLM_OK >= result)
|
|
|
|
/* get the socket(s) and check if the state has been changed since
|
|
|
|
last */
|
2013-08-02 12:25:18 +02:00
|
|
|
singlesocket(multi, data);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2008-05-19 22:58:01 +02: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 16:39:19 +02:00
|
|
|
|
2008-05-19 22:58:01 +02:00
|
|
|
data = NULL; /* set data to NULL again to avoid calling
|
|
|
|
multi_runsingle() in case there's no need to */
|
2014-01-05 16:38:18 +01:00
|
|
|
now = Curl_tvnow(); /* get a newer time since the multi_runsingle() loop
|
|
|
|
may have taken some time */
|
2008-05-19 22:58:01 +02:00
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
multi_socket: remind app if timeout didn't run
BACKGROUND:
We have learned that on some systems timeout timers are inaccurate and
might occasionally fire off too early. To make the multi_socket API work
with this, we made libcurl execute timeout actions a bit early too if
they are within our MULTI_TIMEOUT_INACCURACY. (added in commit
2c72732ebf, present since 7.21.0)
Switching everything to the multi API made this inaccuracy problem
slightly more notable as now everyone can be affected.
Recently (commit 21091549c02) we tweaked that inaccuracy value to make
timeouts more accurate and made it platform specific. We also figured
out that we have code at places that check for fixed timeout values so
they MUST NOT run too early as then they will not trigger at all (see
commit be28223f35 and a691e044705) - so there are definitately problems
with running timeouts before they're supposed to run. (We've handled
that so far by adding the inaccuracy margin to those specific timeouts.)
The libcurl multi_socket API tells the application with a callback that
a timeout expires in N milliseconds (and it explicitly will not tell it
again for the same timeout), and the application is then supposed to
call libcurl when that timeout expires. When libcurl subsequently gets
called with curl_multi_socket_action(...CURL_SOCKET_TIMEOUT...), it
knows that the application thinks the timeout expired - and alas, if it
is within the inaccuracy level libcurl will run code handling that
handle.
If the application says CURL_SOCKET_TIMEOUT to libcurl and _isn't_
within the inaccuracy level, libcurl will not consider the timeout
expired and it will not tell the application again since the timeout
value is still the same.
NOW:
This change introduces a modified behavior here. If the application says
CURL_SOCKET_TIMEOUT and libcurl finds no timeout code to run, it will
inform the application about the timeout value - *again* even if it is
the same timeout that it already told about before (although libcurl
will of course tell it the updated time so that it'll still get the
correct remaining time). This way, we will not risk that the application
believes it has done its job and libcurl thinks the time hasn't come yet
to run any code and both just sit waiting. This also allows us to
decrease the MULTI_TIMEOUT_INACCURACY margin, but that will be handled
in a separate commit.
A repeated timeout update to the application risk that the timeout will
then fire again immediately and we have what basically is a busy-loop
until the time is fine even for libcurl. If that becomes a problem, we
need to address it.
2014-01-08 08:23:13 +01:00
|
|
|
else {
|
|
|
|
/* Asked to run due to time-out. Clear the 'lastcall' variable to force
|
|
|
|
update_timer() to trigger a callback to the app again even if the same
|
|
|
|
timeout is still the one to run after this call. That handles the case
|
|
|
|
when the application asks libcurl to run the timeout prematurely. */
|
|
|
|
memset(&multi->timer_lastcall, 0, sizeof(multi->timer_lastcall));
|
|
|
|
}
|
2006-04-10 17:00:53 +02: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) {
|
2014-02-17 10:35:21 +01:00
|
|
|
SIGPIPE_VARIABLE(pipe_st);
|
|
|
|
|
|
|
|
sigpipe_ignore(data, &pipe_st);
|
2014-11-18 14:34:55 +01:00
|
|
|
result = multi_runsingle(multi, now, data);
|
2014-02-17 10:35:21 +01:00
|
|
|
sigpipe_restore(&pipe_st);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2007-06-01 23:24:34 +02:00
|
|
|
if(CURLM_OK >= result)
|
2006-04-10 17:00:53 +02:00
|
|
|
/* get the socket(s) and check if the state has been changed since
|
|
|
|
last */
|
2013-08-02 12:25:18 +02:00
|
|
|
singlesocket(multi, data);
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Check if there's one (more) expired timer to deal with! This function
|
|
|
|
extracts a matching node if there is one */
|
|
|
|
|
2008-05-07 17:41:41 +02:00
|
|
|
multi->timetree = Curl_splaygetbest(now, multi->timetree, &t);
|
2010-09-01 16:52:23 +02:00
|
|
|
if(t) {
|
|
|
|
data = t->payload; /* assign this for next loop */
|
2010-08-31 00:08:45 +02:00
|
|
|
(void)add_next_timeout(now, multi, t->payload);
|
2010-09-01 16:52:23 +02:00
|
|
|
}
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
} while(t);
|
|
|
|
|
2006-08-03 00:29:29 +02:00
|
|
|
*running_handles = multi->num_alive;
|
2006-04-10 17:00:53 +02:00
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2008-03-18 09:14:37 +01:00
|
|
|
#undef curl_multi_setopt
|
2006-04-10 17:00:53 +02: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 23:49:20 +02:00
|
|
|
case CURLMOPT_PIPELINING:
|
2011-09-05 20:46:09 +02:00
|
|
|
multi->pipelining_enabled = (0 != va_arg(param, long)) ? TRUE : FALSE;
|
2006-09-07 23:49:20 +02:00
|
|
|
break;
|
2006-10-12 10:36:47 +02: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 22:04:44 +02:00
|
|
|
case CURLMOPT_MAXCONNECTS:
|
|
|
|
multi->maxconnects = va_arg(param, long);
|
|
|
|
break;
|
2013-02-15 11:50:45 +01:00
|
|
|
case CURLMOPT_MAX_HOST_CONNECTIONS:
|
|
|
|
multi->max_host_connections = va_arg(param, long);
|
|
|
|
break;
|
|
|
|
case CURLMOPT_MAX_PIPELINE_LENGTH:
|
|
|
|
multi->max_pipeline_length = va_arg(param, long);
|
|
|
|
break;
|
|
|
|
case CURLMOPT_CONTENT_LENGTH_PENALTY_SIZE:
|
|
|
|
multi->content_length_penalty_size = va_arg(param, long);
|
|
|
|
break;
|
|
|
|
case CURLMOPT_CHUNK_LENGTH_PENALTY_SIZE:
|
|
|
|
multi->chunk_length_penalty_size = va_arg(param, long);
|
|
|
|
break;
|
|
|
|
case CURLMOPT_PIPELINING_SITE_BL:
|
|
|
|
res = Curl_pipeline_set_site_blacklist(va_arg(param, char **),
|
|
|
|
&multi->pipelining_site_bl);
|
|
|
|
break;
|
|
|
|
case CURLMOPT_PIPELINING_SERVER_BL:
|
|
|
|
res = Curl_pipeline_set_server_blacklist(va_arg(param, char **),
|
|
|
|
&multi->pipelining_server_bl);
|
|
|
|
break;
|
|
|
|
case CURLMOPT_MAX_TOTAL_CONNECTIONS:
|
|
|
|
multi->max_total_connections = va_arg(param, long);
|
|
|
|
break;
|
2006-04-10 17:00:53 +02:00
|
|
|
default:
|
|
|
|
res = CURLM_UNKNOWN_OPTION;
|
2006-10-12 10:36:47 +02:00
|
|
|
break;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
va_end(param);
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
|
2007-04-16 18:34:08 +02:00
|
|
|
/* we define curl_multi_socket() in the public multi.h header */
|
|
|
|
#undef curl_multi_socket
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2006-07-31 00:44:07 +02:00
|
|
|
CURLMcode curl_multi_socket(CURLM *multi_handle, curl_socket_t s,
|
|
|
|
int *running_handles)
|
2006-04-10 17:00:53 +02:00
|
|
|
{
|
2006-10-12 10:36:47 +02:00
|
|
|
CURLMcode result = multi_socket((struct Curl_multi *)multi_handle, FALSE, s,
|
2007-04-16 18:34:08 +02:00
|
|
|
0, running_handles);
|
2007-11-05 10:45:09 +01:00
|
|
|
if(CURLM_OK >= result)
|
2007-04-16 18:34:08 +02: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 13:32:55 +02:00
|
|
|
int ev_bitmask, int *running_handles)
|
2007-04-16 18:34:08 +02:00
|
|
|
{
|
|
|
|
CURLMcode result = multi_socket((struct Curl_multi *)multi_handle, FALSE, s,
|
|
|
|
ev_bitmask, running_handles);
|
2007-11-05 10:45:09 +01:00
|
|
|
if(CURLM_OK >= result)
|
2006-10-12 10:36:47 +02:00
|
|
|
update_timer((struct Curl_multi *)multi_handle);
|
|
|
|
return result;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
2006-07-31 00:44:07 +02:00
|
|
|
CURLMcode curl_multi_socket_all(CURLM *multi_handle, int *running_handles)
|
2006-04-10 17:00:53 +02:00
|
|
|
|
|
|
|
{
|
2006-10-12 10:36:47 +02:00
|
|
|
CURLMcode result = multi_socket((struct Curl_multi *)multi_handle,
|
2007-04-16 18:34:08 +02:00
|
|
|
TRUE, CURL_SOCKET_BAD, 0, running_handles);
|
2007-11-05 10:45:09 +01:00
|
|
|
if(CURLM_OK >= result)
|
2006-10-12 10:36:47 +02:00
|
|
|
update_timer((struct Curl_multi *)multi_handle);
|
|
|
|
return result;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
2006-10-12 10:36:47 +02:00
|
|
|
static CURLMcode multi_timeout(struct Curl_multi *multi,
|
|
|
|
long *timeout_ms)
|
2006-04-10 17:00:53 +02:00
|
|
|
{
|
2008-05-07 17:41:41 +02:00
|
|
|
static struct timeval tv_zero = {0,0};
|
|
|
|
|
2006-04-10 17:00:53 +02: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 17:41:41 +02:00
|
|
|
multi->timetree = Curl_splay(tv_zero, multi->timetree);
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2008-12-19 23:58:22 +01:00
|
|
|
if(Curl_splaycomparekeys(multi->timetree->key, now) > 0) {
|
2008-05-07 17:41:41 +02:00
|
|
|
/* some time left before expiration */
|
|
|
|
*timeout_ms = curlx_tvdiff(multi->timetree->key, now);
|
2008-12-19 23:58:22 +01: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 17:41:41 +02:00
|
|
|
else
|
2006-04-10 17:00:53 +02:00
|
|
|
/* 0 means immediately */
|
|
|
|
*timeout_ms = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
*timeout_ms = -1;
|
|
|
|
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
|
|
|
|
2006-10-12 10:36:47 +02: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 16:52:23 +02:00
|
|
|
|
2007-11-05 10:45:09 +01:00
|
|
|
if(!multi->timer_cb)
|
2006-10-12 10:36:47 +02:00
|
|
|
return 0;
|
2010-09-01 16:52:23 +02:00
|
|
|
if(multi_timeout(multi, &timeout_ms)) {
|
2006-10-12 10:36:47 +02:00
|
|
|
return -1;
|
2010-09-01 16:52:23 +02:00
|
|
|
}
|
2011-04-22 23:01:30 +02:00
|
|
|
if(timeout_ms < 0) {
|
2010-09-01 16:52:23 +02: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 10:36:47 +02:00
|
|
|
return 0;
|
2010-09-01 16:52:23 +02:00
|
|
|
}
|
2006-10-12 10:36:47 +02: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 17:41:41 +02:00
|
|
|
if(Curl_splaycomparekeys(multi->timetree->key, multi->timer_lastcall) == 0)
|
2006-10-12 10:36:47 +02:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
multi->timer_lastcall = multi->timetree->key;
|
|
|
|
|
|
|
|
return multi->timer_cb((CURLM*)multi, timeout_ms, multi->timer_userp);
|
|
|
|
}
|
|
|
|
|
2008-01-16 13:24:00 +01:00
|
|
|
static bool isHandleAtHead(struct SessionHandle *handle,
|
|
|
|
struct curl_llist *pipeline)
|
|
|
|
{
|
|
|
|
struct curl_llist_element *curr = pipeline->head;
|
|
|
|
if(curr)
|
2011-09-05 20:46:09 +02:00
|
|
|
return (curr->ptr == handle) ? TRUE : FALSE;
|
2008-01-16 13:24:00 +01:00
|
|
|
|
|
|
|
return FALSE;
|
|
|
|
}
|
|
|
|
|
2010-08-10 11:02:07 +02: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 08:08:18 +02:00
|
|
|
if(!Curl_llist_insert_next(timeoutlist, prev, timedup)) {
|
|
|
|
free(timedup);
|
2010-08-10 11:02:07 +02:00
|
|
|
return CURLM_OUT_OF_MEMORY;
|
2010-08-19 08:08:18 +02:00
|
|
|
}
|
2010-08-10 11:02:07 +02:00
|
|
|
|
|
|
|
return CURLM_OK;
|
|
|
|
}
|
2008-12-19 22:14:52 +01:00
|
|
|
|
2010-08-10 11:02:07 +02: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 22:14:52 +01:00
|
|
|
*/
|
2006-04-10 17:00:53 +02:00
|
|
|
void Curl_expire(struct SessionHandle *data, long milli)
|
|
|
|
{
|
|
|
|
struct Curl_multi *multi = data->multi;
|
|
|
|
struct timeval *nowp = &data->state.expiretime;
|
2006-05-28 00:26:16 +02:00
|
|
|
int rc;
|
2006-04-10 17:00:53 +02:00
|
|
|
|
2013-08-09 23:39:09 +02:00
|
|
|
/* this is only interesting while there is still an associated multi struct
|
|
|
|
remaining! */
|
2006-04-10 17:00:53 +02:00
|
|
|
if(!multi)
|
|
|
|
return;
|
|
|
|
|
|
|
|
if(!milli) {
|
|
|
|
/* No timeout, clear the time data. */
|
2008-05-07 17:41:41 +02:00
|
|
|
if(nowp->tv_sec || nowp->tv_usec) {
|
2006-04-10 17:00:53 +02:00
|
|
|
/* Since this is an cleared time, we must remove the previous entry from
|
|
|
|
the splay tree */
|
2010-08-10 11:02:07 +02:00
|
|
|
struct curl_llist *list = data->state.timeoutlist;
|
|
|
|
|
2006-05-28 00:26:16 +02: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 11:02:07 +02:00
|
|
|
|
|
|
|
/* flush the timeout list too */
|
|
|
|
while(list->size > 0)
|
|
|
|
Curl_llist_remove(list, list->tail, NULL);
|
|
|
|
|
2010-12-22 15:29:21 +01:00
|
|
|
#ifdef DEBUGBUILD
|
2006-04-10 17:00:53 +02:00
|
|
|
infof(data, "Expire cleared\n");
|
2010-12-22 15:29:21 +01:00
|
|
|
#endif
|
2006-07-13 20:44:24 +02:00
|
|
|
nowp->tv_sec = 0;
|
2006-07-13 20:57:34 +02:00
|
|
|
nowp->tv_usec = 0;
|
2006-04-10 17:00:53 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
struct timeval set;
|
|
|
|
|
|
|
|
set = Curl_tvnow();
|
|
|
|
set.tv_sec += milli/1000;
|
|
|
|
set.tv_usec += (milli%1000)*1000;
|
|
|
|
|
2010-11-28 20:49:40 +01:00
|
|
|
if(set.tv_usec >= 1000000) {
|
2006-04-10 17:00:53 +02:00
|
|
|
set.tv_sec++;
|
|
|
|
set.tv_usec -= 1000000;
|
|
|
|
}
|
|
|
|
|
2008-05-07 17:41:41 +02:00
|
|
|
if(nowp->tv_sec || nowp->tv_usec) {
|
2006-05-28 00:26:16 +02: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 17:00:53 +02:00
|
|
|
long diff = curlx_tvdiff(set, *nowp);
|
2010-08-10 11:02:07 +02: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 17:00:53 +02:00
|
|
|
return;
|
2010-08-10 11:02:07 +02: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 17:00:53 +02: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-28 00:26:16 +02: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 17:00:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
*nowp = set;
|
|
|
|
data->state.timenode.payload = data;
|
2008-05-07 17:41:41 +02:00
|
|
|
multi->timetree = Curl_splayinsert(*nowp,
|
2006-04-10 17:00:53 +02:00
|
|
|
multi->timetree,
|
|
|
|
&data->state.timenode);
|
|
|
|
}
|
|
|
|
#if 0
|
|
|
|
Curl_splayprint(multi->timetree, 0, TRUE);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2014-08-25 11:34:14 +02:00
|
|
|
/*
|
|
|
|
* Curl_expire_latest()
|
|
|
|
*
|
|
|
|
* This is like Curl_expire() but will only add a timeout node to the list of
|
|
|
|
* timers if there is no timeout that will expire before the given time.
|
|
|
|
*
|
|
|
|
* Use this function if the code logic risks calling this function many times
|
|
|
|
* or if there's no particular conditional wait in the code for this specific
|
|
|
|
* time-out period to expire.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
void Curl_expire_latest(struct SessionHandle *data, long milli)
|
|
|
|
{
|
|
|
|
struct timeval *exp = &data->state.expiretime;
|
|
|
|
|
|
|
|
struct timeval set;
|
|
|
|
|
|
|
|
set = Curl_tvnow();
|
|
|
|
set.tv_sec += milli/1000;
|
|
|
|
set.tv_usec += (milli%1000)*1000;
|
|
|
|
|
|
|
|
if(set.tv_usec >= 1000000) {
|
|
|
|
set.tv_sec++;
|
|
|
|
set.tv_usec -= 1000000;
|
|
|
|
}
|
|
|
|
|
|
|
|
if(exp->tv_sec || exp->tv_usec) {
|
|
|
|
/* 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. */
|
|
|
|
long diff = curlx_tvdiff(set, *exp);
|
|
|
|
if(diff > 0)
|
|
|
|
/* the new expire time was later than the top time, so just skip this */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Just add the timeout like normal */
|
|
|
|
Curl_expire(data, milli);
|
|
|
|
}
|
|
|
|
|
2006-07-27 00:19:42 +02: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 23:49:20 +02:00
|
|
|
|
2013-02-15 11:50:45 +01:00
|
|
|
size_t Curl_multi_max_host_connections(struct Curl_multi *multi)
|
|
|
|
{
|
|
|
|
return multi ? multi->max_host_connections : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t Curl_multi_max_total_connections(struct Curl_multi *multi)
|
|
|
|
{
|
|
|
|
return multi ? multi->max_total_connections : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t Curl_multi_max_pipeline_length(struct Curl_multi *multi)
|
|
|
|
{
|
|
|
|
return multi ? multi->max_pipeline_length : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
curl_off_t Curl_multi_content_length_penalty_size(struct Curl_multi *multi)
|
|
|
|
{
|
|
|
|
return multi ? multi->content_length_penalty_size : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
curl_off_t Curl_multi_chunk_length_penalty_size(struct Curl_multi *multi)
|
|
|
|
{
|
|
|
|
return multi ? multi->chunk_length_penalty_size : 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct curl_llist *Curl_multi_pipelining_site_bl(struct Curl_multi *multi)
|
|
|
|
{
|
|
|
|
return multi->pipelining_site_bl;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct curl_llist *Curl_multi_pipelining_server_bl(struct Curl_multi *multi)
|
|
|
|
{
|
|
|
|
return multi->pipelining_server_bl;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Curl_multi_process_pending_handles(struct Curl_multi *multi)
|
|
|
|
{
|
2014-09-07 08:09:14 +02:00
|
|
|
struct curl_llist_element *e = multi->pending->head;
|
2013-02-15 11:50:45 +01:00
|
|
|
|
2014-09-07 08:09:14 +02:00
|
|
|
while(e) {
|
2014-09-02 09:29:50 +02:00
|
|
|
struct SessionHandle *data = e->ptr;
|
2014-09-07 08:09:14 +02:00
|
|
|
struct curl_llist_element *next = e->next;
|
|
|
|
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->mstate == CURLM_STATE_CONNECT_PEND) {
|
|
|
|
multistate(data, CURLM_STATE_CONNECT);
|
2014-09-07 08:09:14 +02:00
|
|
|
|
2014-09-02 09:29:50 +02:00
|
|
|
/* Remove this node from the list */
|
|
|
|
Curl_llist_remove(multi->pending, e, NULL);
|
2014-09-07 08:09:14 +02:00
|
|
|
|
2013-02-15 11:50:45 +01:00
|
|
|
/* Make sure that the handle will be processed soonish. */
|
2014-09-02 09:29:50 +02:00
|
|
|
Curl_expire_latest(data, 1);
|
2013-02-15 11:50:45 +01:00
|
|
|
}
|
2014-09-07 08:09:14 +02:00
|
|
|
|
|
|
|
e = next; /* operate on next handle */
|
2013-02-15 11:50:45 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-06-10 04:49:42 +02:00
|
|
|
#ifdef DEBUGBUILD
|
2008-09-13 17:59:14 +02:00
|
|
|
void Curl_multi_dump(const struct Curl_multi *multi_handle)
|
2006-10-13 09:11:26 +02:00
|
|
|
{
|
|
|
|
struct Curl_multi *multi=(struct Curl_multi *)multi_handle;
|
2013-08-12 13:52:58 +02:00
|
|
|
struct SessionHandle *data;
|
2006-10-13 09:11:26 +02:00
|
|
|
int i;
|
|
|
|
fprintf(stderr, "* Multi status: %d handles, %d alive\n",
|
|
|
|
multi->num_easy, multi->num_alive);
|
2013-08-12 13:52:58 +02:00
|
|
|
for(data=multi->easyp; data; data = data->next) {
|
|
|
|
if(data->mstate < CURLM_STATE_COMPLETED) {
|
2006-10-13 09:11:26 +02:00
|
|
|
/* only display handles that are not completed */
|
|
|
|
fprintf(stderr, "handle %p, state %s, %d sockets\n",
|
2013-08-12 13:52:58 +02:00
|
|
|
(void *)data,
|
|
|
|
statename[data->mstate], data->numsocks);
|
|
|
|
for(i=0; i < data->numsocks; i++) {
|
|
|
|
curl_socket_t s = data->sockets[i];
|
2006-10-13 09:11:26 +02:00
|
|
|
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":"");
|
|
|
|
}
|
2013-08-12 13:52:58 +02:00
|
|
|
if(data->numsocks)
|
2006-10-13 09:11:26 +02:00
|
|
|
fprintf(stderr, "\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|