*
* Even users that are not taken into account because of the --uid
* option occupy a slot in this hash table. This allows to find out
- * quicky whether a uid is admissible. And yes, this has to be fast.
+ * quickly whether a uid is admissible. And yes, this has to be fast.
*/
static struct user_info *uid_hash_table;
* \a admissible_uids. If so, it sets the admissible bit for this slot and
* opens the osl table of the uid.
*
- * \return Stamdard.
+ * \return Standard.
*/
int open_admissible_user_tables(struct uid_range *admissible_uids)
{
size_t size;
uint32_t n;
char *filename = get_uid_list_name(), *map;
- int ret = mmap_full_file(filename, O_RDONLY, (void **)&map, &size, NULL);
+ int ret = mmap_file_ro(filename, (void **)&map, &size);
unsigned bits;
if (ret < 0) {