1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
|
/* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "apr_strings.h"
#include "apr_thread_proc.h" /* for RLIMIT stuff */
#include "apr_sha1.h"
#include "apr_base64.h"
#include "apr_buckets.h"
#define APR_WANT_STRFUNC
#include "apr_want.h"
#include "httpd.h"
#include "http_config.h"
#include "http_connection.h"
#include "http_core.h"
#include "http_log.h"
#include "http_protocol.h" /* For index_of_response(). Grump. */
#include "http_request.h"
#if APR_HAS_MMAP
#include "apr_mmap.h"
#endif /* APR_HAS_MMAP */
#define SHA1_DIGEST_BASE64_LEN 4*(APR_SHA1_DIGESTSIZE/3)
/* Generate the human-readable hex representation of an apr_uint64_t
* (basically a faster version of 'sprintf("%llx")')
*/
#define HEX_DIGITS "0123456789abcdef"
static char *etag_uint64_to_hex(char *next, apr_uint64_t u)
{
int printing = 0;
int shift = sizeof(apr_uint64_t) * 8 - 4;
do {
unsigned short next_digit = (unsigned short)
((u >> shift) & (apr_uint64_t)0xf);
if (next_digit) {
*next++ = HEX_DIGITS[next_digit];
printing = 1;
}
else if (printing) {
*next++ = HEX_DIGITS[next_digit];
}
shift -= 4;
} while (shift);
*next++ = HEX_DIGITS[u & (apr_uint64_t)0xf];
return next;
}
#define ETAG_WEAK "W/"
#define CHARS_PER_UINT64 (sizeof(apr_uint64_t) * 2)
static void etag_start(char *etag, const char *weak, char **next)
{
if (weak) {
while (*weak) {
*etag++ = *weak++;
}
}
*etag++ = '"';
*next = etag;
}
static void etag_end(char *next, const char *vlv, apr_size_t vlv_len)
{
if (vlv) {
*next++ = ';';
apr_cpystrn(next, vlv, vlv_len);
}
else {
*next++ = '"';
*next = '\0';
}
}
/*
* Construct a strong ETag by creating a SHA1 hash across the file content.
*/
static char *make_digest_etag(request_rec *r, etag_rec *er, char *vlv,
apr_size_t vlv_len, char *weak, apr_size_t weak_len)
{
apr_sha1_ctx_t context;
unsigned char digest[APR_SHA1_DIGESTSIZE];
apr_file_t *fd = NULL;
core_dir_config *cfg;
char *etag, *next;
apr_bucket_brigade *bb;
apr_bucket *e;
apr_size_t nbytes;
apr_off_t offset = 0, zero = 0, len = 0;
apr_status_t status;
cfg = (core_dir_config *)ap_get_core_module_config(r->per_dir_config);
if (er->fd) {
fd = er->fd;
}
else if (er->pathname) {
if ((status = apr_file_open(&fd, er->pathname, APR_READ | APR_BINARY,
0, r->pool)) != APR_SUCCESS) {
ap_log_rerror(APLOG_MARK, APLOG_ERR, status, r, APLOGNO(10251)
"Make etag: could not open %s", er->pathname);
return "";
}
}
if (!fd) {
return "";
}
if ((status = apr_file_seek(fd, APR_CUR, &offset)) != APR_SUCCESS) {
ap_log_rerror(APLOG_MARK, APLOG_ERR, status, r, APLOGNO(10252)
"Make etag: could not seek");
if (er->pathname) {
apr_file_close(fd);
}
return "";
}
if ((status = apr_file_seek(fd, APR_END, &len)) != APR_SUCCESS) {
ap_log_rerror(APLOG_MARK, APLOG_ERR, status, r, APLOGNO(10258)
"Make etag: could not seek");
if (er->pathname) {
apr_file_close(fd);
}
return "";
}
if ((status = apr_file_seek(fd, APR_SET, &zero)) != APR_SUCCESS) {
ap_log_rerror(APLOG_MARK, APLOG_ERR, status, r, APLOGNO(10253)
"Make etag: could not seek");
if (er->pathname) {
apr_file_close(fd);
}
return "";
}
bb = apr_brigade_create(r->pool, r->connection->bucket_alloc);
e = apr_brigade_insert_file(bb, fd, 0, len, r->pool);
#if APR_HAS_MMAP
if (cfg->enable_mmap == ENABLE_MMAP_OFF) {
(void)apr_bucket_file_enable_mmap(e, 0);
}
#endif
apr_sha1_init(&context);
while (!APR_BRIGADE_EMPTY(bb))
{
const char *str;
e = APR_BRIGADE_FIRST(bb);
if ((status = apr_bucket_read(e, &str, &nbytes, APR_BLOCK_READ)) != APR_SUCCESS) {
apr_brigade_destroy(bb);
ap_log_rerror(APLOG_MARK, APLOG_ERR, status, r, APLOGNO(10254)
"Make etag: could not read");
if (er->pathname) {
apr_file_close(fd);
}
return "";
}
apr_sha1_update(&context, str, nbytes);
apr_bucket_delete(e);
}
if ((status = apr_file_seek(fd, APR_SET, &offset)) != APR_SUCCESS) {
ap_log_rerror(APLOG_MARK, APLOG_ERR, status, r, APLOGNO(10255)
"Make etag: could not seek");
if (er->pathname) {
apr_file_close(fd);
}
return "";
}
apr_sha1_final(digest, &context);
etag = apr_palloc(r->pool, weak_len + sizeof("\"\"") +
SHA1_DIGEST_BASE64_LEN + vlv_len + 4);
etag_start(etag, weak, &next);
next += apr_base64_encode_binary(next, digest, APR_SHA1_DIGESTSIZE) - 1;
etag_end(next, vlv, vlv_len);
if (er->pathname) {
apr_file_close(fd);
}
return etag;
}
/*
* Construct an entity tag (ETag) from resource information. If it's a real
* file, build in some of the file characteristics. If the modification time
* is newer than (request-time minus 1 second), mark the ETag as weak - it
* could be modified again in as short an interval.
*/
AP_DECLARE(char *) ap_make_etag_ex(request_rec *r, etag_rec *er)
{
char *weak = NULL;
apr_size_t weak_len = 0, vlv_len = 0;
char *etag, *next, *vlv;
core_dir_config *cfg;
etag_components_t etag_bits;
etag_components_t bits_added;
cfg = (core_dir_config *)ap_get_core_module_config(r->per_dir_config);
etag_bits = (cfg->etag_bits & (~ cfg->etag_remove)) | cfg->etag_add;
if (er->force_weak) {
weak = ETAG_WEAK;
weak_len = sizeof(ETAG_WEAK);
}
if (r->vlist_validator) {
/* If we have a variant list validator (vlv) due to the
* response being negotiated, then we create a structured
* entity tag which merges the variant etag with the variant
* list validator (vlv). This merging makes revalidation
* somewhat safer, ensures that caches which can deal with
* Vary will (eventually) be updated if the set of variants is
* changed, and is also a protocol requirement for transparent
* content negotiation.
*/
/* if the variant list validator is weak, we make the whole
* structured etag weak. If we would not, then clients could
* have problems merging range responses if we have different
* variants with the same non-globally-unique strong etag.
*/
vlv = r->vlist_validator;
if (vlv[0] == 'W') {
vlv += 3;
weak = ETAG_WEAK;
weak_len = sizeof(ETAG_WEAK);
}
else {
vlv++;
}
vlv_len = strlen(vlv);
}
else {
vlv = NULL;
vlv_len = 0;
}
/*
* Did a module flag the need for a strong etag, or did the
* configuration tell us to generate a digest?
*/
if (er->finfo->filetype == APR_REG &&
(AP_REQUEST_IS_STRONG_ETAG(r) || (etag_bits & ETAG_DIGEST))) {
return make_digest_etag(r, er, vlv, vlv_len, weak, weak_len);
}
/*
* If it's a file (or we wouldn't be here) and no ETags
* should be set for files, return an empty string and
* note it for the header-sender to ignore.
*/
if (etag_bits & ETAG_NONE) {
return "";
}
if (etag_bits == ETAG_UNSET) {
etag_bits = ETAG_BACKWARD;
}
/*
* Make an ETag header out of various pieces of information. We use
* the last-modified date and, if we have a real file, the
* length and inode number - note that this doesn't have to match
* the content-length (i.e. includes), it just has to be unique
* for the file.
*
* If the request was made within a second of the last-modified date,
* we send a weak tag instead of a strong one, since it could
* be modified again later in the second, and the validation
* would be incorrect.
*/
if ((er->request_time - er->finfo->mtime < (1 * APR_USEC_PER_SEC))) {
weak = ETAG_WEAK;
weak_len = sizeof(ETAG_WEAK);
}
if (er->finfo->filetype != APR_NOFILE) {
/*
* ETag gets set to [W/]"inode-size-mtime", modulo any
* FileETag keywords.
*/
etag = apr_palloc(r->pool, weak_len + sizeof("\"--\"") +
3 * CHARS_PER_UINT64 + vlv_len + 2);
etag_start(etag, weak, &next);
bits_added = 0;
if (etag_bits & ETAG_INODE) {
next = etag_uint64_to_hex(next, er->finfo->inode);
bits_added |= ETAG_INODE;
}
if (etag_bits & ETAG_SIZE) {
if (bits_added != 0) {
*next++ = '-';
}
next = etag_uint64_to_hex(next, er->finfo->size);
bits_added |= ETAG_SIZE;
}
if (etag_bits & ETAG_MTIME) {
if (bits_added != 0) {
*next++ = '-';
}
next = etag_uint64_to_hex(next, er->finfo->mtime);
}
etag_end(next, vlv, vlv_len);
}
else {
/*
* Not a file document, so just use the mtime: [W/]"mtime"
*/
etag = apr_palloc(r->pool, weak_len + sizeof("\"\"") +
CHARS_PER_UINT64 + vlv_len + 2);
etag_start(etag, weak, &next);
next = etag_uint64_to_hex(next, er->finfo->mtime);
etag_end(next, vlv, vlv_len);
}
return etag;
}
AP_DECLARE(char *) ap_make_etag(request_rec *r, int force_weak)
{
etag_rec er;
er.vlist_validator = NULL;
er.request_time = r->request_time;
er.finfo = &r->finfo;
er.pathname = r->filename;
er.fd = NULL;
er.force_weak = force_weak;
return ap_make_etag_ex(r, &er);
}
AP_DECLARE(void) ap_set_etag(request_rec *r)
{
char *etag;
etag_rec er;
er.vlist_validator = r->vlist_validator;
er.request_time = r->request_time;
er.finfo = &r->finfo;
er.pathname = r->filename;
er.fd = NULL;
er.force_weak = 0;
etag = ap_make_etag_ex(r, &er);
if (etag && etag[0]) {
apr_table_setn(r->headers_out, "ETag", etag);
}
else {
apr_table_setn(r->notes, "no-etag", "omit");
}
}
AP_DECLARE(void) ap_set_etag_fd(request_rec *r, apr_file_t *fd)
{
char *etag;
etag_rec er;
er.vlist_validator = r->vlist_validator;
er.request_time = r->request_time;
er.finfo = &r->finfo;
er.pathname = NULL;
er.fd = fd;
er.force_weak = 0;
etag = ap_make_etag_ex(r, &er);
if (etag && etag[0]) {
apr_table_setn(r->headers_out, "ETag", etag);
}
else {
apr_table_setn(r->notes, "no-etag", "omit");
}
}
|