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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
|
/*====================================================================*
*
* Copyright (c) 2013 Qualcomm Atheros, Inc.
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or
* without modification, are permitted (subject to the limitations
* in the disclaimer below) provided that the following conditions
* are met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* * 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.
*
* * Neither the name of Qualcomm Atheros nor the names of
* its contributors may be used to endorse or promote products
* derived from this software without specific prior written
* permission.
*
* NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE
* GRANTED BY THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE
* COPYRIGHT HOLDERS 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 THE COPYRIGHT OWNER
* 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.
*
*--------------------------------------------------------------------*/
/*====================================================================*
*
* signed ParseRule (int * argcp, char const * argvp [], struct rule * rule, struct cspec * cspec);
*
* rules.h
*
* This module takes an argument vector and an argument count
* and fills in a classification rule structure that is suitable for
* sending in a VS_CLASSIFICATION MME;
*
* This module is currently used by plcrule and pibruin;
*
*
* Contributor(s):
* Charles Maier
* Nathaniel Houghton
*
*--------------------------------------------------------------------*/
#include <memory.h>
#include <errno.h>
#include "../tools/memory.h"
#include "../tools/number.h"
#include "../tools/error.h"
#include "../ether/ether.h"
#include "../plc/rules.h"
signed ParseRule (int * argcp, char const ** argvp [], struct MMERule * rule, struct cspec * cspec)
{
int argc = * argcp;
char const ** argv = * argvp;
union
{
uint32_t wide;
uint16_t word;
uint8_t byte [4];
}
temp;
signed code;
struct MMEClassifier * classifier = (struct MMEClassifier *) (& rule->CLASSIFIER);
if ((code = lookup (* argv++, actions, SIZEOF (actions))) == -1)
{
assist (* -- argv, CLASSIFIER_ACTION_NAME, actions, SIZEOF (actions));
}
rule->MACTION = (uint8_t) (code);
argc--;
if ((code = lookup (* argv++, operands, SIZEOF (operands))) == -1)
{
assist (* -- argv, CLASSIFIER_OPERAND_NAME, operands, SIZEOF (operands));
}
rule->MOPERAND = (uint8_t) (code);
argc--;
while ((* argv) && (lookup (* argv, controls, SIZEOF (controls)) == -1))
{
if ((code = lookup (* argv++, fields, SIZEOF (fields))) == -1)
{
assist (* -- argv, CLASSIFIER_FIELD_NAME, fields, SIZEOF (fields));
}
classifier->CR_PID = (uint8_t) (code);
argc--;
if ((code = lookup (* argv++, operators, SIZEOF (operators))) == -1)
{
assist (* -- argv, CLASSIFIER_OPERATOR_NAME, operators, SIZEOF (operators));
}
classifier->CR_OPERAND = (uint8_t) (code);
argc--;
if (! argc || ! * argv)
{
error (1, ENOTSUP, "I have %s '%s' but no value", CLASSIFIER_OPERATOR_NAME, * -- argv);
}
switch (classifier->CR_PID)
{
case FIELD_ETH_SA:
case FIELD_ETH_DA:
bytespec (* argv++, classifier->CR_VALUE, ETHER_ADDR_LEN);
break;
case FIELD_IPV4_SA:
case FIELD_IPV4_DA:
ipv4spec (* argv++, classifier->CR_VALUE);
break;
case FIELD_IPV6_SA:
case FIELD_IPV6_DA:
ipv6spec (* argv++, classifier->CR_VALUE);
break;
case FIELD_VLAN_UP:
case FIELD_IPV6_TC:
case FIELD_IPV4_TOS:
case FIELD_IPV4_PROT:
classifier->CR_VALUE [0] = (uint8_t) (basespec (* argv++, 0, sizeof (classifier->CR_VALUE [0])));
break;
case FIELD_VLAN_ID:
case FIELD_TCP_SP:
case FIELD_TCP_DP:
case FIELD_UDP_SP:
case FIELD_UDP_DP:
case FIELD_IP_SP:
case FIELD_IP_DP:
temp.word = (uint16_t) (basespec (* argv++, 0, sizeof (temp.word)));
temp.word = htons (temp.word);
memcpy (classifier->CR_VALUE, & temp, sizeof (temp.word));
break;
case FIELD_ETH_TYPE:
temp.word = (uint16_t) (basespec (* argv++, 0, sizeof (temp.word)));
temp.word = htons (temp.word);
memcpy (classifier->CR_VALUE, & temp, sizeof (temp.word));
break;
case FIELD_IPV6_FL:
temp.wide = (uint32_t) (basespec (* argv++, 0, sizeof (temp.wide))) & 0x000FFFFF;
temp.wide = htonl (temp.wide);
memcpy (classifier->CR_VALUE, & temp.byte [1], 3);
break;
case FIELD_HPAV_MME:
bytespec (* argv++, classifier->CR_VALUE, sizeof (uint16_t) + sizeof (uint8_t));
temp.byte [0] = classifier->CR_VALUE [1];
classifier->CR_VALUE [1] = classifier->CR_VALUE [2];
classifier->CR_VALUE [2] = temp.byte [0];
break;
case FIELD_TCP_ACK:
if ((code = lookup (* argv++, states, SIZEOF (states))) == -1)
{
assist (* -- argv, CLASSIFIER_STATE_NAME, states, SIZEOF (states));
}
memset (classifier->CR_VALUE, 0, sizeof (classifier->CR_VALUE));
break;
case FIELD_VLAN_TAG:
if ((code = lookup (* argv++, states, SIZEOF (states))) == -1)
{
assist (* -- argv, CLASSIFIER_STATE_NAME, states, SIZEOF (states));
}
memset (classifier->CR_VALUE, 0, sizeof (classifier->CR_VALUE));
classifier->CR_OPERAND ^= code;
break;
default:
error (1, ENOTSUP, "%s", argv [- 2]);
break;
}
rule->NUM_CLASSIFIERS++;
classifier++;
argc--;
}
memcpy (classifier, cspec, sizeof (* cspec));
if ((code = lookup (* argv++, controls, SIZEOF (controls))) == -1)
{
assist (* -- argv, CLASSIFIER_CONTROL_NAME, controls, SIZEOF (controls));
}
rule->MCONTROL = (uint8_t) (code);
argc--;
if ((code = lookup (* argv++, volatilities, SIZEOF (volatilities))) == -1)
{
assist (* -- argv, CLASSIFIER_VOLATILITY_NAME, volatilities, SIZEOF (volatilities));
}
rule->MVOLATILITY = (uint8_t) (code);
argc--;
* argcp = argc;
* argvp = argv;
return (0);
}
|
