| | varnish-cache/include/vct.h |
0 |
|
/*- |
1 |
|
* Copyright (c) 2006 Verdens Gang AS |
2 |
|
* Copyright (c) 2006-2009 Varnish Software AS |
3 |
|
* All rights reserved. |
4 |
|
* |
5 |
|
* Author: Poul-Henning Kamp <phk@phk.freebsd.dk> |
6 |
|
* |
7 |
|
* SPDX-License-Identifier: BSD-2-Clause |
8 |
|
* |
9 |
|
* Redistribution and use in source and binary forms, with or without |
10 |
|
* modification, are permitted provided that the following conditions |
11 |
|
* are met: |
12 |
|
* 1. Redistributions of source code must retain the above copyright |
13 |
|
* notice, this list of conditions and the following disclaimer. |
14 |
|
* 2. Redistributions in binary form must reproduce the above copyright |
15 |
|
* notice, this list of conditions and the following disclaimer in the |
16 |
|
* documentation and/or other materials provided with the distribution. |
17 |
|
* |
18 |
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
19 |
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
20 |
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
21 |
|
* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE |
22 |
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
23 |
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
24 |
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
25 |
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
26 |
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
27 |
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
28 |
|
* SUCH DAMAGE. |
29 |
|
* |
30 |
|
*/ |
31 |
|
|
32 |
|
/* from libvarnish/vct.c */ |
33 |
|
|
34 |
|
#include "vas.h" |
35 |
|
|
36 |
|
#define VCT_OWS (1<<0) |
37 |
|
#define VCT_CRLF (1<<1) |
38 |
|
#define VCT_LWS (VCT_CRLF | VCT_OWS) |
39 |
|
#define VCT_CTL (1<<2) |
40 |
|
#define VCT_ALPHA (1<<3) |
41 |
|
#define VCT_SEPARATOR (1<<4) |
42 |
|
#define VCT_DIGIT (1<<5) |
43 |
|
#define VCT_HEX (1<<6) |
44 |
|
#define VCT_XMLNAMESTART (1<<7) |
45 |
|
#define VCT_XMLNAME (1<<8) |
46 |
|
#define VCT_TCHAR (1<<9) |
47 |
|
#define VCT_ID (1<<10) |
48 |
|
#define VCT_IDENT (VCT_ALPHA | VCT_DIGIT | VCT_ID) |
49 |
|
#define VCT_BASE64 (1<<11) |
50 |
|
#define VCT_VT (1<<12) |
51 |
|
#define VCT_SPACE (VCT_LWS | VCT_VT) |
52 |
|
#define VCT_UPPER (1<<13) |
53 |
|
#define VCT_LOWER (1<<14) |
54 |
|
|
55 |
|
extern const uint16_t vct_typtab[256]; |
56 |
|
extern const uint8_t vct_lowertab[256]; |
57 |
|
|
58 |
|
const char *VCT_invalid_name(const char *b, const char *e); |
59 |
|
|
60 |
|
static inline int |
61 |
446320 |
vct_is(int x, uint16_t y) |
62 |
|
{ |
63 |
|
|
64 |
446320 |
x &= 0xff; |
65 |
446320 |
return (vct_typtab[x] & (y)); |
66 |
|
} |
67 |
|
|
68 |
|
#define vct_isows(x) vct_is(x, VCT_OWS) |
69 |
|
#define vct_issp(x) vct_is(x, VCT_OWS) |
70 |
|
#define vct_ishex(x) vct_is(x, VCT_HEX) |
71 |
|
#define vct_islws(x) vct_is(x, VCT_LWS) |
72 |
|
#define vct_isctl(x) vct_is(x, VCT_CTL) |
73 |
|
#define vct_isspace(x) vct_is(x, VCT_SPACE) |
74 |
|
#define vct_isdigit(x) vct_is(x, VCT_DIGIT) |
75 |
|
#define vct_isalpha(x) vct_is(x, VCT_ALPHA) |
76 |
|
#define vct_islower(x) vct_is(x, VCT_LOWER) |
77 |
|
#define vct_isupper(x) vct_is(x, VCT_UPPER) |
78 |
|
#define vct_isalnum(x) vct_is(x, VCT_ALPHA | VCT_DIGIT) |
79 |
|
#define vct_isbase64(x) vct_is(x, VCT_BASE64) |
80 |
|
#define vct_issep(x) vct_is(x, VCT_SEPARATOR) |
81 |
|
#define vct_issepctl(x) vct_is(x, VCT_SEPARATOR | VCT_CTL) |
82 |
|
#define vct_isident1(x) vct_isalpha(x) |
83 |
|
#define vct_isident(x) vct_is(x, VCT_IDENT) |
84 |
|
#define vct_isxmlnamestart(x) vct_is(x, VCT_XMLNAMESTART) |
85 |
|
#define vct_isxmlname(x) vct_is(x, VCT_XMLNAMESTART | VCT_XMLNAME) |
86 |
|
#define vct_istchar(x) vct_is(x, VCT_ALPHA | VCT_DIGIT | VCT_TCHAR) |
87 |
|
#define vct_ishdrval(x) \ |
88 |
|
(((uint8_t)(x) >= 0x20 && (uint8_t)(x) != 0x7f) ||(uint8_t)(x) == 0x09) |
89 |
|
|
90 |
|
static inline int |
91 |
91361 |
vct_iscrlf(const char* p, const char* end) |
92 |
|
{ |
93 |
91361 |
assert(p <= end); |
94 |
91361 |
if (p == end) |
95 |
0 |
return (0); |
96 |
91361 |
if ((p[0] == 0x0d && (p+1 < end) && p[1] == 0x0a)) // CR LF |
97 |
39383 |
return (2); |
98 |
51978 |
if (p[0] == 0x0a) // LF |
99 |
127 |
return (1); |
100 |
51851 |
return (0); |
101 |
91361 |
} |
102 |
|
|
103 |
|
/* NB: VCT always operate in ASCII, don't replace 0x0d with \r etc. */ |
104 |
|
static inline char* |
105 |
|
vct_skipcrlf(char* p, const char* end) |
106 |
|
{ |
107 |
|
return (p + vct_iscrlf(p, end)); |
108 |
|
} |
109 |
|
|
110 |
|
static inline int |
111 |
3499 |
vct_casecmp(const void *a, const void *b) |
112 |
|
{ |
113 |
3499 |
const uint8_t *aa = a; |
114 |
3499 |
const uint8_t *bb = b; |
115 |
|
|
116 |
7858 |
while (*aa && vct_lowertab[*aa] == vct_lowertab[*bb]) { |
117 |
4359 |
aa++; |
118 |
4359 |
bb++; |
119 |
|
} |
120 |
3499 |
if (!*aa && !*bb) |
121 |
847 |
return (0); |
122 |
2652 |
if (!*aa) |
123 |
0 |
return (-1); |
124 |
2652 |
if (!*bb) |
125 |
10 |
return (1); |
126 |
2642 |
return ((int)vct_lowertab[*aa] - (int)vct_lowertab[*bb]); |
127 |
3499 |
} |
128 |
|
|
129 |
|
static inline int |
130 |
256687 |
vct_caselencmp(const void *a, const void *b, ssize_t sz) |
131 |
|
{ |
132 |
256687 |
const uint8_t *aa = a; |
133 |
256687 |
const uint8_t *bb = b; |
134 |
|
|
135 |
256687 |
assert(sz >= 0); |
136 |
1279768 |
while (sz > 0 && *aa && vct_lowertab[*aa] == vct_lowertab[*bb]) { |
137 |
1023081 |
aa++; |
138 |
1023081 |
bb++; |
139 |
1023081 |
sz--; |
140 |
|
} |
141 |
256723 |
if (!sz || (!*aa && !*bb)) |
142 |
108603 |
return (0); |
143 |
148120 |
if (!*aa) |
144 |
0 |
return (-1); |
145 |
148120 |
if (!*bb) |
146 |
6 |
return (1); |
147 |
148114 |
return ((int)vct_lowertab[*aa] - (int)vct_lowertab[*bb]); |
148 |
256723 |
} |