GCOV - Varnish Cache


/*-
 * Copyright (c) 2006 Verdens Gang AS
 * Copyright (c) 2006-2015 Varnish Software AS
 * All rights reserved.
 *
 * Author: Martin Blix Grydeland <martin@varnish-software.com>
 *
 * 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 <ctype.h>
#include <math.h>
#include <stdio.h>

#include "vdef.h"
#include "vas.h"
#include "miniobj.h"

#include "vbm.h"
#include "vqueue.h"
#include "vre.h"
#include "vsb.h"

#include "vapi/vsl.h"

#include "vsl_api.h"
#include "vxp.h"

struct vslq_query {
        unsigned                magic;
#define VSLQ_QUERY_MAGIC        0x122322A5

        struct vex              *vex;
};

#define VSLQ_TEST_NUMOP(TYPE, PRE_LHS, OP, PRE_RHS)             \
        do {                                                    \
                switch (TYPE) {                                 \
                case VEX_INT:                                   \
                        if (PRE_LHS##_int OP PRE_RHS##_int)     \
                                return (1);                     \
                        return (0);                             \
                case VEX_FLOAT:                                 \
                        if (PRE_LHS##_float OP PRE_RHS##_float) \
                                return (1);                     \
                        return (0);                             \
                default:                                        \
                        WRONG("Wrong RHS type");                \
                }                                               \
        } while(0)                                              \

static int
vslq_test_vxid(const struct vex *vex, const struct VSL_transaction *trans)
{
        const struct vex_rhs *rhs;

        AN(vex);
        AN(trans);

        rhs = vex->rhs;
        CHECK_OBJ_NOTNULL(rhs, VEX_RHS_MAGIC);

        /* Prepare */
        switch (vex->tok) {
        case T_EQ:              /* == */
        case T_NEQ:             /* != */
        case '<':
        case '>':
        case T_LEQ:             /* <= */
        case T_GEQ:             /* >= */
                if (rhs->type != VEX_INT)
                        WRONG("Wrong RHS type for vxid");
                /* FALLTHROUGH */
        default:
                break;
        }

        /* Compare */
        switch (vex->tok) {
#define VXID_TEST_NUMOP(OP) return (trans->vxid OP rhs->val_int)
        case T_EQ:      VXID_TEST_NUMOP(==);
        case T_NEQ:     VXID_TEST_NUMOP(!=);
        case '<':       VXID_TEST_NUMOP(<);
        case '>':       VXID_TEST_NUMOP(>);
        case T_LEQ:     VXID_TEST_NUMOP(<=);
        case T_GEQ:     VXID_TEST_NUMOP(>=);
        #undef VXID_TEST_NUMOP
        default:        WRONG("Bad vxid expression token");
        }

        NEEDLESS(return (0));
}

