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