]>
The Tcpdump Group git mirrors - libpcap/blob - gencode.h
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.48 2001-01-14 04:34:51 guy Exp $ (LBL)
24 /* Address qualifiers. */
31 #define Q_PROTOCHAIN 6
33 /* Protocol qualifiers. */
70 /* Directional qualifiers. */
84 struct slist
*jt
; /*only for relative jump in block*/
85 struct slist
*jf
; /*only for relative jump in block*/
95 * A bit vector to represent definition sets. We assume TOT_REGISTERS
96 * is smaller than 8*sizeof(atomset).
98 typedef bpf_u_int32 atomset
;
99 #define ATOMMASK(n) (1 << (n))
100 #define ATOMELEM(d, n) (d & ATOMMASK(n))
105 typedef bpf_u_int32
*uset
;
108 * Total number of atomic entities, including accumulator (A) and index (X).
109 * We treat all these guys similarly during flow analysis.
111 #define N_ATOMS (BPF_MEMWORDS+2)
119 struct edge
*next
; /* link list of incoming edges for a node */
124 struct slist
*stmts
; /* side effect stmts */
125 struct stmt s
; /* branch stmt */
127 int longjt
; /* jt branch requires long jump */
128 int longjf
; /* jf branch requires long jump */
135 struct block
*link
; /* link field used by optimizer */
138 struct edge
*in_edges
;
147 struct block
*b
; /* protocol checks */
148 struct slist
*s
; /* stmt list */
149 int regno
; /* virtual register number of result */
159 struct arth
*gen_loadi(int);
160 struct arth
*gen_load(int, struct arth
*, int);
161 struct arth
*gen_loadlen(void);
162 struct arth
*gen_neg(struct arth
*);
163 struct arth
*gen_arth(int, struct arth
*, struct arth
*);
165 void gen_and(struct block
*, struct block
*);
166 void gen_or(struct block
*, struct block
*);
167 void gen_not(struct block
*);
169 struct block
*gen_scode(const char *, struct qual
);
170 struct block
*gen_ecode(const u_char
*, struct qual
);
171 struct block
*gen_mcode(const char *, const char *, int, struct qual
);
173 struct block
*gen_mcode6(const char *, const char *, int, struct qual
);
175 struct block
*gen_ncode(const char *, bpf_u_int32
, struct qual
);
176 struct block
*gen_proto_abbrev(int);
177 struct block
*gen_relation(int, struct arth
*, struct arth
*, int);
178 struct block
*gen_less(int);
179 struct block
*gen_greater(int);
180 struct block
*gen_byteop(int, int, int);
181 struct block
*gen_broadcast(int);
182 struct block
*gen_multicast(int);
183 struct block
*gen_inbound(int);
185 struct block
*gen_vlan(int);
187 void bpf_optimize(struct block
**);
188 void bpf_error(const char *, ...)
189 #if HAVE___ATTRIBUTE__
190 __attribute__((noreturn
, format (printf
, 1, 2)))
194 void finish_parse(struct block
*);
195 char *sdup(const char *);
197 struct bpf_insn
*icode_to_fcode(struct block
*, int *);
198 int pcap_parse(void);
199 void lex_init(char *);
200 void lex_cleanup(void);
201 void sappend(struct slist
*, struct slist
*);
204 #define JT(b) ((b)->et.succ)
205 #define JF(b) ((b)->ef.succ)
207 extern int no_optimize
;