Dmitry Kurochkin worked a lot on improving the HTTP Pipelining support that

                                  Changelog

Daniel S (16 Jan 2008)

- Dmitry Kurochkin worked a lot on improving the HTTP Pipelining support that

  previously had a number of flaws, perhaps most notably when an application

  fired up N transfers at once as then they wouldn't pipeline at all that

  nicely as anyone would think... Test case 530 was also updated to take the

  improved functionality into account.

- Calls to Curl_failf() are not supposed to provide a trailing newline as the

  function itself adds that. Fixed on 50 or something strings!

 o range support for file:// transfers

 o libcurl hang with huge POST request and request-body read from callback

 o removed extra newlines from many error messages

 o improved pipelining

This release includes the following known bugs:

To be addressed before 7.18.0 (planned release: January 2008)

=============================

Less likely to go in 7.18.0

===========================

112 - pipelining patch(es) from Dmitry Kurochkin (outstanding work left probably

      no longer targeted for this release)

      http://curl.haxx.se/mail/lib-2007-12/0252.html

118 - 

 *                            | (__| |_| |  _ <| |___

 *                             \___|\___/|_| \_\_____|

 *

 * Copyright (C) 1998 - 2007, Daniel Stenberg, <daniel@haxx.se>, et al.

 * Copyright (C) 1998 - 2008, Daniel Stenberg, <daniel@haxx.se>, et al.

 *

 * This software is licensed as described in the file COPYING, which

 * you should have received as part of this distribution. The terms

{

  return list->size;

}

int Curl_llist_move(struct curl_llist *list, struct curl_llist_element *e,

                    struct curl_llist *to_list, struct curl_llist_element *to_e)

{

  /* Remove element from list */

  if(e == NULL || list->size == 0)

    return 0;

  if(e == list->head) {

    list->head = e->next;

    if(list->head == NULL)

      list->tail = NULL;

    else

      e->next->prev = NULL;

  }

  else {

    e->prev->next = e->next;

    if(!e->next)

      list->tail = e->prev;

    else

      e->next->prev = e->prev;

  }

  --list->size;

  /* Add element to to_list after to_e */

  if(to_list->size == 0) {

    to_list->head = e;

    to_list->head->prev = NULL;

    to_list->head->next = NULL;

    to_list->tail = e;

  }

  else {

    e->next = to_e->next;

    e->prev = to_e;

    if(to_e->next) {

      to_e->next->prev = e;

    }

    else {

      to_list->tail = e;

    }

    to_e->next = e;

  }

  ++to_list->size;

  return 1;

}

 *                            | (__| |_| |  _ <| |___

 *                             \___|\___/|_| \_\_____|

 *

 * Copyright (C) 1998 - 2005, Daniel Stenberg, <daniel@haxx.se>, et al.

 * Copyright (C) 1998 - 2008, Daniel Stenberg, <daniel@haxx.se>, et al.

 *

 * This software is licensed as described in the file COPYING, which

 * you should have received as part of this distribution. The terms

                           void *);

size_t Curl_llist_count(struct curl_llist *);

void Curl_llist_destroy(struct curl_llist *, void *);

int Curl_llist_move(struct curl_llist *, struct curl_llist_element *,

                    struct curl_llist *, struct curl_llist_element *);

#endif