ptimize: move the definition of extrajmps to the block in which it's used.

[libpcap] / optimize.c

diff --git a/optimize.c b/optimize.c
index 7760569785e455a86fa8c1fc34e5ec7e8f367961..2c9c4b396c02e3e060da46a28fa964606c61820c 100644 (file)
--- a/optimize.c
+++ b/optimize.c
@@ -18,34 +18,19 @@
  * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
  *
  * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
  * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
  *

- *  Optimization module for tcpdump intermediate representation.
+ *  Optimization module for BPF code intermediate representation.

  */
  */

-#ifndef lint
-static const char rcsid[] _U_ =
-    "@(#) $Header: /tcpdump/master/libpcap/optimize.c,v 1.91 2008-01-02 04:16:46 guy Exp $ (LBL)";
-#endif

 
 #ifdef HAVE_CONFIG_H
 
 #ifdef HAVE_CONFIG_H

-#include "config.h"
+#include <config.h>

 #endif
 
 #endif
 

-#ifdef WIN32
-#include <pcap-stdinc.h>
-#else /* WIN32 */
-#if HAVE_INTTYPES_H
-#include <inttypes.h>
-#elif HAVE_STDINT_H
-#include <stdint.h>
-#endif
-#ifdef HAVE_SYS_BITYPES_H
-#include <sys/bitypes.h>
-#endif
-#include <sys/types.h>
-#endif /* WIN32 */
+#include <pcap-types.h>

 
 #include <stdio.h>
 #include <stdlib.h>
 #include <memory.h>
 
 #include <stdio.h>
 #include <stdlib.h>
 #include <memory.h>

+#include <setjmp.h>

 #include <string.h>
 
 #include <errno.h>
 #include <string.h>
 
 #include <errno.h>


@@ -53,22 +38,150 @@ static const char rcsid[] _U_ =
 #include "pcap-int.h"
 
 #include "gencode.h"
 #include "pcap-int.h"
 
 #include "gencode.h"

+#include "optimize.h"

 
 #ifdef HAVE_OS_PROTO_H
 #include "os-proto.h"
 #endif
 
 #ifdef BDEBUG
 
 #ifdef HAVE_OS_PROTO_H
 #include "os-proto.h"
 #endif
 
 #ifdef BDEBUG

-extern int dflag;
+/*
+ * The internal "debug printout" flag for the filter expression optimizer.
+ * The code to print that stuff is present only if BDEBUG is defined, so
+ * the flag, and the routine to set it, are defined only if BDEBUG is
+ * defined.
+ */
+static int pcap_optimizer_debug;
+
+/*
+ * Routine to set that flag.
+ *
+ * This is intended for libpcap developers, not for general use.
+ * If you want to set these in a program, you'll have to declare this
+ * routine yourself, with the appropriate DLL import attribute on Windows;
+ * it's not declared in any header file, and won't be declared in any
+ * header file provided by libpcap.
+ */
+PCAP_API void pcap_set_optimizer_debug(int value);
+
+PCAP_API_DEF void
+pcap_set_optimizer_debug(int value)
+{
+       pcap_optimizer_debug = value;
+}
+
+/*
+ * The internal "print dot graph" flag for the filter expression optimizer.
+ * The code to print that stuff is present only if BDEBUG is defined, so
+ * the flag, and the routine to set it, are defined only if BDEBUG is
+ * defined.
+ */
+static int pcap_print_dot_graph;
+
+/*
+ * Routine to set that flag.
+ *
+ * This is intended for libpcap developers, not for general use.
+ * If you want to set these in a program, you'll have to declare this
+ * routine yourself, with the appropriate DLL import attribute on Windows;
+ * it's not declared in any header file, and won't be declared in any
+ * header file provided by libpcap.
+ */
+PCAP_API void pcap_set_print_dot_graph(int value);
+
+PCAP_API_DEF void
+pcap_set_print_dot_graph(int value)
+{
+       pcap_print_dot_graph = value;
+}
+

 #endif
 
 #endif
 

-#if defined(MSDOS) && !defined(__DJGPP__)
-extern int _w32_ffs (int mask);
-#define ffs _w32_ffs
+/*
+ * lowest_set_bit().
+ *
+ * Takes a 32-bit integer as an argument.
+ *
+ * If handed a non-zero value, returns the index of the lowest set bit,
+ * counting upwards from zero.
+ *
+ * If handed zero, the results are platform- and compiler-dependent.
+ * Keep it out of the light, don't give it any water, don't feed it
+ * after midnight, and don't pass zero to it.
+ *
+ * This is the same as the count of trailing zeroes in the word.
+ */
+#if PCAP_IS_AT_LEAST_GNUC_VERSION(3,4)
+  /*
+   * GCC 3.4 and later; we have __builtin_ctz().
+   */
+  #define lowest_set_bit(mask) ((u_int)__builtin_ctz(mask))
+#elif defined(_MSC_VER)
+  /*
+   * Visual Studio; we support only 2005 and later, so use
+   * _BitScanForward().
+   */
+#include <intrin.h>
+
+#ifndef __clang__
+#pragma intrinsic(_BitScanForward)

 #endif
 
 #endif
 

-#if defined(WIN32) && defined (_MSC_VER)
-int ffs(int mask);
+static __forceinline u_int
+lowest_set_bit(int mask)
+{
+       unsigned long bit;
+
+       /*
+        * Don't sign-extend mask if long is longer than int.
+        * (It's currently not, in MSVC, even on 64-bit platforms, but....)
+        */
+       if (_BitScanForward(&bit, (unsigned int)mask) == 0)
+               abort();        /* mask is zero */
+       return (u_int)bit;
+}
+#elif defined(MSDOS) && defined(__DJGPP__)
+  /*
+   * MS-DOS with DJGPP, which declares ffs() in <string.h>, which
+   * we've already included.
+   */
+  #define lowest_set_bit(mask) ((u_int)(ffs((mask)) - 1))
+#elif (defined(MSDOS) && defined(__WATCOMC__)) || defined(STRINGS_H_DECLARES_FFS)
+  /*
+   * MS-DOS with Watcom C, which has <strings.h> and declares ffs() there,
+   * or some other platform (UN*X conforming to a sufficient recent version
+   * of the Single UNIX Specification).
+   */
+  #include <strings.h>
+  #define lowest_set_bit(mask) (u_int)((ffs((mask)) - 1))
+#else
+/*
+ * None of the above.
+ * Use a perfect-hash-function-based function.
+ */
+static u_int
+lowest_set_bit(int mask)
+{
+       unsigned int v = (unsigned int)mask;
+
+       static const u_int MultiplyDeBruijnBitPosition[32] = {
+               0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8,
+               31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9
+       };
+
+       /*
+        * We strip off all but the lowermost set bit (v & ~v),
+        * and perform a minimal perfect hash on it to look up the
+        * number of low-order zero bits in a table.
+        *
+        * See:
+        *
+        *      http://7ooo.mooo.com/text/ComputingTrailingZerosHOWTO.pdf
+        *
+        *      http://supertech.csail.mit.edu/papers/debruijn.pdf
+        */
+       return (MultiplyDeBruijnBitPosition[((v & -v) * 0x077CB531U) >> 27]);
+}

 #endif
 
 /*
 #endif
 
 /*


@@ -93,136 +206,208 @@ int ffs(int mask);
 #define AX_ATOM N_ATOMS
 
 /*
 #define AX_ATOM N_ATOMS
 
 /*

- * A flag to indicate that further optimization is needed.
- * Iterative passes are continued until a given pass yields no
- * branch movement.
+ * These data structures are used in a Cocke and Shwarz style
+ * value numbering scheme.  Since the flowgraph is acyclic,
+ * exit values can be propagated from a node's predecessors
+ * provided it is uniquely defined.

  */
  */

-static int done;
+struct valnode {
+       int code;
+       bpf_u_int32 v0, v1;
+       int val;                /* the value number */
+       struct valnode *next;
+};

 
 

-/*
- * A block is marked if only if its mark equals the current mark.
- * Rather than traverse the code array, marking each item, 'cur_mark' is
- * incremented.  This automatically makes each element unmarked.
- */
-static int cur_mark;
-#define isMarked(p) ((p)->mark == cur_mark)
-#define unMarkAll() cur_mark += 1
-#define Mark(p) ((p)->mark = cur_mark)
+/* Integer constants mapped with the load immediate opcode. */
+#define K(i) F(opt_state, BPF_LD|BPF_IMM|BPF_W, i, 0U)

 
 

-static void opt_init(struct block *);
-static void opt_cleanup(void);
+struct vmapinfo {
+       int is_const;
+       bpf_u_int32 const_val;
+};

 
 

