/*
- * Copyright (c) 2008, 2009, 2010 Nicira Networks.
+ * Copyright (c) 2008, 2009, 2010, 2012 Nicira, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
#include <config.h>
#include "hmap.h"
-#include <assert.h>
#include <stdint.h>
#include <string.h>
#include "coverage.h"
struct hmap tmp;
size_t i;
- assert(!(new_mask & (new_mask + 1)));
- assert(new_mask != SIZE_MAX);
+ ovs_assert(!(new_mask & (new_mask + 1)));
+ ovs_assert(new_mask != SIZE_MAX);
hmap_init(&tmp);
if (new_mask) {
}
return node;
}
+
+/* Returns the next node in 'hmap' in hash order, or NULL if no nodes remain in
+ * 'hmap'. Uses '*bucketp' and '*offsetp' to determine where to begin
+ * iteration, and stores new values to pass on the next iteration into them
+ * before returning.
+ *
+ * It's better to use plain HMAP_FOR_EACH and related functions, since they are
+ * faster and better at dealing with hmaps that change during iteration.
+ *
+ * Before beginning iteration, store 0 into '*bucketp' and '*offsetp'.
+ */
+struct hmap_node *
+hmap_at_position(const struct hmap *hmap,
+ uint32_t *bucketp, uint32_t *offsetp)
+{
+ size_t offset;
+ size_t b_idx;
+
+ offset = *offsetp;
+ for (b_idx = *bucketp; b_idx <= hmap->mask; b_idx++) {
+ struct hmap_node *node;
+ size_t n_idx;
+
+ for (n_idx = 0, node = hmap->buckets[b_idx]; node != NULL;
+ n_idx++, node = node->next) {
+ if (n_idx == offset) {
+ if (node->next) {
+ *bucketp = node->hash & hmap->mask;
+ *offsetp = offset + 1;
+ } else {
+ *bucketp = (node->hash & hmap->mask) + 1;
+ *offsetp = 0;
+ }
+ return node;
+ }
+ }
+ offset = 0;
+ }
+
+ *bucketp = 0;
+ *offsetp = 0;
+ return NULL;
+}
+
+/* Returns true if 'node' is in 'hmap', false otherwise. */
+bool
+hmap_contains(const struct hmap *hmap, const struct hmap_node *node)
+{
+ struct hmap_node *p;
+
+ for (p = hmap_first_in_bucket(hmap, node->hash); p; p = p->next) {
+ if (p == node) {
+ return true;
+ }
+ }
+
+ return false;
+}