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
|
/* bytecode.h -- bytecode definition
*/
/***********************************************************
Copyright 1999 by Carnegie Mellon University
All Rights Reserved
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose and without fee is hereby granted,
provided that the above copyright notice appear in all copies and that
both that copyright notice and this permission notice appear in
supporting documentation, and that the name of Carnegie Mellon
University not be used in advertising or publicity pertaining to
distribution of the software without specific, written prior
permission.
CARNEGIE MELLON UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO
THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS, IN NO EVENT SHALL CARNEGIE MELLON UNIVERSITY BE LIABLE FOR
ANY SPECIAL, 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.
*****************************************************************/
#ifndef SIEVE_BYTECODE_H
#define SIEVE_BYTECODE_H
/* for debugging*/
#define DUMPCODE 0
#define VERBOSE 0
/*for finding correctly aligned bytes on strings*/
/* bump to the next multiple of 4 bytes */
#define ROUNDUP(num) (((num) + 3) & 0xFFFFFFFC)
/* yes, lots of these are superfluous, it's for clarity */
typedef union
{
int op; /* OPTYPE */
int value;
int jump;
int listlen;
/* store strings (need 2 consecutive bytecodes) */
int len;
char *str;
} bytecode_t;
/* For sanity during input on 64-bit platforms.
* str should only be accessed as (char *)&str, but given the use of
* unwrap_string, this should be OK */
typedef union
{
int op; /* OPTYPE */
int value;
int jump;
int listlen;
/* store strings (need 2 consecutive bytecodes) */
int len;
int str;
} bytecode_input_t;
/*version 0x01 scripts were written in host byte order.
we don't want to use this version number again and cause a mess
this isn't a huge concern, since this is version ntohl(1), or 16777216*/
#define BYTECODE_VERSION 0x03
#define BYTECODE_MAGIC "CyrSBytecode"
#define BYTECODE_MAGIC_LEN 12 /* Should be multiple of 4 */
/* IMPORTANT: To maintain forward compatibility of bytecode, please only add
* new instructions to the end of these enums. (The reason these values
* are all duplicated here is to avoid silliness if this caveat is forgotten
* about in the other tables.) */
enum bytecode {
B_STOP,
B_KEEP,
B_DISCARD,
B_REJECT,/* require reject*/
B_FILEINTO,/*require fileinto*/
B_REDIRECT,
B_IF,
B_MARK,/* require imapflags */
B_UNMARK,/* require imapflags */
B_ADDFLAG,/* require imapflags */
B_SETFLAG,/* require imapflags */
B_REMOVEFLAG,/* require imapflags */
B_NOTIFY,/* require notify */
B_DENOTIFY,/* require notify */
B_VACATION,/* require vacation*/
B_NULL,
B_JUMP
};
enum bytecode_comps {
BC_FALSE,
BC_TRUE,
BC_NOT,
BC_EXISTS,
BC_SIZE,
BC_ANYOF,
BC_ALLOF,
BC_ADDRESS,
BC_ENVELOPE, /* require envelope*/
BC_HEADER
};
/* currently one enum so as to help determine where values are being misused.
* we have left placeholders incase we need to add more later to the middle */
enum bytecode_tags {
/* Sizes */
B_OVER,
B_UNDER,
B_SIZE_PLACEHOLDER_1,
B_SIZE_PLACEHOLDER_2,
/* sizes, pt 2 */
B_GT, /* require relational*/
B_GE, /* require relational*/
B_LT, /* require relational*/
B_LE, /* require relational*/
B_EQ, /* require relational*/
B_NE, /* require relational*/
B_RELATIONAL_PLACEHOLDER_1,
B_RELATIONAL_PLACEHOLDER_2,
/* priorities */
B_LOW,
B_NORMAL,
B_HIGH,
B_ANY,
B_PRIORITY_PLACEHOLDER_1,
B_PRIORITY_PLACEHOLDER_2,
B_PRIORITY_PLACEHOLDER_3,
B_PRIORITY_PLACEHOLDER_4,
/* Address Part Tags */
B_ALL,
B_LOCALPART,
B_DOMAIN,
B_USER, /* require subaddress */
B_DETAIL, /* require subaddress */
B_ADDRESS_PLACEHOLDER_1,
B_ADDRESS_PLACEHOLDER_2,
B_ADDRESS_PLACEHOLDER_3,
B_ADDRESS_PLACEHOLDER_4,
/* Comparators */
B_ASCIICASEMAP,
B_OCTET,
B_ASCIINUMERIC, /* require comparator-i;ascii-numeric */
B_COMPARATOR_PLACEHOLDER_1,
B_COMPARATOR_PLACEHOLDER_2,
B_COMPARATOR_PLACEHOLDER_3,
B_COMPARATOR_PLACEHOLDER_4,
/* match types */
B_IS,
B_CONTAINS,
B_MATCHES,
B_REGEX,/* require regex*/
B_COUNT,/* require relational*/
B_VALUE,/* require relational*/
B_MATCH_PLACEHOLDER_1,
B_MATCH_PLACEHOLDER_2,
B_MATCH_PLACEHOLDER_3,
B_MATCH_PLACEHOLDER_4
};
#endif
|
