PARA_DEBUG_LOG("found entry for %s\n", n);
u = para_malloc(sizeof(struct user));
u->name = para_strdup(n);
- u->rsa = para_malloc(sizeof(RSA));
ret = get_rsa_key(k, &u->rsa, LOAD_PUBLIC_KEY);
if (ret < 0)
break;
- u->perms = 0;
char_ptr = p;
num = sscanf(char_ptr, "%200[A-Z_],%200[A-Z_],%200[A-Z_],%200[A-Z_]",
tmp[0], tmp[1], tmp[2], tmp[3]);
list_for_each_entry_safe(u, tmp, &user_list, node) {
list_del(&u->node);
free(u->name);
- free(u->rsa);
+ rsa_free(u->rsa);
free(u);
}
} else
/**
* lookup user in user_list.
*
- * \param user: must initially contain the name of the user and is filled
- * in by this function on success.
+ * \param name of the user
*
- * \return 1 on success and < 0 on errors.
+ * \return a pointer to the corresponding user struct if the user was found,
+ * \p NULL otherwise.
*/
-int lookup_user(struct user *user)
+struct user *lookup_user(const char *name)
{
struct user *u;
list_for_each_entry(u, &user_list, node) {
- if (strcmp(u->name, user->name))
+ if (strcmp(u->name, name))
continue;
- *user = *u;
- return 1;
+ return u;
}
- return -E_BAD_USER;
+ return NULL;
}