GCOV - Varnish Cache


/*-
 * Copyright 2015-2016 UPLEX - Nils Goroll Systemoptimierung
 * All rights reserved.
 *
 * Authors: Nils Goroll <nils.goroll@uplex.de>
 *          Geoffrey Simmons <geoffrey.simmons@uplex.de>
 *
 * SPDX-License-Identifier: BSD-2-Clause
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 * 1. Redistributions of source code must retain the above copyright notice,
 *    this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright notice,
 *    this list of conditions and the following disclaimer in the documentation
 *    and/or other materials provided with the distribution.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED.  IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 */

#include "config.h"

#include "vdef.h"
#include "vrt.h"
#include "vas.h"

#include "vmod_blob.h"

/* Decoder states */
enum state_e {
        NORMAL,
        PERCENT,  /* just read '%' */
        FIRSTNIB, /* just read the first nibble after '%' */
};

size_t
url_encode_l(size_t l)
{
        return ((l * 3) + 1);
}

size_t
url_decode_l(size_t l)
{
        return (l);
}

/*
 * Bitmap of unreserved characters according to RFC 3986 section 2.3
 * (locale-independent and cacheline friendly)
 */
static const uint8_t unreserved[] = {
        0x00, 0x00, 0x00, 0x00, 0x00, 0x60, 0xff, 0x03,
        0xfe, 0xff, 0xff, 0x87, 0xfe, 0xff, 0xff, 0x47,
        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
};

static inline int
isunreserved(const uint8_t c)
{
        return (unreserved[c >> 3] & (1 << (c & 7)));
}

static inline int
isoutofrange(const uint8_t c)
{
        return (c < '0' || c > 'f');
}

ssize_t
url_encode(const enum encoding enc, const enum case_e kase,
    blob_dest_t buf, blob_len_t buflen,
    blob_src_t in, blob_len_t inlen)
{
        char *p = buf;
        const char * const end = buf + buflen;
        const char *alphabet = hex_alphabet[0];
        size_t i;

        AN(buf);
        assert(enc == URL);
        if (in == NULL || inlen == 0)
                return (0);

        if (kase == UPPER)
                alphabet = hex_alphabet[1];

        for (i = 0; i < inlen; i++) {
                if (isunreserved(in[i])) {
                        if (p == end)
                                return (-1);
                        *p++ = in[i];
                }
                else {
                        if (p + 3 > end)
                                return (-1);
                        *p++ = '%';
                        *p++ = alphabet[(in[i] & 0xf0) >> 4];
                        *p++ = alphabet[in[i] & 0x0f];
                }
        }

        return (p - buf);
}

ssize_t
url_decode(const enum encoding dec, blob_dest_t buf,
    blob_len_t buflen, ssize_t n, VCL_STRANDS strings)
{
        char *dest = buf;
        const char * const end = buf + buflen;
        const char *s;
        size_t len = SIZE_MAX;
        uint8_t nib = 0, nib2;
        enum state_e state = NORMAL;
        int i;

        AN(buf);
        AN(strings);
        assert(dec == URL);

        if (n >= 0)
                len = n;

        for (i = 0; len > 0 && i < strings->n; i++) {
                s = strings->p[i];

                if (s == NULL || *s == '\0')
                        continue;
                while (*s && len) {
                        switch (state) {
                        case NORMAL:
                                if (*s == '%')
                                        state = PERCENT;
                                else {
                                        if (dest == end) {
                                                errno = ENOMEM;
                                                return (-1);
                                        }
                                        *dest++ = *s;
                                }
                                break;
                        case PERCENT:
                                if (isoutofrange(*s) ||
                                    (nib = hex_nibble[*s - '0']) == ILL) {
                                        errno = EINVAL;
                                        return (-1);
                                }
                                state = FIRSTNIB;
                                break;
                        case FIRSTNIB:
                                if (dest == end) {
                                        errno = ENOMEM;
                                        return (-1);
                                }
                                if (isoutofrange(*s) ||
                                    (nib2 = hex_nibble[*s - '0']) == ILL) {
                                        errno = EINVAL;
                                        return (-1);
                                }
                                *dest++ = (nib << 4) | nib2;
                                nib = 0;
                                state = NORMAL;
                                break;
                        default:
                                WRONG("illegal URL decode state");
                        }
                        s++;
                        len--;
                }
        }
        if (state != NORMAL) {
                errno = EINVAL;
                return (-1);
        }
        assert(dest <= end);
        return (dest - buf);
}

		varnish-cache/vmod/vmod_blob_url.c