-static void intern_blocks(struct block *);
+typedef struct {
+       /*
+        * Place to longjmp to on an error.
+        */
+       jmp_buf top_ctx;

 
 

-static void find_inedges(struct block *);
-#ifdef BDEBUG
-static void opt_dump(struct block *);
-#endif
+       /*
+        * The buffer into which to put error message.
+        */
+       char *errbuf;

 
 

-static int n_blocks;
-struct block **blocks;
-static int n_edges;
-struct edge **edges;
+       /*
+        * A flag to indicate that further optimization is needed.
+        * Iterative passes are continued until a given pass yields no
+        * code simplification or branch movement.
+        */
+       int done;
+
+       /*
+        * XXX - detect loops that do nothing but repeated AND/OR pullups
+        * and edge moves.
+        * If 100 passes in a row do nothing but that, treat that as a
+        * sign that we're in a loop that just shuffles in a cycle in
+        * which each pass just shuffles the code and we eventually
+        * get back to the original configuration.
+        *
+        * XXX - we need a non-heuristic way of detecting, or preventing,
+        * such a cycle.
+        */
+       int non_branch_movement_performed;
+
+       u_int n_blocks;         /* number of blocks in the CFG; guaranteed to be > 0, as it's a RET instruction at a minimum */
+       struct block **blocks;
+       u_int n_edges;          /* twice n_blocks, so guaranteed to be > 0 */
+       struct edge **edges;
+
+       /*
+        * A bit vector set representation of the dominators.
+        * We round up the set size to the next power of two.
+        */
+       u_int nodewords;        /* number of 32-bit words for a bit vector of "number of nodes" bits; guaranteed to be > 0 */
+       u_int edgewords;        /* number of 32-bit words for a bit vector of "number of edges" bits; guaranteed to be > 0 */
+       struct block **levels;
+       bpf_u_int32 *space;

 
 

-/*
- * A bit vector set representation of the dominators.
- * We round up the set size to the next power of two.
- */
-static int nodewords;
-static int edgewords;
-struct block **levels;
-bpf_u_int32 *space;

 #define BITS_PER_WORD (8*sizeof(bpf_u_int32))
 /*
  * True if a is in uset {p}
  */
 #define SET_MEMBER(p, a) \
 #define BITS_PER_WORD (8*sizeof(bpf_u_int32))
 /*
  * True if a is in uset {p}
  */
 #define SET_MEMBER(p, a) \

-((p)[(unsigned)(a) / BITS_PER_WORD] & (1 << ((unsigned)(a) % BITS_PER_WORD)))
+((p)[(unsigned)(a) / BITS_PER_WORD] & ((bpf_u_int32)1 << ((unsigned)(a) % BITS_PER_WORD)))

 
 /*
  * Add 'a' to uset p.
  */
 #define SET_INSERT(p, a) \
 
 /*
  * Add 'a' to uset p.
  */
 #define SET_INSERT(p, a) \

-(p)[(unsigned)(a) / BITS_PER_WORD] |= (1 << ((unsigned)(a) % BITS_PER_WORD))
+(p)[(unsigned)(a) / BITS_PER_WORD] |= ((bpf_u_int32)1 << ((unsigned)(a) % BITS_PER_WORD))

 
 /*
  * Delete 'a' from uset p.
  */
 #define SET_DELETE(p, a) \
 
 /*
  * Delete 'a' from uset p.
  */
 #define SET_DELETE(p, a) \

-(p)[(unsigned)(a) / BITS_PER_WORD] &= ~(1 << ((unsigned)(a) % BITS_PER_WORD))
+(p)[(unsigned)(a) / BITS_PER_WORD] &= ~((bpf_u_int32)1 << ((unsigned)(a) % BITS_PER_WORD))

 
 /*
  * a := a intersect b
 
 /*
  * a := a intersect b

+ * n must be guaranteed to be > 0

  */
 #define SET_INTERSECT(a, b, n)\
 {\
        register bpf_u_int32 *_x = a, *_y = b;\
  */
 #define SET_INTERSECT(a, b, n)\
 {\
        register bpf_u_int32 *_x = a, *_y = b;\

-       register int _n = n;\
-       while (--_n >= 0) *_x++ &= *_y++;\
+       register u_int _n = n;\
+       do *_x++ &= *_y++; while (--_n != 0);\

 }
 
 /*
  * a := a - b
 }
 
 /*
  * a := a - b

+ * n must be guaranteed to be > 0

  */
 #define SET_SUBTRACT(a, b, n)\
 {\
        register bpf_u_int32 *_x = a, *_y = b;\
  */
 #define SET_SUBTRACT(a, b, n)\
 {\
        register bpf_u_int32 *_x = a, *_y = b;\

-       register int _n = n;\
-       while (--_n >= 0) *_x++ &=~ *_y++;\
+       register u_int _n = n;\
+       do *_x++ &=~ *_y++; while (--_n != 0);\

 }
 
 /*
  * a := a union b
 }
 
 /*
  * a := a union b

+ * n must be guaranteed to be > 0

  */
 #define SET_UNION(a, b, n)\
 {\
        register bpf_u_int32 *_x = a, *_y = b;\
  */
 #define SET_UNION(a, b, n)\
 {\
        register bpf_u_int32 *_x = a, *_y = b;\

-       register int _n = n;\
-       while (--_n >= 0) *_x++ |= *_y++;\
+       register u_int _n = n;\
+       do *_x++ |= *_y++; while (--_n != 0);\

 }
 
 }
 

-static uset all_dom_sets;
-static uset all_closure_sets;
-static uset all_edge_sets;
+       uset all_dom_sets;
+       uset all_closure_sets;
+       uset all_edge_sets;
+
+#define MODULUS 213
+       struct valnode *hashtbl[MODULUS];
+       bpf_u_int32 curval;
+       bpf_u_int32 maxval;
+
+       struct vmapinfo *vmap;
+       struct valnode *vnode_base;
+       struct valnode *next_vnode;
+} opt_state_t;
+
+typedef struct {
+       /*
+        * Place to longjmp to on an error.
+        */
+       jmp_buf top_ctx;
+
+       /*
+        * The buffer into which to put error message.
+        */
+       char *errbuf;
+
+       /*
+        * Some pointers used to convert the basic block form of the code,
+        * into the array form that BPF requires.  'fstart' will point to
+        * the malloc'd array while 'ftail' is used during the recursive
+        * traversal.
+        */
+       struct bpf_insn *fstart;
+       struct bpf_insn *ftail;
+} conv_state_t;
+
+static void opt_init(opt_state_t *, struct icode *);
+static void opt_cleanup(opt_state_t *);
+static void PCAP_NORETURN opt_error(opt_state_t *, const char *, ...)
+    PCAP_PRINTFLIKE(2, 3);
+
+static void intern_blocks(opt_state_t *, struct icode *);
+
+static void find_inedges(opt_state_t *, struct block *);
+#ifdef BDEBUG
+static void opt_dump(opt_state_t *, struct icode *);
+#endif

 
 #ifndef MAX
 #define MAX(a,b) ((a)>(b)?(a):(b))
 #endif
 
 static void
 
 #ifndef MAX
 #define MAX(a,b) ((a)>(b)?(a):(b))
 #endif
 
 static void

-find_levels_r(struct block *b)
+find_levels_r(opt_state_t *opt_state, struct icode *ic, struct block *b)

 {
        int level;
 
 {
        int level;
 

-       if (isMarked(b))
+       if (isMarked(ic, b))

                return;
 
                return;
 

-       Mark(b);
+       Mark(ic, b);

        b->link = 0;
 
        if (JT(b)) {
        b->link = 0;
 
        if (JT(b)) {

-               find_levels_r(JT(b));
-               find_levels_r(JF(b));
+               find_levels_r(opt_state, ic, JT(b));
+               find_levels_r(opt_state, ic, JF(b));

                level = MAX(JT(b)->level, JF(b)->level) + 1;
        } else
                level = 0;
        b->level = level;
                level = MAX(JT(b)->level, JF(b)->level) + 1;
        } else
                level = 0;
        b->level = level;

-       b->link = levels[level];
-       levels[level] = b;
+       b->link = opt_state->levels[level];
+       opt_state->levels[level] = b;

 }
 
 /*
  * Level graph.  The levels go from 0 at the leaves to
 }
 
 /*
  * Level graph.  The levels go from 0 at the leaves to

- * N_LEVELS at the root.  The levels[] array points to the
+ * N_LEVELS at the root.  The opt_state->levels[] array points to the

  * first node of the level list, whose elements are linked
  * with the 'link' field of the struct block.
  */
 static void
  * first node of the level list, whose elements are linked
  * with the 'link' field of the struct block.
  */
 static void

-find_levels(struct block *root)
+find_levels(opt_state_t *opt_state, struct icode *ic)

 {
 {

-       memset((char *)levels, 0, n_blocks * sizeof(*levels));
-       unMarkAll();
-       find_levels_r(root);
+       memset((char *)opt_state->levels, 0, opt_state->n_blocks * sizeof(*opt_state->levels));
+       unMarkAll(ic);
+       find_levels_r(opt_state, ic, ic->root);

 }
 
 /*
 }
 
 /*


@@ -230,42 +415,50 @@ find_levels(struct block *root)
  * Assumes graph has been leveled.
  */
 static void
  * Assumes graph has been leveled.
  */
 static void

-find_dom(struct block *root)
+find_dom(opt_state_t *opt_state, struct block *root)

 {
 {

-       int i;
+       u_int i;
+       int level;

        struct block *b;
        bpf_u_int32 *x;
 
        /*
         * Initialize sets to contain all nodes.
         */
        struct block *b;
        bpf_u_int32 *x;
 
        /*
         * Initialize sets to contain all nodes.
         */

-       x = all_dom_sets;
-       i = n_blocks * nodewords;
-       while (--i >= 0)
-               *x++ = ~0;
+       x = opt_state->all_dom_sets;
+       /*
+        * In opt_init(), we've made sure the product doesn't overflow.
+        */
+       i = opt_state->n_blocks * opt_state->nodewords;
+       while (i != 0) {
+               --i;
+               *x++ = 0xFFFFFFFFU;
+       }

        /* Root starts off empty. */
        /* Root starts off empty. */

-       for (i = nodewords; --i >= 0;)
+       for (i = opt_state->nodewords; i != 0;) {
+               --i;

                root->dom[i] = 0;
                root->dom[i] = 0;

+       }

 
        /* root->level is the highest level no found. */
 
        /* root->level is the highest level no found. */

-       for (i = root->level; i >= 0; --i) {
-               for (b = levels[i]; b; b = b->link) {
+       for (level = root->level; level >= 0; --level) {
+               for (b = opt_state->levels[level]; b; b = b->link) {

                        SET_INSERT(b->dom, b->id);
                        if (JT(b) == 0)
                                continue;
                        SET_INSERT(b->dom, b->id);
                        if (JT(b) == 0)
                                continue;

-                       SET_INTERSECT(JT(b)->dom, b->dom, nodewords);
-                       SET_INTERSECT(JF(b)->dom, b->dom, nodewords);
+                       SET_INTERSECT(JT(b)->dom, b->dom, opt_state->nodewords);
+                       SET_INTERSECT(JF(b)->dom, b->dom, opt_state->nodewords);

                }
        }
 }
 
 static void
                }
        }
 }
 
 static void

-propedom(struct edge *ep)
+propedom(opt_state_t *opt_state, struct edge *ep)

 {
        SET_INSERT(ep->edom, ep->id);
        if (ep->succ) {
 {
        SET_INSERT(ep->edom, ep->id);
        if (ep->succ) {

-               SET_INTERSECT(ep->succ->et.edom, ep->edom, edgewords);
-               SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords);
+               SET_INTERSECT(ep->succ->et.edom, ep->edom, opt_state->edgewords);
+               SET_INTERSECT(ep->succ->ef.edom, ep->edom, opt_state->edgewords);

        }
 }
 
        }
 }
 


@@ -274,23 +467,29 @@ propedom(struct edge *ep)
  * Assumes graph has been leveled and predecessors established.
  */
 static void
  * Assumes graph has been leveled and predecessors established.
  */
 static void

-find_edom(struct block *root)
+find_edom(opt_state_t *opt_state, struct block *root)

 {
 {

-       int i;
+       u_int i;

        uset x;
        uset x;

+       int level;

        struct block *b;
 
        struct block *b;
 

-       x = all_edge_sets;
-       for (i = n_edges * edgewords; --i >= 0; )
-               x[i] = ~0;
+       x = opt_state->all_edge_sets;
+       /*
+        * In opt_init(), we've made sure the product doesn't overflow.
+        */
+       for (i = opt_state->n_edges * opt_state->edgewords; i != 0; ) {
+               --i;
+               x[i] = 0xFFFFFFFFU;
+       }

 
        /* root->level is the highest level no found. */
 
        /* root->level is the highest level no found. */

-       memset(root->et.edom, 0, edgewords * sizeof(*(uset)0));
-       memset(root->ef.edom, 0, edgewords * sizeof(*(uset)0));
-       for (i = root->level; i >= 0; --i) {
-               for (b = levels[i]; b != 0; b = b->link) {
-                       propedom(&b->et);
-                       propedom(&b->ef);
+       memset(root->et.edom, 0, opt_state->edgewords * sizeof(*(uset)0));
+       memset(root->ef.edom, 0, opt_state->edgewords * sizeof(*(uset)0));
+       for (level = root->level; level >= 0; --level) {
+               for (b = opt_state->levels[level]; b != 0; b = b->link) {
+                       propedom(opt_state, &b->et);
+                       propedom(opt_state, &b->ef);

                }
        }
 }
                }
        }
 }


@@ -303,32 +502,35 @@ find_edom(struct block *root)
  * Assumes graph has been leveled.
  */
 static void
  * Assumes graph has been leveled.
  */
 static void

-find_closure(struct block *root)
+find_closure(opt_state_t *opt_state, struct block *root)

 {
 {

-       int i;
+       int level;

        struct block *b;
 
        /*
         * Initialize sets to contain no nodes.
         */
        struct block *b;
 
        /*
         * Initialize sets to contain no nodes.
         */

-       memset((char *)all_closure_sets, 0,
-             n_blocks * nodewords * sizeof(*all_closure_sets));
+       memset((char *)opt_state->all_closure_sets, 0,
+             opt_state->n_blocks * opt_state->nodewords * sizeof(*opt_state->all_closure_sets));

 
        /* root->level is the highest level no found. */
 
        /* root->level is the highest level no found. */

-       for (i = root->level; i >= 0; --i) {
-               for (b = levels[i]; b; b = b->link) {
+       for (level = root->level; level >= 0; --level) {
+               for (b = opt_state->levels[level]; b; b = b->link) {

                        SET_INSERT(b->closure, b->id);
                        if (JT(b) == 0)
                                continue;
                        SET_INSERT(b->closure, b->id);
                        if (JT(b) == 0)
                                continue;

-                       SET_UNION(JT(b)->closure, b->closure, nodewords);
-                       SET_UNION(JF(b)->closure, b->closure, nodewords);
+                       SET_UNION(JT(b)->closure, b->closure, opt_state->nodewords);
+                       SET_UNION(JF(b)->closure, b->closure, opt_state->nodewords);

                }
        }
 }
 
 /*
                }
        }
 }
 
 /*

- * Return the register number that is used by s.  If A and X are both
- * used, return AX_ATOM.  If no register is used, return -1.
+ * Return the register number that is used by s.
+ *
+ * Returns ATOM_A if A is used, ATOM_X if X is used, AX_ATOM if both A and X
+ * are used, the scratch memory location's number if a scratch memory
+ * location is used (e.g., 0 for M[0]), or -1 if none of those are used.

  *
  * The implementation should probably change to an array access.
  */
  *
  * The implementation should probably change to an array access.
  */


@@ -348,8 +550,12 @@ atomuse(struct stmt *s)
 
        case BPF_LD:
        case BPF_LDX:
 
        case BPF_LD:
        case BPF_LDX:

+               /*
+                * As there are fewer than 2^31 memory locations,
+                * s->k should be convertable to int without problems.
+                */

                return (BPF_MODE(c) == BPF_IND) ? X_ATOM :
                return (BPF_MODE(c) == BPF_IND) ? X_ATOM :

-                       (BPF_MODE(c) == BPF_MEM) ? s->k : -1;
+                       (BPF_MODE(c) == BPF_MEM) ? (int)s->k : -1;

 
        case BPF_ST:
                return A_ATOM;
 
        case BPF_ST:
                return A_ATOM;


@@ -417,7 +623,7 @@ static void
 compute_local_ud(struct block *b)
 {
        struct slist *s;
 compute_local_ud(struct block *b)
 {
        struct slist *s;

-       atomset def = 0, use = 0, kill = 0;
+       atomset def = 0, use = 0, killed = 0;

        int atom;
 
        for (s = b->stmts; s; s = s->next) {
        int atom;
 
        for (s = b->stmts; s; s = s->next) {


@@ -441,7 +647,7 @@ compute_local_ud(struct block *b)
                atom = atomdef(&s->s);
                if (atom >= 0) {
                        if (!ATOMELEM(use, atom))
                atom = atomdef(&s->s);
                if (atom >= 0) {
                        if (!ATOMELEM(use, atom))

-                               kill |= ATOMMASK(atom);
+                               killed |= ATOMMASK(atom);

                        def |= ATOMMASK(atom);
                }
        }
                        def |= ATOMMASK(atom);
                }
        }


@@ -467,7 +673,7 @@ compute_local_ud(struct block *b)
        }
 
        b->def = def;
        }
 
        b->def = def;

-       b->kill = kill;
+       b->kill = killed;

        b->in_use = use;
 }
 
        b->in_use = use;
 }
 


@@ -475,7 +681,7 @@ compute_local_ud(struct block *b)
  * Assume graph is already leveled.
  */
 static void
  * Assume graph is already leveled.
  */
 static void

-find_ud(struct block *root)
+find_ud(opt_state_t *opt_state, struct block *root)

 {
        int i, maxlevel;
        struct block *p;
 {
        int i, maxlevel;
        struct block *p;


@@ -486,106 +692,98 @@ find_ud(struct block *root)
         */
        maxlevel = root->level;
        for (i = maxlevel; i >= 0; --i)
         */
        maxlevel = root->level;
        for (i = maxlevel; i >= 0; --i)

-               for (p = levels[i]; p; p = p->link) {
+               for (p = opt_state->levels[i]; p; p = p->link) {

                        compute_local_ud(p);
                        p->out_use = 0;
                }
 
        for (i = 1; i <= maxlevel; ++i) {
                        compute_local_ud(p);
                        p->out_use = 0;
                }
 
        for (i = 1; i <= maxlevel; ++i) {

-               for (p = levels[i]; p; p = p->link) {
+               for (p = opt_state->levels[i]; p; p = p->link) {

                        p->out_use |= JT(p)->in_use | JF(p)->in_use;
                        p->in_use |= p->out_use &~ p->kill;
                }
        }
 }
                        p->out_use |= JT(p)->in_use | JF(p)->in_use;
                        p->in_use |= p->out_use &~ p->kill;
                }
        }
 }

-
-/*
- * These data structures are used in a Cocke and Shwarz style
- * value numbering scheme.  Since the flowgraph is acyclic,
- * exit values can be propagated from a node's predecessors
- * provided it is uniquely defined.
- */
-struct valnode {
-       int code;
-       int v0, v1;
-       int val;
-       struct valnode *next;
-};
-
-#define MODULUS 213
-static struct valnode *hashtbl[MODULUS];
-static int curval;
-static int maxval;
-
-/* Integer constants mapped with the load immediate opcode. */
-#define K(i) F(BPF_LD|BPF_IMM|BPF_W, i, 0L)
-
-struct vmapinfo {
-       int is_const;
-       bpf_int32 const_val;
-};
-
-struct vmapinfo *vmap;
-struct valnode *vnode_base;
-struct valnode *next_vnode;
-

 static void
 static void

-init_val(void)
+init_val(opt_state_t *opt_state)

 {
 {

-       curval = 0;
-       next_vnode = vnode_base;
-       memset((char *)vmap, 0, maxval * sizeof(*vmap));
-       memset((char *)hashtbl, 0, sizeof hashtbl);
+       opt_state->curval = 0;
+       opt_state->next_vnode = opt_state->vnode_base;
+       memset((char *)opt_state->vmap, 0, opt_state->maxval * sizeof(*opt_state->vmap));
+       memset((char *)opt_state->hashtbl, 0, sizeof opt_state->hashtbl);

 }
 
 }
 

-/* Because we really don't have an IR, this stuff is a little messy. */
-static int
-F(int code, int v0, int v1)
+/*
+ * Because we really don't have an IR, this stuff is a little messy.
+ *
+ * This routine looks in the table of existing value number for a value
+ * with generated from an operation with the specified opcode and
+ * the specified values.  If it finds it, it returns its value number,
+ * otherwise it makes a new entry in the table and returns the
+ * value number of that entry.
+ */
+static bpf_u_int32
+F(opt_state_t *opt_state, int code, bpf_u_int32 v0, bpf_u_int32 v1)

 {
        u_int hash;
 {
        u_int hash;

-       int val;
+       bpf_u_int32 val;

        struct valnode *p;
 
        hash = (u_int)code ^ (v0 << 4) ^ (v1 << 8);
        hash %= MODULUS;
 
        struct valnode *p;
 
        hash = (u_int)code ^ (v0 << 4) ^ (v1 << 8);
        hash %= MODULUS;
 

-       for (p = hashtbl[hash]; p; p = p->next)
+       for (p = opt_state->hashtbl[hash]; p; p = p->next)

                if (p->code == code && p->v0 == v0 && p->v1 == v1)
                        return p->val;
 
                if (p->code == code && p->v0 == v0 && p->v1 == v1)
                        return p->val;
 

-       val = ++curval;
+       /*
+        * Not found.  Allocate a new value, and assign it a new
+        * value number.
+        *
+        * opt_state->curval starts out as 0, which means VAL_UNKNOWN; we
+        * increment it before using it as the new value number, which
+        * means we never assign VAL_UNKNOWN.
+        *
+        * XXX - unless we overflow, but we probably won't have 2^32-1
+        * values; we treat 32 bits as effectively infinite.
+        */
+       val = ++opt_state->curval;

        if (BPF_MODE(code) == BPF_IMM &&
            (BPF_CLASS(code) == BPF_LD || BPF_CLASS(code) == BPF_LDX)) {
        if (BPF_MODE(code) == BPF_IMM &&
            (BPF_CLASS(code) == BPF_LD || BPF_CLASS(code) == BPF_LDX)) {

-               vmap[val].const_val = v0;
-               vmap[val].is_const = 1;
+               opt_state->vmap[val].const_val = v0;
+               opt_state->vmap[val].is_const = 1;

        }
        }

-       p = next_vnode++;
+       p = opt_state->next_vnode++;

        p->val = val;
        p->code = code;
        p->v0 = v0;
        p->v1 = v1;
        p->val = val;
        p->code = code;
        p->v0 = v0;
        p->v1 = v1;

-       p->next = hashtbl[hash];
-       hashtbl[hash] = p;
+       p->next = opt_state->hashtbl[hash];
+       opt_state->hashtbl[hash] = p;

 
        return val;
 }
 
 static inline void
 
        return val;
 }
 
 static inline void

-vstore(struct stmt *s, int *valp, int newval, int alter)
+vstore(struct stmt *s, bpf_u_int32 *valp, bpf_u_int32 newval, int alter)

 {
 {

-       if (alter && *valp == newval)
+       if (alter && newval != VAL_UNKNOWN && *valp == newval)

                s->code = NOP;
        else
                *valp = newval;
 }
 
                s->code = NOP;
        else
                *valp = newval;
 }
 

+/*
+ * Do constant-folding on binary operators.
+ * (Unary operators are handled elsewhere.)
+ */

 static void
 static void

-fold_op(struct stmt *s, int v0, int v1)
+fold_op(opt_state_t *opt_state, struct stmt *s, bpf_u_int32 v0, bpf_u_int32 v1)

 {
        bpf_u_int32 a, b;
 
 {
        bpf_u_int32 a, b;
 

-       a = vmap[v0].const_val;
-       b = vmap[v1].const_val;
+       a = opt_state->vmap[v0].const_val;
+       b = opt_state->vmap[v1].const_val;

 
        switch (BPF_OP(s->code)) {
        case BPF_ADD:
 
        switch (BPF_OP(s->code)) {
        case BPF_ADD:


@@ -602,10 +800,16 @@ fold_op(struct stmt *s, int v0, int v1)
 
        case BPF_DIV:
                if (b == 0)
 
        case BPF_DIV:
                if (b == 0)

-                       bpf_error("division by zero");
+                       opt_error(opt_state, "division by zero");

                a /= b;
                break;
 
                a /= b;
                break;
 

+       case BPF_MOD:
+               if (b == 0)
+                       opt_error(opt_state, "modulus by zero");
+               a %= b;
+               break;
+

        case BPF_AND:
                a &= b;
                break;
        case BPF_AND:
                a &= b;
                break;


@@ -614,12 +818,44 @@ fold_op(struct stmt *s, int v0, int v1)
                a |= b;
                break;
 
                a |= b;
                break;
 

+       case BPF_XOR:
+               a ^= b;
+               break;
+

        case BPF_LSH:
        case BPF_LSH:

-               a <<= b;
+               /*
+                * A left shift of more than the width of the type
+                * is undefined in C; we'll just treat it as shifting
+                * all the bits out.
+                *
+                * XXX - the BPF interpreter doesn't check for this,
+                * so its behavior is dependent on the behavior of
+                * the processor on which it's running.  There are
+                * processors on which it shifts all the bits out
+                * and processors on which it does no shift.
+                */
+               if (b < 32)
+                       a <<= b;
+               else
+                       a = 0;

                break;
 
        case BPF_RSH:
                break;
 
        case BPF_RSH:

-               a >>= b;
+               /*
+                * A right shift of more than the width of the type
+                * is undefined in C; we'll just treat it as shifting
+                * all the bits out.
+                *
+                * XXX - the BPF interpreter doesn't check for this,
+                * so its behavior is dependent on the behavior of
+                * the processor on which it's running.  There are
+                * processors on which it shifts all the bits out
+                * and processors on which it does no shift.
+                */
+               if (b < 32)
+                       a >>= b;
+               else
+                       a = 0;

                break;
 
        default:
                break;
 
        default:


@@ -627,7 +863,11 @@ fold_op(struct stmt *s, int v0, int v1)
        }
        s->k = a;
        s->code = BPF_LD|BPF_IMM;
        }
        s->k = a;
        s->code = BPF_LD|BPF_IMM;

-       done = 0;
+       /*
+        * XXX - optimizer loop detection.
+        */
+       opt_state->non_branch_movement_performed = 1;
+       opt_state->done = 0;

 }
 
 static inline struct slist *
 }
 
 static inline struct slist *


@@ -648,11 +888,11 @@ opt_not(struct block *b)
 }
 
 static void
 }
 
 static void

-opt_peep(struct block *b)
+opt_peep(opt_state_t *opt_state, struct block *b)

 {
        struct slist *s;
        struct slist *next, *last;
 {
        struct slist *s;
        struct slist *next, *last;

-       int val;
+       bpf_u_int32 val;

 
        s = b->stmts;
        if (s == 0)
 
        s = b->stmts;
        if (s == 0)


@@ -683,7 +923,11 @@ opt_peep(struct block *b)
                if (s->s.code == BPF_ST &&
                    next->s.code == (BPF_LDX|BPF_MEM) &&
                    s->s.k == next->s.k) {
                if (s->s.code == BPF_ST &&
                    next->s.code == (BPF_LDX|BPF_MEM) &&
                    s->s.k == next->s.k) {

-                       done = 0;
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                        next->s.code = BPF_MISC|BPF_TAX;
                }
                /*
                        next->s.code = BPF_MISC|BPF_TAX;
                }
                /*


@@ -694,7 +938,11 @@ opt_peep(struct block *b)
                    next->s.code == (BPF_MISC|BPF_TAX)) {
                        s->s.code = BPF_LDX|BPF_IMM;
                        next->s.code = BPF_MISC|BPF_TXA;
                    next->s.code == (BPF_MISC|BPF_TAX)) {
                        s->s.code = BPF_LDX|BPF_IMM;
                        next->s.code = BPF_MISC|BPF_TXA;

-                       done = 0;
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                }
                /*
                 * This is an ugly special case, but it happens
                }
                /*
                 * This is an ugly special case, but it happens


@@ -773,7 +1021,11 @@ opt_peep(struct block *b)
                        s->s.code = NOP;
                        add->s.code = NOP;
                        tax->s.code = NOP;
                        s->s.code = NOP;
                        add->s.code = NOP;
                        tax->s.code = NOP;

-                       done = 0;
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                }
        }
        /*
                }
        }
        /*


@@ -785,13 +1037,13 @@ opt_peep(struct block *b)
         */
        if (b->s.code == (BPF_JMP|BPF_JEQ|BPF_K) &&
            !ATOMELEM(b->out_use, A_ATOM)) {
         */
        if (b->s.code == (BPF_JMP|BPF_JEQ|BPF_K) &&
            !ATOMELEM(b->out_use, A_ATOM)) {

-               /*
-                * We can optimize away certain subtractions of the
-                * X register.
-                */
+               /*
+                * We can optimize away certain subtractions of the
+                * X register.
+                */

                if (last->s.code == (BPF_ALU|BPF_SUB|BPF_X)) {
                        val = b->val[X_ATOM];
                if (last->s.code == (BPF_ALU|BPF_SUB|BPF_X)) {
                        val = b->val[X_ATOM];

-                       if (vmap[val].is_const) {
+                       if (opt_state->vmap[val].is_const) {

                                /*
                                 * If we have a subtract to do a comparison,
                                 * and the X register is a known constant,
                                /*
                                 * If we have a subtract to do a comparison,
                                 * and the X register is a known constant,


@@ -801,9 +1053,13 @@ opt_peep(struct block *b)
                                 * sub x  ->    nop
                                 * jeq #y       jeq #(x+y)
                                 */
                                 * sub x  ->    nop
                                 * jeq #y       jeq #(x+y)
                                 */

-                               b->s.k += vmap[val].const_val;
+                               b->s.k += opt_state->vmap[val].const_val;

                                last->s.code = NOP;
                                last->s.code = NOP;

-                               done = 0;
+                               /*
+                                * XXX - optimizer loop detection.
+                                */
+                               opt_state->non_branch_movement_performed = 1;
+                               opt_state->done = 0;

                        } else if (b->s.k == 0) {
                                /*
                                 * If the X register isn't a constant,
                        } else if (b->s.k == 0) {
                                /*
                                 * If the X register isn't a constant,


@@ -816,7 +1072,11 @@ opt_peep(struct block *b)
                                 */
                                last->s.code = NOP;
                                b->s.code = BPF_JMP|BPF_JEQ|BPF_X;
                                 */
                                last->s.code = NOP;
                                b->s.code = BPF_JMP|BPF_JEQ|BPF_X;

-                               done = 0;
+                               /*
+                                * XXX - optimizer loop detection.
+                                */
+                               opt_state->non_branch_movement_performed = 1;
+                               opt_state->done = 0;

                        }
                }
                /*
                        }
                }
                /*


@@ -828,7 +1088,11 @@ opt_peep(struct block *b)
                else if (last->s.code == (BPF_ALU|BPF_SUB|BPF_K)) {
                        last->s.code = NOP;
                        b->s.k += last->s.k;
                else if (last->s.code == (BPF_ALU|BPF_SUB|BPF_K)) {
                        last->s.code = NOP;
                        b->s.k += last->s.k;

-                       done = 0;
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                }
                /*
                 * And, similarly, a constant AND can be simplified
                }
                /*
                 * And, similarly, a constant AND can be simplified


@@ -842,7 +1106,11 @@ opt_peep(struct block *b)
                        b->s.k = last->s.k;
                        b->s.code = BPF_JMP|BPF_K|BPF_JSET;
                        last->s.code = NOP;
                        b->s.k = last->s.k;
                        b->s.code = BPF_JMP|BPF_K|BPF_JSET;
                        last->s.code = NOP;

-                       done = 0;
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                        opt_not(b);
                }
        }
                        opt_not(b);
                }
        }


@@ -853,7 +1121,7 @@ opt_peep(struct block *b)
        if (b->s.code == (BPF_JMP|BPF_K|BPF_JSET)) {
                if (b->s.k == 0)
                        JT(b) = JF(b);
        if (b->s.code == (BPF_JMP|BPF_K|BPF_JSET)) {
                if (b->s.k == 0)
                        JT(b) = JF(b);

-               if (b->s.k == 0xffffffff)
+               if (b->s.k == 0xffffffffU)

                        JF(b) = JT(b);
        }
        /*
                        JF(b) = JT(b);
        }
        /*


@@ -862,8 +1130,8 @@ opt_peep(struct block *b)
         * constant.
         */
        val = b->val[X_ATOM];
         * constant.
         */
        val = b->val[X_ATOM];

-       if (vmap[val].is_const && BPF_SRC(b->s.code) == BPF_X) {
-               bpf_int32 v = vmap[val].const_val;
+       if (opt_state->vmap[val].is_const && BPF_SRC(b->s.code) == BPF_X) {
+               bpf_u_int32 v = opt_state->vmap[val].const_val;

                b->s.code &= ~BPF_X;
                b->s.k = v;
        }
                b->s.code &= ~BPF_X;
                b->s.k = v;
        }


@@ -872,8 +1140,8 @@ opt_peep(struct block *b)
         * comparison result.
         */
        val = b->val[A_ATOM];
         * comparison result.
         */
        val = b->val[A_ATOM];

-       if (vmap[val].is_const && BPF_SRC(b->s.code) == BPF_K) {
-               bpf_int32 v = vmap[val].const_val;
+       if (opt_state->vmap[val].is_const && BPF_SRC(b->s.code) == BPF_K) {
+               bpf_u_int32 v = opt_state->vmap[val].const_val;

                switch (BPF_OP(b->s.code)) {
 
                case BPF_JEQ:
                switch (BPF_OP(b->s.code)) {
 
                case BPF_JEQ:


@@ -881,11 +1149,11 @@ opt_peep(struct block *b)
                        break;
 
                case BPF_JGT:
                        break;
 
                case BPF_JGT:

-                       v = (unsigned)v > b->s.k;
+                       v = v > b->s.k;

                        break;
 
                case BPF_JGE:
                        break;
 
                case BPF_JGE:

-                       v = (unsigned)v >= b->s.k;
+                       v = v >= b->s.k;

                        break;
 
                case BPF_JSET:
                        break;
 
                case BPF_JSET:


@@ -895,8 +1163,13 @@ opt_peep(struct block *b)
                default:
                        abort();
                }
                default:
                        abort();
                }

-               if (JF(b) != JT(b))
-                       done = 0;
+               if (JF(b) != JT(b)) {
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;
+               }

                if (v)
                        JF(b) = JT(b);
                else
                if (v)
                        JF(b) = JT(b);
                else


@@ -911,17 +1184,17 @@ opt_peep(struct block *b)
  * evaluation and code transformations weren't folded together.
  */
 static void
  * evaluation and code transformations weren't folded together.
  */
 static void

-opt_stmt(struct stmt *s, int val[], int alter)
+opt_stmt(opt_state_t *opt_state, struct stmt *s, bpf_u_int32 val[], int alter)

 {
        int op;
 {
        int op;

-       int v;
+       bpf_u_int32 v;

 
        switch (s->code) {
 
        case BPF_LD|BPF_ABS|BPF_W:
        case BPF_LD|BPF_ABS|BPF_H:
        case BPF_LD|BPF_ABS|BPF_B:
 
        switch (s->code) {
 
        case BPF_LD|BPF_ABS|BPF_W:
        case BPF_LD|BPF_ABS|BPF_H:
        case BPF_LD|BPF_ABS|BPF_B:

-               v = F(s->code, s->k, 0L);
+               v = F(opt_state, s->code, s->k, 0L);

                vstore(s, &val[A_ATOM], v, alter);
                break;
 
                vstore(s, &val[A_ATOM], v, alter);
                break;
 


@@ -929,19 +1202,23 @@ opt_stmt(struct stmt *s, int val[], int alter)
        case BPF_LD|BPF_IND|BPF_H:
        case BPF_LD|BPF_IND|BPF_B:
                v = val[X_ATOM];
        case BPF_LD|BPF_IND|BPF_H:
        case BPF_LD|BPF_IND|BPF_B:
                v = val[X_ATOM];

-               if (alter && vmap[v].is_const) {
+               if (alter && opt_state->vmap[v].is_const) {

                        s->code = BPF_LD|BPF_ABS|BPF_SIZE(s->code);
                        s->code = BPF_LD|BPF_ABS|BPF_SIZE(s->code);

-                       s->k += vmap[v].const_val;
-                       v = F(s->code, s->k, 0L);
-                       done = 0;
+                       s->k += opt_state->vmap[v].const_val;
+                       v = F(opt_state, s->code, s->k, 0L);
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                }
                else
                }
                else

-                       v = F(s->code, s->k, v);
+                       v = F(opt_state, s->code, s->k, v);

                vstore(s, &val[A_ATOM], v, alter);
                break;
 
        case BPF_LD|BPF_LEN:
                vstore(s, &val[A_ATOM], v, alter);
                break;
 
        case BPF_LD|BPF_LEN:

-               v = F(s->code, 0L, 0L);
+               v = F(opt_state, s->code, 0L, 0L);

                vstore(s, &val[A_ATOM], v, alter);
                break;
 
                vstore(s, &val[A_ATOM], v, alter);
                break;
 


@@ -956,37 +1233,63 @@ opt_stmt(struct stmt *s, int val[], int alter)
                break;
 
        case BPF_LDX|BPF_MSH|BPF_B:
                break;
 
        case BPF_LDX|BPF_MSH|BPF_B:

-               v = F(s->code, s->k, 0L);
+               v = F(opt_state, s->code, s->k, 0L);

                vstore(s, &val[X_ATOM], v, alter);
                break;
 
        case BPF_ALU|BPF_NEG:
                vstore(s, &val[X_ATOM], v, alter);
                break;
 
        case BPF_ALU|BPF_NEG:

-               if (alter && vmap[val[A_ATOM]].is_const) {
+               if (alter && opt_state->vmap[val[A_ATOM]].is_const) {

                        s->code = BPF_LD|BPF_IMM;
                        s->code = BPF_LD|BPF_IMM;

-                       s->k = -vmap[val[A_ATOM]].const_val;
+                       /*
+                        * Do this negation as unsigned arithmetic; that's
+                        * what modern BPF engines do, and it guarantees
+                        * that all possible values can be negated.  (Yeah,
+                        * negating 0x80000000, the minimum signed 32-bit
+                        * two's-complement value, results in 0x80000000,
+                        * so it's still negative, but we *should* be doing
+                        * all unsigned arithmetic here, to match what
+                        * modern BPF engines do.)
+                        *
+                        * Express it as 0U - (unsigned value) so that we
+                        * don't get compiler warnings about negating an
+                        * unsigned value and don't get UBSan warnings
+                        * about the result of negating 0x80000000 being
+                        * undefined.
+                        */
+                       s->k = 0U - opt_state->vmap[val[A_ATOM]].const_val;

                        val[A_ATOM] = K(s->k);
                }
                else
                        val[A_ATOM] = K(s->k);
                }
                else

-                       val[A_ATOM] = F(s->code, val[A_ATOM], 0L);
+                       val[A_ATOM] = F(opt_state, s->code, val[A_ATOM], 0L);

                break;
 
        case BPF_ALU|BPF_ADD|BPF_K:
        case BPF_ALU|BPF_SUB|BPF_K:
        case BPF_ALU|BPF_MUL|BPF_K:
        case BPF_ALU|BPF_DIV|BPF_K:
                break;
 
        case BPF_ALU|BPF_ADD|BPF_K:
        case BPF_ALU|BPF_SUB|BPF_K:
        case BPF_ALU|BPF_MUL|BPF_K:
        case BPF_ALU|BPF_DIV|BPF_K:

+       case BPF_ALU|BPF_MOD|BPF_K:

        case BPF_ALU|BPF_AND|BPF_K:
        case BPF_ALU|BPF_OR|BPF_K:
        case BPF_ALU|BPF_AND|BPF_K:
        case BPF_ALU|BPF_OR|BPF_K:

+       case BPF_ALU|BPF_XOR|BPF_K:

        case BPF_ALU|BPF_LSH|BPF_K:
        case BPF_ALU|BPF_RSH|BPF_K:
                op = BPF_OP(s->code);
                if (alter) {
                        if (s->k == 0) {
        case BPF_ALU|BPF_LSH|BPF_K:
        case BPF_ALU|BPF_RSH|BPF_K:
                op = BPF_OP(s->code);
                if (alter) {
                        if (s->k == 0) {

-                               /* don't optimize away "sub #0"
+                               /*
+                                * Optimize operations where the constant
+                                * is zero.
+                                *
+                                * Don't optimize away "sub #0"

                                 * as it may be needed later to
                                 * as it may be needed later to

-                                * fixup the generated math code */
+                                * fixup the generated math code.
+                                *
+                                * Fail if we're dividing by zero or taking
+                                * a modulus by zero.
+                                */

                                if (op == BPF_ADD ||
                                    op == BPF_LSH || op == BPF_RSH ||
                                if (op == BPF_ADD ||
                                    op == BPF_LSH || op == BPF_RSH ||

-                                   op == BPF_OR) {
+                                   op == BPF_OR || op == BPF_XOR) {

                                        s->code = NOP;
                                        break;
                                }
                                        s->code = NOP;
                                        break;
                                }


@@ -995,36 +1298,52 @@ opt_stmt(struct stmt *s, int val[], int alter)
                                        val[A_ATOM] = K(s->k);
                                        break;
                                }
                                        val[A_ATOM] = K(s->k);
                                        break;
                                }

+                               if (op == BPF_DIV)
+                                       opt_error(opt_state,
+                                           "division by zero");
+                               if (op == BPF_MOD)
+                                       opt_error(opt_state,
+                                           "modulus by zero");

                        }
                        }

-                       if (vmap[val[A_ATOM]].is_const) {
-                               fold_op(s, val[A_ATOM], K(s->k));
+                       if (opt_state->vmap[val[A_ATOM]].is_const) {
+                               fold_op(opt_state, s, val[A_ATOM], K(s->k));

                                val[A_ATOM] = K(s->k);
                                break;
                        }
                }
                                val[A_ATOM] = K(s->k);
                                break;
                        }
                }

-               val[A_ATOM] = F(s->code, val[A_ATOM], K(s->k));
+               val[A_ATOM] = F(opt_state, s->code, val[A_ATOM], K(s->k));

                break;
 
        case BPF_ALU|BPF_ADD|BPF_X:
        case BPF_ALU|BPF_SUB|BPF_X:
        case BPF_ALU|BPF_MUL|BPF_X:
        case BPF_ALU|BPF_DIV|BPF_X:
                break;
 
        case BPF_ALU|BPF_ADD|BPF_X:
        case BPF_ALU|BPF_SUB|BPF_X:
        case BPF_ALU|BPF_MUL|BPF_X:
        case BPF_ALU|BPF_DIV|BPF_X:

+       case BPF_ALU|BPF_MOD|BPF_X:

        case BPF_ALU|BPF_AND|BPF_X:
        case BPF_ALU|BPF_OR|BPF_X:
        case BPF_ALU|BPF_AND|BPF_X:
        case BPF_ALU|BPF_OR|BPF_X:

+       case BPF_ALU|BPF_XOR|BPF_X:

        case BPF_ALU|BPF_LSH|BPF_X:
        case BPF_ALU|BPF_RSH|BPF_X:
                op = BPF_OP(s->code);
        case BPF_ALU|BPF_LSH|BPF_X:
        case BPF_ALU|BPF_RSH|BPF_X:
                op = BPF_OP(s->code);

-               if (alter && vmap[val[X_ATOM]].is_const) {
-                       if (vmap[val[A_ATOM]].is_const) {
-                               fold_op(s, val[A_ATOM], val[X_ATOM]);
+               if (alter && opt_state->vmap[val[X_ATOM]].is_const) {
+                       if (opt_state->vmap[val[A_ATOM]].is_const) {
+                               fold_op(opt_state, s, val[A_ATOM], val[X_ATOM]);

                                val[A_ATOM] = K(s->k);
                        }
                        else {
                                s->code = BPF_ALU|BPF_K|op;
                                val[A_ATOM] = K(s->k);
                        }
                        else {
                                s->code = BPF_ALU|BPF_K|op;

-                               s->k = vmap[val[X_ATOM]].const_val;
-                               done = 0;
+                               s->k = opt_state->vmap[val[X_ATOM]].const_val;
+                               if ((op == BPF_LSH || op == BPF_RSH) &&
+                                   s->k > 31)
+                                       opt_error(opt_state,
+                                           "shift by more than 31 bits");
+                               /*
+                                * XXX - optimizer loop detection.
+                                */
+                               opt_state->non_branch_movement_performed = 1;
+                               opt_state->done = 0;

                                val[A_ATOM] =
                                val[A_ATOM] =

-                                       F(s->code, val[A_ATOM], K(s->k));
+                                       F(opt_state, s->code, val[A_ATOM], K(s->k));

                        }
                        break;
                }
                        }
                        break;
                }


@@ -1035,14 +1354,14 @@ opt_stmt(struct stmt *s, int val[], int alter)
                 * optimizations.
                 * XXX We could also check for mul by 1, etc.
                 */
                 * optimizations.
                 * XXX We could also check for mul by 1, etc.
                 */

-               if (alter && vmap[val[A_ATOM]].is_const
-                   && vmap[val[A_ATOM]].const_val == 0) {
-                       if (op == BPF_ADD || op == BPF_OR) {
+               if (alter && opt_state->vmap[val[A_ATOM]].is_const
+                   && opt_state->vmap[val[A_ATOM]].const_val == 0) {
+                       if (op == BPF_ADD || op == BPF_OR || op == BPF_XOR) {

                                s->code = BPF_MISC|BPF_TXA;
                                vstore(s, &val[A_ATOM], val[X_ATOM], alter);
                                break;
                        }
                                s->code = BPF_MISC|BPF_TXA;
                                vstore(s, &val[A_ATOM], val[X_ATOM], alter);
                                break;
                        }

-                       else if (op == BPF_MUL || op == BPF_DIV ||
+                       else if (op == BPF_MUL || op == BPF_DIV || op == BPF_MOD ||

                                 op == BPF_AND || op == BPF_LSH || op == BPF_RSH) {
                                s->code = BPF_LD|BPF_IMM;
                                s->k = 0;
                                 op == BPF_AND || op == BPF_LSH || op == BPF_RSH) {
                                s->code = BPF_LD|BPF_IMM;
                                s->k = 0;


@@ -1054,7 +1373,7 @@ opt_stmt(struct stmt *s, int val[], int alter)
                                break;
                        }
                }
                                break;
                        }
                }

-               val[A_ATOM] = F(s->code, val[A_ATOM], val[X_ATOM]);
+               val[A_ATOM] = F(opt_state, s->code, val[A_ATOM], val[X_ATOM]);

                break;
 
        case BPF_MISC|BPF_TXA:
                break;
 
        case BPF_MISC|BPF_TXA:


@@ -1063,10 +1382,14 @@ opt_stmt(struct stmt *s, int val[], int alter)
 
        case BPF_LD|BPF_MEM:
                v = val[s->k];
 
        case BPF_LD|BPF_MEM:
                v = val[s->k];

-               if (alter && vmap[v].is_const) {
+               if (alter && opt_state->vmap[v].is_const) {

                        s->code = BPF_LD|BPF_IMM;
                        s->code = BPF_LD|BPF_IMM;

-                       s->k = vmap[v].const_val;
-                       done = 0;
+                       s->k = opt_state->vmap[v].const_val;
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                }
                vstore(s, &val[A_ATOM], v, alter);
                break;
                }
                vstore(s, &val[A_ATOM], v, alter);
                break;


@@ -1077,10 +1400,14 @@ opt_stmt(struct stmt *s, int val[], int alter)
 
        case BPF_LDX|BPF_MEM:
                v = val[s->k];
 
        case BPF_LDX|BPF_MEM:
                v = val[s->k];

-               if (alter && vmap[v].is_const) {
+               if (alter && opt_state->vmap[v].is_const) {

                        s->code = BPF_LDX|BPF_IMM;
                        s->code = BPF_LDX|BPF_IMM;

-                       s->k = vmap[v].const_val;
-                       done = 0;
+                       s->k = opt_state->vmap[v].const_val;
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                }
                vstore(s, &val[X_ATOM], v, alter);
                break;
                }
                vstore(s, &val[X_ATOM], v, alter);
                break;


@@ -1096,7 +1423,7 @@ opt_stmt(struct stmt *s, int val[], int alter)
 }
 
 static void
 }
 
 static void

-deadstmt(register struct stmt *s, register struct stmt *last[])
+deadstmt(opt_state_t *opt_state, register struct stmt *s, register struct stmt *last[])

 {
        register int atom;
 
 {
        register int atom;
 


@@ -1112,7 +1439,11 @@ deadstmt(register struct stmt *s, register struct stmt *last[])
        atom = atomdef(s);
        if (atom >= 0) {
                if (last[atom]) {
        atom = atomdef(s);
        if (atom >= 0) {
                if (last[atom]) {

-                       done = 0;
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                        last[atom]->code = NOP;
                }
                last[atom] = s;
                        last[atom]->code = NOP;
                }
                last[atom] = s;


@@ -1120,7 +1451,7 @@ deadstmt(register struct stmt *s, register struct stmt *last[])
 }
 
 static void
 }
 
 static void

-opt_deadstores(register struct block *b)
+opt_deadstores(opt_state_t *opt_state, register struct block *b)

 {
        register struct slist *s;
        register int atom;
 {
        register struct slist *s;
        register int atom;


@@ -1129,23 +1460,27 @@ opt_deadstores(register struct block *b)
        memset((char *)last, 0, sizeof last);
 
        for (s = b->stmts; s != 0; s = s->next)
        memset((char *)last, 0, sizeof last);
 
        for (s = b->stmts; s != 0; s = s->next)

-               deadstmt(&s->s, last);
-       deadstmt(&b->s, last);
+               deadstmt(opt_state, &s->s, last);
+       deadstmt(opt_state, &b->s, last);

 
        for (atom = 0; atom < N_ATOMS; ++atom)
                if (last[atom] && !ATOMELEM(b->out_use, atom)) {
                        last[atom]->code = NOP;
 
        for (atom = 0; atom < N_ATOMS; ++atom)
                if (last[atom] && !ATOMELEM(b->out_use, atom)) {
                        last[atom]->code = NOP;

-                       done = 0;
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                }
 }
 
 static void
                }
 }
 
 static void

-opt_blk(struct block *b, int do_stmts)
+opt_blk(opt_state_t *opt_state, struct block *b, int do_stmts)

 {
        struct slist *s;
        struct edge *p;
        int i;
 {
        struct slist *s;
        struct edge *p;
        int i;

-       bpf_int32 aval, xval;
+       bpf_u_int32 aval, xval;

 
 #if 0
        for (s = b->stmts; s && s->next; s = s->next)
 
 #if 0
        for (s = b->stmts; s && s->next; s = s->next)


@@ -1190,7 +1525,7 @@ opt_blk(struct block *b, int do_stmts)
        aval = b->val[A_ATOM];
        xval = b->val[X_ATOM];
        for (s = b->stmts; s; s = s->next)
        aval = b->val[A_ATOM];
        xval = b->val[X_ATOM];
        for (s = b->stmts; s; s = s->next)

-               opt_stmt(&s->s, b->val, do_stmts);
+               opt_stmt(opt_state, &s->s, b->val, do_stmts);

 
        /*
         * This is a special case: if we don't use anything from this
 
        /*
         * This is a special case: if we don't use anything from this


@@ -1198,7 +1533,10 @@ opt_blk(struct block *b, int do_stmts)
         * value that is already there, or if this block is a return,
         * eliminate all the statements.
         *
         * value that is already there, or if this block is a return,
         * eliminate all the statements.
         *

-        * XXX - what if it does a store?
+        * XXX - what if it does a store?  Presumably that falls under
+        * the heading of "if we don't use anything from this block",
+        * i.e., if we use any memory location set to a different
+        * value by this block, then we use something from this block.

         *
         * XXX - why does it matter whether we use anything from this
         * block?  If the accumulator or index register doesn't change
         *
         * XXX - why does it matter whether we use anything from this
         * block?  If the accumulator or index register doesn't change


@@ -1216,16 +1554,21 @@ opt_blk(struct block *b, int do_stmts)
         * block, can we eliminate it?
         */
        if (do_stmts &&
         * block, can we eliminate it?
         */
        if (do_stmts &&

-           ((b->out_use == 0 && aval != 0 && b->val[A_ATOM] == aval &&
-             xval != 0 && b->val[X_ATOM] == xval) ||
+           ((b->out_use == 0 &&
+             aval != VAL_UNKNOWN && b->val[A_ATOM] == aval &&
+             xval != VAL_UNKNOWN && b->val[X_ATOM] == xval) ||

             BPF_CLASS(b->s.code) == BPF_RET)) {
                if (b->stmts != 0) {
                        b->stmts = 0;
             BPF_CLASS(b->s.code) == BPF_RET)) {
                if (b->stmts != 0) {
                        b->stmts = 0;

-                       done = 0;
+                       /*
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                }
        } else {
                }
        } else {

-               opt_peep(b);
-               opt_deadstores(b);
+               opt_peep(opt_state, b);
+               opt_deadstores(opt_state, b);

        }
        /*
         * Set up values for branch optimizer.
        }
        /*
         * Set up values for branch optimizer.


@@ -1259,19 +1602,41 @@ use_conflict(struct block *b, struct block *succ)
        return 0;
 }
 
        return 0;
 }
 

+/*
+ * Given a block that is the successor of an edge, and an edge that
+ * dominates that edge, return either a pointer to a child of that
+ * block (a block to which that block jumps) if that block is a
+ * candidate to replace the successor of the latter edge or NULL
+ * if neither of the children of the first block are candidates.
+ */

 static struct block *
 fold_edge(struct block *child, struct edge *ep)
 {
        int sense;
 static struct block *
 fold_edge(struct block *child, struct edge *ep)
 {
        int sense;

-       int aval0, aval1, oval0, oval1;
+       bpf_u_int32 aval0, aval1, oval0, oval1;

        int code = ep->code;
 
        if (code < 0) {
        int code = ep->code;
 
        if (code < 0) {

+               /*
+                * This edge is a "branch if false" edge.
+                */

                code = -code;
                sense = 0;
                code = -code;
                sense = 0;

-       } else
+       } else {
+               /*
+                * This edge is a "branch if true" edge.
+                */

                sense = 1;
                sense = 1;

+       }

 
 

+       /*
+        * If the opcode for the branch at the end of the block we
+        * were handed isn't the same as the opcode for the branch
+        * to which the edge we were handed corresponds, the tests
+        * for those branches aren't testing the same conditions,
+        * so the blocks to which the first block branches aren't
+        * candidates to replace the successor of the edge.
+        */

        if (child->s.code != code)
                return 0;
 
        if (child->s.code != code)
                return 0;
 


@@ -1280,13 +1645,21 @@ fold_edge(struct block *child, struct edge *ep)
        aval1 = ep->pred->val[A_ATOM];
        oval1 = ep->pred->oval;
 
        aval1 = ep->pred->val[A_ATOM];
        oval1 = ep->pred->oval;
 

+       /*
+        * If the A register value on exit from the successor block
+        * isn't the same as the A register value on exit from the
+        * predecessor of the edge, the blocks to which the first
+        * block branches aren't candidates to replace the successor
+        * of the edge.
+        */

        if (aval0 != aval1)
                return 0;
 
        if (oval0 == oval1)
                /*
                 * The operands of the branch instructions are
        if (aval0 != aval1)
                return 0;
 
        if (oval0 == oval1)
                /*
                 * The operands of the branch instructions are

-                * identical, so the result is true if a true
+                * identical, so the branches are testing the
+                * same condition, and the result is true if a true

                 * branch was taken to get here, otherwise false.
                 */
                return sense ? JT(child) : JF(child);
                 * branch was taken to get here, otherwise false.
                 */
                return sense ? JT(child) : JF(child);


@@ -1311,22 +1684,59 @@ fold_edge(struct block *child, struct edge *ep)
        return 0;
 }
 
        return 0;
 }
 

+/*
+ * If we can make this edge go directly to a child of the edge's current
+ * successor, do so.
+ */

 static void
 static void

-opt_j(struct edge *ep)
+opt_j(opt_state_t *opt_state, struct edge *ep)

 {
 {

-       register int i, k;
+       register u_int i, k;

        register struct block *target;
 
        register struct block *target;
 

+       /*
+        * Does this edge go to a block where, if the test
+        * at the end of it succeeds, it goes to a block
+        * that's a leaf node of the DAG, i.e. a return
+        * statement?
+        * If so, there's nothing to optimize.
+        */

        if (JT(ep->succ) == 0)
                return;
 
        if (JT(ep->succ) == 0)
                return;
 

+       /*
+        * Does this edge go to a block that goes, in turn, to
+        * the same block regardless of whether the test at the
+        * end succeeds or fails?
+        */

        if (JT(ep->succ) == JF(ep->succ)) {
                /*
                 * Common branch targets can be eliminated, provided
                 * there is no data dependency.
        if (JT(ep->succ) == JF(ep->succ)) {
                /*
                 * Common branch targets can be eliminated, provided
                 * there is no data dependency.

+                *
+                * Check whether any register used on exit from the
+                * block to which the successor of this edge goes
+                * has a value at that point that's different from
+                * the value it has on exit from the predecessor of
+                * this edge.  If not, the predecessor of this edge
+                * can just go to the block to which the successor
+                * of this edge goes, bypassing the successor of this
+                * edge, as the successor of this edge isn't doing
+                * any calculations whose results are different
+                * from what the blocks before it did and isn't
+                * doing any tests the results of which matter.

                 */
                 */

-               if (!use_conflict(ep->pred, ep->succ->et.succ)) {
-                       done = 0;
+               if (!use_conflict(ep->pred, JT(ep->succ))) {
+                       /*
+                        * No, there isn't.
+                        * Make this edge go to the block to
+                        * which the successor of that edge
+                        * goes.
+                        *
+                        * XXX - optimizer loop detection.
+                        */
+                       opt_state->non_branch_movement_performed = 1;
+                       opt_state->done = 0;

                        ep->succ = JT(ep->succ);
                }
        }
                        ep->succ = JT(ep->succ);
                }
        }


@@ -1338,21 +1748,40 @@ opt_j(struct edge *ep)
         * efficient loop.
         */
  top:
         * efficient loop.
         */
  top:

-       for (i = 0; i < edgewords; ++i) {
+       for (i = 0; i < opt_state->edgewords; ++i) {
+               /* i'th word in the bitset of dominators */

                register bpf_u_int32 x = ep->edom[i];
 
                while (x != 0) {
                register bpf_u_int32 x = ep->edom[i];
 
                while (x != 0) {

-                       k = ffs(x) - 1;
-                       x &=~ (1 << k);
+                       /* Find the next dominator in that word and mark it as found */
+                       k = lowest_set_bit(x);
+                       x &=~ ((bpf_u_int32)1 << k);

                        k += i * BITS_PER_WORD;
 
                        k += i * BITS_PER_WORD;
 

-                       target = fold_edge(ep->succ, edges[k]);
+                       target = fold_edge(ep->succ, opt_state->edges[k]);

                        /*
                        /*

+                        * We have a candidate to replace the successor
+                        * of ep.
+                        *

                         * Check that there is no data dependency between
                         * Check that there is no data dependency between

-                        * nodes that will be violated if we move the edge.
+                        * nodes that will be violated if we move the edge;
+                        * i.e., if any register used on exit from the
+                        * candidate has a value at that point different
+                        * from the value it has when we exit the
+                        * predecessor of that edge, there's a data
+                        * dependency that will be violated.

                         */
                        if (target != 0 && !use_conflict(ep->pred, target)) {
                         */
                        if (target != 0 && !use_conflict(ep->pred, target)) {

-                               done = 0;
+                               /*
+                                * It's safe to replace the successor of
+                                * ep; do so, and note that we've made
+                                * at least one change.
+                                *
+                                * XXX - this is one of the operations that
+                                * happens when the optimizer gets into
+                                * one of those infinite loops.
+                                */
+                               opt_state->done = 0;

                                ep->succ = target;
                                if (JT(target) != 0)
                                        /*
                                ep->succ = target;
                                if (JT(target) != 0)
                                        /*


@@ -1365,11 +1794,30 @@ opt_j(struct edge *ep)
        }
 }
 
        }
 }
 

-
+/*
+ * XXX - is this, and and_pullup(), what's described in section 6.1.2
+ * "Predicate Assertion Propagation" in the BPF+ paper?
+ *
+ * Note that this looks at block dominators, not edge dominators.
+ * Don't think so.
+ *
+ * "A or B" compiles into
+ *
+ *          A
+ *       t / \ f
+ *        /   B
+ *       / t / \ f
+ *      \   /
+ *       \ /
+ *        X
+ *
+ *
+ */

 static void
 static void

-or_pullup(struct block *b)
+or_pullup(opt_state_t *opt_state, struct block *b)

 {
 {

-       int val, at_top;
+       bpf_u_int32 val;
+       int at_top;

        struct block *pull;
        struct block **diffp, **samep;
        struct edge *ep;
        struct block *pull;
        struct block **diffp, **samep;
        struct edge *ep;


@@ -1387,39 +1835,106 @@ or_pullup(struct block *b)
                if (val != ep->pred->val[A_ATOM])
                        return;
 
                if (val != ep->pred->val[A_ATOM])
                        return;
 

+       /*
+        * For the first edge in the list of edges coming into this block,
+        * see whether the predecessor of that edge comes here via a true
+        * branch or a false branch.
+        */

        if (JT(b->in_edges->pred) == b)
        if (JT(b->in_edges->pred) == b)

-               diffp = &JT(b->in_edges->pred);
+               diffp = &JT(b->in_edges->pred); /* jt */

        else
        else

-               diffp = &JF(b->in_edges->pred);
+               diffp = &JF(b->in_edges->pred); /* jf */

 
 

+       /*
+        * diffp is a pointer to a pointer to the block.
+        *
+        * Go down the false chain looking as far as you can,
+        * making sure that each jump-compare is doing the
+        * same as the original block.
+        *
+        * If you reach the bottom before you reach a
+        * different jump-compare, just exit.  There's nothing
+        * to do here.  XXX - no, this version is checking for
+        * the value leaving the block; that's from the BPF+
+        * pullup routine.
+        */

        at_top = 1;
        at_top = 1;

-       while (1) {
+       for (;;) {
+               /*
+                * Done if that's not going anywhere XXX
+                */

                if (*diffp == 0)
                        return;
 
                if (*diffp == 0)
                        return;
 

+               /*
+                * Done if that predecessor blah blah blah isn't
+                * going the same place we're going XXX
+                *
+                * Does the true edge of this block point to the same
+                * location as the true edge of b?
+                */

                if (JT(*diffp) != JT(b))
                        return;
 
                if (JT(*diffp) != JT(b))
                        return;
 

+               /*
+                * Done if this node isn't a dominator of that
+                * node blah blah blah XXX
+                *
+                * Does b dominate diffp?
+                */

                if (!SET_MEMBER((*diffp)->dom, b->id))
                        return;
 
                if (!SET_MEMBER((*diffp)->dom, b->id))
                        return;
 

+               /*
+                * Break out of the loop if that node's value of A
+                * isn't the value of A above XXX
+                */

                if ((*diffp)->val[A_ATOM] != val)
                        break;
 
                if ((*diffp)->val[A_ATOM] != val)
                        break;
 

+               /*
+                * Get the JF for that node XXX
+                * Go down the false path.
+                */

                diffp = &JF(*diffp);
                at_top = 0;
        }
                diffp = &JF(*diffp);
                at_top = 0;
        }

+
+       /*
+        * Now that we've found a different jump-compare in a chain
+        * below b, search further down until we find another
+        * jump-compare that looks at the original value.  This
+        * jump-compare should get pulled up.  XXX again we're
+        * comparing values not jump-compares.
+        */

        samep = &JF(*diffp);
        samep = &JF(*diffp);

-       while (1) {
+       for (;;) {
+               /*
+                * Done if that's not going anywhere XXX
+                */

                if (*samep == 0)
                        return;
 
                if (*samep == 0)
                        return;
 

+               /*
+                * Done if that predecessor blah blah blah isn't
+                * going the same place we're going XXX
+                */

                if (JT(*samep) != JT(b))
                        return;
 
                if (JT(*samep) != JT(b))
                        return;
 

+               /*
+                * Done if this node isn't a dominator of that
+                * node blah blah blah XXX
+                *
+                * Does b dominate samep?
+                */

                if (!SET_MEMBER((*samep)->dom, b->id))
                        return;
 
                if (!SET_MEMBER((*samep)->dom, b->id))
                        return;
 

+               /*
+                * Break out of the loop if that node's value of A
+                * is the value of A above XXX
+                */

                if ((*samep)->val[A_ATOM] == val)
                        break;
 
                if ((*samep)->val[A_ATOM] == val)
                        break;
 


@@ -1455,13 +1970,18 @@ or_pullup(struct block *b)
        else
                *diffp = pull;
 
        else
                *diffp = pull;
 

-       done = 0;
+       /*
+        * XXX - this is one of the operations that happens when the
+        * optimizer gets into one of those infinite loops.
+        */
+       opt_state->done = 0;

 }
 
 static void
 }
 
 static void

-and_pullup(struct block *b)
+and_pullup(opt_state_t *opt_state, struct block *b)

 {
 {

-       int val, at_top;
+       bpf_u_int32 val;
+       int at_top;

        struct block *pull;
        struct block **diffp, **samep;
        struct edge *ep;
        struct block *pull;
        struct block **diffp, **samep;
        struct edge *ep;


@@ -1484,7 +2004,7 @@ and_pullup(struct block *b)
                diffp = &JF(b->in_edges->pred);
 
        at_top = 1;
                diffp = &JF(b->in_edges->pred);
 
        at_top = 1;

-       while (1) {
+       for (;;) {

                if (*diffp == 0)
                        return;
 
                if (*diffp == 0)
                        return;
 


@@ -1501,7 +2021,7 @@ and_pullup(struct block *b)
                at_top = 0;
        }
        samep = &JT(*diffp);
                at_top = 0;
        }
        samep = &JT(*diffp);

-       while (1) {
+       for (;;) {

                if (*samep == 0)
                        return;
 
                if (*samep == 0)
                        return;
 


@@ -1546,42 +2066,59 @@ and_pullup(struct block *b)
        else
                *diffp = pull;
 
        else
                *diffp = pull;
 

-       done = 0;
+       /*
+        * XXX - this is one of the operations that happens when the
+        * optimizer gets into one of those infinite loops.
+        */
+       opt_state->done = 0;

 }
 
 static void
 }
 
 static void

-opt_blks(struct block *root, int do_stmts)
+opt_blks(opt_state_t *opt_state, struct icode *ic, int do_stmts)

 {
        int i, maxlevel;
        struct block *p;
 
 {
        int i, maxlevel;
        struct block *p;
 

-       init_val();
-       maxlevel = root->level;
+       init_val(opt_state);
+       maxlevel = ic->root->level;

 
 

-       find_inedges(root);
+       find_inedges(opt_state, ic->root);

        for (i = maxlevel; i >= 0; --i)
        for (i = maxlevel; i >= 0; --i)

-               for (p = levels[i]; p; p = p->link)
-                       opt_blk(p, do_stmts);
+               for (p = opt_state->levels[i]; p; p = p->link)
+                       opt_blk(opt_state, p, do_stmts);

 
        if (do_stmts)
                /*
                 * No point trying to move branches; it can't possibly
                 * make a difference at this point.
 
        if (do_stmts)
                /*
                 * No point trying to move branches; it can't possibly
                 * make a difference at this point.

+                *
+                * XXX - this might be after we detect a loop where
+                * we were just looping infinitely moving branches
+                * in such a fashion that we went through two or more
+                * versions of the machine code, eventually returning
+                * to the first version.  (We're really not doing a
+                * full loop detection, we're just testing for two
+                * passes in a row where where we do nothing but
+                * move branches.)

                 */
                return;
 
                 */
                return;
 

+       /*
+        * Is this what the BPF+ paper describes in sections 6.1.1,
+        * 6.1.2, and 6.1.3?
+        */

        for (i = 1; i <= maxlevel; ++i) {
        for (i = 1; i <= maxlevel; ++i) {

-               for (p = levels[i]; p; p = p->link) {
-                       opt_j(&p->et);
-                       opt_j(&p->ef);
+               for (p = opt_state->levels[i]; p; p = p->link) {
+                       opt_j(opt_state, &p->et);
+                       opt_j(opt_state, &p->ef);

                }
        }
 
                }
        }
 

-       find_inedges(root);
+       find_inedges(opt_state, ic->root);

        for (i = 1; i <= maxlevel; ++i) {
        for (i = 1; i <= maxlevel; ++i) {

-               for (p = levels[i]; p; p = p->link) {
-                       or_pullup(p);
-                       and_pullup(p);
+               for (p = opt_state->levels[i]; p; p = p->link) {
+                       or_pullup(opt_state, p);
+                       and_pullup(opt_state, p);

                }
        }
 }
                }
        }
 }


@@ -1594,20 +2131,21 @@ link_inedge(struct edge *parent, struct block *child)
 }
 
 static void
 }
 
 static void

-find_inedges(struct block *root)
+find_inedges(opt_state_t *opt_state, struct block *root)

 {
 {

-       int i;
+       u_int i;
+       int level;

        struct block *b;
 
        struct block *b;
 

-       for (i = 0; i < n_blocks; ++i)
-               blocks[i]->in_edges = 0;
+       for (i = 0; i < opt_state->n_blocks; ++i)
+               opt_state->blocks[i]->in_edges = 0;

 
        /*
         * Traverse the graph, adding each edge to the predecessor
         * list of its successors.  Skip the leaves (i.e. level 0).
         */
 
        /*
         * Traverse the graph, adding each edge to the predecessor
         * list of its successors.  Skip the leaves (i.e. level 0).
         */

-       for (i = root->level; i > 0; --i) {
-               for (b = levels[i]; b != 0; b = b->link) {
+       for (level = root->level; level > 0; --level) {
+               for (b = opt_state->levels[level]; b != 0; b = b->link) {

                        link_inedge(&b->et, JT(b));
                        link_inedge(&b->ef, JF(b));
                }
                        link_inedge(&b->et, JT(b));
                        link_inedge(&b->ef, JF(b));
                }


@@ -1639,83 +2177,143 @@ opt_root(struct block **b)
 }
 
 static void
 }
 
 static void

-opt_loop(struct block *root, int do_stmts)
+opt_loop(opt_state_t *opt_state, struct icode *ic, int do_stmts)

 {
 
 #ifdef BDEBUG
 {
 
 #ifdef BDEBUG

-       if (dflag > 1) {
+       if (pcap_optimizer_debug > 1 || pcap_print_dot_graph) {

                printf("opt_loop(root, %d) begin\n", do_stmts);
                printf("opt_loop(root, %d) begin\n", do_stmts);

-               opt_dump(root);
+               opt_dump(opt_state, ic);

        }
 #endif
        }
 #endif

-       do {
-               done = 1;
-               find_levels(root);
-               find_dom(root);
-               find_closure(root);
-               find_ud(root);
-               find_edom(root);
-               opt_blks(root, do_stmts);
+
+       /*
+        * XXX - optimizer loop detection.
+        */
+       int loop_count = 0;
+       for (;;) {
+               opt_state->done = 1;
+               /*
+                * XXX - optimizer loop detection.
+                */
+               opt_state->non_branch_movement_performed = 0;
+               find_levels(opt_state, ic);
+               find_dom(opt_state, ic->root);
+               find_closure(opt_state, ic->root);
+               find_ud(opt_state, ic->root);
+               find_edom(opt_state, ic->root);
+               opt_blks(opt_state, ic, do_stmts);

 #ifdef BDEBUG
 #ifdef BDEBUG

-               if (dflag > 1) {
-                       printf("opt_loop(root, %d) bottom, done=%d\n", do_stmts, done);
-                       opt_dump(root);
+               if (pcap_optimizer_debug > 1 || pcap_print_dot_graph) {
+                       printf("opt_loop(root, %d) bottom, done=%d\n", do_stmts, opt_state->done);
+                       opt_dump(opt_state, ic);

                }
 #endif
                }
 #endif

-       } while (!done);
+
+               /*
+                * Was anything done in this optimizer pass?
+                */
+               if (opt_state->done) {
+                       /*
+                        * No, so we've reached a fixed point.
+                        * We're done.
+                        */
+                       break;
+               }
+
+               /*
+                * XXX - was anything done other than branch movement
+                * in this pass?
+                */
+               if (opt_state->non_branch_movement_performed) {
+                       /*
+                        * Yes.  Clear any loop-detection counter;
+                        * we're making some form of progress (assuming
+                        * we can't get into a cycle doing *other*
+                        * optimizations...).
+                        */
+                       loop_count = 0;
+               } else {
+                       /*
+                        * No - increment the counter, and quit if
+                        * it's up to 100.
+                        */
+                       loop_count++;
+                       if (loop_count >= 100) {
+                               /*
+                                * We've done nothing but branch movement
+                                * for 100 passes; we're probably
+                                * in a cycle and will never reach a
+                                * fixed point.
+                                *
+                                * XXX - yes, we really need a non-
+                                * heuristic way of detecting a cycle.
+                                */
+                               opt_state->done = 1;
+                               break;
+                       }
+               }
+       }

 }
 
 /*
  * Optimize the filter code in its dag representation.
 }
 
 /*
  * Optimize the filter code in its dag representation.

+ * Return 0 on success, -1 on error.

  */
  */

-void
-bpf_optimize(struct block **rootp)
+int
+bpf_optimize(struct icode *ic, char *errbuf)

 {
 {

-       struct block *root;
-
-       root = *rootp;
+       opt_state_t opt_state;

 
 

-       opt_init(root);
-       opt_loop(root, 0);
-       opt_loop(root, 1);
-       intern_blocks(root);
+       memset(&opt_state, 0, sizeof(opt_state));
+       opt_state.errbuf = errbuf;
+       opt_state.non_branch_movement_performed = 0;
+       if (setjmp(opt_state.top_ctx)) {
+               opt_cleanup(&opt_state);
+               return -1;
+       }
+       opt_init(&opt_state, ic);
+       opt_loop(&opt_state, ic, 0);
+       opt_loop(&opt_state, ic, 1);
+       intern_blocks(&opt_state, ic);

 #ifdef BDEBUG
 #ifdef BDEBUG

-       if (dflag > 1) {
+       if (pcap_optimizer_debug > 1 || pcap_print_dot_graph) {

                printf("after intern_blocks()\n");
                printf("after intern_blocks()\n");

-               opt_dump(root);
+               opt_dump(&opt_state, ic);

        }
 #endif
        }
 #endif

-       opt_root(rootp);
+       opt_root(&ic->root);

 #ifdef BDEBUG
 #ifdef BDEBUG

-       if (dflag > 1) {
+       if (pcap_optimizer_debug > 1 || pcap_print_dot_graph) {

                printf("after opt_root()\n");
                printf("after opt_root()\n");

-               opt_dump(root);
+               opt_dump(&opt_state, ic);

        }
 #endif
        }
 #endif

-       opt_cleanup();
+       opt_cleanup(&opt_state);
+       return 0;

 }
 
 static void
 }
 
 static void

-make_marks(struct block *p)
+make_marks(struct icode *ic, struct block *p)

 {
 {

-       if (!isMarked(p)) {
-               Mark(p);
+       if (!isMarked(ic, p)) {
+               Mark(ic, p);

                if (BPF_CLASS(p->s.code) != BPF_RET) {
                if (BPF_CLASS(p->s.code) != BPF_RET) {

-                       make_marks(JT(p));
-                       make_marks(JF(p));
+                       make_marks(ic, JT(p));
+                       make_marks(ic, JF(p));

                }
        }
 }
 
 /*
                }
        }
 }
 
 /*

- * Mark code array such that isMarked(i) is true
+ * Mark code array such that isMarked(ic->cur_mark, i) is true

  * only for nodes that are alive.
  */
 static void
  * only for nodes that are alive.
  */
 static void

-mark_code(struct block *p)
+mark_code(struct icode *ic)

 {
 {

-       cur_mark += 1;
-       make_marks(p);
+       ic->cur_mark += 1;
+       make_marks(ic, ic->root);

 }
 
 /*
 }
 
 /*


@@ -1725,7 +2323,7 @@ mark_code(struct block *p)
 static int
 eq_slist(struct slist *x, struct slist *y)
 {
 static int
 eq_slist(struct slist *x, struct slist *y)
 {

-       while (1) {
+       for (;;) {

                while (x && x->s.code == NOP)
                        x = x->next;
                while (y && y->s.code == NOP)
                while (x && x->s.code == NOP)
                        x = x->next;
                while (y && y->s.code == NOP)


@@ -1753,33 +2351,34 @@ eq_blk(struct block *b0, struct block *b1)
 }
 
 static void
 }
 
 static void

-intern_blocks(struct block *root)
+intern_blocks(opt_state_t *opt_state, struct icode *ic)

 {
        struct block *p;
 {
        struct block *p;

-       int i, j;
+       u_int i, j;

        int done1; /* don't shadow global */
  top:
        done1 = 1;
        int done1; /* don't shadow global */
  top:
        done1 = 1;

-       for (i = 0; i < n_blocks; ++i)
-               blocks[i]->link = 0;
+       for (i = 0; i < opt_state->n_blocks; ++i)
+               opt_state->blocks[i]->link = 0;

 
 

-       mark_code(root);
+       mark_code(ic);

 
 

-       for (i = n_blocks - 1; --i >= 0; ) {
-               if (!isMarked(blocks[i]))
+       for (i = opt_state->n_blocks - 1; i != 0; ) {
+               --i;
+               if (!isMarked(ic, opt_state->blocks[i]))

                        continue;
                        continue;

-               for (j = i + 1; j < n_blocks; ++j) {
-                       if (!isMarked(blocks[j]))
+               for (j = i + 1; j < opt_state->n_blocks; ++j) {
+                       if (!isMarked(ic, opt_state->blocks[j]))

                                continue;
                                continue;

-                       if (eq_blk(blocks[i], blocks[j])) {
-                               blocks[i]->link = blocks[j]->link ?
-                                       blocks[j]->link : blocks[j];
+                       if (eq_blk(opt_state->blocks[i], opt_state->blocks[j])) {
+                               opt_state->blocks[i]->link = opt_state->blocks[j]->link ?
+                                       opt_state->blocks[j]->link : opt_state->blocks[j];

                                break;
                        }
                }
        }
                                break;
                        }
                }
        }

-       for (i = 0; i < n_blocks; ++i) {
-               p = blocks[i];
+       for (i = 0; i < opt_state->n_blocks; ++i) {
+               p = opt_state->blocks[i];

                if (JT(p) == 0)
                        continue;
                if (JT(p)->link) {
                if (JT(p) == 0)
                        continue;
                if (JT(p)->link) {


@@ -1796,14 +2395,32 @@ intern_blocks(struct block *root)
 }
 
 static void
 }
 
 static void

-opt_cleanup(void)
+opt_cleanup(opt_state_t *opt_state)

 {
 {

-       free((void *)vnode_base);
-       free((void *)vmap);
-       free((void *)edges);
-       free((void *)space);
-       free((void *)levels);
-       free((void *)blocks);
+       free((void *)opt_state->vnode_base);
+       free((void *)opt_state->vmap);
+       free((void *)opt_state->edges);
+       free((void *)opt_state->space);
+       free((void *)opt_state->levels);
+       free((void *)opt_state->blocks);
+}
+
+/*
+ * For optimizer errors.
+ */
+static void PCAP_NORETURN
+opt_error(opt_state_t *opt_state, const char *fmt, ...)
+{
+       va_list ap;
+
+       if (opt_state->errbuf != NULL) {
+               va_start(ap, fmt);
+               (void)vsnprintf(opt_state->errbuf,
+                   PCAP_ERRBUF_SIZE, fmt, ap);
+               va_end(ap);
+       }
+       longjmp(opt_state->top_ctx, 1);
+       /* NOTREACHED */

 }
 
 /*
 }
 
 /*


@@ -1825,12 +2442,12 @@ slength(struct slist *s)
  * All nodes should be initially unmarked.
  */
 static int
  * All nodes should be initially unmarked.
  */
 static int

-count_blocks(struct block *p)
+count_blocks(struct icode *ic, struct block *p)

 {
 {

-       if (p == 0 || isMarked(p))
+       if (p == 0 || isMarked(ic, p))

                return 0;
                return 0;

-       Mark(p);
-       return count_blocks(JT(p)) + count_blocks(JF(p)) + 1;
+       Mark(ic, p);
+       return count_blocks(ic, JT(p)) + count_blocks(ic, JF(p)) + 1;

 }
 
 /*
 }
 
 /*


@@ -1838,20 +2455,26 @@ count_blocks(struct block *p)
  * the basic blocks, and entering them into the 'blocks' array.`
  */
 static void
  * the basic blocks, and entering them into the 'blocks' array.`
  */
 static void

-number_blks_r(struct block *p)
+number_blks_r(opt_state_t *opt_state, struct icode *ic, struct block *p)

 {
 {

-       int n;
+       u_int n;

 
 

-       if (p == 0 || isMarked(p))
+       if (p == 0 || isMarked(ic, p))

                return;
 
                return;
 

-       Mark(p);
-       n = n_blocks++;
+       Mark(ic, p);
+       n = opt_state->n_blocks++;
+       if (opt_state->n_blocks == 0) {
+               /*
+                * Overflow.
+                */
+               opt_error(opt_state, "filter is too complex to optimize");
+       }

        p->id = n;
        p->id = n;

-       blocks[n] = p;
+       opt_state->blocks[n] = p;

 
 

-       number_blks_r(JT(p));
-       number_blks_r(JF(p));
+       number_blks_r(opt_state, ic, JT(p));
+       number_blks_r(opt_state, ic, JF(p));

 }
 
 /*
 }
 
 /*


@@ -1873,14 +2496,14 @@ number_blks_r(struct block *p)
  *     an extra long jump if the false branch requires it (p->longjf).
  */
 static u_int
  *     an extra long jump if the false branch requires it (p->longjf).
  */
 static u_int

-count_stmts(struct block *p)
+count_stmts(struct icode *ic, struct block *p)

 {
        u_int n;
 
 {
        u_int n;
 

-       if (p == 0 || isMarked(p))
+       if (p == 0 || isMarked(ic, p))

                return 0;
                return 0;

-       Mark(p);
-       n = count_stmts(JT(p)) + count_stmts(JF(p));
+       Mark(ic, p);
+       n = count_stmts(ic, JT(p)) + count_stmts(ic, JF(p));

        return slength(p->stmts) + n + 1 + p->longjt + p->longjf;
 }
 
        return slength(p->stmts) + n + 1 + p->longjt + p->longjf;
 }
 


@@ -1890,97 +2513,168 @@ count_stmts(struct block *p)
  * from the total number of blocks and/or statements.
  */
 static void
  * from the total number of blocks and/or statements.
  */
 static void

-opt_init(struct block *root)
+opt_init(opt_state_t *opt_state, struct icode *ic)

 {
        bpf_u_int32 *p;
        int i, n, max_stmts;
 {
        bpf_u_int32 *p;
        int i, n, max_stmts;

+       u_int product;
+       size_t block_memsize, edge_memsize;

 
        /*
         * First, count the blocks, so we can malloc an array to map
         * block number to block.  Then, put the blocks into the array.
         */
 
        /*
         * First, count the blocks, so we can malloc an array to map
         * block number to block.  Then, put the blocks into the array.
         */

-       unMarkAll();
-       n = count_blocks(root);
-       blocks = (struct block **)calloc(n, sizeof(*blocks));
-       if (blocks == NULL)
-               bpf_error("malloc");
-       unMarkAll();
-       n_blocks = 0;
-       number_blks_r(root);
-
-       n_edges = 2 * n_blocks;
-       edges = (struct edge **)calloc(n_edges, sizeof(*edges));
-       if (edges == NULL)
-               bpf_error("malloc");
+       unMarkAll(ic);
+       n = count_blocks(ic, ic->root);
+       opt_state->blocks = (struct block **)calloc(n, sizeof(*opt_state->blocks));
+       if (opt_state->blocks == NULL)
+               opt_error(opt_state, "malloc");
+       unMarkAll(ic);
+       opt_state->n_blocks = 0;
+       number_blks_r(opt_state, ic, ic->root);
+
+       /*
+        * This "should not happen".
+        */
+       if (opt_state->n_blocks == 0)
+               opt_error(opt_state, "filter has no instructions; please report this as a libpcap issue");
+
+       opt_state->n_edges = 2 * opt_state->n_blocks;
+       if ((opt_state->n_edges / 2) != opt_state->n_blocks) {
+               /*
+                * Overflow.
+                */
+               opt_error(opt_state, "filter is too complex to optimize");
+       }
+       opt_state->edges = (struct edge **)calloc(opt_state->n_edges, sizeof(*opt_state->edges));
+       if (opt_state->edges == NULL) {
+               opt_error(opt_state, "malloc");
+       }

 
        /*
         * The number of levels is bounded by the number of nodes.
         */
 
        /*
         * The number of levels is bounded by the number of nodes.
         */

-       levels = (struct block **)calloc(n_blocks, sizeof(*levels));
-       if (levels == NULL)
-               bpf_error("malloc");
+       opt_state->levels = (struct block **)calloc(opt_state->n_blocks, sizeof(*opt_state->levels));
+       if (opt_state->levels == NULL) {
+               opt_error(opt_state, "malloc");
+       }

 
 

-       edgewords = n_edges / (8 * sizeof(bpf_u_int32)) + 1;
-       nodewords = n_blocks / (8 * sizeof(bpf_u_int32)) + 1;
+       opt_state->edgewords = opt_state->n_edges / BITS_PER_WORD + 1;
+       opt_state->nodewords = opt_state->n_blocks / BITS_PER_WORD + 1;
+
+       /*
+        * Make sure opt_state->n_blocks * opt_state->nodewords fits
+        * in a u_int; we use it as a u_int number-of-iterations
+        * value.
+        */
+       product = opt_state->n_blocks * opt_state->nodewords;
+       if ((product / opt_state->n_blocks) != opt_state->nodewords) {
+               /*
+                * XXX - just punt and don't try to optimize?
+                * In practice, this is unlikely to happen with
+                * a normal filter.
+                */
+               opt_error(opt_state, "filter is too complex to optimize");
+       }
+
+       /*
+        * Make sure the total memory required for that doesn't
+        * overflow.
+        */
+       block_memsize = (size_t)2 * product * sizeof(*opt_state->space);
+       if ((block_memsize / product) != 2 * sizeof(*opt_state->space)) {
+               opt_error(opt_state, "filter is too complex to optimize");
+       }
+
+       /*
+        * Make sure opt_state->n_edges * opt_state->edgewords fits
+        * in a u_int; we use it as a u_int number-of-iterations
+        * value.
+        */
+       product = opt_state->n_edges * opt_state->edgewords;
+       if ((product / opt_state->n_edges) != opt_state->edgewords) {
+               opt_error(opt_state, "filter is too complex to optimize");
+       }
+
+       /*
+        * Make sure the total memory required for that doesn't
+        * overflow.
+        */
+       edge_memsize = (size_t)product * sizeof(*opt_state->space);
+       if (edge_memsize / product != sizeof(*opt_state->space)) {
+               opt_error(opt_state, "filter is too complex to optimize");
+       }
+
+       /*
+        * Make sure the total memory required for both of them dosn't
+        * overflow.
+        */
+       if (block_memsize > SIZE_MAX - edge_memsize) {
+               opt_error(opt_state, "filter is too complex to optimize");
+       }

 
        /* XXX */
 
        /* XXX */

-       space = (bpf_u_int32 *)malloc(2 * n_blocks * nodewords * sizeof(*space)
-                                + n_edges * edgewords * sizeof(*space));
-       if (space == NULL)
-               bpf_error("malloc");
-       p = space;
-       all_dom_sets = p;
+       opt_state->space = (bpf_u_int32 *)malloc(block_memsize + edge_memsize);
+       if (opt_state->space == NULL) {
+               opt_error(opt_state, "malloc");
+       }
+       p = opt_state->space;
+       opt_state->all_dom_sets = p;

        for (i = 0; i < n; ++i) {
        for (i = 0; i < n; ++i) {

-               blocks[i]->dom = p;
-               p += nodewords;
+               opt_state->blocks[i]->dom = p;
+               p += opt_state->nodewords;

        }
        }

-       all_closure_sets = p;
+       opt_state->all_closure_sets = p;

        for (i = 0; i < n; ++i) {
        for (i = 0; i < n; ++i) {

-               blocks[i]->closure = p;
-               p += nodewords;
+               opt_state->blocks[i]->closure = p;
+               p += opt_state->nodewords;

        }
        }

-       all_edge_sets = p;
+       opt_state->all_edge_sets = p;

        for (i = 0; i < n; ++i) {
        for (i = 0; i < n; ++i) {

-               register struct block *b = blocks[i];
+               register struct block *b = opt_state->blocks[i];

 
                b->et.edom = p;
 
                b->et.edom = p;

-               p += edgewords;
+               p += opt_state->edgewords;

                b->ef.edom = p;
                b->ef.edom = p;

-               p += edgewords;
+               p += opt_state->edgewords;

                b->et.id = i;
                b->et.id = i;

-               edges[i] = &b->et;
-               b->ef.id = n_blocks + i;
-               edges[n_blocks + i] = &b->ef;
+               opt_state->edges[i] = &b->et;
+               b->ef.id = opt_state->n_blocks + i;
+               opt_state->edges[opt_state->n_blocks + i] = &b->ef;

                b->et.pred = b;
                b->ef.pred = b;
        }
        max_stmts = 0;
        for (i = 0; i < n; ++i)
                b->et.pred = b;
                b->ef.pred = b;
        }
        max_stmts = 0;
        for (i = 0; i < n; ++i)

-               max_stmts += slength(blocks[i]->stmts) + 1;
+               max_stmts += slength(opt_state->blocks[i]->stmts) + 1;

        /*
         * We allocate at most 3 value numbers per statement,
         * so this is an upper bound on the number of valnodes
         * we'll need.
         */
        /*
         * We allocate at most 3 value numbers per statement,
         * so this is an upper bound on the number of valnodes
         * we'll need.
         */

-       maxval = 3 * max_stmts;
-       vmap = (struct vmapinfo *)calloc(maxval, sizeof(*vmap));
-       vnode_base = (struct valnode *)calloc(maxval, sizeof(*vnode_base));
-       if (vmap == NULL || vnode_base == NULL)
-               bpf_error("malloc");
+       opt_state->maxval = 3 * max_stmts;
+       opt_state->vmap = (struct vmapinfo *)calloc(opt_state->maxval, sizeof(*opt_state->vmap));
+       if (opt_state->vmap == NULL) {
+               opt_error(opt_state, "malloc");
+       }
+       opt_state->vnode_base = (struct valnode *)calloc(opt_state->maxval, sizeof(*opt_state->vnode_base));
+       if (opt_state->vnode_base == NULL) {
+               opt_error(opt_state, "malloc");
+       }

 }
 
 /*
 }
 
 /*

- * Some pointers used to convert the basic block form of the code,
- * into the array form that BPF requires.  'fstart' will point to
- * the malloc'd array while 'ftail' is used during the recursive traversal.
+ * This is only used when supporting optimizer debugging.  It is
+ * global state, so do *not* do more than one compile in parallel
+ * and expect it to provide meaningful information.

  */
  */

-static struct bpf_insn *fstart;
-static struct bpf_insn *ftail;
-

 #ifdef BDEBUG
 #ifdef BDEBUG

-int bids[1000];
+int bids[NBIDS];

 #endif
 
 #endif
 

+static void PCAP_NORETURN conv_error(conv_state_t *, const char *, ...)
+    PCAP_PRINTFLIKE(2, 3);
+

 /*
  * Returns true if successful.  Returns false if a branch has
  * an offset that is too large.  If so, we have marked that
 /*
  * Returns true if successful.  Returns false if a branch has
  * an offset that is too large.  If so, we have marked that


@@ -1988,35 +2682,34 @@ int bids[1000];
  * properly.
  */
 static int
  * properly.
  */
 static int

-convert_code_r(struct block *p)
+convert_code_r(conv_state_t *conv_state, struct icode *ic, struct block *p)

 {
        struct bpf_insn *dst;
        struct slist *src;
 {
        struct bpf_insn *dst;
        struct slist *src;

-       int slen;
+       u_int slen;

        u_int off;
        u_int off;

-       int extrajmps;          /* number of extra jumps inserted */

        struct slist **offset = NULL;
 
        struct slist **offset = NULL;
 

-       if (p == 0 || isMarked(p))
+       if (p == 0 || isMarked(ic, p))

                return (1);
                return (1);

-       Mark(p);
+       Mark(ic, p);

 
 

-       if (convert_code_r(JF(p)) == 0)
+       if (convert_code_r(conv_state, ic, JF(p)) == 0)

                return (0);
                return (0);

-       if (convert_code_r(JT(p)) == 0)
+       if (convert_code_r(conv_state, ic, JT(p)) == 0)

                return (0);
 
        slen = slength(p->stmts);
                return (0);
 
        slen = slength(p->stmts);

-       dst = ftail -= (slen + 1 + p->longjt + p->longjf);
+       dst = conv_state->ftail -= (slen + 1 + p->longjt + p->longjf);

                /* inflate length by any extra jumps */
 
                /* inflate length by any extra jumps */
 

-       p->offset = dst - fstart;
+       p->offset = (int)(dst - conv_state->fstart);

 
        /* generate offset[] for convenience  */
        if (slen) {
                offset = (struct slist **)calloc(slen, sizeof(struct slist *));
                if (!offset) {
 
        /* generate offset[] for convenience  */
        if (slen) {
                offset = (struct slist **)calloc(slen, sizeof(struct slist *));
                if (!offset) {

-                       bpf_error("not enough core");
+                       conv_error(conv_state, "not enough core");

                        /*NOTREACHED*/
                }
        }
                        /*NOTREACHED*/
                }
        }


@@ -2040,7 +2733,8 @@ convert_code_r(struct block *p)
                if (BPF_CLASS(src->s.code) != BPF_JMP || src->s.code == (BPF_JMP|BPF_JA)) {
 #if 0
                        if (src->s.jt || src->s.jf) {
                if (BPF_CLASS(src->s.code) != BPF_JMP || src->s.code == (BPF_JMP|BPF_JA)) {
 #if 0
                        if (src->s.jt || src->s.jf) {

-                               bpf_error("illegal jmp destination");
+                               free(offset);
+                               conv_error(conv_state, "illegal jmp destination");

                                /*NOTREACHED*/
                        }
 #endif
                                /*NOTREACHED*/
                        }
 #endif


@@ -2050,9 +2744,9 @@ convert_code_r(struct block *p)
                        goto filled;
 
            {
                        goto filled;
 
            {

-               int i;
+               u_int i;

                int jt, jf;
                int jt, jf;

-               const char *ljerr = "%s for block-local relative jump: off=%d";
+               const char ljerr[] = "%s for block-local relative jump: off=%d";

 
 #if 0
                printf("code=%x off=%d %x %x\n", src->s.code,
 
 #if 0
                printf("code=%x off=%d %x %x\n", src->s.code,


@@ -2060,7 +2754,8 @@ convert_code_r(struct block *p)
 #endif
 
                if (!src->s.jt || !src->s.jf) {
 #endif
 
                if (!src->s.jt || !src->s.jf) {

-                       bpf_error(ljerr, "no jmp destination", off);
+                       free(offset);
+                       conv_error(conv_state, ljerr, "no jmp destination", off);

                        /*NOTREACHED*/
                }
 
                        /*NOTREACHED*/
                }
 


@@ -2068,24 +2763,37 @@ convert_code_r(struct block *p)
                for (i = 0; i < slen; i++) {
                        if (offset[i] == src->s.jt) {
                                if (jt) {
                for (i = 0; i < slen; i++) {
                        if (offset[i] == src->s.jt) {
                                if (jt) {

-                                       bpf_error(ljerr, "multiple matches", off);
+                                       free(offset);
+                                       conv_error(conv_state, ljerr, "multiple matches", off);

                                        /*NOTREACHED*/
                                }
 
                                        /*NOTREACHED*/
                                }
 

-                               dst->jt = i - off - 1;
+                               if (i - off - 1 >= 256) {
+                                       free(offset);
+                                       conv_error(conv_state, ljerr, "out-of-range jump", off);
+                                       /*NOTREACHED*/
+                               }
+                               dst->jt = (u_char)(i - off - 1);

                                jt++;
                        }
                        if (offset[i] == src->s.jf) {
                                if (jf) {
                                jt++;
                        }
                        if (offset[i] == src->s.jf) {
                                if (jf) {

-                                       bpf_error(ljerr, "multiple matches", off);
+                                       free(offset);
+                                       conv_error(conv_state, ljerr, "multiple matches", off);
+                                       /*NOTREACHED*/
+                               }
+                               if (i - off - 1 >= 256) {
+                                       free(offset);
+                                       conv_error(conv_state, ljerr, "out-of-range jump", off);

                                        /*NOTREACHED*/
                                }
                                        /*NOTREACHED*/
                                }

-                               dst->jf = i - off - 1;
+                               dst->jf = (u_char)(i - off - 1);

                                jf++;
                        }
                }
                if (!jt || !jf) {
                                jf++;
                        }
                }
                if (!jt || !jf) {

-                       bpf_error(ljerr, "no destination found", off);
+                       free(offset);
+                       conv_error(conv_state, ljerr, "no destination found", off);

                        /*NOTREACHED*/
                }
            }
                        /*NOTREACHED*/
                }
            }


@@ -2097,33 +2805,34 @@ filled:
                free(offset);
 
 #ifdef BDEBUG
                free(offset);
 
 #ifdef BDEBUG

-       bids[dst - fstart] = p->id + 1;
+       if (dst - conv_state->fstart < NBIDS)
+               bids[dst - conv_state->fstart] = p->id + 1;

 #endif
        dst->code = (u_short)p->s.code;
        dst->k = p->s.k;
        if (JT(p)) {
 #endif
        dst->code = (u_short)p->s.code;
        dst->k = p->s.k;
        if (JT(p)) {

-               extrajmps = 0;
+               /* number of extra jumps inserted */
+               u_char extrajmps = 0;

                off = JT(p)->offset - (p->offset + slen) - 1;
                if (off >= 256) {
                    /* offset too large for branch, must add a jump */
                    if (p->longjt == 0) {
                off = JT(p)->offset - (p->offset + slen) - 1;
                if (off >= 256) {
                    /* offset too large for branch, must add a jump */
                    if (p->longjt == 0) {

-                       /* mark this instruction and retry */
+                       /* mark this instruction and retry */

                        p->longjt++;
                        return(0);
                    }
                        p->longjt++;
                        return(0);
                    }

-                   /* branch if T to following jump */

                    dst->jt = extrajmps;
                    extrajmps++;
                    dst[extrajmps].code = BPF_JMP|BPF_JA;
                    dst[extrajmps].k = off - extrajmps;
                }
                else
                    dst->jt = extrajmps;
                    extrajmps++;
                    dst[extrajmps].code = BPF_JMP|BPF_JA;
                    dst[extrajmps].k = off - extrajmps;
                }
                else

-                   dst->jt = off;
+                   dst->jt = (u_char)off;

                off = JF(p)->offset - (p->offset + slen) - 1;
                if (off >= 256) {
                    /* offset too large for branch, must add a jump */
                    if (p->longjf == 0) {
                off = JF(p)->offset - (p->offset + slen) - 1;
                if (off >= 256) {
                    /* offset too large for branch, must add a jump */
                    if (p->longjf == 0) {

-                       /* mark this instruction and retry */
+                       /* mark this instruction and retry */

                        p->longjf++;
                        return(0);
                    }
                        p->longjf++;
                        return(0);
                    }


@@ -2135,7 +2844,7 @@ filled:
                    dst[extrajmps].k = off - extrajmps;
                }
                else
                    dst[extrajmps].k = off - extrajmps;
                }
                else

-                   dst->jf = off;
+                   dst->jf = (u_char)off;

        }
        return (1);
 }
        }
        return (1);
 }


@@ -2160,28 +2869,41 @@ filled:
  * done with the filter program.  See the pcap man page.
  */
 struct bpf_insn *
  * done with the filter program.  See the pcap man page.
  */
 struct bpf_insn *

-icode_to_fcode(struct block *root, u_int *lenp)
+icode_to_fcode(struct icode *ic, struct block *root, u_int *lenp,
+    char *errbuf)

 {
        u_int n;
        struct bpf_insn *fp;
 {
        u_int n;
        struct bpf_insn *fp;

+       conv_state_t conv_state;
+
+       conv_state.fstart = NULL;
+       conv_state.errbuf = errbuf;
+       if (setjmp(conv_state.top_ctx) != 0) {
+               free(conv_state.fstart);
+               return NULL;
+       }

 
        /*
         * Loop doing convert_code_r() until no branches remain
         * with too-large offsets.
         */
 
        /*
         * Loop doing convert_code_r() until no branches remain
         * with too-large offsets.
         */

-       while (1) {
-           unMarkAll();
-           n = *lenp = count_stmts(root);
+       for (;;) {
+           unMarkAll(ic);
+           n = *lenp = count_stmts(ic, root);

 
            fp = (struct bpf_insn *)malloc(sizeof(*fp) * n);
 
            fp = (struct bpf_insn *)malloc(sizeof(*fp) * n);

-           if (fp == NULL)
-                   bpf_error("malloc");
+           if (fp == NULL) {
+               (void)snprintf(errbuf, PCAP_ERRBUF_SIZE,
+                   "malloc");
+               free(fp);
+               return NULL;
+           }

            memset((char *)fp, 0, sizeof(*fp) * n);
            memset((char *)fp, 0, sizeof(*fp) * n);

-           fstart = fp;
-           ftail = fp + n;
+           conv_state.fstart = fp;
+           conv_state.ftail = fp + n;

 
 

-           unMarkAll();
-           if (convert_code_r(root))
+           unMarkAll(ic);
+           if (convert_code_r(&conv_state, ic, root))

                break;
            free(fp);
        }
                break;
            free(fp);
        }


@@ -2189,6 +2911,22 @@ icode_to_fcode(struct block *root, u_int *lenp)
        return fp;
 }
 
        return fp;
 }
 

+/*
+ * For iconv_to_fconv() errors.
+ */
+static void PCAP_NORETURN
+conv_error(conv_state_t *conv_state, const char *fmt, ...)
+{
+       va_list ap;
+
+       va_start(ap, fmt);
+       (void)vsnprintf(conv_state->errbuf,
+           PCAP_ERRBUF_SIZE, fmt, ap);
+       va_end(ap);
+       longjmp(conv_state->top_ctx, 1);
+       /* NOTREACHED */
+}
+

 /*
  * Make a copy of a BPF program and put it in the "fcode" member of
  * a "pcap_t".
 /*
  * Make a copy of a BPF program and put it in the "fcode" member of
  * a "pcap_t".


@@ -2205,7 +2943,7 @@ install_bpf_program(pcap_t *p, struct bpf_program *fp)
        /*
         * Validate the program.
         */
        /*
         * Validate the program.
         */

-       if (!bpf_validate(fp->bf_insns, fp->bf_len)) {
+       if (!pcap_validate_filter(fp->bf_insns, fp->bf_len)) {

                snprintf(p->errbuf, sizeof(p->errbuf),
                        "BPF program is not valid");
                return (-1);
                snprintf(p->errbuf, sizeof(p->errbuf),
                        "BPF program is not valid");
                return (-1);


@@ -2220,8 +2958,8 @@ install_bpf_program(pcap_t *p, struct bpf_program *fp)
        p->fcode.bf_len = fp->bf_len;
        p->fcode.bf_insns = (struct bpf_insn *)malloc(prog_size);
        if (p->fcode.bf_insns == NULL) {
        p->fcode.bf_len = fp->bf_len;
        p->fcode.bf_insns = (struct bpf_insn *)malloc(prog_size);
        if (p->fcode.bf_insns == NULL) {

-               snprintf(p->errbuf, sizeof(p->errbuf),
-                        "malloc: %s", pcap_strerror(errno));
+               pcap_fmt_errmsg_for_errno(p->errbuf, sizeof(p->errbuf),
+                   errno, "malloc");

                return (-1);
        }
        memcpy(p->fcode.bf_insns, fp->bf_insns, prog_size);
                return (-1);
        }
        memcpy(p->fcode.bf_insns, fp->bf_insns, prog_size);


@@ -2230,14 +2968,126 @@ install_bpf_program(pcap_t *p, struct bpf_program *fp)
 
 #ifdef BDEBUG
 static void
 
 #ifdef BDEBUG
 static void

-opt_dump(struct block *root)
+dot_dump_node(struct icode *ic, struct block *block, struct bpf_program *prog,
+    FILE *out)
+{
+       int icount, noffset;
+       int i;
+
+       if (block == NULL || isMarked(ic, block))
+               return;
+       Mark(ic, block);
+
+       icount = slength(block->stmts) + 1 + block->longjt + block->longjf;
+       noffset = min(block->offset + icount, (int)prog->bf_len);
+
+       fprintf(out, "\tblock%u [shape=ellipse, id=\"block-%u\" label=\"BLOCK%u\\n", block->id, block->id, block->id);
+       for (i = block->offset; i < noffset; i++) {
+               fprintf(out, "\\n%s", bpf_image(prog->bf_insns + i, i));
+       }
+       fprintf(out, "\" tooltip=\"");
+       for (i = 0; i < BPF_MEMWORDS; i++)
+               if (block->val[i] != VAL_UNKNOWN)
+                       fprintf(out, "val[%d]=%d ", i, block->val[i]);
+       fprintf(out, "val[A]=%d ", block->val[A_ATOM]);
+       fprintf(out, "val[X]=%d", block->val[X_ATOM]);
+       fprintf(out, "\"");
+       if (JT(block) == NULL)
+               fprintf(out, ", peripheries=2");
+       fprintf(out, "];\n");
+
+       dot_dump_node(ic, JT(block), prog, out);
+       dot_dump_node(ic, JF(block), prog, out);
+}
+
+static void
+dot_dump_edge(struct icode *ic, struct block *block, FILE *out)
+{
+       if (block == NULL || isMarked(ic, block))
+               return;
+       Mark(ic, block);
+
+       if (JT(block)) {
+               fprintf(out, "\t\"block%u\":se -> \"block%u\":n [label=\"T\"]; \n",
+                               block->id, JT(block)->id);
+               fprintf(out, "\t\"block%u\":sw -> \"block%u\":n [label=\"F\"]; \n",
+                          block->id, JF(block)->id);
+       }
+       dot_dump_edge(ic, JT(block), out);
+       dot_dump_edge(ic, JF(block), out);
+}
+
+/* Output the block CFG using graphviz/DOT language
+ * In the CFG, block's code, value index for each registers at EXIT,
+ * and the jump relationship is show.
+ *
+ * example DOT for BPF `ip src host 1.1.1.1' is:
+    digraph BPF {
+       block0 [shape=ellipse, id="block-0" label="BLOCK0\n\n(000) ldh      [12]\n(001) jeq      #0x800           jt 2  jf 5" tooltip="val[A]=0 val[X]=0"];
+       block1 [shape=ellipse, id="block-1" label="BLOCK1\n\n(002) ld       [26]\n(003) jeq      #0x1010101       jt 4  jf 5" tooltip="val[A]=0 val[X]=0"];
+       block2 [shape=ellipse, id="block-2" label="BLOCK2\n\n(004) ret      #68" tooltip="val[A]=0 val[X]=0", peripheries=2];
+       block3 [shape=ellipse, id="block-3" label="BLOCK3\n\n(005) ret      #0" tooltip="val[A]=0 val[X]=0", peripheries=2];
+       "block0":se -> "block1":n [label="T"];
+       "block0":sw -> "block3":n [label="F"];
+       "block1":se -> "block2":n [label="T"];
+       "block1":sw -> "block3":n [label="F"];
+    }
+ *
+ *  After install graphviz on https://www.graphviz.org/, save it as bpf.dot
+ *  and run `dot -Tpng -O bpf.dot' to draw the graph.
+ */
+static int
+dot_dump(struct icode *ic, char *errbuf)

 {
        struct bpf_program f;
 {
        struct bpf_program f;

+       FILE *out = stdout;

 
        memset(bids, 0, sizeof bids);
 
        memset(bids, 0, sizeof bids);

-       f.bf_insns = icode_to_fcode(root, &f.bf_len);
+       f.bf_insns = icode_to_fcode(ic, ic->root, &f.bf_len, errbuf);
+       if (f.bf_insns == NULL)
+               return -1;
+
+       fprintf(out, "digraph BPF {\n");
+       unMarkAll(ic);
+       dot_dump_node(ic, ic->root, &f, out);
+       unMarkAll(ic);
+       dot_dump_edge(ic, ic->root, out);
+       fprintf(out, "}\n");
+
+       free((char *)f.bf_insns);
+       return 0;
+}
+
+static int
+plain_dump(struct icode *ic, char *errbuf)
+{
+       struct bpf_program f;
+
+       memset(bids, 0, sizeof bids);
+       f.bf_insns = icode_to_fcode(ic, ic->root, &f.bf_len, errbuf);
+       if (f.bf_insns == NULL)
+               return -1;

        bpf_dump(&f, 1);
        putchar('\n');
        free((char *)f.bf_insns);
        bpf_dump(&f, 1);
        putchar('\n');
        free((char *)f.bf_insns);

+       return 0;
+}
+
+static void
+opt_dump(opt_state_t *opt_state, struct icode *ic)
+{
+       int status;
+       char errbuf[PCAP_ERRBUF_SIZE];
+
+       /*
+        * If the CFG, in DOT format, is requested, output it rather than
+        * the code that would be generated from that graph.
+        */
+       if (pcap_print_dot_graph)
+               status = dot_dump(ic, errbuf);
+       else
+               status = plain_dump(ic, errbuf);
+       if (status == -1)
+               opt_error(opt_state, "opt_dump: icode_to_fcode failed: %s", errbuf);

 }
 #endif
 }
 #endif