X-Git-Url: http://git.tuebingen.mpg.de/?a=blobdiff_plain;f=user_list.c;h=8c54ab7f78cc150a236d7231283d3b5279d9e3fc;hb=7c305178150d5adb4b566e11f1a4bc2e5fe91c8e;hp=0f56b651680e1b5f4c275432e7f209714222045e;hpb=a5ec1a6f44b149c0b018c1da8c1703109c5bdc8c;p=paraslash.git diff --git a/user_list.c b/user_list.c index 0f56b651..8c54ab7f 100644 --- a/user_list.c +++ b/user_list.c @@ -1,14 +1,9 @@ -/* - * Copyright (C) 2006-2011 Andre Noll - * - * Licensed under the GPL v2. For licencing details see COPYING. - */ +/* Copyright (C) 2006 Andre Noll , see file COPYING. */ /** \file user_list.c User handling for para_server. */ #include #include -#include #include "para.h" #include "error.h" @@ -18,7 +13,7 @@ #include "list.h" #include "user_list.h" -static struct list_head user_list; +INITIALIZED_LIST_HEAD(user_list); /* * Fill the list of users known to para_server. @@ -26,7 +21,7 @@ static struct list_head user_list; * Populates a linked list of all users in \a user_list_file. Returns on * success, calls exit() on errors. */ -static void populate_user_list(char *user_list_file) +static void populate(char *user_list_file) { int ret = -E_USERLIST; FILE *file_ptr = fopen(user_list_file, "r"); @@ -49,7 +44,7 @@ static void populate_user_list(char *user_list_file) if (strcmp(w, "user")) continue; PARA_DEBUG_LOG("found entry for user %s\n", n); - ret = get_asymmetric_key(k, LOAD_PUBLIC_KEY, &pubkey); + ret = get_public_key(k, &pubkey); if (ret < 0) { PARA_NOTICE_LOG("skipping entry for user %s: %s\n", n, para_strerror(-ret)); @@ -64,7 +59,7 @@ static void populate_user_list(char *user_list_file) if (ret <= CHALLENGE_SIZE + 2 * SESSION_KEY_LEN + 41) { PARA_WARNING_LOG("public key %s too short (%d)\n", k, ret); - free_asymmetric_key(pubkey); + free_public_key(pubkey); continue; } u = para_malloc(sizeof(*u)); @@ -99,29 +94,24 @@ err: } /** - * Initialize the list of users allowed to connect to to para_server. + * Initialize the list of users allowed to connect to para_server. * * \param user_list_file The file containing access information. * * If this function is called for the second time, the contents of the * previous call are discarded, i.e. the user list is reloaded. */ -void init_user_list(char *user_list_file) +void user_list_init(char *user_list_file) { struct user *u, *tmp; - static int initialized; - if (initialized) { - list_for_each_entry_safe(u, tmp, &user_list, node) { - list_del(&u->node); - free(u->name); - free_asymmetric_key(u->pubkey); - free(u); - } - } else - INIT_LIST_HEAD(&user_list); - initialized = 1; - populate_user_list(user_list_file); + list_for_each_entry_safe(u, tmp, &user_list, node) { + list_del(&u->node); + free(u->name); + free_public_key(u->pubkey); + free(u); + } + populate(user_list_file); } /** @@ -132,9 +122,9 @@ void init_user_list(char *user_list_file) * \return A pointer to the corresponding user struct if the user was found, \p * NULL otherwise. */ -struct user *lookup_user(const char *name) +const struct user *user_list_lookup(const char *name) { - struct user *u; + const struct user *u; list_for_each_entry(u, &user_list, node) { if (strcmp(u->name, name)) continue;