]> The Tcpdump Group git mirrors - libpcap/blob - gencode.h
Declare "install_bpf_program()" in "pcap-int.h", not "gencode.h"; it has
[libpcap] / gencode.h
1 /*
2 * Copyright (c) 1990, 1991, 1992, 1993, 1994, 1995, 1996
3 * The Regents of the University of California. All rights reserved.
4 *
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
16 * written permission.
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.
20 *
21 * @(#) $Header: /tcpdump/master/libpcap/gencode.h,v 1.47 2000-11-04 10:09:55 guy Exp $ (LBL)
22 */
23
24 /* Address qualifiers. */
25
26 #define Q_HOST 1
27 #define Q_NET 2
28 #define Q_PORT 3
29 #define Q_GATEWAY 4
30 #define Q_PROTO 5
31 #define Q_PROTOCHAIN 6
32
33 /* Protocol qualifiers. */
34
35 #define Q_LINK 1
36 #define Q_IP 2
37 #define Q_ARP 3
38 #define Q_RARP 4
39 #define Q_TCP 5
40 #define Q_UDP 6
41 #define Q_ICMP 7
42 #define Q_IGMP 8
43 #define Q_IGRP 9
44
45
46 #define Q_ATALK 10
47 #define Q_DECNET 11
48 #define Q_LAT 12
49 #define Q_SCA 13
50 #define Q_MOPRC 14
51 #define Q_MOPDL 15
52
53
54 #define Q_IPV6 16
55 #define Q_ICMPV6 17
56 #define Q_AH 18
57 #define Q_ESP 19
58
59 #define Q_PIM 20
60
61 #define Q_AARP 21
62
63 #define Q_ISO 22
64 #define Q_ESIS 23
65 #define Q_ISIS 24
66 #define Q_CLNP 25
67
68 /* Directional qualifiers. */
69
70 #define Q_SRC 1
71 #define Q_DST 2
72 #define Q_OR 3
73 #define Q_AND 4
74
75 #define Q_DEFAULT 0
76 #define Q_UNDEF 255
77
78 struct slist;
79
80 struct stmt {
81 int code;
82 struct slist *jt; /*only for relative jump in block*/
83 struct slist *jf; /*only for relative jump in block*/
84 bpf_int32 k;
85 };
86
87 struct slist {
88 struct stmt s;
89 struct slist *next;
90 };
91
92 /*
93 * A bit vector to represent definition sets. We assume TOT_REGISTERS
94 * is smaller than 8*sizeof(atomset).
95 */
96 typedef bpf_u_int32 atomset;
97 #define ATOMMASK(n) (1 << (n))
98 #define ATOMELEM(d, n) (d & ATOMMASK(n))
99
100 /*
101 * An unbounded set.
102 */
103 typedef bpf_u_int32 *uset;
104
105 /*
106 * Total number of atomic entities, including accumulator (A) and index (X).
107 * We treat all these guys similarly during flow analysis.
108 */
109 #define N_ATOMS (BPF_MEMWORDS+2)
110
111 struct edge {
112 int id;
113 int code;
114 uset edom;
115 struct block *succ;
116 struct block *pred;
117 struct edge *next; /* link list of incoming edges for a node */
118 };
119
120 struct block {
121 int id;
122 struct slist *stmts; /* side effect stmts */
123 struct stmt s; /* branch stmt */
124 int mark;
125 int longjt; /* jt branch requires long jump */
126 int longjf; /* jf branch requires long jump */
127 int level;
128 int offset;
129 int sense;
130 struct edge et;
131 struct edge ef;
132 struct block *head;
133 struct block *link; /* link field used by optimizer */
134 uset dom;
135 uset closure;
136 struct edge *in_edges;
137 atomset def, kill;
138 atomset in_use;
139 atomset out_use;
140 int oval;
141 int val[N_ATOMS];
142 };
143
144 struct arth {
145 struct block *b; /* protocol checks */
146 struct slist *s; /* stmt list */
147 int regno; /* virtual register number of result */
148 };
149
150 struct qual {
151 unsigned char addr;
152 unsigned char proto;
153 unsigned char dir;
154 unsigned char pad;
155 };
156
157 struct arth *gen_loadi(int);
158 struct arth *gen_load(int, struct arth *, int);
159 struct arth *gen_loadlen(void);
160 struct arth *gen_neg(struct arth *);
161 struct arth *gen_arth(int, struct arth *, struct arth *);
162
163 void gen_and(struct block *, struct block *);
164 void gen_or(struct block *, struct block *);
165 void gen_not(struct block *);
166
167 struct block *gen_scode(const char *, struct qual);
168 struct block *gen_ecode(const u_char *, struct qual);
169 struct block *gen_mcode(const char *, const char *, int, struct qual);
170 #ifdef INET6
171 struct block *gen_mcode6(const char *, const char *, int, struct qual);
172 #endif
173 struct block *gen_ncode(const char *, bpf_u_int32, struct qual);
174 struct block *gen_proto_abbrev(int);
175 struct block *gen_relation(int, struct arth *, struct arth *, int);
176 struct block *gen_less(int);
177 struct block *gen_greater(int);
178 struct block *gen_byteop(int, int, int);
179 struct block *gen_broadcast(int);
180 struct block *gen_multicast(int);
181 struct block *gen_inbound(int);
182
183 struct block *gen_vlan(int);
184
185 void bpf_optimize(struct block **);
186 void bpf_error(const char *, ...)
187 #if HAVE___ATTRIBUTE__
188 __attribute__((noreturn, format (printf, 1, 2)))
189 #endif
190 ;
191
192 void finish_parse(struct block *);
193 char *sdup(const char *);
194
195 struct bpf_insn *icode_to_fcode(struct block *, int *);
196 int pcap_parse(void);
197 void lex_init(char *);
198 void lex_cleanup(void);
199 void sappend(struct slist *, struct slist *);
200
201 /* XXX */
202 #define JT(b) ((b)->et.succ)
203 #define JF(b) ((b)->ef.succ)
204
205 extern int no_optimize;