static int
vslq_test_rec(const struct vex *vex, const struct VSLC_ptr *rec)
{
        const struct vex_rhs *rhs;
        long long lhs_int = 0;
        double lhs_float = 0.;
        const char *b, *e;
        int i, dq;
        char *q = NULL;

        AN(vex);
        AN(rec);

        b = VSL_CDATA(rec->ptr);
        e = b + VSL_LEN(rec->ptr) - 1;

        /* Prefix */
        if (vex->lhs->prefix != NULL) {
                if (strncasecmp(b, vex->lhs->prefix, vex->lhs->prefixlen))
                        return (0);
                if (b[vex->lhs->prefixlen] != ':')
                        return (0);
                b += vex->lhs->prefixlen + 1;
                /* Skip ws */
                while (*b && isspace(*b))
                        b++;
        }

        /* Field */
        if (vex->lhs->field > 0) {
                for (e = b, i = 0, dq = 0; *e && i < vex->lhs->field; i++) {
                        /* Skip end of previous field */
                        if (dq) {
                                assert(e > b);
                                assert(*e == '"');
                                dq = 0;
                                e++;
                                if (*e == '\0')
                                        break;
                                if (!isspace(*e))
                                        return (0);
                        }

                        b = e;
                        /* Skip ws */
                        while (*b && isspace(*b))
                                b++;

                        dq = (*b == '"');
                        if (dq)
                                b++;
                        e = b;

                        if (dq) {
                                /* Find end of string */
                                while (*e && *e != '"')
                                        e++;
                                if (*e != '"')
                                        return (0);
                        } else {
                                /* Skip non-ws */
                                while (*e && !isspace(*e))
                                        e++;
                        }
                }
                assert(b <= e);
                if (*b == '\0' || i < vex->lhs->field)
                        /* Missing field - no match */
                        return (0);
        }

        if (vex->tok == T_TRUE)
                /* Always true */
                return (1);

        rhs = vex->rhs;
        CHECK_OBJ_NOTNULL(rhs, VEX_RHS_MAGIC);

        /* Prepare */
        switch (vex->tok) {
        case T_EQ:              /* == */
        case T_NEQ:             /* != */
        case '<':
        case '>':
        case T_LEQ:             /* <= */
        case T_GEQ:             /* >= */
                /* Numerical comparison */
                if (*b == '\0')
                        /* Empty string doesn't match */
                        return (0);
                errno = 0;
                switch (rhs->type) {
                case VEX_INT:
                        lhs_int = strtoll(b, &q, 0);
                        AN(q);
                        if (q != e && (*q == '.' || *q == 'e')) {
                                errno = 0;
                                lhs_float = strtod(b, &q);
                                lhs_int = (long long)lhs_float;
                                lhs_float = 0.;
                        }
                        break;
                case VEX_FLOAT:
                        lhs_float = strtod(b, &q);
                        break;
                default:
                        WRONG("Wrong RHS type");
                }
                if (q != e || errno != 0)
                        return (0);
                break;
        default:
                break;
        }

        /* Compare */
        switch (vex->tok) {
        case T_EQ:              /* == */
                VSLQ_TEST_NUMOP(rhs->type, lhs, ==, rhs->val);
        case T_NEQ:             /* != */
                VSLQ_TEST_NUMOP(rhs->type, lhs, !=, rhs->val);
        case '<':               /* < */
                VSLQ_TEST_NUMOP(rhs->type, lhs, <, rhs->val);
        case '>':
                VSLQ_TEST_NUMOP(rhs->type, lhs, >, rhs->val);
        case T_LEQ:             /* <= */
                VSLQ_TEST_NUMOP(rhs->type, lhs, <=, rhs->val);
        case T_GEQ:             /* >= */
                VSLQ_TEST_NUMOP(rhs->type, lhs, >=, rhs->val);
        case T_SEQ:             /* eq */
                assert(rhs->type == VEX_STRING);
                if (e - b != rhs->val_stringlen)
                        return (0);
                if (vex->options & VEX_OPT_CASELESS) {
                        if (strncasecmp(b, rhs->val_string, e - b))
                                return (0);
                } else {
                        if (strncmp(b, rhs->val_string, e - b))
                                return (0);
                }
                return (1);
        case T_SNEQ:            /* ne */
                assert(rhs->type == VEX_STRING);
                if (e - b != rhs->val_stringlen)
                        return (1);
                if (vex->options & VEX_OPT_CASELESS) {
                        if (strncasecmp(b, rhs->val_string, e - b))
                                return (1);
                } else {
                        if (strncmp(b, rhs->val_string, e - b))
                                return (1);
                }
                return (0);
        case '~':               /* ~ */
                assert(rhs->type == VEX_REGEX && rhs->val_regex != NULL);
                i = VRE_match(rhs->val_regex, b, e - b, 0, NULL);
                if (i != VRE_ERROR_NOMATCH)
                        return (1);
                return (0);
        case T_NOMATCH:         /* !~ */
                assert(rhs->type == VEX_REGEX && rhs->val_regex != NULL);
                i = VRE_match(rhs->val_regex, b, e - b, 0, NULL);
                if (i == VRE_ERROR_NOMATCH)
                        return (1);
                return (0);
        default:
                WRONG("Bad expression token");
        }
        NEEDLESS(return (0));
}

static int
vslq_test(const struct vex *vex, struct VSL_transaction * const ptrans[])
{
        struct VSL_transaction *t;
        int i;

        CHECK_OBJ_NOTNULL(vex, VEX_MAGIC);
        CHECK_OBJ_NOTNULL(vex->lhs, VEX_LHS_MAGIC);
        AN(vex->lhs->tags);
        assert(vex->lhs->vxid <= 1);

        if (vex->lhs->vxid) {
                AZ(vex->lhs->taglist);
                for (t = ptrans[0]; t != NULL; t = *++ptrans)
                        if (vslq_test_vxid(vex, t))
                                return (1);
                return (0);
        }

        AN(vex->lhs->taglist);

        for (t = ptrans[0]; t != NULL; t = *++ptrans) {
                if (vex->lhs->level >= 0) {
                        if (vex->lhs->level_pm < 0) {
                                /* OK if less than or equal */
                                if (t->level > vex->lhs->level)
                                        continue;
                        } else if (vex->lhs->level_pm > 0) {
                                /* OK if greater than or equal */
                                if (t->level < vex->lhs->level)
                                        continue;
                        } else {
                                /* OK if equal */
                                if (t->level != vex->lhs->level)
                                        continue;
                        }
                }

                AZ(VSL_ResetCursor(t->c));
                while (1) {
                        i = VSL_Next(t->c);
                        if (i < 0)
                                return (i);
                        if (i == 0)
                                break;
                        assert(i == 1);
                        AN(t->c->rec.ptr);

                        if (!vbit_test(vex->lhs->tags, VSL_TAG(t->c->rec.ptr)))
                                continue;

                        i = vslq_test_rec(vex, &t->c->rec);
                        if (i)
                                return (i);
                }
        }

        return (0);
}

