1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
#include "netcosm.h"
static void *map = NULL;
static char *db_file = NULL;
/*
* the user DB is stored on disk as an ASCII database
*
* this is then loaded into fixed-sized hash map at init
* TODO: implement with B-tree
*/
void userdb_init(const char *file)
{
db_file = strdup(file);
/* FILE* for getline() */
FILE *f = fopen(file, "r");
map = hash_init(256, hash_djb, compare_strings);
hash_setfreedata_cb(map, free);
char *format;
asprintf(&format, "%%%d[a-z0-9 ]:%%%d[A-Z]:%%%ds:%%d\n",
MAX_NAME_LEN, SALT_LEN, AUTH_HASHLEN * 2);
if(f)
{
while(1)
{
struct userdata_t *data = calloc(1, sizeof(*data));
int ret = fscanf(f, format,
data->username,
data->salt,
data->passhash,
&data->priv);
if(ret != 4)
{
free(data);
break;
}
hash_insert(map, data->username, data);
}
fclose(f);
}
free(format);
}
void userdb_write(const char *file)
{
int fd = open(file, O_WRONLY | O_CREAT | O_TRUNC, 0600);
void *save, *ptr = map;
while(1)
{
struct userdata_t *user = hash_iterate(ptr, &save, NULL);
ptr = NULL;
if(!user)
break;
dprintf(fd, "%s:%*s:%*s:%d\n",
user->username,
SALT_LEN, user->salt,
AUTH_HASHLEN*2, user->passhash,
user->priv);
}
close(fd);
}
struct userdata_t *userdb_lookup(const char *key)
{
return hash_lookup(map, key);
}
bool userdb_remove(const char *key)
{
if(hash_remove(map, key))
{
userdb_write(db_file);
return true;
}
return false;
}
/* should never fail, but returns NULL if something weird happens */
struct userdata_t *userdb_add(struct userdata_t *data)
{
struct userdata_t *new = calloc(1, sizeof(*new)); /* only in C! */
memcpy(new, data, sizeof(*new));
strncpy(new->username, data->username, sizeof(new->username));
struct userdata_t *ret;
if((ret = hash_insert(map, new->username, new))) /* failure */
{
hash_remove(map, new->username);
ret = hash_insert(map, new->username, new);
}
userdb_write(db_file);
return ret;
}
void userdb_shutdown(void)
{
debugf("shutting down userdb with %d entries\n", hash_size(map));
if(map)
{
debugf("shutting down userdb\n");
hash_free(map);
map = NULL;
}
if(db_file)
{
free(db_file);
db_file = NULL;
}
}
size_t userdb_size(void)
{
return hash_size(map);
}
/* child request wrappers */
/* NOTE: also works from the master, but it's better to use the userdb_* funcs instead */
struct userdata_t *userdb_request_lookup(const char *name)
{
if(are_child)
{
send_master(REQ_GETUSERDATA, name, strlen(name) + 1);
if(reqdata_type == TYPE_USERDATA)
return &returned_reqdata.userdata;
return NULL;
}
else
return userdb_lookup(name);
}
bool userdb_request_add(struct userdata_t *data)
{
if(are_child)
{
send_master(REQ_ADDUSERDATA, data, sizeof(*data));
return returned_reqdata.boolean;
}
else
return userdb_add(data);
}
bool userdb_request_remove(const char *name)
{
if(are_child)
{
send_master(REQ_DELUSERDATA, name, strlen(name) + 1);
return returned_reqdata.boolean;
}
else
return userdb_remove(name);
}
|
