contrib/libpcap/gencode.h

   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$
  22  * @(#) $Header: /tcpdump/master/libpcap/gencode.h,v 1.60.2.11 2007/06/11 09:52:04 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 /* MTP2 types */
 178 #define M_FISU          22      /* FISU */
 179 #define M_LSSU          23      /* LSSU */
 180 #define M_MSU           24      /* MSU */
 181
 182 /* MTP3 field types */
 183 #define M_SIO           1
 184 #define M_OPC           2
 185 #define M_DPC           3
 186 #define M_SLS           4
 187
 188
 189 struct slist;
 190
 191 struct stmt {
 192         int code;
 193         struct slist *jt;       /*only for relative jump in block*/
 194         struct slist *jf;       /*only for relative jump in block*/
 195         bpf_int32 k;
 196 };
 197
 198 struct slist {
 199         struct stmt s;
 200         struct slist *next;
 201 };
 202
 203 /*
 204  * A bit vector to represent definition sets.  We assume TOT_REGISTERS
 205  * is smaller than 8*sizeof(atomset).
 206  */
 207 typedef bpf_u_int32 atomset;
 208 #define ATOMMASK(n) (1 << (n))
 209 #define ATOMELEM(d, n) (d & ATOMMASK(n))
 210
 211 /*
 212  * An unbounded set.
 213  */
 214 typedef bpf_u_int32 *uset;
 215
 216 /*
 217  * Total number of atomic entities, including accumulator (A) and index (X).
 218  * We treat all these guys similarly during flow analysis.
 219  */
 220 #define N_ATOMS (BPF_MEMWORDS+2)
 221
 222 struct edge {
 223         int id;
 224         int code;
 225         uset edom;
 226         struct block *succ;
 227         struct block *pred;
 228         struct edge *next;      /* link list of incoming edges for a node */
 229 };
 230
 231 struct block {
 232         int id;
 233         struct slist *stmts;    /* side effect stmts */
 234         struct stmt s;          /* branch stmt */
 235         int mark;
 236         int longjt;             /* jt branch requires long jump */
 237         int longjf;             /* jf branch requires long jump */
 238         int level;
 239         int offset;
 240         int sense;
 241         struct edge et;
 242         struct edge ef;
 243         struct block *head;
 244         struct block *link;     /* link field used by optimizer */
 245         uset dom;
 246         uset closure;
 247         struct edge *in_edges;
 248         atomset def, kill;
 249         atomset in_use;
 250         atomset out_use;
 251         int oval;
 252         int val[N_ATOMS];
 253 };
 254
 255 struct arth {
 256         struct block *b;        /* protocol checks */
 257         struct slist *s;        /* stmt list */
 258         int regno;              /* virtual register number of result */
 259 };
 260
 261 struct qual {
 262         unsigned char addr;
 263         unsigned char proto;
 264         unsigned char dir;
 265         unsigned char pad;
 266 };
 267
 268 struct arth *gen_loadi(int);
 269 struct arth *gen_load(int, struct arth *, int);
 270 struct arth *gen_loadlen(void);
 271 struct arth *gen_neg(struct arth *);
 272 struct arth *gen_arth(int, struct arth *, struct arth *);
 273
 274 void gen_and(struct block *, struct block *);
 275 void gen_or(struct block *, struct block *);
 276 void gen_not(struct block *);
 277
 278 struct block *gen_scode(const char *, struct qual);
 279 struct block *gen_ecode(const u_char *, struct qual);
 280 struct block *gen_acode(const u_char *, struct qual);
 281 struct block *gen_mcode(const char *, const char *, int, struct qual);
 282 #ifdef INET6
 283 struct block *gen_mcode6(const char *, const char *, int, struct qual);
 284 #endif
 285 struct block *gen_ncode(const char *, bpf_u_int32, struct qual);
 286 struct block *gen_proto_abbrev(int);
 287 struct block *gen_relation(int, struct arth *, struct arth *, int);
 288 struct block *gen_less(int);
 289 struct block *gen_greater(int);
 290 struct block *gen_byteop(int, int, int);
 291 struct block *gen_broadcast(int);
 292 struct block *gen_multicast(int);
 293 struct block *gen_inbound(int);
 294
 295 struct block *gen_vlan(int);
 296 struct block *gen_mpls(int);
 297
 298 struct block *gen_pppoed(void);
 299 struct block *gen_pppoes(void);
 300
 301 struct block *gen_atmfield_code(int atmfield, bpf_int32 jvalue, bpf_u_int32 jtype, int reverse);
 302 struct block *gen_atmtype_abbrev(int type);
 303 struct block *gen_atmmulti_abbrev(int type);
 304
 305 struct block *gen_mtp2type_abbrev(int type);
 306 struct block *gen_mtp3field_code(int mtp3field, bpf_u_int32 jvalue, bpf_u_int32 jtype, int reverse);
 307
 308 struct block *gen_pf_ifname(const char *);
 309 struct block *gen_pf_rnr(int);
 310 struct block *gen_pf_srnr(int);
 311 struct block *gen_pf_ruleset(char *);
 312 struct block *gen_pf_reason(int);
 313 struct block *gen_pf_action(int);
 314 struct block *gen_pf_dir(int);
 315
 316 void bpf_optimize(struct block **);
 317 void bpf_error(const char *, ...)
 318     __attribute__((noreturn, format (printf, 1, 2)));
 319
 320 void finish_parse(struct block *);
 321 char *sdup(const char *);
 322
 323 struct bpf_insn *icode_to_fcode(struct block *, int *);
 324 int pcap_parse(void);
 325 void lex_init(const char *);
 326 void lex_cleanup(void);
 327 void sappend(struct slist *, struct slist *);
 328
 329 /* XXX */
 330 #define JT(b)  ((b)->et.succ)
 331 #define JF(b)  ((b)->ef.succ)
 332
 333 extern int no_optimize;