mirror of
https://salsa.debian.org/ha-team/libqb
synced 2025-12-27 15:45:43 +00:00
2da98acd42
At the moment if you have multiple notifiers it becomes impossible to figure out when it is safe to free the values. This new callback can only be added once and is called once, making it better suited to freeing memory. It is also called after the deleted and replaced notifiers. Signed-off-by: Angus Salkeld <asalkeld@redhat.com>
132 lines
2.7 KiB
C
132 lines
2.7 KiB
C
/*
|
|
* Copyright (C) 2011 Red Hat, Inc.
|
|
*
|
|
* Author: Angus Salkeld <asalkeld@redhat.com>
|
|
*
|
|
* This file is part of libqb.
|
|
*
|
|
* libqb is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Lesser General Public License as published by
|
|
* the Free Software Foundation, either version 2.1 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* libqb is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public License
|
|
* along with libqb. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include "os_base.h"
|
|
#include <qb/qbmap.h>
|
|
#include "map_int.h"
|
|
|
|
void
|
|
qb_map_put(struct qb_map *map, const char *key, const void *value)
|
|
{
|
|
map->put(map, key, value);
|
|
}
|
|
|
|
void *
|
|
qb_map_get(struct qb_map *map, const char *key)
|
|
{
|
|
return map->get(map, key);
|
|
}
|
|
|
|
int32_t
|
|
qb_map_rm(struct qb_map * map, const char *key)
|
|
{
|
|
return map->rm(map, key);
|
|
}
|
|
|
|
size_t
|
|
qb_map_count_get(struct qb_map * map)
|
|
{
|
|
return map->count_get(map);
|
|
}
|
|
|
|
void
|
|
qb_map_foreach(struct qb_map *map, qb_map_transverse_fn func, void *user_data)
|
|
{
|
|
const char *key;
|
|
void *value;
|
|
qb_map_iter_t *i = qb_map_iter_create(map);
|
|
|
|
for (key = qb_map_iter_next(i, &value);
|
|
key; key = qb_map_iter_next(i, &value)) {
|
|
if (func(key, value, user_data)) {
|
|
goto clean_up;
|
|
}
|
|
}
|
|
clean_up:
|
|
qb_map_iter_free(i);
|
|
}
|
|
|
|
qb_map_iter_t *
|
|
qb_map_iter_create(struct qb_map *map)
|
|
{
|
|
return map->iter_create(map, NULL);
|
|
}
|
|
|
|
qb_map_iter_t *
|
|
qb_map_pref_iter_create(qb_map_t * map, const char *prefix)
|
|
{
|
|
return map->iter_create(map, prefix);
|
|
}
|
|
|
|
const char *
|
|
qb_map_iter_next(struct qb_map_iter *i, void **value)
|
|
{
|
|
return i->m->iter_next(i, value);
|
|
}
|
|
|
|
void
|
|
qb_map_iter_free(qb_map_iter_t * i)
|
|
{
|
|
i->m->iter_free(i);
|
|
}
|
|
|
|
int32_t
|
|
qb_map_notify_add(qb_map_t * m, const char *key, qb_map_notify_fn fn,
|
|
int32_t events, void *user_data)
|
|
{
|
|
if (key != NULL && events & QB_MAP_NOTIFY_FREE) {
|
|
return -EINVAL;
|
|
}
|
|
if (m->notify_add) {
|
|
return m->notify_add(m, key, fn, events, user_data);
|
|
} else {
|
|
return -ENOSYS;
|
|
}
|
|
}
|
|
|
|
int32_t
|
|
qb_map_notify_del(qb_map_t * m, const char *key, qb_map_notify_fn fn,
|
|
int32_t events)
|
|
{
|
|
if (m->notify_del) {
|
|
return m->notify_del(m, key, fn, events, QB_FALSE, NULL);
|
|
} else {
|
|
return -ENOSYS;
|
|
}
|
|
}
|
|
|
|
int32_t
|
|
qb_map_notify_del_2(qb_map_t * m, const char *key, qb_map_notify_fn fn,
|
|
int32_t events, void *user_data)
|
|
{
|
|
if (m->notify_del) {
|
|
return m->notify_del(m, key, fn, events, QB_TRUE, user_data);
|
|
} else {
|
|
return -ENOSYS;
|
|
}
|
|
}
|
|
|
|
void
|
|
qb_map_destroy(struct qb_map *map)
|
|
{
|
|
map->destroy(map);
|
|
}
|