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