]>
Commit | Line | Data |
---|---|---|
67479a70 | 1 | /* Cache handling for passwd lookup. |
20e498bd | 2 | Copyright (C) 1998-2008, 2009 Free Software Foundation, Inc. |
d67281a7 | 3 | This file is part of the GNU C Library. |
67479a70 | 4 | Contributed by Ulrich Drepper <drepper@cygnus.com>, 1998. |
d67281a7 | 5 | |
43bc8ac6 | 6 | This program is free software; you can redistribute it and/or modify |
2e2efe65 RM |
7 | it under the terms of the GNU General Public License as published |
8 | by the Free Software Foundation; version 2 of the License, or | |
9 | (at your option) any later version. | |
d67281a7 | 10 | |
43bc8ac6 | 11 | This program is distributed in the hope that it will be useful, |
d67281a7 | 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
43bc8ac6 UD |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
14 | GNU General Public License for more details. | |
d67281a7 | 15 | |
43bc8ac6 UD |
16 | You should have received a copy of the GNU General Public License |
17 | along with this program; if not, write to the Free Software Foundation, | |
18 | Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ | |
d67281a7 | 19 | |
9caf4f1c | 20 | #include <alloca.h> |
a95a08b4 | 21 | #include <assert.h> |
d67281a7 | 22 | #include <errno.h> |
67479a70 | 23 | #include <error.h> |
a95a08b4 | 24 | #include <libintl.h> |
d67281a7 | 25 | #include <pwd.h> |
c7a9b6e2 | 26 | #include <stdbool.h> |
67479a70 UD |
27 | #include <stddef.h> |
28 | #include <stdio.h> | |
29 | #include <stdlib.h> | |
d67281a7 | 30 | #include <string.h> |
67479a70 | 31 | #include <time.h> |
ba9234d9 | 32 | #include <unistd.h> |
a95a08b4 | 33 | #include <sys/mman.h> |
0b20008e | 34 | #include <sys/socket.h> |
c7a9b6e2 | 35 | #include <stackinfo.h> |
d67281a7 | 36 | |
d67281a7 | 37 | #include "nscd.h" |
67479a70 | 38 | #include "dbg_log.h" |
eac10791 UD |
39 | #ifdef HAVE_SENDFILE |
40 | # include <kernel-features.h> | |
41 | #endif | |
d67281a7 | 42 | |
67479a70 UD |
43 | /* This is the standard reply in case the service is disabled. */ |
44 | static const pw_response_header disabled = | |
45 | { | |
c2e13112 RM |
46 | .version = NSCD_VERSION, |
47 | .found = -1, | |
48 | .pw_name_len = 0, | |
49 | .pw_passwd_len = 0, | |
50 | .pw_uid = -1, | |
51 | .pw_gid = -1, | |
52 | .pw_gecos_len = 0, | |
53 | .pw_dir_len = 0, | |
54 | .pw_shell_len = 0 | |
d67281a7 | 55 | }; |
d67281a7 | 56 | |
67479a70 UD |
57 | /* This is the struct describing how to write this record. */ |
58 | const struct iovec pwd_iov_disabled = | |
d67281a7 | 59 | { |
c2e13112 RM |
60 | .iov_base = (void *) &disabled, |
61 | .iov_len = sizeof (disabled) | |
d67281a7 | 62 | }; |
d67281a7 | 63 | |
d67281a7 | 64 | |
67479a70 UD |
65 | /* This is the standard reply in case we haven't found the dataset. */ |
66 | static const pw_response_header notfound = | |
d67281a7 | 67 | { |
c2e13112 RM |
68 | .version = NSCD_VERSION, |
69 | .found = 0, | |
70 | .pw_name_len = 0, | |
71 | .pw_passwd_len = 0, | |
72 | .pw_uid = -1, | |
73 | .pw_gid = -1, | |
74 | .pw_gecos_len = 0, | |
75 | .pw_dir_len = 0, | |
76 | .pw_shell_len = 0 | |
67479a70 | 77 | }; |
d67281a7 | 78 | |
d67281a7 | 79 | |
d67281a7 | 80 | static void |
a95a08b4 UD |
81 | cache_addpw (struct database_dyn *db, int fd, request_header *req, |
82 | const void *key, struct passwd *pwd, uid_t owner, | |
20e498bd | 83 | struct hashentry *const he, struct datahead *dh, int errval) |
d67281a7 | 84 | { |
67479a70 UD |
85 | ssize_t total; |
86 | ssize_t written; | |
87 | time_t t = time (NULL); | |
d67281a7 | 88 | |
a95a08b4 UD |
89 | /* We allocate all data in one memory block: the iov vector, |
90 | the response header and the dataset itself. */ | |
91 | struct dataset | |
92 | { | |
93 | struct datahead head; | |
94 | pw_response_header resp; | |
95 | char strdata[0]; | |
96 | } *dataset; | |
97 | ||
98 | assert (offsetof (struct dataset, resp) == offsetof (struct datahead, data)); | |
99 | ||
67479a70 | 100 | if (pwd == NULL) |
d67281a7 | 101 | { |
a95a08b4 UD |
102 | if (he != NULL && errval == EAGAIN) |
103 | { | |
104 | /* If we have an old record available but cannot find one | |
105 | now because the service is not available we keep the old | |
106 | record and make sure it does not get removed. */ | |
107 | if (reload_count != UINT_MAX && dh->nreloads == reload_count) | |
108 | /* Do not reset the value if we never not reload the record. */ | |
109 | dh->nreloads = reload_count - 1; | |
110 | ||
111 | written = total = 0; | |
112 | } | |
113 | else | |
114 | { | |
115 | /* We have no data. This means we send the standard reply for this | |
116 | case. */ | |
117 | written = total = sizeof (notfound); | |
d67281a7 | 118 | |
a95a08b4 | 119 | if (fd != -1) |
2c210d1e UD |
120 | written = TEMP_FAILURE_RETRY (send (fd, ¬found, total, |
121 | MSG_NOSIGNAL)); | |
d67281a7 | 122 | |
c52137d3 | 123 | dataset = mempool_alloc (db, sizeof (struct dataset) + req->key_len, |
20e498bd | 124 | 1); |
a95a08b4 UD |
125 | /* If we cannot permanently store the result, so be it. */ |
126 | if (dataset != NULL) | |
127 | { | |
128 | dataset->head.allocsize = sizeof (struct dataset) + req->key_len; | |
129 | dataset->head.recsize = total; | |
130 | dataset->head.notfound = true; | |
131 | dataset->head.nreloads = 0; | |
132 | dataset->head.usable = true; | |
d67281a7 | 133 | |
a95a08b4 UD |
134 | /* Compute the timeout time. */ |
135 | dataset->head.timeout = t + db->negtimeout; | |
d67281a7 | 136 | |
a95a08b4 UD |
137 | /* This is the reply. */ |
138 | memcpy (&dataset->resp, ¬found, total); | |
d67281a7 | 139 | |
a95a08b4 UD |
140 | /* Copy the key data. */ |
141 | char *key_copy = memcpy (dataset->strdata, key, req->key_len); | |
d67281a7 | 142 | |
cf244b74 UD |
143 | /* If necessary, we also propagate the data to disk. */ |
144 | if (db->persistent) | |
145 | { | |
146 | // XXX async OK? | |
147 | uintptr_t pval = (uintptr_t) dataset & ~pagesize_m1; | |
148 | msync ((void *) pval, | |
149 | ((uintptr_t) dataset & pagesize_m1) | |
150 | + sizeof (struct dataset) + req->key_len, MS_ASYNC); | |
151 | } | |
152 | ||
7e71e55f | 153 | (void) cache_add (req->type, key_copy, req->key_len, |
528741cb | 154 | &dataset->head, true, db, owner, he == NULL); |
a95a08b4 UD |
155 | |
156 | pthread_rwlock_unlock (&db->lock); | |
157 | ||
158 | /* Mark the old entry as obsolete. */ | |
159 | if (dh != NULL) | |
160 | dh->usable = false; | |
161 | } | |
99bb9f42 | 162 | } |
d67281a7 UD |
163 | } |
164 | else | |
165 | { | |
67479a70 | 166 | /* Determine the I/O structure. */ |
67479a70 UD |
167 | size_t pw_name_len = strlen (pwd->pw_name) + 1; |
168 | size_t pw_passwd_len = strlen (pwd->pw_passwd) + 1; | |
169 | size_t pw_gecos_len = strlen (pwd->pw_gecos) + 1; | |
170 | size_t pw_dir_len = strlen (pwd->pw_dir) + 1; | |
171 | size_t pw_shell_len = strlen (pwd->pw_shell) + 1; | |
172 | char *cp; | |
a95a08b4 UD |
173 | const size_t key_len = strlen (key); |
174 | const size_t buf_len = 3 * sizeof (pwd->pw_uid) + key_len + 1; | |
175 | char *buf = alloca (buf_len); | |
67479a70 UD |
176 | ssize_t n; |
177 | ||
178 | /* We need this to insert the `byuid' entry. */ | |
a95a08b4 UD |
179 | int key_offset; |
180 | n = snprintf (buf, buf_len, "%d%c%n%s", pwd->pw_uid, '\0', | |
181 | &key_offset, (char *) key) + 1; | |
182 | ||
5a337776 UD |
183 | written = total = (offsetof (struct dataset, strdata) |
184 | + pw_name_len + pw_passwd_len | |
a95a08b4 UD |
185 | + pw_gecos_len + pw_dir_len + pw_shell_len); |
186 | ||
187 | /* If we refill the cache, first assume the reconrd did not | |
188 | change. Allocate memory on the cache since it is likely | |
189 | discarded anyway. If it turns out to be necessary to have a | |
190 | new record we can still allocate real memory. */ | |
191 | bool alloca_used = false; | |
192 | dataset = NULL; | |
193 | ||
194 | if (he == NULL) | |
20e498bd | 195 | dataset = (struct dataset *) mempool_alloc (db, total + n, 1); |
a95a08b4 UD |
196 | |
197 | if (dataset == NULL) | |
198 | { | |
199 | /* We cannot permanently add the result in the moment. But | |
200 | we can provide the result as is. Store the data in some | |
201 | temporary memory. */ | |
202 | dataset = (struct dataset *) alloca (total + n); | |
203 | ||
204 | /* We cannot add this record to the permanent database. */ | |
205 | alloca_used = true; | |
206 | } | |
207 | ||
208 | dataset->head.allocsize = total + n; | |
209 | dataset->head.recsize = total - offsetof (struct dataset, resp); | |
210 | dataset->head.notfound = false; | |
211 | dataset->head.nreloads = he == NULL ? 0 : (dh->nreloads + 1); | |
212 | dataset->head.usable = true; | |
213 | ||
214 | /* Compute the timeout time. */ | |
215 | dataset->head.timeout = t + db->postimeout; | |
216 | ||
217 | dataset->resp.version = NSCD_VERSION; | |
218 | dataset->resp.found = 1; | |
219 | dataset->resp.pw_name_len = pw_name_len; | |
220 | dataset->resp.pw_passwd_len = pw_passwd_len; | |
221 | dataset->resp.pw_uid = pwd->pw_uid; | |
222 | dataset->resp.pw_gid = pwd->pw_gid; | |
223 | dataset->resp.pw_gecos_len = pw_gecos_len; | |
224 | dataset->resp.pw_dir_len = pw_dir_len; | |
225 | dataset->resp.pw_shell_len = pw_shell_len; | |
226 | ||
227 | cp = dataset->strdata; | |
67479a70 UD |
228 | |
229 | /* Copy the strings over into the buffer. */ | |
230 | cp = mempcpy (cp, pwd->pw_name, pw_name_len); | |
231 | cp = mempcpy (cp, pwd->pw_passwd, pw_passwd_len); | |
232 | cp = mempcpy (cp, pwd->pw_gecos, pw_gecos_len); | |
233 | cp = mempcpy (cp, pwd->pw_dir, pw_dir_len); | |
234 | cp = mempcpy (cp, pwd->pw_shell, pw_shell_len); | |
235 | ||
a95a08b4 | 236 | /* Finally the stringified UID value. */ |
67479a70 | 237 | memcpy (cp, buf, n); |
a95a08b4 UD |
238 | char *key_copy = cp + key_offset; |
239 | assert (key_copy == (char *) rawmemchr (cp, '\0') + 1); | |
67479a70 | 240 | |
5a337776 UD |
241 | assert (cp == dataset->strdata + total - offsetof (struct dataset, |
242 | strdata)); | |
243 | ||
a95a08b4 UD |
244 | /* Now we can determine whether on refill we have to create a new |
245 | record or not. */ | |
246 | if (he != NULL) | |
247 | { | |
248 | assert (fd == -1); | |
801ddb6a | 249 | |
20e498bd | 250 | if (dataset->head.allocsize == dh->allocsize |
5a337776 | 251 | && dataset->head.recsize == dh->recsize |
a95a08b4 UD |
252 | && memcmp (&dataset->resp, dh->data, |
253 | dh->allocsize - offsetof (struct dataset, resp)) == 0) | |
254 | { | |
cf244b74 | 255 | /* The data has not changed. We will just bump the |
a95a08b4 UD |
256 | timeout value. Note that the new record has been |
257 | allocated on the stack and need not be freed. */ | |
258 | dh->timeout = dataset->head.timeout; | |
259 | ++dh->nreloads; | |
260 | } | |
261 | else | |
262 | { | |
263 | /* We have to create a new record. Just allocate | |
264 | appropriate memory and copy it. */ | |
265 | struct dataset *newp | |
20e498bd | 266 | = (struct dataset *) mempool_alloc (db, total + n, 1); |
a95a08b4 UD |
267 | if (newp != NULL) |
268 | { | |
269 | /* Adjust pointer into the memory block. */ | |
270 | cp = (char *) newp + (cp - (char *) dataset); | |
61705e06 | 271 | key_copy = (char *) newp + (key_copy - (char *) dataset); |
a95a08b4 UD |
272 | |
273 | dataset = memcpy (newp, dataset, total + n); | |
274 | alloca_used = false; | |
275 | } | |
276 | ||
277 | /* Mark the old record as obsolete. */ | |
278 | dh->usable = false; | |
279 | } | |
280 | } | |
281 | else | |
282 | { | |
283 | /* We write the dataset before inserting it to the database | |
284 | since while inserting this thread might block and so would | |
285 | unnecessarily let the receiver wait. */ | |
286 | assert (fd != -1); | |
67479a70 | 287 | |
eac10791 | 288 | #ifdef HAVE_SENDFILE |
74158740 | 289 | if (__builtin_expect (db->mmap_used, 1) && !alloca_used) |
eac10791 UD |
290 | { |
291 | assert (db->wr_fd != -1); | |
292 | assert ((char *) &dataset->resp > (char *) db->data); | |
293 | assert ((char *) &dataset->resp - (char *) db->head | |
294 | + total | |
295 | <= (sizeof (struct database_pers_head) | |
296 | + db->head->module * sizeof (ref_t) | |
297 | + db->head->data_size)); | |
bd547139 UD |
298 | written = sendfileall (fd, db->wr_fd, |
299 | (char *) &dataset->resp | |
300 | - (char *) db->head, total); | |
eac10791 UD |
301 | # ifndef __ASSUME_SENDFILE |
302 | if (written == -1 && errno == ENOSYS) | |
303 | goto use_write; | |
304 | # endif | |
305 | } | |
306 | else | |
307 | # ifndef __ASSUME_SENDFILE | |
308 | use_write: | |
309 | # endif | |
310 | #endif | |
311 | written = writeall (fd, &dataset->resp, total); | |
a95a08b4 | 312 | } |
67479a70 | 313 | |
67479a70 | 314 | |
a95a08b4 UD |
315 | /* Add the record to the database. But only if it has not been |
316 | stored on the stack. */ | |
317 | if (! alloca_used) | |
318 | { | |
319 | /* If necessary, we also propagate the data to disk. */ | |
320 | if (db->persistent) | |
3418007e UD |
321 | { |
322 | // XXX async OK? | |
323 | uintptr_t pval = (uintptr_t) dataset & ~pagesize_m1; | |
324 | msync ((void *) pval, | |
325 | ((uintptr_t) dataset & pagesize_m1) + total + n, | |
326 | MS_ASYNC); | |
327 | } | |
67479a70 | 328 | |
a95a08b4 UD |
329 | /* NB: in the following code we always must add the entry |
330 | marked with FIRST first. Otherwise we end up with | |
331 | dangling "pointers" in case a latter hash entry cannot be | |
332 | added. */ | |
797ed6f7 | 333 | bool first = true; |
67479a70 | 334 | |
a95a08b4 | 335 | /* If the request was by UID, add that entry first. */ |
797ed6f7 | 336 | if (req->type == GETPWBYUID) |
a95a08b4 | 337 | { |
03e157d8 | 338 | if (cache_add (GETPWBYUID, cp, key_offset, &dataset->head, true, |
528741cb | 339 | db, owner, he == NULL) < 0) |
7e71e55f | 340 | goto out; |
797ed6f7 UD |
341 | |
342 | first = false; | |
a95a08b4 UD |
343 | } |
344 | /* If the key is different from the name add a separate entry. */ | |
345 | else if (strcmp (key_copy, dataset->strdata) != 0) | |
346 | { | |
347 | if (cache_add (GETPWBYNAME, key_copy, key_len + 1, | |
528741cb | 348 | &dataset->head, true, db, owner, he == NULL) < 0) |
7e71e55f | 349 | goto out; |
a95a08b4 UD |
350 | |
351 | first = false; | |
352 | } | |
353 | ||
354 | /* We have to add the value for both, byname and byuid. */ | |
797ed6f7 UD |
355 | if ((req->type == GETPWBYNAME || db->propagate) |
356 | && __builtin_expect (cache_add (GETPWBYNAME, dataset->strdata, | |
357 | pw_name_len, &dataset->head, | |
528741cb UD |
358 | first, db, owner, he == NULL) |
359 | == 0, 1)) | |
a95a08b4 | 360 | { |
797ed6f7 | 361 | if (req->type == GETPWBYNAME && db->propagate) |
03e157d8 | 362 | (void) cache_add (GETPWBYUID, cp, key_offset, &dataset->head, |
528741cb | 363 | false, db, owner, false); |
a95a08b4 | 364 | } |
a95a08b4 UD |
365 | |
366 | out: | |
367 | pthread_rwlock_unlock (&db->lock); | |
368 | } | |
d67281a7 | 369 | } |
14e9dd67 | 370 | |
23700036 | 371 | if (__builtin_expect (written != total, 0) && debug_level > 0) |
d67281a7 | 372 | { |
67479a70 UD |
373 | char buf[256]; |
374 | dbg_log (_("short write in %s: %s"), __FUNCTION__, | |
375 | strerror_r (errno, buf, sizeof (buf))); | |
d67281a7 | 376 | } |
d67281a7 UD |
377 | } |
378 | ||
d67281a7 | 379 | |
a95a08b4 UD |
380 | union keytype |
381 | { | |
382 | void *v; | |
383 | uid_t u; | |
384 | }; | |
385 | ||
386 | ||
387 | static int | |
388 | lookup (int type, union keytype key, struct passwd *resultbufp, char *buffer, | |
389 | size_t buflen, struct passwd **pwd) | |
390 | { | |
391 | if (type == GETPWBYNAME) | |
392 | return __getpwnam_r (key.v, resultbufp, buffer, buflen, pwd); | |
393 | else | |
394 | return __getpwuid_r (key.u, resultbufp, buffer, buflen, pwd); | |
395 | } | |
396 | ||
397 | ||
398 | static void | |
399 | addpwbyX (struct database_dyn *db, int fd, request_header *req, | |
400 | union keytype key, const char *keystr, uid_t c_uid, | |
401 | struct hashentry *he, struct datahead *dh) | |
67479a70 UD |
402 | { |
403 | /* Search for the entry matching the key. Please note that we don't | |
404 | look again in the table whether the dataset is now available. We | |
405 | simply insert it. It does not matter if it is in there twice. The | |
406 | pruning function only will look at the timestamp. */ | |
a95a08b4 | 407 | size_t buflen = 1024; |
c7a9b6e2 | 408 | char *buffer = (char *) alloca (buflen); |
67479a70 UD |
409 | struct passwd resultbuf; |
410 | struct passwd *pwd; | |
c7a9b6e2 | 411 | bool use_malloc = false; |
a95a08b4 | 412 | int errval = 0; |
d67281a7 | 413 | |
c7a9b6e2 | 414 | if (__builtin_expect (debug_level > 0, 0)) |
a95a08b4 UD |
415 | { |
416 | if (he == NULL) | |
417 | dbg_log (_("Haven't found \"%s\" in password cache!"), keystr); | |
418 | else | |
419 | dbg_log (_("Reloading \"%s\" in password cache!"), keystr); | |
420 | } | |
d67281a7 | 421 | |
a95a08b4 UD |
422 | while (lookup (req->type, key, &resultbuf, buffer, buflen, &pwd) != 0 |
423 | && (errval = errno) == ERANGE) | |
d67281a7 | 424 | { |
67479a70 | 425 | errno = 0; |
c7a9b6e2 UD |
426 | |
427 | if (__builtin_expect (buflen > 32768, 0)) | |
428 | { | |
b21fa963 | 429 | char *old_buffer = buffer; |
4379b403 | 430 | buflen *= 2; |
c7a9b6e2 UD |
431 | buffer = (char *) realloc (use_malloc ? buffer : NULL, buflen); |
432 | if (buffer == NULL) | |
433 | { | |
434 | /* We ran out of memory. We cannot do anything but | |
435 | sending a negative response. In reality this should | |
436 | never happen. */ | |
437 | pwd = NULL; | |
438 | buffer = old_buffer; | |
a95a08b4 UD |
439 | |
440 | /* We set the error to indicate this is (possibly) a | |
441 | temporary error and that it does not mean the entry | |
442 | is not available at all. */ | |
443 | errval = EAGAIN; | |
c7a9b6e2 UD |
444 | break; |
445 | } | |
446 | use_malloc = true; | |
447 | } | |
448 | else | |
9caf4f1c UD |
449 | /* Allocate a new buffer on the stack. If possible combine it |
450 | with the previously allocated buffer. */ | |
4379b403 | 451 | buffer = (char *) extend_alloca (buffer, buflen, 2 * buflen); |
d67281a7 | 452 | } |
14e9dd67 | 453 | |
a95a08b4 UD |
454 | /* Add the entry to the cache. */ |
455 | cache_addpw (db, fd, req, keystr, pwd, c_uid, he, dh, errval); | |
c7a9b6e2 UD |
456 | |
457 | if (use_malloc) | |
458 | free (buffer); | |
d67281a7 UD |
459 | } |
460 | ||
d67281a7 | 461 | |
67479a70 | 462 | void |
a95a08b4 UD |
463 | addpwbyname (struct database_dyn *db, int fd, request_header *req, |
464 | void *key, uid_t c_uid) | |
465 | { | |
466 | union keytype u = { .v = key }; | |
467 | ||
468 | addpwbyX (db, fd, req, u, key, c_uid, NULL, NULL); | |
469 | } | |
470 | ||
471 | ||
472 | void | |
473 | readdpwbyname (struct database_dyn *db, struct hashentry *he, | |
474 | struct datahead *dh) | |
475 | { | |
476 | request_header req = | |
477 | { | |
478 | .type = GETPWBYNAME, | |
479 | .key_len = he->len | |
480 | }; | |
481 | union keytype u = { .v = db->data + he->key }; | |
482 | ||
483 | addpwbyX (db, -1, &req, u, db->data + he->key, he->owner, he, dh); | |
484 | } | |
485 | ||
486 | ||
487 | void | |
488 | addpwbyuid (struct database_dyn *db, int fd, request_header *req, | |
a1c542bf | 489 | void *key, uid_t c_uid) |
67479a70 | 490 | { |
8e9b2075 | 491 | char *ep; |
c7a9b6e2 | 492 | uid_t uid = strtoul ((char *) key, &ep, 10); |
c7a9b6e2 UD |
493 | |
494 | if (*(char *) key == '\0' || *ep != '\0') /* invalid numeric uid */ | |
8e9b2075 | 495 | { |
c7a9b6e2 UD |
496 | if (debug_level > 0) |
497 | dbg_log (_("Invalid numeric uid \"%s\"!"), (char *) key); | |
8e9b2075 UD |
498 | |
499 | errno = EINVAL; | |
500 | return; | |
501 | } | |
d67281a7 | 502 | |
a95a08b4 | 503 | union keytype u = { .u = uid }; |
d67281a7 | 504 | |
a95a08b4 UD |
505 | addpwbyX (db, fd, req, u, key, c_uid, NULL, NULL); |
506 | } | |
a1c542bf | 507 | |
c7a9b6e2 | 508 | |
a95a08b4 UD |
509 | void |
510 | readdpwbyuid (struct database_dyn *db, struct hashentry *he, | |
511 | struct datahead *dh) | |
512 | { | |
513 | char *ep; | |
514 | uid_t uid = strtoul (db->data + he->key, &ep, 10); | |
d67281a7 | 515 | |
a95a08b4 UD |
516 | /* Since the key has been added before it must be OK. */ |
517 | assert (*(db->data + he->key) != '\0' && *ep == '\0'); | |
a1c542bf | 518 | |
a95a08b4 UD |
519 | request_header req = |
520 | { | |
521 | .type = GETPWBYUID, | |
522 | .key_len = he->len | |
523 | }; | |
524 | union keytype u = { .u = uid }; | |
c7a9b6e2 | 525 | |
a95a08b4 | 526 | addpwbyX (db, -1, &req, u, db->data + he->key, he->owner, he, dh); |
d67281a7 | 527 | } |