0		/*-
1		* Copyright 2015-2016 UPLEX - Nils Goroll Systemoptimierung
2		* All rights reserved.
3		*
4		* Authors: Nils Goroll <nils.goroll@uplex.de>
5		* Geoffrey Simmons <geoffrey.simmons@uplex.de>
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 are met:
11		* 1. Redistributions of source code must retain the above copyright notice,
12		* this list of conditions and the following disclaimer.
13		* 2. Redistributions in binary form must reproduce the above copyright notice,
14		* this list of conditions and the following disclaimer in the documentation
15		* and/or other materials provided with the distribution.
16		*
17		* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND ANY
18		* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
19		* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
20		* DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE FOR ANY
21		* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
22		* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
23		* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
24		* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25		* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
26		* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27		*
28		*/
29
30		#include "config.h"
31
32		#include "vdef.h"
33		#include "vrt.h"
34		#include "vas.h"
35
36		#include "vmod_blob.h"
37
38		/* Decoder states */
39		enum state_e {
40		NORMAL,
41		PERCENT, /* just read '%' */
42		FIRSTNIB, /* just read the first nibble after '%' */
43		};
44
45		size_t
46	560	url_encode_l(size_t l)
47		{
48	560	return ((l * 3) + 1);
49		}
50
51		size_t
52	2680	url_decode_l(size_t l)
53		{
54	2680	return (l);
55		}
56
57		/*
58		* Bitmap of unreserved characters according to RFC 3986 section 2.3
59		* (locale-independent and cacheline friendly)
60		*/
61		static const uint8_t unreserved[] = {
62		0x00, 0x00, 0x00, 0x00, 0x00, 0x60, 0xff, 0x03,
63		0xfe, 0xff, 0xff, 0x87, 0xfe, 0xff, 0xff, 0x47,
64		0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
65		0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
66		};
67
68		static inline int
69	384040	isunreserved(const uint8_t c)
70		{
71	384040	return (unreserved[c >> 3] & (1 << (c & 7)));
72		}
73
74		static inline int
75	529120	isoutofrange(const uint8_t c)
76		{
77	529120	return (c < '0' \|\| c > 'f');
78		}
79
80		ssize_t
81	3720	url_encode(const enum encoding enc, const enum case_e kase,
82		blob_dest_t buf, blob_len_t buflen,
83		blob_src_t in, blob_len_t inlen)
84		{
85	3720	char *p = buf;
86	3720	const char * const end = buf + buflen;
87	3720	const char *alphabet = hex_alphabet[0];
88		size_t i;
89
90	3720	AN(buf);
91	3720	assert(enc == URL);
92	3720	if (in == NULL \|\| inlen == 0)
93	120	return (0);
94
95	3600	if (kase == UPPER)
96	1280	alphabet = hex_alphabet[1];
97
98	387640	for (i = 0; i < inlen; i++) {
99	384040	if (isunreserved(in[i])) {
100	130640	if (p == end)
101	0	return (-1);
102	130640	*p++ = in[i];
103	130640	}
104		else {
105	253400	if (p + 3 > end)
106	0	return (-1);
107	253400	*p++ = '%';
108	253400	*p++ = alphabet[(in[i] & 0xf0) >> 4];
109	253400	*p++ = alphabet[in[i] & 0x0f];
110		}
111	384040	}
112
113	3600	return (p - buf);
114	3720	}
115
116		ssize_t
117	4680	url_decode(const enum encoding dec, blob_dest_t buf,
118		blob_len_t buflen, ssize_t n, VCL_STRANDS strings)
119		{
120	4680	char *dest = buf;
121	4680	const char * const end = buf + buflen;
122		const char *s;
123	4680	size_t len = SIZE_MAX;
124	4680	uint8_t nib = 0, nib2;
125	4680	enum state_e state = NORMAL;
126		int i;
127
128	4680	AN(buf);
129	4680	AN(strings);
130	4680	assert(dec == URL);
131
132	4680	if (n >= 0)
133	2120	len = n;
134
135	10720	for (i = 0; len > 0 && i < strings->n; i++) {
136	6320	s = strings->p[i];
137
138	6320	if (s == NULL \|\| *s == '\0')
139	1280	continue;
140	937480	while (*s && len) {
141	932720	switch (state) {
142		case NORMAL:
143	403600	if (*s == '%')
144	264920	state = PERCENT;
145		else {
146	138680	if (dest == end) {
147	40	errno = ENOMEM;
148	40	return (-1);
149		}
150	138640	dest++ = s;
151		}
152	403560	break;
153		case PERCENT:
154	264720	if (isoutofrange(*s) \|\|
155	264600	(nib = hex_nibble[*s - '0']) == ILL) {
156	120	errno = EINVAL;
157	120	return (-1);
158		}
159	264600	state = FIRSTNIB;
160	264600	break;
161		case FIRSTNIB:
162	264400	if (dest == end) {
163	0	errno = ENOMEM;
164	0	return (-1);
165		}
166	264400	if (isoutofrange(*s) \|\|
167	264280	(nib2 = hex_nibble[*s - '0']) == ILL) {
168	120	errno = EINVAL;
169	120	return (-1);
170		}
171	264280	*dest++ = (nib << 4) \| nib2;
172	264280	nib = 0;
173	264280	state = NORMAL;
174	264280	break;
175		default:
176	0	WRONG("illegal URL decode state");
177	0	}
178	932440	s++;
179	932440	len--;
180		}
181	4760	}
182	4400	if (state != NORMAL) {
183	400	errno = EINVAL;
184	400	return (-1);
185		}
186	4000	assert(dest <= end);
187	4000	return (dest - buf);
188	4680	}