gencode.h revision 162015
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 162015 2006-09-04 19:54:21Z sam $ 22 * @(#) $Header: /tcpdump/master/libpcap/gencode.h,v 1.60.2.6 2005/09/05 09:08:06 guy 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#ifndef HAVE___ATTRIBUTE__ 60#define __attribute__(x) 61#endif /* HAVE___ATTRIBUTE__ */ 62 63/* Address qualifiers. */ 64 65#define Q_HOST 1 66#define Q_NET 2 67#define Q_PORT 3 68#define Q_GATEWAY 4 69#define Q_PROTO 5 70#define Q_PROTOCHAIN 6 71#define Q_PORTRANGE 7 72 73/* Protocol qualifiers. */ 74 75#define Q_LINK 1 76#define Q_IP 2 77#define Q_ARP 3 78#define Q_RARP 4 79#define Q_SCTP 5 80#define Q_TCP 6 81#define Q_UDP 7 82#define Q_ICMP 8 83#define Q_IGMP 9 84#define Q_IGRP 10 85 86 87#define Q_ATALK 11 88#define Q_DECNET 12 89#define Q_LAT 13 90#define Q_SCA 14 91#define Q_MOPRC 15 92#define Q_MOPDL 16 93 94 95#define Q_IPV6 17 96#define Q_ICMPV6 18 97#define Q_AH 19 98#define Q_ESP 20 99 100#define Q_PIM 21 101#define Q_VRRP 22 102 103#define Q_AARP 23 104 105#define Q_ISO 24 106#define Q_ESIS 25 107#define Q_ISIS 26 108#define Q_CLNP 27 109 110#define Q_STP 28 111 112#define Q_IPX 29 113 114#define Q_NETBEUI 30 115 116/* IS-IS Levels */ 117#define Q_ISIS_L1 31 118#define Q_ISIS_L2 32 119/* PDU types */ 120#define Q_ISIS_IIH 33 121#define Q_ISIS_LAN_IIH 34 122#define Q_ISIS_PTP_IIH 35 123#define Q_ISIS_SNP 36 124#define Q_ISIS_CSNP 37 125#define Q_ISIS_PSNP 38 126#define Q_ISIS_LSP 39 127 128#define Q_RADIO 40 129 130/* Directional qualifiers. */ 131 132#define Q_SRC 1 133#define Q_DST 2 134#define Q_OR 3 135#define Q_AND 4 136 137#define Q_DEFAULT 0 138#define Q_UNDEF 255 139 140/* ATM types */ 141#define A_METAC 22 /* Meta signalling Circuit */ 142#define A_BCC 23 /* Broadcast Circuit */ 143#define A_OAMF4SC 24 /* Segment OAM F4 Circuit */ 144#define A_OAMF4EC 25 /* End-to-End OAM F4 Circuit */ 145#define A_SC 26 /* Signalling Circuit*/ 146#define A_ILMIC 27 /* ILMI Circuit */ 147#define A_OAM 28 /* OAM cells : F4 only */ 148#define A_OAMF4 29 /* OAM F4 cells: Segment + End-to-end */ 149#define A_LANE 30 /* LANE traffic */ 150#define A_LLC 31 /* LLC-encapsulated traffic */ 151 152/* Based on Q.2931 signalling protocol */ 153#define A_SETUP 41 /* Setup message */ 154#define A_CALLPROCEED 42 /* Call proceeding message */ 155#define A_CONNECT 43 /* Connect message */ 156#define A_CONNECTACK 44 /* Connect Ack message */ 157#define A_RELEASE 45 /* Release message */ 158#define A_RELEASE_DONE 46 /* Release message */ 159 160/* ATM field types */ 161#define A_VPI 51 162#define A_VCI 52 163#define A_PROTOTYPE 53 164#define A_MSGTYPE 54 165#define A_CALLREFTYPE 55 166 167#define A_CONNECTMSG 70 /* returns Q.2931 signalling messages for 168 establishing and destroying switched 169 virtual connection */ 170#define A_METACONNECT 71 /* returns Q.2931 signalling messages for 171 establishing and destroying predefined 172 virtual circuits, such as broadcast 173 circuit, oamf4 segment circuit, oamf4 174 end-to-end circuits, ILMI circuits or 175 connection signalling circuit. */ 176 177/*MTP3 field types */ 178#define M_SIO 1 179#define M_OPC 2 180#define M_DPC 3 181#define M_SLS 4 182 183 184struct slist; 185 186struct stmt { 187 int code; 188 struct slist *jt; /*only for relative jump in block*/ 189 struct slist *jf; /*only for relative jump in block*/ 190 bpf_int32 k; 191}; 192 193struct slist { 194 struct stmt s; 195 struct slist *next; 196}; 197 198/* 199 * A bit vector to represent definition sets. We assume TOT_REGISTERS 200 * is smaller than 8*sizeof(atomset). 201 */ 202typedef bpf_u_int32 atomset; 203#define ATOMMASK(n) (1 << (n)) 204#define ATOMELEM(d, n) (d & ATOMMASK(n)) 205 206/* 207 * An unbounded set. 208 */ 209typedef bpf_u_int32 *uset; 210 211/* 212 * Total number of atomic entities, including accumulator (A) and index (X). 213 * We treat all these guys similarly during flow analysis. 214 */ 215#define N_ATOMS (BPF_MEMWORDS+2) 216 217struct edge { 218 int id; 219 int code; 220 uset edom; 221 struct block *succ; 222 struct block *pred; 223 struct edge *next; /* link list of incoming edges for a node */ 224}; 225 226struct block { 227 int id; 228 struct slist *stmts; /* side effect stmts */ 229 struct stmt s; /* branch stmt */ 230 int mark; 231 int longjt; /* jt branch requires long jump */ 232 int longjf; /* jf branch requires long jump */ 233 int level; 234 int offset; 235 int sense; 236 struct edge et; 237 struct edge ef; 238 struct block *head; 239 struct block *link; /* link field used by optimizer */ 240 uset dom; 241 uset closure; 242 struct edge *in_edges; 243 atomset def, kill; 244 atomset in_use; 245 atomset out_use; 246 int oval; 247 int val[N_ATOMS]; 248}; 249 250struct arth { 251 struct block *b; /* protocol checks */ 252 struct slist *s; /* stmt list */ 253 int regno; /* virtual register number of result */ 254}; 255 256struct qual { 257 unsigned char addr; 258 unsigned char proto; 259 unsigned char dir; 260 unsigned char pad; 261}; 262 263struct arth *gen_loadi(int); 264struct arth *gen_load(int, struct arth *, int); 265struct arth *gen_loadlen(void); 266struct arth *gen_neg(struct arth *); 267struct arth *gen_arth(int, struct arth *, struct arth *); 268 269void gen_and(struct block *, struct block *); 270void gen_or(struct block *, struct block *); 271void gen_not(struct block *); 272 273struct block *gen_scode(const char *, struct qual); 274struct block *gen_ecode(const u_char *, struct qual); 275struct block *gen_acode(const u_char *, struct qual); 276struct block *gen_mcode(const char *, const char *, int, struct qual); 277#ifdef INET6 278struct block *gen_mcode6(const char *, const char *, int, struct qual); 279#endif 280struct block *gen_ncode(const char *, bpf_u_int32, struct qual); 281struct block *gen_proto_abbrev(int); 282struct block *gen_relation(int, struct arth *, struct arth *, int); 283struct block *gen_less(int); 284struct block *gen_greater(int); 285struct block *gen_byteop(int, int, int); 286struct block *gen_broadcast(int); 287struct block *gen_multicast(int); 288struct block *gen_inbound(int); 289 290struct block *gen_vlan(int); 291struct block *gen_mpls(int); 292 293struct block *gen_pppoed(void); 294struct block *gen_pppoes(void); 295 296struct block *gen_atmfield_code(int atmfield, bpf_int32 jvalue, bpf_u_int32 jtype, int reverse); 297struct block *gen_atmtype_abbrev(int type); 298struct block *gen_atmmulti_abbrev(int type); 299 300struct block *gen_mtp3field_code(int mtp3field, bpf_u_int32 jvalue, bpf_u_int32 jtype, int reverse); 301 302struct block *gen_pf_ifname(const char *); 303struct block *gen_pf_rnr(int); 304struct block *gen_pf_srnr(int); 305struct block *gen_pf_ruleset(char *); 306struct block *gen_pf_reason(int); 307struct block *gen_pf_action(int); 308struct block *gen_pf_dir(int); 309 310void bpf_optimize(struct block **); 311void bpf_error(const char *, ...) 312 __attribute__((noreturn, format (printf, 1, 2))); 313 314void finish_parse(struct block *); 315char *sdup(const char *); 316 317struct bpf_insn *icode_to_fcode(struct block *, int *); 318int pcap_parse(void); 319void lex_init(char *); 320void lex_cleanup(void); 321void sappend(struct slist *, struct slist *); 322 323/* XXX */ 324#define JT(b) ((b)->et.succ) 325#define JF(b) ((b)->ef.succ) 326 327extern int no_optimize; 328