2009-07-08 13:19:16 -07:00
|
|
|
/*
|
2010-01-19 10:40:36 -08:00
|
|
|
* Copyright (c) 2009, 2010 Nicira Networks.
|
2009-07-08 13:19:16 -07:00
|
|
|
*
|
2009-06-15 15:11:30 -07:00
|
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
* you may not use this file except in compliance with the License.
|
|
|
|
* You may obtain a copy of the License at:
|
2009-07-08 13:19:16 -07:00
|
|
|
*
|
2009-06-15 15:11:30 -07:00
|
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
*
|
|
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
* See the License for the specific language governing permissions and
|
|
|
|
* limitations under the License.
|
2009-07-08 13:19:16 -07:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef SHASH_H
|
|
|
|
#define SHASH_H 1
|
|
|
|
|
|
|
|
#include "hmap.h"
|
|
|
|
|
2010-02-04 09:37:30 -08:00
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
2009-07-08 13:19:16 -07:00
|
|
|
struct shash_node {
|
|
|
|
struct hmap_node node;
|
|
|
|
char *name;
|
|
|
|
void *data;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct shash {
|
|
|
|
struct hmap map;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define SHASH_INITIALIZER(SHASH) { HMAP_INITIALIZER(&(SHASH)->map) }
|
|
|
|
|
2009-07-22 16:33:43 -07:00
|
|
|
#define SHASH_FOR_EACH(SHASH_NODE, SHASH) \
|
|
|
|
HMAP_FOR_EACH (SHASH_NODE, struct shash_node, node, &(SHASH)->map)
|
|
|
|
|
|
|
|
#define SHASH_FOR_EACH_SAFE(SHASH_NODE, NEXT, SHASH) \
|
|
|
|
HMAP_FOR_EACH_SAFE (SHASH_NODE, NEXT, struct shash_node, node, \
|
|
|
|
&(SHASH)->map)
|
|
|
|
|
2009-07-08 13:19:16 -07:00
|
|
|
void shash_init(struct shash *);
|
|
|
|
void shash_destroy(struct shash *);
|
2010-06-07 16:58:57 -07:00
|
|
|
void shash_destroy_free_data(struct shash *);
|
2010-01-19 10:40:36 -08:00
|
|
|
void shash_swap(struct shash *, struct shash *);
|
2010-01-28 14:21:31 -08:00
|
|
|
void shash_moved(struct shash *);
|
2009-07-08 13:19:16 -07:00
|
|
|
void shash_clear(struct shash *);
|
2010-06-07 16:58:57 -07:00
|
|
|
void shash_clear_free_data(struct shash *);
|
2009-06-24 10:21:25 -07:00
|
|
|
bool shash_is_empty(const struct shash *);
|
2009-11-04 14:56:03 -08:00
|
|
|
size_t shash_count(const struct shash *);
|
2009-11-20 15:39:07 -08:00
|
|
|
struct shash_node *shash_add(struct shash *, const char *, const void *);
|
2010-06-02 11:08:03 -07:00
|
|
|
struct shash_node *shash_add_nocopy(struct shash *, char *, const void *);
|
2009-12-03 11:28:40 -08:00
|
|
|
bool shash_add_once(struct shash *, const char *, const void *);
|
2010-05-05 14:00:47 -07:00
|
|
|
void shash_add_assert(struct shash *, const char *, const void *);
|
2009-07-08 13:19:16 -07:00
|
|
|
void shash_delete(struct shash *, struct shash_node *);
|
|
|
|
struct shash_node *shash_find(const struct shash *, const char *);
|
|
|
|
void *shash_find_data(const struct shash *, const char *);
|
2009-10-28 11:10:36 -07:00
|
|
|
void *shash_find_and_delete(struct shash *, const char *);
|
2010-05-05 14:00:47 -07:00
|
|
|
void *shash_find_and_delete_assert(struct shash *, const char *);
|
2009-06-24 10:21:39 -07:00
|
|
|
struct shash_node *shash_first(const struct shash *);
|
2009-10-29 14:51:25 -07:00
|
|
|
const struct shash_node **shash_sort(const struct shash *);
|
2010-01-19 10:40:36 -08:00
|
|
|
bool shash_equal_keys(const struct shash *, const struct shash *);
|
2009-07-08 13:19:16 -07:00
|
|
|
|
2010-02-04 09:37:30 -08:00
|
|
|
#ifdef __cplusplus
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2009-07-08 13:19:16 -07:00
|
|
|
#endif /* shash.h */
|