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
|
/* Copyright (C) 2022 CZ.NIC, z.s.p.o. <knot-dns@labs.nic.cz>
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "utils/common/token.h"
#include "utils/common/msg.h"
#include "libknot/libknot.h"
#include "contrib/ctype.h"
int tok_scan(const char* lp, const char **tbl, int *lpm)
{
if (lp == NULL || tbl == NULL || *tbl == NULL || lpm == NULL) {
DBG_NULL;
return -1;
}
const char *prefix = lp; /* Ptr to line start. */
int i = 0, pl = 1; /* Match index, prefix length. */
unsigned char len = 0; /* Read length. */
for(;;) {
const char *tok = tbl[i];
if (*lp == '\0' || is_space(*lp)) {
if (tok && TOK_L(tok) == len) { /* Consumed whole w? */
return i; /* Identifier */
} else { /* Word is shorter than cmd? */
break;
}
}
/* Find next prefix match. */
++len;
while (tok) {
if (TOK_L(tok) >= len) { /* Is prefix of current token */
if (*lp < tok[pl]) { /* Terminate early. */
tok = NULL;
break; /* No match could be found. */
}
if (*lp == tok[pl]) { /* Match */
if(lpm) *lpm = i;
++pl;
break;
}
}
/* No early cut, no match - seek next. */
while ((tok = tbl[++i]) != NULL) {
if (TOK_L(tok) >= len &&
memcmp(TOK_S(tok), prefix, len) == 0) {
break;
}
}
}
if (tok == NULL) {
break; /* All tokens exhausted. */
} else {
++lp; /* Next char */
}
}
return -1;
}
int tok_find(const char *lp, const char **tbl)
{
if (lp == NULL || tbl == NULL || *tbl == NULL) {
DBG_NULL;
return KNOT_EINVAL;
}
int lpm = -1;
int bp = 0;
if ((bp = tok_scan(lp, tbl, &lpm)) < 0) {
if (lpm > -1) {
ERR("unexpected literal: '%s', did you mean '%s' ?",
lp, TOK_S(tbl[lpm]));
} else {
ERR("unexpected literal: '%s'", lp);
}
return KNOT_EPARSEFAIL;
}
return bp;
}
const char *tok_skipspace(const char *lp)
{
if (lp == NULL) {
DBG_NULL;
return NULL;
}
while (is_space(*lp)) {
lp += 1;
}
return lp;
}
|
