2
0

http_chunks.h 3.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108
  1. #ifndef __HTTP_CHUNKS_H
  2. #define __HTTP_CHUNKS_H
  3. /***************************************************************************
  4. * _ _ ____ _
  5. * Project ___| | | | _ \| |
  6. * / __| | | | |_) | |
  7. * | (__| |_| | _ <| |___
  8. * \___|\___/|_| \_\_____|
  9. *
  10. * Copyright (C) 1998 - 2007, Daniel Stenberg, <daniel@haxx.se>, et al.
  11. *
  12. * This software is licensed as described in the file COPYING, which
  13. * you should have received as part of this distribution. The terms
  14. * are also available at http://curl.haxx.se/docs/copyright.html.
  15. *
  16. * You may opt to use, copy, modify, merge, publish, distribute and/or sell
  17. * copies of the Software, and permit persons to whom the Software is
  18. * furnished to do so, under the terms of the COPYING file.
  19. *
  20. * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
  21. * KIND, either express or implied.
  22. *
  23. * $Id$
  24. ***************************************************************************/
  25. /*
  26. * The longest possible hexadecimal number we support in a chunked transfer.
  27. * Weird enough, RFC2616 doesn't set a maximum size! Since we use strtoul()
  28. * to convert it, we "only" support 2^32 bytes chunk data.
  29. */
  30. #define MAXNUM_SIZE 16
  31. typedef enum {
  32. CHUNK_FIRST, /* never use */
  33. /* In this we await and buffer all hexadecimal digits until we get one
  34. that isn't a hexadecimal digit. When done, we go POSTHEX */
  35. CHUNK_HEX,
  36. /* We have received the hexadecimal digit and we eat all characters until
  37. we get a CRLF pair. When we see a CR we go to the CR state. */
  38. CHUNK_POSTHEX,
  39. /* A single CR has been found and we should get a LF right away in this
  40. state or we go back to POSTHEX. When LF is received, we go to DATA.
  41. If the size given was zero, we set state to STOP and return. */
  42. CHUNK_CR,
  43. /* We eat the amount of data specified. When done, we move on to the
  44. POST_CR state. */
  45. CHUNK_DATA,
  46. /* POSTCR should get a CR and nothing else, then move to POSTLF */
  47. CHUNK_POSTCR,
  48. /* POSTLF should get a LF and nothing else, then move back to HEX as the
  49. CRLF combination marks the end of a chunk */
  50. CHUNK_POSTLF,
  51. /* Each Chunk body should end with a CRLF. Read a CR and nothing else,
  52. then move to CHUNK_STOP */
  53. CHUNK_STOPCR,
  54. /* This is mainly used to really mark that we're out of the game.
  55. NOTE: that there's a 'dataleft' field in the struct that will tell how
  56. many bytes that were not passed to the client in the end of the last
  57. buffer! */
  58. CHUNK_STOP,
  59. /* At this point optional trailer headers can be found, unless the next line
  60. is CRLF */
  61. CHUNK_TRAILER,
  62. /* A trailer CR has been found - next state is CHUNK_TRAILER_POSTCR.
  63. Next char must be a LF */
  64. CHUNK_TRAILER_CR,
  65. /* A trailer LF must be found now, otherwise CHUNKE_BAD_CHUNK will be
  66. signalled If this is an empty trailer CHUNKE_STOP will be signalled.
  67. Otherwise the trailer will be broadcasted via Curl_client_write() and the
  68. next state will be CHUNK_TRAILER */
  69. CHUNK_TRAILER_POSTCR,
  70. CHUNK_LAST /* never use */
  71. } ChunkyState;
  72. typedef enum {
  73. CHUNKE_STOP = -1,
  74. CHUNKE_OK = 0,
  75. CHUNKE_TOO_LONG_HEX = 1,
  76. CHUNKE_ILLEGAL_HEX,
  77. CHUNKE_BAD_CHUNK,
  78. CHUNKE_WRITE_ERROR,
  79. CHUNKE_STATE_ERROR,
  80. CHUNKE_BAD_ENCODING,
  81. CHUNKE_OUT_OF_MEMORY,
  82. CHUNKE_LAST
  83. } CHUNKcode;
  84. struct Curl_chunker {
  85. char hexbuffer[ MAXNUM_SIZE + 1];
  86. int hexindex;
  87. ChunkyState state;
  88. size_t datasize;
  89. size_t dataleft; /* untouched data amount at the end of the last buffer */
  90. };
  91. #endif