static int
vslq_exec(const struct vex *vex, struct VSL_transaction * const ptrans[])
{
        int r;

        CHECK_OBJ_NOTNULL(vex, VEX_MAGIC);

        switch (vex->tok) {
        case T_OR:
                AN(vex->a);
                AN(vex->b);
                r = vslq_exec(vex->a, ptrans);
                if (r != 0)
                        return (r);
                return (vslq_exec(vex->b, ptrans));
        case T_AND:
                AN(vex->a);
                AN(vex->b);
                r = vslq_exec(vex->a, ptrans);
                if (r <= 0)
                        return (r);
                return (vslq_exec(vex->b, ptrans));
        case T_NOT:
                AN(vex->a);
                AZ(vex->b);
                r = vslq_exec(vex->a, ptrans);
                if (r < 0)
                        return (r);
                return (!r);
        default:
                return (vslq_test(vex, ptrans));
        }
        NEEDLESS(return (0));
}

struct vslq_query *
vslq_newquery(struct VSL_data *vsl, enum VSL_grouping_e grouping,
    const char *querystring)
{
        struct vsb *vsb;
        struct vex *vex;
        struct vslq_query *query = NULL;

        (void)grouping;
        AN(querystring);

        vsb = VSB_new_auto();
        AN(vsb);
        vex = vex_New(querystring, vsb, vsl->C_opt ? VEX_OPT_CASELESS : 0);
        AZ(VSB_finish(vsb));
        if (vex == NULL)
                vsl_diag(vsl, "%s", VSB_data(vsb));
        else {
                ALLOC_OBJ(query, VSLQ_QUERY_MAGIC);
                XXXAN(query);
                query->vex = vex;
        }
        VSB_destroy(&vsb);
        return (query);
}

void
vslq_deletequery(struct vslq_query **pquery)
{
        struct vslq_query *query;

        TAKE_OBJ_NOTNULL(query, pquery, VSLQ_QUERY_MAGIC);

        AN(query->vex);
        vex_Free(&query->vex);
        AZ(query->vex);

        FREE_OBJ(query);
}

int
vslq_runquery(const struct vslq_query *query,
    struct VSL_transaction * const ptrans[])
{
        struct VSL_transaction *t;
        int r;

        CHECK_OBJ_NOTNULL(query, VSLQ_QUERY_MAGIC);

        r = vslq_exec(query->vex, ptrans);
        for (t = ptrans[0]; t != NULL; t = *++ptrans)
                AZ(VSL_ResetCursor(t->c));
        return (r);
}

		varnish-cache/lib/libvarnishapi/vsl_query.c
