+ /*
+ * To optimize jumps, we use a table with skipto_entries pointers
+ * (a power of 2, set with a sysctl depending on available memory).
+ * Entry i points to the first rule i*64k/n <= n < (i+1)*64k/n.
+ * On insert/delete we simply update the relevant entry
+ * with O(1) additional cost. Updates to the sysctl variable
+ * that controls the table are managed at the next add/delete.
+ */
+ int skipto_shift; /* shifts to compute the index in skipto-ptrs */
+ int skipto_size; /* number of entries in the table */
+ struct ip_fw **skipto_ptrs;
+#ifdef IPFW_HASHTABLES
+ struct ipfw_ht *hashtab[IPFW_TABLES_MAX];
+#endif