gencode.h revision 146771
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 * $FreeBSD: head/contrib/libpcap/gencode.h 146771 2005-05-29 18:09:04Z sam $ 22 * @(#) $Header: /tcpdump/master/libpcap/gencode.h,v 1.60 2004/06/16 08:20:30 hannes Exp $ (LBL) 23 */ 24 25/* 26 * ATM support: 27 * 28 * Copyright (c) 1997 Yen Yen Lim and North Dakota State University 29 * All rights reserved. 30 * 31 * Redistribution and use in source and binary forms, with or without 32 * modification, are permitted provided that the following conditions 33 * are met: 34 * 1. Redistributions of source code must retain the above copyright 35 * notice, this list of conditions and the following disclaimer. 36 * 2. Redistributions in binary form must reproduce the above copyright 37 * notice, this list of conditions and the following disclaimer in the 38 * documentation and/or other materials provided with the distribution. 39 * 3. All advertising materials mentioning features or use of this software 40 * must display the following acknowledgement: 41 * This product includes software developed by Yen Yen Lim and 42 * North Dakota State University 43 * 4. The name of the author may not be used to endorse or promote products 44 * derived from this software without specific prior written permission. 45 * 46 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 47 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 48 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 49 * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, 50 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 51 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 52 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 53 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, 54 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 55 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 56 * POSSIBILITY OF SUCH DAMAGE. 57 */ 58 59/* Address qualifiers. */ 60 61#define Q_HOST 1 62#define Q_NET 2 63#define Q_PORT 3 64#define Q_GATEWAY 4 65#define Q_PROTO 5 66#define Q_PROTOCHAIN 6 67 68/* Protocol qualifiers. */ 69 70#define Q_LINK 1 71#define Q_IP 2 72#define Q_ARP 3 73#define Q_RARP 4 74#define Q_SCTP 5 75#define Q_TCP 6 76#define Q_UDP 7 77#define Q_ICMP 8 78#define Q_IGMP 9 79#define Q_IGRP 10 80 81 82#define Q_ATALK 11 83#define Q_DECNET 12 84#define Q_LAT 13 85#define Q_SCA 14 86#define Q_MOPRC 15 87#define Q_MOPDL 16 88 89 90#define Q_IPV6 17 91#define Q_ICMPV6 18 92#define Q_AH 19 93#define Q_ESP 20 94 95#define Q_PIM 21 96#define Q_VRRP 22 97 98#define Q_AARP 23 99 100#define Q_ISO 24 101#define Q_ESIS 25 102#define Q_ISIS 26 103#define Q_CLNP 27 104 105#define Q_STP 28 106 107#define Q_IPX 29 108 109#define Q_NETBEUI 30 110 111/* IS-IS Levels */ 112#define Q_ISIS_L1 31 113#define Q_ISIS_L2 32 114/* PDU types */ 115#define Q_ISIS_IIH 33 116#define Q_ISIS_LAN_IIH 34 117#define Q_ISIS_PTP_IIH 35 118#define Q_ISIS_SNP 36 119#define Q_ISIS_CSNP 37 120#define Q_ISIS_PSNP 38 121#define Q_ISIS_LSP 39 122 123/* Directional qualifiers. */ 124 125#define Q_SRC 1 126#define Q_DST 2 127#define Q_OR 3 128#define Q_AND 4 129 130#define Q_DEFAULT 0 131#define Q_UNDEF 255 132 133/* ATM types */ 134#define A_METAC 22 /* Meta signalling Circuit */ 135#define A_BCC 23 /* Broadcast Circuit */ 136#define A_OAMF4SC 24 /* Segment OAM F4 Circuit */ 137#define A_OAMF4EC 25 /* End-to-End OAM F4 Circuit */ 138#define A_SC 26 /* Signalling Circuit*/ 139#define A_ILMIC 27 /* ILMI Circuit */ 140#define A_OAM 28 /* OAM cells : F4 only */ 141#define A_OAMF4 29 /* OAM F4 cells: Segment + End-to-end */ 142#define A_LANE 30 /* LANE traffic */ 143#define A_LLC 31 /* LLC-encapsulated traffic */ 144 145/* Based on Q.2931 signalling protocol */ 146#define A_SETUP 41 /* Setup message */ 147#define A_CALLPROCEED 42 /* Call proceeding message */ 148#define A_CONNECT 43 /* Connect message */ 149#define A_CONNECTACK 44 /* Connect Ack message */ 150#define A_RELEASE 45 /* Release message */ 151#define A_RELEASE_DONE 46 /* Release message */ 152 153/* ATM field types */ 154#define A_VPI 51 155#define A_VCI 52 156#define A_PROTOTYPE 53 157#define A_MSGTYPE 54 158#define A_CALLREFTYPE 55 159 160#define A_CONNECTMSG 70 /* returns Q.2931 signalling messages for 161 establishing and destroying switched 162 virtual connection */ 163#define A_METACONNECT 71 /* returns Q.2931 signalling messages for 164 establishing and destroying predefined 165 virtual circuits, such as broadcast 166 circuit, oamf4 segment circuit, oamf4 167 end-to-end circuits, ILMI circuits or 168 connection signalling circuit. */ 169 170struct slist; 171 172struct stmt { 173 int code; 174 struct slist *jt; /*only for relative jump in block*/ 175 struct slist *jf; /*only for relative jump in block*/ 176 bpf_int32 k; 177}; 178 179struct slist { 180 struct stmt s; 181 struct slist *next; 182}; 183 184/* 185 * A bit vector to represent definition sets. We assume TOT_REGISTERS 186 * is smaller than 8*sizeof(atomset). 187 */ 188typedef bpf_u_int32 atomset; 189#define ATOMMASK(n) (1 << (n)) 190#define ATOMELEM(d, n) (d & ATOMMASK(n)) 191 192/* 193 * An unbounded set. 194 */ 195typedef bpf_u_int32 *uset; 196 197/* 198 * Total number of atomic entities, including accumulator (A) and index (X). 199 * We treat all these guys similarly during flow analysis. 200 */ 201#define N_ATOMS (BPF_MEMWORDS+2) 202 203struct edge { 204 int id; 205 int code; 206 uset edom; 207 struct block *succ; 208 struct block *pred; 209 struct edge *next; /* link list of incoming edges for a node */ 210}; 211 212struct block { 213 int id; 214 struct slist *stmts; /* side effect stmts */ 215 struct stmt s; /* branch stmt */ 216 int mark; 217 int longjt; /* jt branch requires long jump */ 218 int longjf; /* jf branch requires long jump */ 219 int level; 220 int offset; 221 int sense; 222 struct edge et; 223 struct edge ef; 224 struct block *head; 225 struct block *link; /* link field used by optimizer */ 226 uset dom; 227 uset closure; 228 struct edge *in_edges; 229 atomset def, kill; 230 atomset in_use; 231 atomset out_use; 232 int oval; 233 int val[N_ATOMS]; 234}; 235 236struct arth { 237 struct block *b; /* protocol checks */ 238 struct slist *s; /* stmt list */ 239 int regno; /* virtual register number of result */ 240}; 241 242struct qual { 243 unsigned char addr; 244 unsigned char proto; 245 unsigned char dir; 246 unsigned char pad; 247}; 248 249struct arth *gen_loadi(int); 250struct arth *gen_load(int, struct arth *, int); 251struct arth *gen_loadlen(void); 252struct arth *gen_neg(struct arth *); 253struct arth *gen_arth(int, struct arth *, struct arth *); 254 255void gen_and(struct block *, struct block *); 256void gen_or(struct block *, struct block *); 257void gen_not(struct block *); 258 259struct block *gen_scode(const char *, struct qual); 260struct block *gen_ecode(const u_char *, struct qual); 261struct block *gen_acode(const u_char *, struct qual); 262struct block *gen_mcode(const char *, const char *, int, struct qual); 263#ifdef INET6 264struct block *gen_mcode6(const char *, const char *, int, struct qual); 265#endif 266struct block *gen_ncode(const char *, bpf_u_int32, struct qual); 267struct block *gen_proto_abbrev(int); 268struct block *gen_relation(int, struct arth *, struct arth *, int); 269struct block *gen_less(int); 270struct block *gen_greater(int); 271struct block *gen_byteop(int, int, int); 272struct block *gen_broadcast(int); 273struct block *gen_multicast(int); 274struct block *gen_inbound(int); 275 276struct block *gen_vlan(int); 277struct block *gen_mpls(int); 278 279struct block *gen_atmfield_code(int atmfield, bpf_u_int32 jvalue, bpf_u_int32 jtype, int reverse); 280struct block *gen_atmtype_abbrev(int type); 281struct block *gen_atmmulti_abbrev(int type); 282 283struct block *gen_pf_ifname(const char *); 284struct block *gen_pf_rnr(int); 285struct block *gen_pf_srnr(int); 286struct block *gen_pf_ruleset(char *); 287struct block *gen_pf_reason(int); 288struct block *gen_pf_action(int); 289struct block *gen_pf_dir(int); 290 291void bpf_optimize(struct block **); 292void bpf_error(const char *, ...) 293#if HAVE___ATTRIBUTE__ 294 __attribute__((noreturn, format (printf, 1, 2))) 295#endif 296; 297 298void finish_parse(struct block *); 299char *sdup(const char *); 300 301struct bpf_insn *icode_to_fcode(struct block *, int *); 302int pcap_parse(void); 303void lex_init(char *); 304void lex_cleanup(void); 305void sappend(struct slist *, struct slist *); 306 307/* XXX */ 308#define JT(b) ((b)->et.succ) 309#define JF(b) ((b)->ef.succ) 310 311extern int no_optimize; 312