-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathjsonpath.cpp
More file actions
135 lines (103 loc) · 2.77 KB
/
jsonpath.cpp
File metadata and controls
135 lines (103 loc) · 2.77 KB
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
/*
* Copyright (C) 2013-2014 Jo-Philipp Wich <jo@mein.io>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <limits.h>
#include "jsonpath.h"
#include "lemon/parser.c"
struct jp_opcode*
jp_append_op(struct jp_opcode *a, struct jp_opcode *b) {
struct jp_opcode *tail = a;
while (tail->sibling)
tail = tail->sibling;
tail->sibling = b;
return a;
}
//---------------------------------------------------------------------------
struct jp_opcode*
jp_alloc_op(struct jp_state *s, int type, int num, char *str, ...) {
va_list ap;
struct jp_opcode *newop, *child;
newop = (jp_opcode*)calloc( 1, sizeof(*newop) );
if (!newop) {
fprintf(stderr, "Out of memory\n");
return NULL;
}
newop->type = type;
newop->num = num;
newop->str = str;
va_start(ap, str);
while ((child = (struct jp_opcode*)va_arg(ap, void*)) != NULL) {
if (!newop->down) {
newop->down = child;
} else {
jp_append_op(newop->down, child);
}
}
va_end(ap);
newop->next = s->pool;
s->pool = newop;
return newop;
}
//---------------------------------------------------------------------------
void
jp_free(struct jp_state *s) {
struct jp_opcode *op, *tmp;
for (op = s->pool; op;) {
tmp = op->next;
if (op->str)
free(op->str);
free(op);
op = tmp;
}
free(s);
}
//---------------------------------------------------------------------------
struct jp_state *
jp_parse(const char *expr) {
struct jp_state *s;
struct jp_opcode *op;
const char *ptr = expr;
void *pParser;
int len = strlen(expr);
int mlen = 0;
s = (jp_state*)calloc(1, sizeof(*s));
if (!s)
return NULL;
pParser = ParseAlloc(malloc);
if (!pParser)
return NULL;
while (len > 0) {
op = jp_get_token(s, ptr, &mlen);
if (mlen < 0)
{
s->error_code = mlen;
goto out;
}
if (op)
Parse(pParser, op->type, op, s);
len -= mlen;
ptr += mlen;
s->off += mlen;
}
Parse(pParser, 0, NULL, s);
out:
ParseFree(pParser, free);
return s;
}
//---------------------------------------------------------------------------