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: gencode.h,v 1.36 96/07/17 00:11:34 leres Exp $ (LBL)
27 /* Address qualifiers. */
35 /* Protocol qualifiers. */
58 /* Directional qualifiers. */
79 * A bit vector to represent definition sets. We assume TOT_REGISTERS
80 * is smaller than 8*sizeof(atomset).
82 typedef bpf_u_int32 atomset;
83 #define ATOMMASK(n) (1 << (n))
84 #define ATOMELEM(d, n) (d & ATOMMASK(n))
89 typedef bpf_u_int32 *uset;
92 * Total number of atomic entities, including accumulator (A) and index (X).
93 * We treat all these guys similarly during flow analysis.
95 #define N_ATOMS (BPF_MEMWORDS+2)
103 struct edge *next; /* link list of incoming edges for a node */
108 struct slist *stmts; /* side effect stmts */
109 struct stmt s; /* branch stmt */
111 int longjt; /* jt branch requires long jump */
112 int longjf; /* jf branch requires long jump */
119 struct block *link; /* link field used by optimizer */
122 struct edge *in_edges;
131 struct block *b; /* protocol checks */
132 struct slist *s; /* stmt list */
133 int regno; /* virtual register number of result */
143 struct arth *gen_loadi(int);
144 struct arth *gen_load(int, struct arth *, int);
145 struct arth *gen_loadlen(void);
146 struct arth *gen_neg(struct arth *);
147 struct arth *gen_arth(int, struct arth *, struct arth *);
149 void gen_and(struct block *, struct block *);
150 void gen_or(struct block *, struct block *);
151 void gen_not(struct block *);
153 struct block *gen_scode(const char *, struct qual);
154 struct block *gen_ecode(const u_char *, struct qual);
155 struct block *gen_mcode(const char *, const char *, int, struct qual);
156 struct block *gen_ncode(const char *, bpf_u_int32, struct qual);
157 struct block *gen_proto_abbrev(int);
158 struct block *gen_relation(int, struct arth *, struct arth *, int);
159 struct block *gen_less(int);
160 struct block *gen_greater(int);
161 struct block *gen_byteop(int, int, int);
162 struct block *gen_broadcast(int);
163 struct block *gen_multicast(int);
164 struct block *gen_inbound(int);
166 void bpf_optimize(struct block **);
168 __dead void bpf_error(const char *, ...)
169 __attribute__((volatile, format (printf, 1, 2)));
172 void finish_parse(struct block *);
173 char *sdup(const char *);
175 struct bpf_insn *icode_to_fcode(struct block *, int *);
176 int pcap_parse(void);
177 void lex_init(char *);
178 void sappend(struct slist *, struct slist *);
181 #define JT(b) ((b)->et.succ)
182 #define JF(b) ((b)->ef.succ)