GCOV - Varnish Cache


/*-
 * Copyright (c) 2010-2014 Varnish Software AS
 * All rights reserved.
 *
 * Author: Naren Venkataraman of Vimeo Inc.
 *
 * 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 <stdlib.h>
#include <string.h>

#include "cache/cache.h"

#include "vcc_std_if.h"

static int
compa(const void *a, const void *b)
{
        const char * const *pa = a;
        const char * const *pb = b;
        const char *a1, *b1;

        for (a1 = pa[0], b1 = pb[0]; a1 < pa[1] && b1 < pb[1]; a1++, b1++)
                if (*a1 != *b1)
                        return (*a1 - *b1);
        return (0);
}

VCL_STRING v_matchproto_(td_std_querysort)
vmod_querysort(VRT_CTX, VCL_STRING url)
{
        const char *cq, *cu;
        char *p, *r;
        const char **pp;
        const char **pe;
        unsigned u;
        int np;
        int i;

        CHECK_OBJ_NOTNULL(ctx, VRT_CTX_MAGIC);

        if (url == NULL)
                return (NULL);

        /* Split :query from :url */
        cu = strchr(url, '?');
        if (cu == NULL)
                return (url);

        /* Spot single-param queries */
        cq = strchr(cu, '&');
        if (cq == NULL)
                return (url);

        r = WS_Copy(ctx->ws, url, -1);
        if (r == NULL)
                return (url);

        u = WS_ReserveLumps(ctx->ws, sizeof(const char **));
        pp = WS_Reservation(ctx->ws);
        if (u < 4) {
                WS_Release(ctx->ws, 0);
                WS_MarkOverflow(ctx->ws);
                return (url);
        }
        pe = pp + u;

        /* Collect params as pointer pairs */
        np = 0;
        pp[np++] = 1 + cu;
        for (cq = 1 + cu; *cq != '\0'; cq++) {
                if (*cq == '&') {
                        if (pp + np + 3 > pe) {
                                WS_Release(ctx->ws, 0);
                                WS_MarkOverflow(ctx->ws);
                                return (url);
                        }
                        pp[np++] = cq;
                        /* Skip trivially empty params */
                        while (cq[1] == '&')
                                cq++;
                        pp[np++] = cq + 1;
                }
        }
        pp[np++] = cq;
        assert(!(np & 1));

        qsort(pp, np / 2, sizeof(*pp) * 2, compa);

        /* Emit sorted params */
        p = 1 + r + (cu - url);
        cq = "";
        for (i = 0; i < np; i += 2) {
                /* Ignore any edge-case zero length params */
                if (pp[i + 1] == pp[i])
                        continue;
                assert(pp[i + 1] > pp[i]);
                if (*cq)
                        *p++ = *cq;
                memcpy(p, pp[i], pp[i + 1] - pp[i]);
                p += pp[i + 1] - pp[i];
                cq = "&";
        }
        *p = '\0';

        WS_Release(ctx->ws, 0);
        return (r);
}

		varnish-cache/vmod/vmod_std_querysort.c
0		/*-
1		* Copyright (c) 2010-2014 Varnish Software AS
2		* All rights reserved.
3		*
4		* Author: Naren Venkataraman of Vimeo Inc.
5		*
6		* SPDX-License-Identifier: BSD-2-Clause
7		*
8		* Redistribution and use in source and binary forms, with or without
9		* modification, are permitted provided that the following conditions
10		* are met:
11		* 1. Redistributions of source code must retain the above copyright
12		* notice, this list of conditions and the following disclaimer.
13		* 2. Redistributions in binary form must reproduce the above copyright
14		* notice, this list of conditions and the following disclaimer in the
15		* documentation and/or other materials provided with the distribution.
16		*
17		* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18		* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19		* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20		* ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
21		* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22		* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23		* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24		* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25		* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26		* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27		* SUCH DAMAGE.
28		*/
29
30		#include "config.h"
31
32		#include <stdlib.h>
33		#include <string.h>
34
35		#include "cache/cache.h"
36
37		#include "vcc_std_if.h"
38
39		static int
40	640	compa(const void a, const void b)
41		{
42	640	const char * const *pa = a;
43	640	const char * const *pb = b;
44		const char a1, b1;
45
46	720	for (a1 = pa[0], b1 = pb[0]; a1 < pa[1] && b1 < pb[1]; a1++, b1++)
47	560	if (a1 != b1)
48	480	return (a1 - b1);
49	160	return (0);
50	640	}
51
52		VCL_STRING v_matchproto_(td_std_querysort)
53	360	vmod_querysort(VRT_CTX, VCL_STRING url)
54		{
55		const char cq, cu;
56		char p, r;
57		const char **pp;
58		const char **pe;
59		unsigned u;
60		int np;
61		int i;
62
63	360	CHECK_OBJ_NOTNULL(ctx, VRT_CTX_MAGIC);
64
65	360	if (url == NULL)
66	40	return (NULL);
67
68		/* Split :query from :url */
69	320	cu = strchr(url, '?');
70	320	if (cu == NULL)
71	40	return (url);
72
73		/* Spot single-param queries */
74	280	cq = strchr(cu, '&');
75	280	if (cq == NULL)
76	40	return (url);
77
78	240	r = WS_Copy(ctx->ws, url, -1);
79	240	if (r == NULL)
80	0	return (url);
81
82	240	u = WS_ReserveLumps(ctx->ws, sizeof(const char **));
83	240	pp = WS_Reservation(ctx->ws);
84	240	if (u < 4) {
85	0	WS_Release(ctx->ws, 0);
86	0	WS_MarkOverflow(ctx->ws);
87	0	return (url);
88		}
89	240	pe = pp + u;
90
91		/* Collect params as pointer pairs */
92	240	np = 0;
93	240	pp[np++] = 1 + cu;
94	2160	for (cq = 1 + cu; *cq != '\0'; cq++) {
95	1960	if (*cq == '&') {
96	520	if (pp + np + 3 > pe) {
97	40	WS_Release(ctx->ws, 0);
98	40	WS_MarkOverflow(ctx->ws);
99	40	return (url);
100		}
101	480	pp[np++] = cq;
102		/* Skip trivially empty params */
103	800	while (cq[1] == '&')
104	320	cq++;
105	480	pp[np++] = cq + 1;
106	480	}
107	1920	}
108	200	pp[np++] = cq;
109	200	assert(!(np & 1));
110
111	200	qsort(pp, np / 2, sizeof(pp) 2, compa);
112
113		/* Emit sorted params */
114	200	p = 1 + r + (cu - url);
115	200	cq = "";
116	840	for (i = 0; i < np; i += 2) {
117		/* Ignore any edge-case zero length params */
118	640	if (pp[i + 1] == pp[i])
119	200	continue;
120	440	assert(pp[i + 1] > pp[i]);
121	440	if (*cq)
122	280	p++ = cq;
123	440	memcpy(p, pp[i], pp[i + 1] - pp[i]);
124	440	p += pp[i + 1] - pp[i];
125	440	cq = "&";
126	440	}
127	200	*p = '\0';
128
129	200	WS_Release(ctx->ws, 0);
130	200	return (r);
131	360	}