misc_namelist.h from EmStar at Krugle
Show misc_namelist.h syntax highlighted
/*
*
* Copyright (c) 2003 The Regents of the University of California. All
* rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Neither the name of the University nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
/**
* \file misc_namelist.h Simple Queue Macros
*
* A simple few queue macros for implementing a
* namelist, which is a simple linked list of key/value pairs, each of
* which is a string. Plus, a few utilities for manipulating them.
* It's a generally useful service.
*/
#ifndef __MISC_NAMELIST_H__
#define __MISC_NAMELIST_H__
/** \brief a linked list of names (strings) */
typedef struct name_t_s {
QUEUE_ELEMENT_DECL(namelist_ptrs, struct name_t_s);
char *name;
char *value;
void *data;
} name_t;
typedef struct namelist_t_s {
QUEUE_DECL(namelist, struct name_t_s);
} namelist_t;
void namelist_add(namelist_t *namelist, char *name, char *value);
void namelist_free(namelist_t *list);
name_t *namelist_find(namelist_t *namelist, char *name);
int namelist_is_member(namelist_t *namelist, char *name);
int namelist_is_same(namelist_t *list1, namelist_t *list2);
QUEUE_INLINE_INSTANTIATIONS(namelist,namelist_ptrs,namelist,struct name_t_s, struct namelist_t_s);
#endif /* __MISC_NAMELIST_H__ */
See more files for this project here