1
0
mirror of git://sourceware.org/git/lvm2.git synced 2024-12-22 17:35:59 +03:00
lvm2/lib/datastruct/str_list.c

124 lines
2.4 KiB
C
Raw Normal View History

2003-09-18 00:35:57 +04:00
/*
2004-03-30 23:35:44 +04:00
* Copyright (C) 2003-2004 Sistina Software, Inc. All rights reserved.
* Copyright (C) 2004-2005 Red Hat, Inc. All rights reserved.
2003-09-18 00:35:57 +04:00
*
2004-03-30 23:35:44 +04:00
* This file is part of LVM2.
*
* This copyrighted material is made available to anyone wishing to use,
* modify, copy, or redistribute it subject to the terms and conditions
* of the GNU Lesser General Public License v.2.1.
2004-03-30 23:35:44 +04:00
*
* You should have received a copy of the GNU Lesser General Public License
2004-03-30 23:35:44 +04:00
* along with this program; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
2003-09-18 00:35:57 +04:00
*/
#include "lib.h"
#include "str_list.h"
struct dm_list *str_list_create(struct dm_pool *mem)
2003-10-16 00:04:29 +04:00
{
struct dm_list *sl;
2003-10-16 00:04:29 +04:00
if (!(sl = dm_pool_alloc(mem, sizeof(struct dm_list)))) {
log_errno(ENOMEM, "str_list allocation failed");
return NULL;
}
2003-10-16 00:04:29 +04:00
dm_list_init(sl);
2003-10-16 00:04:29 +04:00
return sl;
}
int str_list_add(struct dm_pool *mem, struct dm_list *sll, const char *str)
2003-09-18 00:35:57 +04:00
{
struct str_list *sln;
2008-01-30 16:19:47 +03:00
if (!str)
return_0;
2003-09-18 00:35:57 +04:00
/* Already in list? */
2003-10-16 00:04:29 +04:00
if (str_list_match_item(sll, str))
return 1;
2003-09-18 00:35:57 +04:00
2008-01-30 16:19:47 +03:00
if (!(sln = dm_pool_alloc(mem, sizeof(*sln))))
return_0;
2003-09-18 00:35:57 +04:00
sln->str = str;
dm_list_add(sll, &sln->list);
2003-09-18 00:35:57 +04:00
return 1;
}
2003-10-16 00:01:12 +04:00
int str_list_del(struct dm_list *sll, const char *str)
2003-10-16 00:01:12 +04:00
{
struct dm_list *slh, *slht;
2003-10-16 00:01:12 +04:00
dm_list_iterate_safe(slh, slht, sll) {
if (!strcmp(str, dm_list_item(slh, struct str_list)->str))
dm_list_del(slh);
2003-10-16 00:01:12 +04:00
}
return 1;
}
int str_list_dup(struct dm_pool *mem, struct dm_list *sllnew,
const struct dm_list *sllold)
2004-03-08 18:23:01 +03:00
{
struct str_list *sl;
dm_list_init(sllnew);
2004-03-08 18:23:01 +03:00
dm_list_iterate_items(sl, sllold) {
2008-01-30 16:19:47 +03:00
if (!str_list_add(mem, sllnew, dm_pool_strdup(mem, sl->str)))
return_0;
2004-03-08 18:23:01 +03:00
}
return 1;
}
/*
* Is item on list?
*/
int str_list_match_item(const struct dm_list *sll, const char *str)
2003-10-16 00:04:29 +04:00
{
struct str_list *sl;
dm_list_iterate_items(sl, sll)
2003-10-16 00:04:29 +04:00
if (!strcmp(str, sl->str))
return 1;
return 0;
}
2004-03-08 18:23:01 +03:00
/*
* Is at least one item on both lists?
*/
int str_list_match_list(const struct dm_list *sll, const struct dm_list *sll2)
2003-10-16 00:04:29 +04:00
{
struct str_list *sl;
dm_list_iterate_items(sl, sll)
2003-10-16 00:04:29 +04:00
if (str_list_match_item(sll2, sl->str))
return 1;
return 0;
}
2004-03-08 18:23:01 +03:00
/*
* Do both lists contain the same set of items?
*/
int str_list_lists_equal(const struct dm_list *sll, const struct dm_list *sll2)
2004-03-08 18:23:01 +03:00
{
struct str_list *sl;
if (dm_list_size(sll) != dm_list_size(sll2))
2004-03-08 18:23:01 +03:00
return 0;
dm_list_iterate_items(sl, sll)
2004-03-08 18:23:01 +03:00
if (!str_list_match_item(sll2, sl->str))
return 0;
return 1;
}