blob: f0f2039310c3a9b5ce4635773a8e95a695135d26 [file] [log] [blame]
Willy Tarreauafba57a2018-12-11 13:44:24 +01001/*
2 * include/common/h1.h
3 * This file contains HTTP/1 protocol definitions.
4 *
5 * Copyright (C) 2000-2017 Willy Tarreau - w@1wt.eu
6 *
7 * This library is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation, version 2.1
10 * exclusively.
11 *
12 * This library is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with this library; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22#ifndef _COMMON_H1_H
23#define _COMMON_H1_H
24
25#include <common/buffer.h>
26#include <common/compiler.h>
27#include <common/config.h>
28#include <common/http.h>
29#include <common/http-hdr.h>
30#include <common/ist.h>
31#include <common/standard.h>
32
33
34/* Possible states while parsing HTTP/1 messages (request|response) */
35enum h1m_state {
36 H1_MSG_RQBEFORE = 0, // request: leading LF, before start line
37 H1_MSG_RQBEFORE_CR = 1, // request: leading CRLF, before start line
38 /* these ones define a request start line */
39 H1_MSG_RQMETH = 2, // parsing the Method
40 H1_MSG_RQMETH_SP = 3, // space(s) after the Method
41 H1_MSG_RQURI = 4, // parsing the Request URI
42 H1_MSG_RQURI_SP = 5, // space(s) after the Request URI
43 H1_MSG_RQVER = 6, // parsing the Request Version
44 H1_MSG_RQLINE_END = 7, // end of request line (CR or LF)
45
46 H1_MSG_RPBEFORE = 8, // response: leading LF, before start line
47 H1_MSG_RPBEFORE_CR = 9, // response: leading CRLF, before start line
48
49 /* these ones define a response start line */
50 H1_MSG_RPVER = 10, // parsing the Response Version
51 H1_MSG_RPVER_SP = 11, // space(s) after the Response Version
52 H1_MSG_RPCODE = 12, // response code
53 H1_MSG_RPCODE_SP = 13, // space(s) after the response code
54 H1_MSG_RPREASON = 14, // response reason
55 H1_MSG_RPLINE_END = 15, // end of response line (CR or LF)
56
57 /* common header processing */
58 H1_MSG_HDR_FIRST = 16, // waiting for first header or last CRLF (no LWS possible)
59 H1_MSG_HDR_NAME = 17, // parsing header name
60 H1_MSG_HDR_COL = 18, // parsing header colon
61 H1_MSG_HDR_L1_SP = 19, // parsing header LWS (SP|HT) before value
62 H1_MSG_HDR_L1_LF = 20, // parsing header LWS (LF) before value
63 H1_MSG_HDR_L1_LWS = 21, // checking whether it's a new header or an LWS
64 H1_MSG_HDR_VAL = 22, // parsing header value
65 H1_MSG_HDR_L2_LF = 23, // parsing header LWS (LF) inside/after value
66 H1_MSG_HDR_L2_LWS = 24, // checking whether it's a new header or an LWS
67
68 H1_MSG_LAST_LF = 25, // parsing last LF, last state for headers
69
70 /* Body processing. */
71
72 H1_MSG_CHUNK_SIZE = 26, // parsing the chunk size (RFC7230 #4.1)
73 H1_MSG_DATA = 27, // skipping data chunk / content-length data
74 H1_MSG_CHUNK_CRLF = 28, // skipping CRLF after data chunk
75 H1_MSG_TRAILERS = 29, // trailers (post-data entity headers)
76 /* we enter this state when we've received the end of the current message */
77 H1_MSG_DONE = 30, // message end received, waiting for resync or close
78 H1_MSG_TUNNEL = 31, // tunneled data after DONE
79} __attribute__((packed));
80
81
82/* HTTP/1 message flags (32 bit), for use in h1m->flags only */
83#define H1_MF_NONE 0x00000000
84#define H1_MF_CLEN 0x00000001 // content-length present
85#define H1_MF_CHNK 0x00000002 // chunk present, exclusive with c-l
86#define H1_MF_RESP 0x00000004 // this message is the response message
87#define H1_MF_TOLOWER 0x00000008 // turn the header names to lower case
88#define H1_MF_VER_11 0x00000010 // message indicates version 1.1 or above
89#define H1_MF_CONN_CLO 0x00000020 // message contains "connection: close"
90#define H1_MF_CONN_KAL 0x00000040 // message contains "connection: keep-alive"
91#define H1_MF_CONN_UPG 0x00000080 // message contains "connection: upgrade"
92#define H1_MF_XFER_LEN 0x00000100 // message xfer size can be determined
93#define H1_MF_XFER_ENC 0x00000200 // transfer-encoding is present
94#define H1_MF_NO_PHDR 0x00000400 // don't add pseudo-headers in the header list
Willy Tarreau0f8fb6b2019-01-04 10:48:03 +010095#define H1_MF_HDRS_ONLY 0x00000800 // parse headers only
Willy Tarreauafba57a2018-12-11 13:44:24 +010096
97/* Note: for a connection to be persistent, we need this for the request :
98 * - one of CLEN or CHNK
99 * - version 1.0 and KAL and not CLO
100 * - or version 1.1 and not CLO
101 * For the response it's the same except that UPG must not appear either.
102 * So in short, for a request it's (CLEN|CHNK) > 0 && !CLO && (VER_11 || KAL)
103 * and for a response it's (CLEN|CHNK) > 0 && !(CLO|UPG) && (VER_11 || KAL)
104 */
105
106
107/* basic HTTP/1 message state for use in parsers. The err_pos field is special,
108 * it is pre-set to a negative value (-1 or -2), and once non-negative it contains
109 * the relative position in the message of the first parse error. -2 is used to tell
110 * the parser that we want to block the invalid message. -1 is used to only perform
111 * a silent capture.
112 */
113struct h1m {
114 enum h1m_state state; // H1 message state (H1_MSG_*)
115 /* 24 bits available here */
116 uint32_t flags; // H1 message flags (H1_MF_*)
117 uint64_t curr_len; // content-length or last chunk length
118 uint64_t body_len; // total known size of the body length
119 uint32_t next; // next byte to parse, relative to buffer's head
120 int err_pos; // position in the byte stream of the first error (H1 or H2)
121 int err_state; // state where the first error was met (H1 or H2)
122};
123
124/* basic H1 start line, describes either the request and the response */
125union h1_sl { /* useful start line pointers, relative to ->sol */
126 struct {
127 struct ist m; /* METHOD */
128 struct ist u; /* URI */
129 struct ist v; /* VERSION */
130 enum http_meth_t meth; /* method */
131 } rq; /* request line : field, length */
132 struct {
133 struct ist v; /* VERSION */
134 struct ist c; /* CODE */
135 struct ist r; /* REASON */
136 uint16_t status; /* status code */
137 } st; /* status line : field, length */
138};
139
140int h1_headers_to_hdr_list(char *start, const char *stop,
141 struct http_hdr *hdr, unsigned int hdr_num,
142 struct h1m *h1m, union h1_sl *slp);
143int h1_measure_trailers(const struct buffer *buf, unsigned int ofs, unsigned int max);
144
145int h1_parse_cont_len_header(struct h1m *h1m, struct ist *value);
146void h1_parse_xfer_enc_header(struct h1m *h1m, struct ist value);
147void h1_parse_connection_header(struct h1m *h1m, struct ist value);
148
149/* for debugging, reports the HTTP/1 message state name */
150static inline const char *h1m_state_str(enum h1m_state msg_state)
151{
152 switch (msg_state) {
153 case H1_MSG_RQBEFORE: return "MSG_RQBEFORE";
154 case H1_MSG_RQBEFORE_CR: return "MSG_RQBEFORE_CR";
155 case H1_MSG_RQMETH: return "MSG_RQMETH";
156 case H1_MSG_RQMETH_SP: return "MSG_RQMETH_SP";
157 case H1_MSG_RQURI: return "MSG_RQURI";
158 case H1_MSG_RQURI_SP: return "MSG_RQURI_SP";
159 case H1_MSG_RQVER: return "MSG_RQVER";
160 case H1_MSG_RQLINE_END: return "MSG_RQLINE_END";
161 case H1_MSG_RPBEFORE: return "MSG_RPBEFORE";
162 case H1_MSG_RPBEFORE_CR: return "MSG_RPBEFORE_CR";
163 case H1_MSG_RPVER: return "MSG_RPVER";
164 case H1_MSG_RPVER_SP: return "MSG_RPVER_SP";
165 case H1_MSG_RPCODE: return "MSG_RPCODE";
166 case H1_MSG_RPCODE_SP: return "MSG_RPCODE_SP";
167 case H1_MSG_RPREASON: return "MSG_RPREASON";
168 case H1_MSG_RPLINE_END: return "MSG_RPLINE_END";
169 case H1_MSG_HDR_FIRST: return "MSG_HDR_FIRST";
170 case H1_MSG_HDR_NAME: return "MSG_HDR_NAME";
171 case H1_MSG_HDR_COL: return "MSG_HDR_COL";
172 case H1_MSG_HDR_L1_SP: return "MSG_HDR_L1_SP";
173 case H1_MSG_HDR_L1_LF: return "MSG_HDR_L1_LF";
174 case H1_MSG_HDR_L1_LWS: return "MSG_HDR_L1_LWS";
175 case H1_MSG_HDR_VAL: return "MSG_HDR_VAL";
176 case H1_MSG_HDR_L2_LF: return "MSG_HDR_L2_LF";
177 case H1_MSG_HDR_L2_LWS: return "MSG_HDR_L2_LWS";
178 case H1_MSG_LAST_LF: return "MSG_LAST_LF";
179 case H1_MSG_CHUNK_SIZE: return "MSG_CHUNK_SIZE";
180 case H1_MSG_DATA: return "MSG_DATA";
181 case H1_MSG_CHUNK_CRLF: return "MSG_CHUNK_CRLF";
182 case H1_MSG_TRAILERS: return "MSG_TRAILERS";
183 case H1_MSG_DONE: return "MSG_DONE";
184 case H1_MSG_TUNNEL: return "MSG_TUNNEL";
185 default: return "MSG_??????";
186 }
187}
188
189/* This function may be called only in HTTP_MSG_CHUNK_CRLF. It reads the CRLF or
190 * a possible LF alone at the end of a chunk. The caller should adjust msg->next
191 * in order to include this part into the next forwarding phase. Note that the
192 * caller must ensure that head+start points to the first byte to parse. It
193 * returns the number of bytes parsed on success, so the caller can set msg_state
194 * to HTTP_MSG_CHUNK_SIZE. If not enough data are available, the function does not
195 * change anything and returns zero. Otherwise it returns a negative value
196 * indicating the error positionn relative to <stop>. Note: this function is
197 * designed to parse wrapped CRLF at the end of the buffer.
198 */
199static inline int h1_skip_chunk_crlf(const struct buffer *buf, int start, int stop)
200{
201 const char *ptr = b_peek(buf, start);
202 int bytes = 1;
203
204 /* NB: we'll check data availability at the end. It's not a
205 * problem because whatever we match first will be checked
206 * against the correct length.
207 */
208 if (*ptr == '\r') {
209 bytes++;
210 ptr++;
211 if (ptr >= b_wrap(buf))
212 ptr = b_orig(buf);
213 }
214
215 if (bytes > stop - start)
216 return 0;
217
218 if (*ptr != '\n') // negative position to stop
219 return ptr - __b_peek(buf, stop);
220
221 return bytes;
222}
223
224/* Parse the chunk size start at buf + start and stops before buf + stop. The
225 * positions are relative to the buffer's head.
226 * It returns the chunk size in <res> and the amount of bytes read this way :
227 * < 0 : error at this position relative to <stop>
228 * = 0 : not enough bytes to read a complete chunk size
229 * > 0 : number of bytes successfully read that the caller can skip
230 * On success, the caller should adjust its msg->next to point to the first
231 * byte of data after the chunk size, so that we know we can forward exactly
232 * msg->next bytes, and msg->sol to contain the exact number of bytes forming
233 * the chunk size. That way it is always possible to differentiate between the
234 * start of the body and the start of the data. Note: this function is designed
235 * to parse wrapped CRLF at the end of the buffer.
236 */
237static inline int h1_parse_chunk_size(const struct buffer *buf, int start, int stop, unsigned int *res)
238{
239 const char *ptr = b_peek(buf, start);
240 const char *ptr_old = ptr;
241 const char *end = b_wrap(buf);
242 unsigned int chunk = 0;
243
244 stop -= start; // bytes left
245 start = stop; // bytes to transfer
246
247 /* The chunk size is in the following form, though we are only
248 * interested in the size and CRLF :
249 * 1*HEXDIGIT *WSP *[ ';' extensions ] CRLF
250 */
251 while (1) {
252 int c;
253 if (!stop)
254 return 0;
255 c = hex2i(*ptr);
256 if (c < 0) /* not a hex digit anymore */
257 break;
258 if (unlikely(++ptr >= end))
259 ptr = b_orig(buf);
260 if (unlikely(chunk & 0xF8000000)) /* integer overflow will occur if result >= 2GB */
261 goto error;
262 chunk = (chunk << 4) + c;
263 stop--;
264 }
265
266 /* empty size not allowed */
267 if (unlikely(ptr == ptr_old))
268 goto error;
269
270 while (HTTP_IS_SPHT(*ptr)) {
271 if (++ptr >= end)
272 ptr = b_orig(buf);
273 if (--stop == 0)
274 return 0;
275 }
276
277 /* Up to there, we know that at least one byte is present at *ptr. Check
278 * for the end of chunk size.
279 */
280 while (1) {
281 if (likely(HTTP_IS_CRLF(*ptr))) {
282 /* we now have a CR or an LF at ptr */
283 if (likely(*ptr == '\r')) {
284 if (++ptr >= end)
285 ptr = b_orig(buf);
286 if (--stop == 0)
287 return 0;
288 }
289
290 if (*ptr != '\n')
291 goto error;
292 if (++ptr >= end)
293 ptr = b_orig(buf);
294 --stop;
295 /* done */
296 break;
297 }
298 else if (likely(*ptr == ';')) {
299 /* chunk extension, ends at next CRLF */
300 if (++ptr >= end)
301 ptr = b_orig(buf);
302 if (--stop == 0)
303 return 0;
304
305 while (!HTTP_IS_CRLF(*ptr)) {
306 if (++ptr >= end)
307 ptr = b_orig(buf);
308 if (--stop == 0)
309 return 0;
310 }
311 /* we have a CRLF now, loop above */
312 continue;
313 }
314 else
315 goto error;
316 }
317
318 /* OK we found our CRLF and now <ptr> points to the next byte, which may
319 * or may not be present. Let's return the number of bytes parsed.
320 */
321 *res = chunk;
322 return start - stop;
323 error:
324 *res = 0; // just to stop gcc's -Wuninitialized warning :-(
325 return -stop;
326}
327
328/* initializes an H1 message for a request */
329static inline struct h1m *h1m_init_req(struct h1m *h1m)
330{
331 h1m->state = H1_MSG_RQBEFORE;
332 h1m->next = 0;
333 h1m->flags = H1_MF_NONE;
334 h1m->curr_len = 0;
335 h1m->body_len = 0;
336 h1m->err_pos = -2;
337 h1m->err_state = 0;
338 return h1m;
339}
340
341/* initializes an H1 message for a response */
342static inline struct h1m *h1m_init_res(struct h1m *h1m)
343{
344 h1m->state = H1_MSG_RPBEFORE;
345 h1m->next = 0;
346 h1m->flags = H1_MF_RESP;
347 h1m->curr_len = 0;
348 h1m->body_len = 0;
349 h1m->err_pos = -2;
350 h1m->err_state = 0;
351 return h1m;
352}
353
354#endif /* _COMMON_H1_H */