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.70.2.1 2007/11/18 02:04:55 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 #define Q_ADDR1 5 136 #define Q_ADDR2 6 137 #define Q_ADDR3 7 138 #define Q_ADDR4 8 139 140 #define Q_DEFAULT 0 141 #define Q_UNDEF 255 142 143 /* ATM types */ 144 #define A_METAC 22 /* Meta signalling Circuit */ 145 #define A_BCC 23 /* Broadcast Circuit */ 146 #define A_OAMF4SC 24 /* Segment OAM F4 Circuit */ 147 #define A_OAMF4EC 25 /* End-to-End OAM F4 Circuit */ 148 #define A_SC 26 /* Signalling Circuit*/ 149 #define A_ILMIC 27 /* ILMI Circuit */ 150 #define A_OAM 28 /* OAM cells : F4 only */ 151 #define A_OAMF4 29 /* OAM F4 cells: Segment + End-to-end */ 152 #define A_LANE 30 /* LANE traffic */ 153 #define A_LLC 31 /* LLC-encapsulated traffic */ 154 155 /* Based on Q.2931 signalling protocol */ 156 #define A_SETUP 41 /* Setup message */ 157 #define A_CALLPROCEED 42 /* Call proceeding message */ 158 #define A_CONNECT 43 /* Connect message */ 159 #define A_CONNECTACK 44 /* Connect Ack message */ 160 #define A_RELEASE 45 /* Release message */ 161 #define A_RELEASE_DONE 46 /* Release message */ 162 163 /* ATM field types */ 164 #define A_VPI 51 165 #define A_VCI 52 166 #define A_PROTOTYPE 53 167 #define A_MSGTYPE 54 168 #define A_CALLREFTYPE 55 169 170 #define A_CONNECTMSG 70 /* returns Q.2931 signalling messages for 171 establishing and destroying switched 172 virtual connection */ 173 #define A_METACONNECT 71 /* returns Q.2931 signalling messages for 174 establishing and destroying predefined 175 virtual circuits, such as broadcast 176 circuit, oamf4 segment circuit, oamf4 177 end-to-end circuits, ILMI circuits or 178 connection signalling circuit. */ 179 180 /* MTP2 types */ 181 #define M_FISU 22 /* FISU */ 182 #define M_LSSU 23 /* LSSU */ 183 #define M_MSU 24 /* MSU */ 184 185 /* MTP3 field types */ 186 #define M_SIO 1 187 #define M_OPC 2 188 #define M_DPC 3 189 #define M_SLS 4 190 191 192 struct slist; 193 194 struct stmt { 195 int code; 196 struct slist *jt; /*only for relative jump in block*/ 197 struct slist *jf; /*only for relative jump in block*/ 198 bpf_int32 k; 199 }; 200 201 struct slist { 202 struct stmt s; 203 struct slist *next; 204 }; 205 206 /* 207 * A bit vector to represent definition sets. We assume TOT_REGISTERS 208 * is smaller than 8*sizeof(atomset). 209 */ 210 typedef bpf_u_int32 atomset; 211 #define ATOMMASK(n) (1 << (n)) 212 #define ATOMELEM(d, n) (d & ATOMMASK(n)) 213 214 /* 215 * An unbounded set. 216 */ 217 typedef bpf_u_int32 *uset; 218 219 /* 220 * Total number of atomic entities, including accumulator (A) and index (X). 221 * We treat all these guys similarly during flow analysis. 222 */ 223 #define N_ATOMS (BPF_MEMWORDS+2) 224 225 struct edge { 226 int id; 227 int code; 228 uset edom; 229 struct block *succ; 230 struct block *pred; 231 struct edge *next; /* link list of incoming edges for a node */ 232 }; 233 234 struct block { 235 int id; 236 struct slist *stmts; /* side effect stmts */ 237 struct stmt s; /* branch stmt */ 238 int mark; 239 int longjt; /* jt branch requires long jump */ 240 int longjf; /* jf branch requires long jump */ 241 int level; 242 int offset; 243 int sense; 244 struct edge et; 245 struct edge ef; 246 struct block *head; 247 struct block *link; /* link field used by optimizer */ 248 uset dom; 249 uset closure; 250 struct edge *in_edges; 251 atomset def, kill; 252 atomset in_use; 253 atomset out_use; 254 int oval; 255 int val[N_ATOMS]; 256 }; 257 258 struct arth { 259 struct block *b; /* protocol checks */ 260 struct slist *s; /* stmt list */ 261 int regno; /* virtual register number of result */ 262 }; 263 264 struct qual { 265 unsigned char addr; 266 unsigned char proto; 267 unsigned char dir; 268 unsigned char pad; 269 }; 270 271 struct arth *gen_loadi(int); 272 struct arth *gen_load(int, struct arth *, int); 273 struct arth *gen_loadlen(void); 274 struct arth *gen_neg(struct arth *); 275 struct arth *gen_arth(int, struct arth *, struct arth *); 276 277 void gen_and(struct block *, struct block *); 278 void gen_or(struct block *, struct block *); 279 void gen_not(struct block *); 280 281 struct block *gen_scode(const char *, struct qual); 282 struct block *gen_ecode(const u_char *, struct qual); 283 struct block *gen_acode(const u_char *, struct qual); 284 struct block *gen_mcode(const char *, const char *, int, struct qual); 285 #ifdef INET6 286 struct block *gen_mcode6(const char *, const char *, int, struct qual); 287 #endif 288 struct block *gen_ncode(const char *, bpf_u_int32, struct qual); 289 struct block *gen_proto_abbrev(int); 290 struct block *gen_relation(int, struct arth *, struct arth *, int); 291 struct block *gen_less(int); 292 struct block *gen_greater(int); 293 struct block *gen_byteop(int, int, int); 294 struct block *gen_broadcast(int); 295 struct block *gen_multicast(int); 296 struct block *gen_inbound(int); 297 298 struct block *gen_vlan(int); 299 struct block *gen_mpls(int); 300 301 struct block *gen_pppoed(void); 302 struct block *gen_pppoes(void); 303 304 struct block *gen_atmfield_code(int atmfield, bpf_int32 jvalue, bpf_u_int32 jtype, int reverse); 305 struct block *gen_atmtype_abbrev(int type); 306 struct block *gen_atmmulti_abbrev(int type); 307 308 struct block *gen_mtp2type_abbrev(int type); 309 struct block *gen_mtp3field_code(int mtp3field, bpf_u_int32 jvalue, bpf_u_int32 jtype, int reverse); 310 311 struct block *gen_pf_ifname(const char *); 312 struct block *gen_pf_rnr(int); 313 struct block *gen_pf_srnr(int); 314 struct block *gen_pf_ruleset(char *); 315 struct block *gen_pf_reason(int); 316 struct block *gen_pf_action(int); 317 struct block *gen_pf_dir(int); 318 319 struct block *gen_p80211_type(int, int); 320 struct block *gen_p80211_fcdir(int); 321 322 void bpf_optimize(struct block **); 323 void bpf_error(const char *, ...) 324 __attribute__((noreturn, format (printf, 1, 2))); 325 326 void finish_parse(struct block *); 327 char *sdup(const char *); 328 329 struct bpf_insn *icode_to_fcode(struct block *, int *); 330 int pcap_parse(void); 331 void lex_init(const char *); 332 void lex_cleanup(void); 333 void sappend(struct slist *, struct slist *); 334 335 /* XXX */ 336 #define JT(b) ((b)->et.succ) 337 #define JF(b) ((b)->ef.succ) 338 339 extern int no_optimize; 340