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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
* (C) 2012-2013 by Pablo Neira Ayuso <pablo@netfilter.org>
* (C) 2013 by Arturo Borrero Gonzalez <arturo.borrero.glez@gmail.com>
*
* 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 2 of the License, or
* (at your option) any later version.
*
* This code has been sponsored by Sophos Astaro <http://www.sophos.com>
*/
#include "internal.h"
#include "expr_ops.h"
#include <stdint.h>
#include <limits.h>
#include <linux/netfilter/nf_tables.h>
#include <libnftables/rule.h>
#include <libnftables/expr.h>
#ifdef XML_PARSING
struct nft_rule_expr *nft_mxml_expr_parse(mxml_node_t *node)
{
mxml_node_t *tree;
struct nft_rule_expr *e;
const char *expr_name;
char *xml_text;
int ret;
expr_name = mxmlElementGetAttr(node, "type");
if (expr_name == NULL)
goto err;
e = nft_rule_expr_alloc(expr_name);
if (e == NULL)
goto err;
xml_text = mxmlSaveAllocString(node, MXML_NO_CALLBACK);
if (xml_text == NULL)
goto err_expr;
tree = mxmlLoadString(NULL, xml_text, MXML_OPAQUE_CALLBACK);
free(xml_text);
if (tree == NULL)
goto err_expr;
ret = e->ops->xml_parse(e, tree);
mxmlDelete(tree);
return ret < 0 ? NULL : e;
err_expr:
nft_rule_expr_free(e);
err:
mxmlDelete(tree);
errno = EINVAL;
return NULL;
}
int nft_mxml_reg_parse(mxml_node_t *tree, const char *reg_name, uint32_t flags)
{
mxml_node_t *node;
uint64_t val;
node = mxmlFindElement(tree, tree, reg_name, NULL, NULL, flags);
if (node == NULL) {
errno = EINVAL;
goto err;
}
if (nft_strtoi(node->child->value.opaque, BASE_DEC, &val,
NFT_TYPE_U64) != 0)
goto err;
if (val > NFT_REG_MAX) {
errno = ERANGE;
goto err;
}
return val;
err:
return -1;
}
int nft_mxml_data_reg_parse(mxml_node_t *tree, const char *node_name,
union nft_data_reg *data_reg)
{
mxml_node_t *node;
const char *type;
char *tmpstr = NULL;
int ret;
node = mxmlFindElement(tree, tree, node_name, NULL, NULL,
MXML_DESCEND_FIRST);
if (node == NULL || node->child == NULL) {
errno = EINVAL;
goto err;
}
tmpstr = mxmlSaveAllocString(node, MXML_NO_CALLBACK);
if (tmpstr == NULL) {
errno = ENOMEM;
goto err;
}
ret = nft_data_reg_xml_parse(data_reg, tmpstr);
free(tmpstr);
if (ret < 0) {
errno = EINVAL;
goto err;
}
node = mxmlFindElement(node, node, "data_reg", NULL, NULL,
MXML_DESCEND);
if (node == NULL || node->child == NULL) {
errno = EINVAL;
goto err;
}
type = mxmlElementGetAttr(node, "type");
if (type == NULL) {
errno = EINVAL;
goto err;
}
if (strcmp(type, "value") == 0)
return DATA_VALUE;
else if (strcmp(type, "verdict") == 0)
return DATA_VERDICT;
else if (strcmp(type, "chain") == 0)
return DATA_CHAIN;
else
errno = EINVAL;
err:
return -1;
}
int
nft_mxml_num_parse(mxml_node_t *tree, const char *node_name,
uint32_t mxml_flags, int base, void *number,
enum nft_type type)
{
mxml_node_t *node = NULL;
node = mxmlFindElement(tree, tree, node_name, NULL, NULL, mxml_flags);
if (node == NULL || node->child == NULL) {
errno = EINVAL;
return -1;
}
return nft_strtoi(node->child->value.opaque, base, number, type);
}
#endif
|
