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