0		/*-
1		* Copyright (c) 2006 Verdens Gang AS
2		* Copyright (c) 2006-2015 Varnish Software AS
3		* All rights reserved.
4		*
5		* Author: Martin Blix Grydeland <martin@varnish-software.com>
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		#include "config.h"
33
34		#include <ctype.h>
35		#include <math.h>
36		#include <stdio.h>
37
38		#include "vdef.h"
39		#include "vas.h"
40		#include "miniobj.h"
41
42		#include "vbm.h"
43		#include "vqueue.h"
44		#include "vre.h"
45		#include "vsb.h"
46
47		#include "vapi/vsl.h"
48
49		#include "vsl_api.h"
50		#include "vxp.h"
51
52		struct vslq_query {
53		unsigned magic;
54		#define VSLQ_QUERY_MAGIC 0x122322A5
55
56		struct vex *vex;
57		};
58
59		#define VSLQ_TEST_NUMOP(TYPE, PRE_LHS, OP, PRE_RHS) \
60		do { \
61		switch (TYPE) { \
62		case VEX_INT: \
63		if (PRE_LHS##_int OP PRE_RHS##_int) \
64		return (1); \
65		return (0); \
66		case VEX_FLOAT: \
67		if (PRE_LHS##_float OP PRE_RHS##_float) \
68		return (1); \
69		return (0); \
70		default: \
71		WRONG("Wrong RHS type"); \
72		} \
73		} while(0) \
74
75		static int
76	8176	vslq_test_vxid(const struct vex vex, const struct VSL_transaction trans)
77		{
78		const struct vex_rhs *rhs;
79
80	8176	AN(vex);
81	8176	AN(trans);
82
83	8176	rhs = vex->rhs;
84	8176	CHECK_OBJ_NOTNULL(rhs, VEX_RHS_MAGIC);
85
86		/* Prepare */
87	8176	switch (vex->tok) {
88		case T_EQ: /* == */
89		case T_NEQ: /* != */
90		case '<':
91		case '>':
92		case T_LEQ: /* <= */
93		case T_GEQ: /* >= */
94	8176	if (rhs->type != VEX_INT)
95	0	WRONG("Wrong RHS type for vxid");
96		/* FALLTHROUGH */
97		default:
98	8176	break;
99		}
100
101		/* Compare */
102	8176	switch (vex->tok) {
103		#define VXID_TEST_NUMOP(OP) return (trans->vxid OP rhs->val_int)
104	8176	case T_EQ: VXID_TEST_NUMOP(==);
105	0	case T_NEQ: VXID_TEST_NUMOP(!=);
106	0	case '<': VXID_TEST_NUMOP(<);
107	0	case '>': VXID_TEST_NUMOP(>);
108	0	case T_LEQ: VXID_TEST_NUMOP(<=);
109	0	case T_GEQ: VXID_TEST_NUMOP(>=);
110		#undef VXID_TEST_NUMOP
111	0	default: WRONG("Bad vxid expression token");
112	0	}
113
114	0	NEEDLESS(return (0));
115	8176	}
116
117		static int
118	4521	vslq_test_rec(const struct vex vex, const struct VSLC_ptr rec)
119		{
120		const struct vex_rhs *rhs;
121	4521	long long lhs_int = 0;
122	4521	double lhs_float = 0.;
123		const char b, e;
124		int i, dq;
125	4521	char *q = NULL;
126
127	4521	AN(vex);
128	4521	AN(rec);
129
130	4521	b = VSL_CDATA(rec->ptr);
131	4521	e = b + VSL_LEN(rec->ptr) - 1;
132
133		/* Prefix */
134	4521	if (vex->lhs->prefix != NULL) {
135	1130	if (strncasecmp(b, vex->lhs->prefix, vex->lhs->prefixlen))
136	850	return (0);
137	280	if (b[vex->lhs->prefixlen] != ':')
138	0	return (0);
139	280	b += vex->lhs->prefixlen + 1;
140		/* Skip ws */
141	410	while (b && isspace(b))
142	130	b++;
143	280	}
144
145		/* Field */
146	3671	if (vex->lhs->field > 0) {
147	1360	for (e = b, i = 0, dq = 0; *e && i < vex->lhs->field; i++) {
148		/* Skip end of previous field */
149	1090	if (dq) {
150	30	assert(e > b);
151	30	assert(*e == '"');
152	30	dq = 0;
153	30	e++;
154	30	if (*e == '\0')
155	0	break;
156	30	if (!isspace(*e))
157	10	return (0);
158	20	}
159
160	1080	b = e;
161		/* Skip ws */
162	2030	while (b && isspace(b))
163	950	b++;
164
165	1080	dq = (*b == '"');
166	1080	if (dq)
167	110	b++;
168	1080	e = b;
169
170	1080	if (dq) {
171		/* Find end of string */
172	640	while (e && e != '"')
173	530	e++;
174	110	if (*e != '"')
175	10	return (0);
176	100	} else {
177		/* Skip non-ws */
178	6040	while (e && !isspace(e))
179	5070	e++;
180		}
181	1070	}
182	270	assert(b <= e);
183	270	if (*b == '\0' \|\| i < vex->lhs->field)
184		/* Missing field - no match */
185	0	return (0);
186	270	}
187
188	3651	if (vex->tok == T_TRUE)
189		/* Always true */
190	1580	return (1);
191
192	2071	rhs = vex->rhs;
193	2071	CHECK_OBJ_NOTNULL(rhs, VEX_RHS_MAGIC);
194
195		/* Prepare */
196	2071	switch (vex->tok) {
197		case T_EQ: /* == */
198		case T_NEQ: /* != */
199		case '<':
200		case '>':
201		case T_LEQ: /* <= */
202		case T_GEQ: /* >= */
203		/* Numerical comparison */
204	760	if (*b == '\0')
205		/* Empty string doesn't match */
206	0	return (0);
207	760	errno = 0;
208	760	switch (rhs->type) {
209		case VEX_INT:
210	580	lhs_int = strtoll(b, &q, 0);
211	580	AN(q);
212	580	if (q != e && (q == '.' \|\| q == 'e')) {
213	50	errno = 0;
214	50	lhs_float = strtod(b, &q);
215	50	lhs_int = (long long)lhs_float;
216	50	lhs_float = 0.;
217	50	}
218	580	break;
219		case VEX_FLOAT:
220	180	lhs_float = strtod(b, &q);
221	180	break;
222		default:
223	0	WRONG("Wrong RHS type");
224	0	}
225	760	if (q != e \|\| errno != 0)
226	90	return (0);
227	670	break;
228		default:
229	1311	break;
230		}
231
232		/* Compare */
233	1981	switch (vex->tok) {
234		case T_EQ: /* == */
235	510	VSLQ_TEST_NUMOP(rhs->type, lhs, ==, rhs->val);
236		case T_NEQ: /* != */
237	20	VSLQ_TEST_NUMOP(rhs->type, lhs, !=, rhs->val);
238		case '<': /* < */
239	50	VSLQ_TEST_NUMOP(rhs->type, lhs, <, rhs->val);
240		case '>':
241	30	VSLQ_TEST_NUMOP(rhs->type, lhs, >, rhs->val);
242		case T_LEQ: /* <= */
243	30	VSLQ_TEST_NUMOP(rhs->type, lhs, <=, rhs->val);
244		case T_GEQ: /* >= */
245	30	VSLQ_TEST_NUMOP(rhs->type, lhs, >=, rhs->val);
246		case T_SEQ: /* eq */
247	280	assert(rhs->type == VEX_STRING);
248	280	if (e - b != rhs->val_stringlen)
249	140	return (0);
250	140	if (vex->options & VEX_OPT_CASELESS) {
251	0	if (strncasecmp(b, rhs->val_string, e - b))
252	0	return (0);
253	0	} else {
254	140	if (strncmp(b, rhs->val_string, e - b))
255	10	return (0);
256		}
257	130	return (1);
258		case T_SNEQ: /* ne */
259	10	assert(rhs->type == VEX_STRING);
260	10	if (e - b != rhs->val_stringlen)
261	0	return (1);
262	10	if (vex->options & VEX_OPT_CASELESS) {
263	0	if (strncasecmp(b, rhs->val_string, e - b))
264	0	return (1);
265	0	} else {
266	10	if (strncmp(b, rhs->val_string, e - b))
267	10	return (1);
268		}
269	0	return (0);
270		case '~': /* ~ */
271	1011	assert(rhs->type == VEX_REGEX && rhs->val_regex != NULL);
272	1011	i = VRE_match(rhs->val_regex, b, e - b, 0, NULL);
273	1011	if (i != VRE_ERROR_NOMATCH)
274	560	return (1);
275	451	return (0);
276		case T_NOMATCH: /* !~ */
277	10	assert(rhs->type == VEX_REGEX && rhs->val_regex != NULL);
278	10	i = VRE_match(rhs->val_regex, b, e - b, 0, NULL);
279	10	if (i == VRE_ERROR_NOMATCH)
280	10	return (1);
281	0	return (0);
282		default:
283	0	WRONG("Bad expression token");
284	0	}
285	0	NEEDLESS(return (0));
286	4521	}
287
288		static int
289	28008	vslq_test(const struct vex vex, struct VSL_transaction const ptrans[])
290		{
291		struct VSL_transaction *t;
292		int i;
293
294	28008	CHECK_OBJ_NOTNULL(vex, VEX_MAGIC);
295	28008	CHECK_OBJ_NOTNULL(vex->lhs, VEX_LHS_MAGIC);
296	28008	AN(vex->lhs->tags);
297	28008	assert(vex->lhs->vxid <= 1);
298
299	28008	if (vex->lhs->vxid) {
300	8176	AZ(vex->lhs->taglist);
301	15352	for (t = ptrans[0]; t != NULL; t = *++ptrans)
302	8176	if (vslq_test_vxid(vex, t))
303	1000	return (1);
304	7176	return (0);
305		}
306
307	19832	AN(vex->lhs->taglist);
308
309	37173	for (t = ptrans[0]; t != NULL; t = *++ptrans) {
310	20091	if (vex->lhs->level >= 0) {
311	30	if (vex->lhs->level_pm < 0) {
312		/* OK if less than or equal */
313	10	if (t->level > vex->lhs->level)
314	0	continue;
315	30	} else if (vex->lhs->level_pm > 0) {
316		/* OK if greater than or equal */
317	10	if (t->level < vex->lhs->level)
318	0	continue;
319	10	} else {
320		/* OK if equal */
321	10	if (t->level != vex->lhs->level)
322	0	continue;
323		}
324	30	}
325
326	20091	AZ(VSL_ResetCursor(t->c));
327	21862	while (1) {
328	184420	i = VSL_Next(t->c);
329	184420	if (i < 0)
330	0	return (i);
331	184420	if (i == 0)
332	17341	break;
333	167079	assert(i == 1);
334	167079	AN(t->c->rec.ptr);
335
336	167079	if (!vbit_test(vex->lhs->tags, VSL_TAG(t->c->rec.ptr)))
337	162558	continue;
338
339	4521	i = vslq_test_rec(vex, &t->c->rec);
340	4521	if (i)
341	2750	return (i);
342		}
343	17341	}
344
345	17082	return (0);
346	28008	}
347
348		static int
349	28466	vslq_exec(const struct vex vex, struct VSL_transaction const ptrans[])
350		{
351		int r;
352
353	28466	CHECK_OBJ_NOTNULL(vex, VEX_MAGIC);
354
355	28466	switch (vex->tok) {
356		case T_OR:
357	300	AN(vex->a);
358	300	AN(vex->b);
359	300	r = vslq_exec(vex->a, ptrans);
360	300	if (r != 0)
361	90	return (r);
362	210	return (vslq_exec(vex->b, ptrans));
363		case T_AND:
364	150	AN(vex->a);
365	150	AN(vex->b);
366	150	r = vslq_exec(vex->a, ptrans);
367	150	if (r <= 0)
368	70	return (r);
369	80	return (vslq_exec(vex->b, ptrans));
370		case T_NOT:
371	10	AN(vex->a);
372	10	AZ(vex->b);
373	10	r = vslq_exec(vex->a, ptrans);
374	10	if (r < 0)
375	0	return (r);
376	10	return (!r);
377		default:
378	28006	return (vslq_test(vex, ptrans));
379		}
380		NEEDLESS(return (0));
381	28466	}
382
383		struct vslq_query *
384	1870	vslq_newquery(struct VSL_data *vsl, enum VSL_grouping_e grouping,
385		const char *querystring)
386		{
387		struct vsb *vsb;
388		struct vex *vex;
389	1870	struct vslq_query *query = NULL;
390
391	1870	(void)grouping;
392	1870	AN(querystring);
393
394	1870	vsb = VSB_new_auto();
395	1870	AN(vsb);
396	1870	vex = vex_New(querystring, vsb, vsl->C_opt ? VEX_OPT_CASELESS : 0);
397	1870	AZ(VSB_finish(vsb));
398	1870	if (vex == NULL)
399	320	vsl_diag(vsl, "%s", VSB_data(vsb));
400		else {
401	1550	ALLOC_OBJ(query, VSLQ_QUERY_MAGIC);
402	1550	XXXAN(query);
403	1550	query->vex = vex;
404		}
405	1870	VSB_destroy(&vsb);
406	1870	return (query);
407		}
408
409		void
410	1550	vslq_deletequery(struct vslq_query **pquery)
411		{
412		struct vslq_query *query;
413
414	1550	TAKE_OBJ_NOTNULL(query, pquery, VSLQ_QUERY_MAGIC);
415
416	1550	AN(query->vex);
417	1550	vex_Free(&query->vex);
418	1550	AZ(query->vex);
419
420	1550	FREE_OBJ(query);
421	1550	}
422
423		int
424	27717	vslq_runquery(const struct vslq_query *query,
425		struct VSL_transaction * const ptrans[])
426		{
427		struct VSL_transaction *t;
428		int r;
429
430	27717	CHECK_OBJ_NOTNULL(query, VSLQ_QUERY_MAGIC);
431
432	27717	r = vslq_exec(query->vex, ptrans);
433	55830	for (t = ptrans[0]; t != NULL; t = *++ptrans)
434	28113	AZ(VSL_ResetCursor(t->c));
435	27717	return (r);
436		}