33 int aelem, uelem, attr;
66 if(list_tail != NULL) {
67 list_tail->
next = user;
72 if(list_head == NULL) {
98 for(scan = list; scan != NULL; scan = scan->
next)
99 if(strcmp(scan->
name, name) == 0)
103 log_debug(
ZONE,
"checking for '%s' in acl '%s'", name, type);
105 for(scan = list; scan != NULL; scan = scan->
next)
106 if(strcmp(scan->
name, name) == 0)
121 while (list != NULL) {
#define NAD_CDATA_L(N, E)
int nad_find_attr(nad_t nad, unsigned int elem, int ns, const char *name, const char *val)
get a matching attr on this elem, both name and optional val
int xhash_iter_next(xht h)
struct aci_user_st * aci_user_t
aci manager
int aci_check(xht aci, const char *type, const char *name)
see if a username is in an acl
void xhash_put(xht h, const char *key, void *val)
int xhash_iter_get(xht h, const char **key, int *keylen, void **val)
int nad_find_elem(nad_t nad, unsigned int elem, int ns, const char *name, int depth)
locate the next elem at a given depth with an optional matching name
int xhash_iter_first(xht h)
iteration
pool_t xhash_pool(xht h)
get our pool
char * pstrdup(pool_t p, const char *src)
XXX efficient: move this to const char * and then loop throug the existing heaps to see if src is wit...
void * xhash_get(xht h, const char *key)
void aci_unload(xht aci)
unload aci table