}
}
PARA_DEBUG_LOG("received auth request for user %s\n", username);
- *u = lookup_user(username);
+ *u = user_list_lookup(username);
ret = 1;
out:
free_argv(features);
daemon_set_flag(DF_LOG_TIMING);
daemon_set_priority(OPT_UINT32_VAL(PRIORITY));
if (user_list_file)
- init_user_list(user_list_file);
+ user_list_init(user_list_file);
ret = 1;
free_cf:
free(cf);
* 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");
* 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;
} else
INIT_LIST_HEAD(&user_list);
initialized = 1;
- populate_user_list(user_list_file);
+ populate(user_list_file);
}
/**
* \return A pointer to the corresponding user struct if the user was found, \p
* NULL otherwise.
*/
-const struct user *lookup_user(const char *name)
+const struct user *user_list_lookup(const char *name)
{
const struct user *u;
list_for_each_entry(u, &user_list, node) {
unsigned int perms;
};
-void init_user_list(char *user_list_file);
-const struct user *lookup_user(const char *name);
+void user_list_init(char *user_list_file);
+const struct user *user_list_lookup(const char *name);