2 * Copyright (c) 1990, 1991, 1992, 1993, 1994, 1995, 1996
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that: (1) source code distributions
7 * retain the above copyright notice and this paragraph in its entirety, (2)
8 * distributions including binary code include the above copyright notice and
9 * this paragraph in its entirety in the documentation or other materials
10 * provided with the distribution, and (3) all advertising materials mentioning
11 * features or use of this software display the following acknowledgement:
12 * ``This product includes software developed by the University of California,
13 * Lawrence Berkeley Laboratory and its contributors.'' Neither the name of
14 * the University nor the names of its contributors may be used to endorse
15 * or promote products derived from this software without specific prior
17 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
18 * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
19 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
22 * @(#) $Header: /tcpdump/master/libpcap/gencode.h,v 1.70.2.1 2007/11/18 02:04:55 guy Exp $ (LBL)
28 * Copyright (c) 1997 Yen Yen Lim and North Dakota State University
29 * All rights reserved.
31 * Redistribution and use in source and binary forms, with or without
32 * modification, are permitted provided that the following conditions
34 * 1. Redistributions of source code must retain the above copyright
35 * notice, this list of conditions and the following disclaimer.
36 * 2. Redistributions in binary form must reproduce the above copyright
37 * notice, this list of conditions and the following disclaimer in the
38 * documentation and/or other materials provided with the distribution.
39 * 3. All advertising materials mentioning features or use of this software
40 * must display the following acknowledgement:
41 * This product includes software developed by Yen Yen Lim and
42 * North Dakota State University
43 * 4. The name of the author may not be used to endorse or promote products
44 * derived from this software without specific prior written permission.
46 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
47 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
48 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
49 * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
50 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
51 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
52 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
53 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
54 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
55 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
56 * POSSIBILITY OF SUCH DAMAGE.
59 #ifndef HAVE___ATTRIBUTE__
60 #define __attribute__(x)
61 #endif /* HAVE___ATTRIBUTE__ */
63 /* Address qualifiers. */
70 #define Q_PROTOCHAIN 6
73 /* Protocol qualifiers. */
120 #define Q_ISIS_IIH 33
121 #define Q_ISIS_LAN_IIH 34
122 #define Q_ISIS_PTP_IIH 35
123 #define Q_ISIS_SNP 36
124 #define Q_ISIS_CSNP 37
125 #define Q_ISIS_PSNP 38
126 #define Q_ISIS_LSP 39
130 /* Directional qualifiers. */
145 #define A_METAC 22 /* Meta signalling Circuit */
146 #define A_BCC 23 /* Broadcast Circuit */
147 #define A_OAMF4SC 24 /* Segment OAM F4 Circuit */
148 #define A_OAMF4EC 25 /* End-to-End OAM F4 Circuit */
149 #define A_SC 26 /* Signalling Circuit*/
150 #define A_ILMIC 27 /* ILMI Circuit */
151 #define A_OAM 28 /* OAM cells : F4 only */
152 #define A_OAMF4 29 /* OAM F4 cells: Segment + End-to-end */
153 #define A_LANE 30 /* LANE traffic */
154 #define A_LLC 31 /* LLC-encapsulated traffic */
156 /* Based on Q.2931 signalling protocol */
157 #define A_SETUP 41 /* Setup message */
158 #define A_CALLPROCEED 42 /* Call proceeding message */
159 #define A_CONNECT 43 /* Connect message */
160 #define A_CONNECTACK 44 /* Connect Ack message */
161 #define A_RELEASE 45 /* Release message */
162 #define A_RELEASE_DONE 46 /* Release message */
164 /* ATM field types */
167 #define A_PROTOTYPE 53
169 #define A_CALLREFTYPE 55
171 #define A_CONNECTMSG 70 /* returns Q.2931 signalling messages for
172 establishing and destroying switched
173 virtual connection */
174 #define A_METACONNECT 71 /* returns Q.2931 signalling messages for
175 establishing and destroying predefined
176 virtual circuits, such as broadcast
177 circuit, oamf4 segment circuit, oamf4
178 end-to-end circuits, ILMI circuits or
179 connection signalling circuit. */
182 #define M_FISU 22 /* FISU */
183 #define M_LSSU 23 /* LSSU */
184 #define M_MSU 24 /* MSU */
186 /* MTP3 field types */
197 struct slist *jt; /*only for relative jump in block*/
198 struct slist *jf; /*only for relative jump in block*/
208 * A bit vector to represent definition sets. We assume TOT_REGISTERS
209 * is smaller than 8*sizeof(atomset).
211 typedef bpf_u_int32 atomset;
212 #define ATOMMASK(n) (1 << (n))
213 #define ATOMELEM(d, n) (d & ATOMMASK(n))
218 typedef bpf_u_int32 *uset;
221 * Total number of atomic entities, including accumulator (A) and index (X).
222 * We treat all these guys similarly during flow analysis.
224 #define N_ATOMS (BPF_MEMWORDS+2)
232 struct edge *next; /* link list of incoming edges for a node */
237 struct slist *stmts; /* side effect stmts */
238 struct stmt s; /* branch stmt */
240 int longjt; /* jt branch requires long jump */
241 int longjf; /* jf branch requires long jump */
248 struct block *link; /* link field used by optimizer */
251 struct edge *in_edges;
260 struct block *b; /* protocol checks */
261 struct slist *s; /* stmt list */
262 int regno; /* virtual register number of result */
272 struct arth *gen_loadi(int);
273 struct arth *gen_load(int, struct arth *, int);
274 struct arth *gen_loadlen(void);
275 struct arth *gen_neg(struct arth *);
276 struct arth *gen_arth(int, struct arth *, struct arth *);
278 void gen_and(struct block *, struct block *);
279 void gen_or(struct block *, struct block *);
280 void gen_not(struct block *);
282 struct block *gen_scode(const char *, struct qual);
283 struct block *gen_ecode(const u_char *, struct qual);
284 struct block *gen_acode(const u_char *, struct qual);
285 struct block *gen_mcode(const char *, const char *, int, struct qual);
287 struct block *gen_mcode6(const char *, const char *, int, struct qual);
289 struct block *gen_ncode(const char *, bpf_u_int32, struct qual);
290 struct block *gen_proto_abbrev(int);
291 struct block *gen_relation(int, struct arth *, struct arth *, int);
292 struct block *gen_less(int);
293 struct block *gen_greater(int);
294 struct block *gen_byteop(int, int, int);
295 struct block *gen_broadcast(int);
296 struct block *gen_multicast(int);
297 struct block *gen_inbound(int);
299 struct block *gen_vlan(int);
300 struct block *gen_mpls(int);
302 struct block *gen_pppoed(void);
303 struct block *gen_pppoes(void);
305 struct block *gen_atmfield_code(int atmfield, bpf_int32 jvalue, bpf_u_int32 jtype, int reverse);
306 struct block *gen_atmtype_abbrev(int type);
307 struct block *gen_atmmulti_abbrev(int type);
309 struct block *gen_mtp2type_abbrev(int type);
310 struct block *gen_mtp3field_code(int mtp3field, bpf_u_int32 jvalue, bpf_u_int32 jtype, int reverse);
312 struct block *gen_pf_ifname(const char *);
313 struct block *gen_pf_rnr(int);
314 struct block *gen_pf_srnr(int);
315 struct block *gen_pf_ruleset(char *);
316 struct block *gen_pf_reason(int);
317 struct block *gen_pf_action(int);
318 struct block *gen_pf_dir(int);
320 struct block *gen_p80211_type(int, int);
321 struct block *gen_p80211_fcdir(int);
323 void bpf_optimize(struct block **);
324 void bpf_error(const char *, ...)
325 __attribute__((noreturn, format (printf, 1, 2)));
327 void finish_parse(struct block *);
328 char *sdup(const char *);
330 struct bpf_insn *icode_to_fcode(struct block *, int *);
331 int pcap_parse(void);
332 void lex_init(const char *);
333 void lex_cleanup(void);
334 void sappend(struct slist *, struct slist *);
337 #define JT(b) ((b)->et.succ)
338 #define JF(b) ((b)->ef.succ)
340 extern int no_optimize;