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.
25 #include "pcap/funcattrs.h"
27 * pcap/bpf.h (a public header) needs u_char, u_short and u_int, which can be
28 * made available via either pcap-types.h (a private header) or pcap/pcap.h
29 * (a public header), none of which pcap/bpf.h includes. Include the private
30 * header to keep things simple, this way this private header should compile
31 * even if included early from another file.
33 #include "pcap-types.h"
34 #include "pcap/bpf.h" /* bpf_u_int32 and BPF_MEMWORDS */
39 * Copyright (c) 1997 Yen Yen Lim and North Dakota State University
40 * All rights reserved.
42 * Redistribution and use in source and binary forms, with or without
43 * modification, are permitted provided that the following conditions
45 * 1. Redistributions of source code must retain the above copyright
46 * notice, this list of conditions and the following disclaimer.
47 * 2. Redistributions in binary form must reproduce the above copyright
48 * notice, this list of conditions and the following disclaimer in the
49 * documentation and/or other materials provided with the distribution.
50 * 3. All advertising materials mentioning features or use of this software
51 * must display the following acknowledgement:
52 * This product includes software developed by Yen Yen Lim and
53 * North Dakota State University
54 * 4. The name of the author may not be used to endorse or promote products
55 * derived from this software without specific prior written permission.
57 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
58 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
59 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
60 * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT,
61 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
62 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
63 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
64 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
65 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
66 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
67 * POSSIBILITY OF SUCH DAMAGE.
70 /* Address qualifiers. */
77 #define Q_PROTOCHAIN 6
80 /* Protocol qualifiers. */
127 #define Q_ISIS_IIH 33
128 #define Q_ISIS_SNP 34
129 #define Q_ISIS_CSNP 35
130 #define Q_ISIS_PSNP 36
131 #define Q_ISIS_LSP 37
137 /* Directional qualifiers. */
154 #define A_METAC 22 /* Meta signalling Circuit */
155 #define A_BCC 23 /* Broadcast Circuit */
156 #define A_OAMF4SC 24 /* Segment OAM F4 Circuit */
157 #define A_OAMF4EC 25 /* End-to-End OAM F4 Circuit */
158 #define A_SC 26 /* Signalling Circuit*/
159 #define A_ILMIC 27 /* ILMI Circuit */
160 #define A_OAM 28 /* OAM cells : F4 only */
161 #define A_OAMF4 29 /* OAM F4 cells: Segment + End-to-end */
162 #define A_LANE 30 /* LANE traffic */
163 #define A_LLC 31 /* LLC-encapsulated traffic */
165 /* Based on Q.2931 signalling protocol */
166 #define A_SETUP 41 /* Setup message */
167 #define A_CALLPROCEED 42 /* Call proceeding message */
168 #define A_CONNECT 43 /* Connect message */
169 #define A_CONNECTACK 44 /* Connect Ack message */
170 #define A_RELEASE 45 /* Release message */
171 #define A_RELEASE_DONE 46 /* Release message */
173 /* ATM field types */
176 #define A_PROTOTYPE 53
178 #define A_CALLREFTYPE 55
180 #define A_CONNECTMSG 70 /* returns Q.2931 signalling messages for
181 establishing and destroying switched
182 virtual connection */
183 #define A_METACONNECT 71 /* returns Q.2931 signalling messages for
184 establishing and destroying predefined
185 virtual circuits, such as broadcast
186 circuit, oamf4 segment circuit, oamf4
187 end-to-end circuits, ILMI circuits or
188 connection signalling circuit. */
191 #define M_FISU 22 /* FISU */
192 #define M_LSSU 23 /* LSSU */
193 #define M_MSU 24 /* MSU */
196 #define MH_FISU 25 /* FISU for HSL */
197 #define MH_LSSU 26 /* LSSU */
198 #define MH_MSU 27 /* MSU */
200 /* MTP3 field types */
206 /* MTP3 field types in case of MTP2 HSL */
216 * A single statement, corresponding to an instruction in a block.
219 int code; /* opcode */
220 struct slist *jt; /* only for relative jump in block */
221 struct slist *jf; /* only for relative jump in block */
222 bpf_u_int32 k; /* k field */
231 * A bit vector to represent definition sets. We assume TOT_REGISTERS
232 * is smaller than 8*sizeof(atomset).
234 typedef bpf_u_int32 atomset;
235 #define ATOMMASK(n) (1 << (n))
236 #define ATOMELEM(d, n) (d & ATOMMASK(n))
241 typedef bpf_u_int32 *uset;
244 * Total number of atomic entities, including accumulator (A) and index (X).
245 * We treat all these guys similarly during flow analysis.
247 #define N_ATOMS (BPF_MEMWORDS+2)
250 * Control flow graph of a program.
251 * This corresponds to an edge in the CFG.
252 * It's a directed graph, so an edge has a predecessor and a successor.
256 int code; /* opcode for branch corresponding to this edge */
258 struct block *succ; /* successor vertex */
259 struct block *pred; /* predecessor vertex */
260 struct edge *next; /* link list of incoming edges for a node */
264 * A block is a vertex in the CFG.
265 * It has a list of statements, with the final statement being a
266 * branch to successor blocks.
270 struct slist *stmts; /* side effect stmts */
271 struct stmt s; /* branch stmt */
273 u_int longjt; /* jt branch requires long jump */
274 u_int longjf; /* jf branch requires long jump */
278 struct edge et; /* edge corresponding to the jt branch */
279 struct edge ef; /* edge corresponding to the jf branch */
281 struct block *link; /* link field used by optimizer */
284 struct edge *in_edges; /* first edge in the set (linked list) of edges with this as a successor */
288 int oval; /* value ID for value tested in branch stmt */
289 bpf_u_int32 val[N_ATOMS];
293 * A value of 0 for val[i] means the value is unknown.
295 #define VAL_UNKNOWN 0
298 struct block *b; /* protocol checks */
299 struct slist *s; /* stmt list */
300 int regno; /* virtual register number of result */
310 struct _compiler_state;
312 typedef struct _compiler_state compiler_state_t;
314 struct arth *gen_loadi(compiler_state_t *, bpf_u_int32);
315 struct arth *gen_load(compiler_state_t *, int, struct arth *, bpf_u_int32);
316 struct arth *gen_loadlen(compiler_state_t *);
317 struct arth *gen_neg(compiler_state_t *, struct arth *);
318 struct arth *gen_arth(compiler_state_t *, int, struct arth *, struct arth *);
320 void gen_and(struct block *, struct block *);
321 void gen_or(struct block *, struct block *);
322 void gen_not(struct block *);
324 struct block *gen_scode(compiler_state_t *, const char *, struct qual);
325 struct block *gen_ecode(compiler_state_t *, const char *, struct qual);
326 struct block *gen_acode(compiler_state_t *, const char *, struct qual);
327 struct block *gen_mcode(compiler_state_t *, const char *, const char *,
328 bpf_u_int32, struct qual);
330 struct block *gen_mcode6(compiler_state_t *, const char *, const char *,
331 bpf_u_int32, struct qual);
333 struct block *gen_ncode(compiler_state_t *, const char *, bpf_u_int32,
335 struct block *gen_proto_abbrev(compiler_state_t *, int);
336 struct block *gen_relation(compiler_state_t *, int, struct arth *,
338 struct block *gen_less(compiler_state_t *, int);
339 struct block *gen_greater(compiler_state_t *, int);
340 struct block *gen_byteop(compiler_state_t *, int, int, bpf_u_int32);
341 struct block *gen_broadcast(compiler_state_t *, int);
342 struct block *gen_multicast(compiler_state_t *, int);
343 struct block *gen_ifindex(compiler_state_t *, int);
344 struct block *gen_inbound(compiler_state_t *, int);
346 struct block *gen_llc(compiler_state_t *);
347 struct block *gen_llc_i(compiler_state_t *);
348 struct block *gen_llc_s(compiler_state_t *);
349 struct block *gen_llc_u(compiler_state_t *);
350 struct block *gen_llc_s_subtype(compiler_state_t *, bpf_u_int32);
351 struct block *gen_llc_u_subtype(compiler_state_t *, bpf_u_int32);
353 struct block *gen_vlan(compiler_state_t *, bpf_u_int32, int);
354 struct block *gen_mpls(compiler_state_t *, bpf_u_int32, int);
356 struct block *gen_pppoed(compiler_state_t *);
357 struct block *gen_pppoes(compiler_state_t *, bpf_u_int32, int);
359 struct block *gen_geneve(compiler_state_t *, bpf_u_int32, int);
361 struct block *gen_atmfield_code(compiler_state_t *, int, bpf_u_int32,
363 struct block *gen_atmtype_abbrev(compiler_state_t *, int);
364 struct block *gen_atmmulti_abbrev(compiler_state_t *, int);
366 struct block *gen_mtp2type_abbrev(compiler_state_t *, int);
367 struct block *gen_mtp3field_code(compiler_state_t *, int, bpf_u_int32,
370 struct block *gen_pf_ifname(compiler_state_t *, const char *);
371 struct block *gen_pf_rnr(compiler_state_t *, int);
372 struct block *gen_pf_srnr(compiler_state_t *, int);
373 struct block *gen_pf_ruleset(compiler_state_t *, char *);
374 struct block *gen_pf_reason(compiler_state_t *, int);
375 struct block *gen_pf_action(compiler_state_t *, int);
377 struct block *gen_p80211_type(compiler_state_t *, bpf_u_int32, bpf_u_int32);
378 struct block *gen_p80211_fcdir(compiler_state_t *, bpf_u_int32);
381 * Representation of a program as a tree of blocks, plus current mark.
382 * A block is marked if only if its mark equals the current mark.
383 * Rather than traverse the code array, marking each item, 'cur_mark'
384 * is incremented. This automatically makes each element unmarked.
386 #define isMarked(icp, p) ((p)->mark == (icp)->cur_mark)
387 #define unMarkAll(icp) (icp)->cur_mark += 1
388 #define Mark(icp, p) ((p)->mark = (icp)->cur_mark)
395 int bpf_optimize(struct icode *, char *);
396 void bpf_set_error(compiler_state_t *, const char *, ...)
397 PCAP_PRINTFLIKE(2, 3);
399 int finish_parse(compiler_state_t *, struct block *);
400 char *sdup(compiler_state_t *, const char *);
402 struct bpf_insn *icode_to_fcode(struct icode *, struct block *, u_int *,
404 void sappend(struct slist *, struct slist *);
407 * Older versions of Bison don't put this declaration in
410 int pcap_parse(void *, compiler_state_t *);
413 #define JT(b) ((b)->et.succ)
414 #define JF(b) ((b)->ef.succ)
416 #endif /* gencode_h */