The Tcpdump Group git mirrors - libpcap/blob - 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  * @(#) $Header: /tcpdump/master/libpcap/gencode.h,v 1.44 2000-10-28 08:19:29 guy Exp $ (LBL)
  22  */
  23
  24 /* Address qualifiers. */
  25
  26 #define Q_HOST          1
  27 #define Q_NET           2
  28 #define Q_PORT          3
  29 #define Q_GATEWAY       4
  30 #define Q_PROTO         5
  31 #define Q_PROTOCHAIN    6
  32
  33 /* Protocol qualifiers. */
  34
  35 #define Q_LINK          1
  36 #define Q_IP            2
  37 #define Q_ARP           3
  38 #define Q_RARP          4
  39 #define Q_TCP           5
  40 #define Q_UDP           6
  41 #define Q_ICMP          7
  42 #define Q_IGMP          8
  43 #define Q_IGRP          9
  44
  45
  46 #define Q_ATALK         10
  47 #define Q_DECNET        11
  48 #define Q_LAT           12
  49 #define Q_SCA           13
  50 #define Q_MOPRC         14
  51 #define Q_MOPDL         15
  52
  53
  54 #define Q_IPV6          16
  55 #define Q_ICMPV6        17
  56 #define Q_AH            18
  57 #define Q_ESP           19
  58
  59 #define Q_PIM           20
  60
  61 #define Q_AARP          21
  62
  63 /* Directional qualifiers. */
  64
  65 #define Q_SRC           1
  66 #define Q_DST           2
  67 #define Q_OR            3
  68 #define Q_AND           4
  69
  70 #define Q_DEFAULT       0
  71 #define Q_UNDEF         255
  72
  73 struct slist;
  74
  75 struct stmt {
  76         int code;
  77         struct slist *jt;       /*only for relative jump in block*/
  78         struct slist *jf;       /*only for relative jump in block*/
  79         bpf_int32 k;
  80 };
  81
  82 struct slist {
  83         struct stmt s;
  84         struct slist *next;
  85 };
  86
  87 /*
  88  * A bit vector to represent definition sets.  We assume TOT_REGISTERS
  89  * is smaller than 8*sizeof(atomset).
  90  */
  91 typedef bpf_u_int32 atomset;
  92 #define ATOMMASK(n) (1 << (n))
  93 #define ATOMELEM(d, n) (d & ATOMMASK(n))
  94
  95 /*
  96  * An unbounded set.
  97  */
  98 typedef bpf_u_int32 *uset;
  99
 100 /*
 101  * Total number of atomic entities, including accumulator (A) and index (X).
 102  * We treat all these guys similarly during flow analysis.
 103  */
 104 #define N_ATOMS (BPF_MEMWORDS+2)
 105
 106 struct edge {
 107         int id;
 108         int code;
 109         uset edom;
 110         struct block *succ;
 111         struct block *pred;
 112         struct edge *next;      /* link list of incoming edges for a node */
 113 };
 114
 115 struct block {
 116         int id;
 117         struct slist *stmts;    /* side effect stmts */
 118         struct stmt s;          /* branch stmt */
 119         int mark;
 120         int longjt;             /* jt branch requires long jump */
 121         int longjf;             /* jf branch requires long jump */
 122         int level;
 123         int offset;
 124         int sense;
 125         struct edge et;
 126         struct edge ef;
 127         struct block *head;
 128         struct block *link;     /* link field used by optimizer */
 129         uset dom;
 130         uset closure;
 131         struct edge *in_edges;
 132         atomset def, kill;
 133         atomset in_use;
 134         atomset out_use;
 135         int oval;
 136         int val[N_ATOMS];
 137 };
 138
 139 struct arth {
 140         struct block *b;        /* protocol checks */
 141         struct slist *s;        /* stmt list */
 142         int regno;              /* virtual register number of result */
 143 };
 144
 145 struct qual {
 146         unsigned char addr;
 147         unsigned char proto;
 148         unsigned char dir;
 149         unsigned char pad;
 150 };
 151
 152 struct arth *gen_loadi(int);
 153 struct arth *gen_load(int, struct arth *, int);
 154 struct arth *gen_loadlen(void);
 155 struct arth *gen_neg(struct arth *);
 156 struct arth *gen_arth(int, struct arth *, struct arth *);
 157
 158 void gen_and(struct block *, struct block *);
 159 void gen_or(struct block *, struct block *);
 160 void gen_not(struct block *);
 161
 162 struct block *gen_scode(const char *, struct qual);
 163 struct block *gen_ecode(const u_char *, struct qual);
 164 struct block *gen_mcode(const char *, const char *, int, struct qual);
 165 #ifdef INET6
 166 struct block *gen_mcode6(const char *, const char *, int, struct qual);
 167 #endif
 168 struct block *gen_ncode(const char *, bpf_u_int32, struct qual);
 169 struct block *gen_proto_abbrev(int);
 170 struct block *gen_relation(int, struct arth *, struct arth *, int);
 171 struct block *gen_less(int);
 172 struct block *gen_greater(int);
 173 struct block *gen_byteop(int, int, int);
 174 struct block *gen_broadcast(int);
 175 struct block *gen_multicast(int);
 176 struct block *gen_inbound(int);
 177
 178 struct block *gen_vlan(int);
 179
 180 void bpf_optimize(struct block **);
 181 void bpf_error(const char *, ...)
 182 #if HAVE___ATTRIBUTE__
 183     __attribute__((noreturn, format (printf, 1, 2)))
 184 #endif
 185 ;
 186
 187 void finish_parse(struct block *);
 188 char *sdup(const char *);
 189
 190 struct bpf_insn *icode_to_fcode(struct block *, int *);
 191 int install_bpf_program(pcap_t *, struct bpf_program *);
 192 int pcap_parse(void);
 193 void lex_init(char *);
 194 void lex_cleanup(void);
 195 void sappend(struct slist *, struct slist *);
 196
 197 /* XXX */
 198 #define JT(b)  ((b)->et.succ)
 199 #define JF(b)  ((b)->ef.succ)
 200
 201 extern int no_optimize;