+/* "dst = ~dst;" for n-bit dst. */
+static inline unsigned long *
+bitmap_not(unsigned long *dst, size_t n)
+{
+ size_t i;
+
+ for (i = 0; i < n / BITMAP_ULONG_BITS; i++) {
+ dst[i] = ~dst[i];
+ }
+ if (n % BITMAP_ULONG_BITS) {
+ dst[i] ^= (1UL << (n % BITMAP_ULONG_BITS)) - 1;
+ }
+ return dst;
+}
+
+/* Compares the 'n' bits in bitmaps 'a' and 'b'. Returns true if all bits are
+ * equal, false otherwise. */
+static inline bool
+bitmap_equal(const unsigned long *a, const unsigned long *b, size_t n)
+{
+ if (memcmp(a, b, n / BITMAP_ULONG_BITS * sizeof(unsigned long))) {
+ return false;
+ }
+ if (n % BITMAP_ULONG_BITS) {
+ unsigned long mask = (1UL << n % BITMAP_ULONG_BITS) - 1;
+ unsigned long diff = *bitmap_unit__(a, n) ^ *bitmap_unit__(b, n);
+
+ return !(diff & mask);
+ }
+ return true;
+}
+
+/* Scans 'bitmap' from bit offset 'start' to 'end', excluding 'end' itself.
+ * Returns the bit offset of the lowest-numbered bit set to 'target', or 'end'
+ * if all of the bits are set to '!target'. 'target' is typically a
+ * compile-time constant, so it makes sense to inline this. Compiler may also
+ * optimize parts away depending on the 'start' and 'end' values passed in. */
+static inline size_t
+bitmap_scan(const unsigned long *bitmap, bool target, size_t start, size_t end)
+{
+ if (OVS_LIKELY(start < end)) {
+ unsigned long *p, unit;
+
+ p = bitmap_unit__(bitmap, start);
+ unit = (target ? *p : ~*p) >> (start % BITMAP_ULONG_BITS);
+ if (!unit) {
+ start -= start % BITMAP_ULONG_BITS; /* Round down. */
+ start += BITMAP_ULONG_BITS; /* Start of the next unit. */
+
+ for (; start < end; start += BITMAP_ULONG_BITS) {
+ unit = target ? *++p : ~*++p;
+ if (unit) {
+ goto found;
+ }
+ }
+ return end;
+ }
+found:
+ start += raw_ctz(unit); /* unit != 0 */
+ if (OVS_LIKELY(start < end)) {
+ return start;
+ }
+ }
+ return end;
+}
+
+/* Returns true if all of the 'n' bits in 'bitmap' are 0,
+ * false if at least one bit is a 1.*/
+static inline bool
+bitmap_is_all_zeros(const unsigned long *bitmap, size_t n)
+{
+ return bitmap_scan(bitmap, true, 0, n) == n;
+}
+
+#define BITMAP_FOR_EACH_1_RANGE(IDX, BEGIN, END, BITMAP) \
+ for ((IDX) = bitmap_scan(BITMAP, true, BEGIN, END); (IDX) < (END); \
+ (IDX) = bitmap_scan(BITMAP, true, (IDX) + 1, END))
+#define BITMAP_FOR_EACH_1(IDX, SIZE, BITMAP) \
+ BITMAP_FOR_EACH_1_RANGE(IDX, 0, SIZE, BITMAP)
+
+/* More efficient access to a map of single ullong. */
+#define ULLONG_FOR_EACH_1(IDX, MAP) \
+ for (uint64_t map__ = (MAP); \
+ map__ && (((IDX) = raw_ctz(map__)), true); \
+ map__ = zero_rightmost_1bit(map__))
+
+#define ULLONG_SET0(MAP, OFFSET) ((MAP) &= ~(1ULL << (OFFSET)))
+#define ULLONG_SET1(MAP, OFFSET) ((MAP) |= 1ULL << (OFFSET))