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