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.53 2001/05/10 14:48:02 fenner Exp $ (LBL)
26 /* Address qualifiers. */
33 #define Q_PROTOCHAIN 6
35 /* Protocol qualifiers. */
78 /* Directional qualifiers. */
92 struct slist *jt; /*only for relative jump in block*/
93 struct slist *jf; /*only for relative jump in block*/
103 * A bit vector to represent definition sets. We assume TOT_REGISTERS
104 * is smaller than 8*sizeof(atomset).
106 typedef bpf_u_int32 atomset;
107 #define ATOMMASK(n) (1 << (n))
108 #define ATOMELEM(d, n) (d & ATOMMASK(n))
113 typedef bpf_u_int32 *uset;
116 * Total number of atomic entities, including accumulator (A) and index (X).
117 * We treat all these guys similarly during flow analysis.
119 #define N_ATOMS (BPF_MEMWORDS+2)
127 struct edge *next; /* link list of incoming edges for a node */
132 struct slist *stmts; /* side effect stmts */
133 struct stmt s; /* branch stmt */
135 int longjt; /* jt branch requires long jump */
136 int longjf; /* jf branch requires long jump */
143 struct block *link; /* link field used by optimizer */
146 struct edge *in_edges;
155 struct block *b; /* protocol checks */
156 struct slist *s; /* stmt list */
157 int regno; /* virtual register number of result */
167 struct arth *gen_loadi(int);
168 struct arth *gen_load(int, struct arth *, int);
169 struct arth *gen_loadlen(void);
170 struct arth *gen_neg(struct arth *);
171 struct arth *gen_arth(int, struct arth *, struct arth *);
173 void gen_and(struct block *, struct block *);
174 void gen_or(struct block *, struct block *);
175 void gen_not(struct block *);
177 struct block *gen_scode(const char *, struct qual);
178 struct block *gen_ecode(const u_char *, struct qual);
179 struct block *gen_acode(const u_char *, struct qual);
180 struct block *gen_mcode(const char *, const char *, int, struct qual);
182 struct block *gen_mcode6(const char *, const char *, int, struct qual);
184 struct block *gen_ncode(const char *, bpf_u_int32, struct qual);
185 struct block *gen_proto_abbrev(int);
186 struct block *gen_relation(int, struct arth *, struct arth *, int);
187 struct block *gen_less(int);
188 struct block *gen_greater(int);
189 struct block *gen_byteop(int, int, int);
190 struct block *gen_broadcast(int);
191 struct block *gen_multicast(int);
192 struct block *gen_inbound(int);
194 struct block *gen_vlan(int);
196 void bpf_optimize(struct block **);
197 void bpf_error(const char *, ...)
198 #if HAVE___ATTRIBUTE__
199 __attribute__((noreturn, format (printf, 1, 2)))
203 void finish_parse(struct block *);
204 char *sdup(const char *);
206 struct bpf_insn *icode_to_fcode(struct block *, int *);
207 int pcap_parse(void);
208 void lex_init(char *);
209 void lex_cleanup(void);
210 void sappend(struct slist *, struct slist *);
213 #define JT(b) ((b)->et.succ)
214 #define JF(b) ((b)->ef.succ)
216 extern int no_optimize;