]>
Commit | Line | Data |
---|---|---|
67479a70 | 1 | /* Cache handling for group lookup. |
bfff8b1b | 2 | Copyright (C) 1998-2017 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 | 16 | You should have received a copy of the GNU General Public License |
59ba27a6 | 17 | along with this program; if not, see <http://www.gnu.org/licenses/>. */ |
d67281a7 | 18 | |
9caf4f1c | 19 | #include <alloca.h> |
a95a08b4 | 20 | #include <assert.h> |
d67281a7 | 21 | #include <errno.h> |
67479a70 | 22 | #include <error.h> |
d67281a7 | 23 | #include <grp.h> |
a95a08b4 | 24 | #include <libintl.h> |
0472723a | 25 | #include <stdbool.h> |
67479a70 UD |
26 | #include <stddef.h> |
27 | #include <stdio.h> | |
3107c0c5 | 28 | #include <stdint.h> |
da2d1bc5 | 29 | #include <stdlib.h> |
d67281a7 | 30 | #include <string.h> |
ba9234d9 | 31 | #include <unistd.h> |
a95a08b4 | 32 | #include <sys/mman.h> |
0b20008e | 33 | #include <sys/socket.h> |
0472723a | 34 | #include <stackinfo.h> |
d67281a7 | 35 | |
d67281a7 | 36 | #include "nscd.h" |
67479a70 | 37 | #include "dbg_log.h" |
eac10791 UD |
38 | #ifdef HAVE_SENDFILE |
39 | # include <kernel-features.h> | |
40 | #endif | |
d67281a7 | 41 | |
67479a70 UD |
42 | /* This is the standard reply in case the service is disabled. */ |
43 | static const gr_response_header disabled = | |
d67281a7 | 44 | { |
c2e13112 RM |
45 | .version = NSCD_VERSION, |
46 | .found = -1, | |
47 | .gr_name_len = 0, | |
48 | .gr_passwd_len = 0, | |
49 | .gr_gid = -1, | |
50 | .gr_mem_cnt = 0, | |
d67281a7 | 51 | }; |
d67281a7 | 52 | |
67479a70 UD |
53 | /* This is the struct describing how to write this record. */ |
54 | const struct iovec grp_iov_disabled = | |
d67281a7 | 55 | { |
c2e13112 RM |
56 | .iov_base = (void *) &disabled, |
57 | .iov_len = sizeof (disabled) | |
d67281a7 | 58 | }; |
d67281a7 | 59 | |
67479a70 UD |
60 | |
61 | /* This is the standard reply in case we haven't found the dataset. */ | |
62 | static const gr_response_header notfound = | |
d67281a7 | 63 | { |
c2e13112 RM |
64 | .version = NSCD_VERSION, |
65 | .found = 0, | |
66 | .gr_name_len = 0, | |
67 | .gr_passwd_len = 0, | |
68 | .gr_gid = -1, | |
69 | .gr_mem_cnt = 0, | |
d67281a7 | 70 | }; |
d67281a7 | 71 | |
d67281a7 | 72 | |
a4c7ea7b | 73 | static time_t |
a95a08b4 UD |
74 | cache_addgr (struct database_dyn *db, int fd, request_header *req, |
75 | const void *key, struct group *grp, uid_t owner, | |
20e498bd | 76 | struct hashentry *const he, struct datahead *dh, int errval) |
d67281a7 | 77 | { |
306dfba9 | 78 | bool all_written = true; |
67479a70 | 79 | ssize_t total; |
67479a70 | 80 | time_t t = time (NULL); |
d67281a7 | 81 | |
a95a08b4 UD |
82 | /* We allocate all data in one memory block: the iov vector, |
83 | the response header and the dataset itself. */ | |
84 | struct dataset | |
85 | { | |
86 | struct datahead head; | |
87 | gr_response_header resp; | |
88 | char strdata[0]; | |
89 | } *dataset; | |
90 | ||
91 | assert (offsetof (struct dataset, resp) == offsetof (struct datahead, data)); | |
92 | ||
a4c7ea7b | 93 | time_t timeout = MAX_TIMEOUT_VALUE; |
67479a70 | 94 | if (grp == NULL) |
d67281a7 | 95 | { |
a95a08b4 UD |
96 | if (he != NULL && errval == EAGAIN) |
97 | { | |
98 | /* If we have an old record available but cannot find one | |
99 | now because the service is not available we keep the old | |
100 | record and make sure it does not get removed. */ | |
101 | if (reload_count != UINT_MAX) | |
102 | /* Do not reset the value if we never not reload the record. */ | |
103 | dh->nreloads = reload_count - 1; | |
104 | ||
a4c7ea7b UD |
105 | /* Reload with the same time-to-live value. */ |
106 | timeout = dh->timeout = t + db->postimeout; | |
107 | ||
306dfba9 | 108 | total = 0; |
a95a08b4 UD |
109 | } |
110 | else | |
111 | { | |
112 | /* We have no data. This means we send the standard reply for this | |
113 | case. */ | |
114 | total = sizeof (notfound); | |
d67281a7 | 115 | |
306dfba9 AS |
116 | if (fd != -1 |
117 | && TEMP_FAILURE_RETRY (send (fd, ¬found, total, | |
118 | MSG_NOSIGNAL)) != total) | |
119 | all_written = false; | |
d67281a7 | 120 | |
3e1aa84e UD |
121 | /* If we have a transient error or cannot permanently store |
122 | the result, so be it. */ | |
123 | if (errno == EAGAIN || __builtin_expect (db->negtimeout == 0, 0)) | |
445b4a53 TK |
124 | { |
125 | /* Mark the old entry as obsolete. */ | |
126 | if (dh != NULL) | |
127 | dh->usable = false; | |
128 | } | |
129 | else if ((dataset = mempool_alloc (db, sizeof (struct dataset) + req->key_len, 1)) != NULL) | |
a95a08b4 | 130 | { |
1cdeb237 SP |
131 | timeout = datahead_init_neg (&dataset->head, |
132 | (sizeof (struct dataset) | |
133 | + req->key_len), total, | |
134 | db->negtimeout); | |
14e9dd67 | 135 | |
a95a08b4 UD |
136 | /* This is the reply. */ |
137 | memcpy (&dataset->resp, ¬found, total); | |
d67281a7 | 138 | |
a95a08b4 UD |
139 | /* Copy the key data. */ |
140 | memcpy (dataset->strdata, key, req->key_len); | |
d67281a7 | 141 | |
cf244b74 UD |
142 | /* If necessary, we also propagate the data to disk. */ |
143 | if (db->persistent) | |
144 | { | |
145 | // XXX async OK? | |
146 | uintptr_t pval = (uintptr_t) dataset & ~pagesize_m1; | |
147 | msync ((void *) pval, | |
148 | ((uintptr_t) dataset & pagesize_m1) | |
149 | + sizeof (struct dataset) + req->key_len, MS_ASYNC); | |
150 | } | |
151 | ||
7e71e55f | 152 | (void) cache_add (req->type, &dataset->strdata, req->key_len, |
528741cb | 153 | &dataset->head, true, db, owner, he == NULL); |
a95a08b4 | 154 | |
00ebd7ed UD |
155 | pthread_rwlock_unlock (&db->lock); |
156 | ||
a95a08b4 UD |
157 | /* Mark the old entry as obsolete. */ |
158 | if (dh != NULL) | |
159 | dh->usable = false; | |
160 | } | |
99bb9f42 | 161 | } |
d67281a7 | 162 | } |
ba9234d9 UD |
163 | else |
164 | { | |
67479a70 | 165 | /* Determine the I/O structure. */ |
67479a70 UD |
166 | size_t gr_name_len = strlen (grp->gr_name) + 1; |
167 | size_t gr_passwd_len = strlen (grp->gr_passwd) + 1; | |
168 | size_t gr_mem_cnt = 0; | |
3107c0c5 | 169 | uint32_t *gr_mem_len; |
67479a70 UD |
170 | size_t gr_mem_len_total = 0; |
171 | char *gr_name; | |
172 | char *cp; | |
a95a08b4 | 173 | const size_t key_len = strlen (key); |
9f3731cf | 174 | const size_t buf_len = 3 * sizeof (grp->gr_gid) + key_len + 1; |
2af1b328 JL |
175 | size_t alloca_used = 0; |
176 | char *buf = alloca_account (buf_len, alloca_used); | |
67479a70 UD |
177 | ssize_t n; |
178 | size_t cnt; | |
179 | ||
180 | /* We need this to insert the `bygid' entry. */ | |
a95a08b4 UD |
181 | int key_offset; |
182 | n = snprintf (buf, buf_len, "%d%c%n%s", grp->gr_gid, '\0', | |
183 | &key_offset, (char *) key) + 1; | |
67479a70 UD |
184 | |
185 | /* Determine the length of all members. */ | |
186 | while (grp->gr_mem[gr_mem_cnt]) | |
187 | ++gr_mem_cnt; | |
2af1b328 | 188 | gr_mem_len = alloca_account (gr_mem_cnt * sizeof (uint32_t), alloca_used); |
67479a70 UD |
189 | for (gr_mem_cnt = 0; grp->gr_mem[gr_mem_cnt]; ++gr_mem_cnt) |
190 | { | |
191 | gr_mem_len[gr_mem_cnt] = strlen (grp->gr_mem[gr_mem_cnt]) + 1; | |
192 | gr_mem_len_total += gr_mem_len[gr_mem_cnt]; | |
193 | } | |
ba9234d9 | 194 | |
306dfba9 AS |
195 | total = (offsetof (struct dataset, strdata) |
196 | + gr_mem_cnt * sizeof (uint32_t) | |
197 | + gr_name_len + gr_passwd_len + gr_mem_len_total); | |
a95a08b4 UD |
198 | |
199 | /* If we refill the cache, first assume the reconrd did not | |
200 | change. Allocate memory on the cache since it is likely | |
201 | discarded anyway. If it turns out to be necessary to have a | |
202 | new record we can still allocate real memory. */ | |
2af1b328 JL |
203 | bool dataset_temporary = false; |
204 | bool dataset_malloced = false; | |
a95a08b4 UD |
205 | dataset = NULL; |
206 | ||
207 | if (he == NULL) | |
bd499987 AS |
208 | { |
209 | /* Prevent an INVALIDATE request from pruning the data between | |
210 | the two calls to cache_add. */ | |
211 | if (db->propagate) | |
212 | pthread_mutex_lock (&db->prune_run_lock); | |
213 | dataset = (struct dataset *) mempool_alloc (db, total + n, 1); | |
214 | } | |
a95a08b4 UD |
215 | |
216 | if (dataset == NULL) | |
217 | { | |
bd499987 AS |
218 | if (he == NULL && db->propagate) |
219 | pthread_mutex_unlock (&db->prune_run_lock); | |
220 | ||
a95a08b4 UD |
221 | /* We cannot permanently add the result in the moment. But |
222 | we can provide the result as is. Store the data in some | |
223 | temporary memory. */ | |
2af1b328 JL |
224 | if (! __libc_use_alloca (alloca_used + total + n)) |
225 | { | |
226 | dataset = malloc (total + n); | |
227 | /* Perhaps we should log a message that we were unable | |
228 | to allocate memory for a large request. */ | |
229 | if (dataset == NULL) | |
230 | goto out; | |
231 | dataset_malloced = true; | |
232 | } | |
233 | else | |
234 | dataset = alloca_account (total + n, alloca_used); | |
a95a08b4 UD |
235 | |
236 | /* We cannot add this record to the permanent database. */ | |
2af1b328 | 237 | dataset_temporary = true; |
a95a08b4 UD |
238 | } |
239 | ||
1cdeb237 SP |
240 | timeout = datahead_init_pos (&dataset->head, total + n, |
241 | total - offsetof (struct dataset, resp), | |
242 | he == NULL ? 0 : dh->nreloads + 1, | |
243 | db->postimeout); | |
a95a08b4 UD |
244 | |
245 | dataset->resp.version = NSCD_VERSION; | |
246 | dataset->resp.found = 1; | |
247 | dataset->resp.gr_name_len = gr_name_len; | |
248 | dataset->resp.gr_passwd_len = gr_passwd_len; | |
249 | dataset->resp.gr_gid = grp->gr_gid; | |
250 | dataset->resp.gr_mem_cnt = gr_mem_cnt; | |
251 | ||
252 | cp = dataset->strdata; | |
d67281a7 | 253 | |
67479a70 | 254 | /* This is the member string length array. */ |
3107c0c5 | 255 | cp = mempcpy (cp, gr_mem_len, gr_mem_cnt * sizeof (uint32_t)); |
0a55a284 UD |
256 | gr_name = cp; |
257 | cp = mempcpy (cp, grp->gr_name, gr_name_len); | |
67479a70 | 258 | cp = mempcpy (cp, grp->gr_passwd, gr_passwd_len); |
d67281a7 | 259 | |
67479a70 UD |
260 | for (cnt = 0; cnt < gr_mem_cnt; ++cnt) |
261 | cp = mempcpy (cp, grp->gr_mem[cnt], gr_mem_len[cnt]); | |
d67281a7 | 262 | |
a95a08b4 | 263 | /* Finally the stringified GID value. */ |
67479a70 | 264 | memcpy (cp, buf, n); |
a95a08b4 UD |
265 | char *key_copy = cp + key_offset; |
266 | assert (key_copy == (char *) rawmemchr (cp, '\0') + 1); | |
d67281a7 | 267 | |
5a337776 UD |
268 | assert (cp == dataset->strdata + total - offsetof (struct dataset, |
269 | strdata)); | |
270 | ||
a95a08b4 UD |
271 | /* Now we can determine whether on refill we have to create a new |
272 | record or not. */ | |
273 | if (he != NULL) | |
274 | { | |
275 | assert (fd == -1); | |
d6db0975 | 276 | |
a95a08b4 UD |
277 | if (total + n == dh->allocsize |
278 | && total - offsetof (struct dataset, resp) == dh->recsize | |
279 | && memcmp (&dataset->resp, dh->data, | |
280 | dh->allocsize - offsetof (struct dataset, resp)) == 0) | |
281 | { | |
282 | /* The data has not changed. We will just bump the | |
283 | timeout value. Note that the new record has been | |
284 | allocated on the stack and need not be freed. */ | |
285 | dh->timeout = dataset->head.timeout; | |
286 | ++dh->nreloads; | |
2af1b328 JL |
287 | |
288 | /* If the new record was allocated via malloc, then we must free | |
289 | it here. */ | |
290 | if (dataset_malloced) | |
291 | free (dataset); | |
a95a08b4 UD |
292 | } |
293 | else | |
294 | { | |
295 | /* We have to create a new record. Just allocate | |
296 | appropriate memory and copy it. */ | |
297 | struct dataset *newp | |
20e498bd | 298 | = (struct dataset *) mempool_alloc (db, total + n, 1); |
a95a08b4 UD |
299 | if (newp != NULL) |
300 | { | |
301 | /* Adjust pointers into the memory block. */ | |
302 | gr_name = (char *) newp + (gr_name - (char *) dataset); | |
303 | cp = (char *) newp + (cp - (char *) dataset); | |
c8703f88 | 304 | key_copy = (char *) newp + (key_copy - (char *) dataset); |
a95a08b4 UD |
305 | |
306 | dataset = memcpy (newp, dataset, total + n); | |
2af1b328 | 307 | dataset_temporary = false; |
a95a08b4 UD |
308 | } |
309 | ||
310 | /* Mark the old record as obsolete. */ | |
311 | dh->usable = false; | |
312 | } | |
313 | } | |
314 | else | |
315 | { | |
316 | /* We write the dataset before inserting it to the database | |
317 | since while inserting this thread might block and so would | |
318 | unnecessarily let the receiver wait. */ | |
319 | assert (fd != -1); | |
d67281a7 | 320 | |
eac10791 | 321 | #ifdef HAVE_SENDFILE |
2af1b328 | 322 | if (__builtin_expect (db->mmap_used, 1) && ! dataset_temporary) |
eac10791 UD |
323 | { |
324 | assert (db->wr_fd != -1); | |
325 | assert ((char *) &dataset->resp > (char *) db->data); | |
ea547a1a | 326 | assert ((char *) dataset - (char *) db->head |
eac10791 UD |
327 | + total |
328 | <= (sizeof (struct database_pers_head) | |
329 | + db->head->module * sizeof (ref_t) | |
330 | + db->head->data_size)); | |
306dfba9 AS |
331 | ssize_t written = sendfileall (fd, db->wr_fd, |
332 | (char *) &dataset->resp | |
333 | - (char *) db->head, | |
334 | dataset->head.recsize); | |
335 | if (written != dataset->head.recsize) | |
336 | { | |
eac10791 | 337 | # ifndef __ASSUME_SENDFILE |
306dfba9 AS |
338 | if (written == -1 && errno == ENOSYS) |
339 | goto use_write; | |
eac10791 | 340 | # endif |
306dfba9 AS |
341 | all_written = false; |
342 | } | |
eac10791 UD |
343 | } |
344 | else | |
345 | # ifndef __ASSUME_SENDFILE | |
346 | use_write: | |
347 | # endif | |
348 | #endif | |
306dfba9 AS |
349 | if (writeall (fd, &dataset->resp, dataset->head.recsize) |
350 | != dataset->head.recsize) | |
351 | all_written = false; | |
a95a08b4 | 352 | } |
d67281a7 | 353 | |
a95a08b4 UD |
354 | /* Add the record to the database. But only if it has not been |
355 | stored on the stack. */ | |
2af1b328 | 356 | if (! dataset_temporary) |
a95a08b4 UD |
357 | { |
358 | /* If necessary, we also propagate the data to disk. */ | |
359 | if (db->persistent) | |
3418007e UD |
360 | { |
361 | // XXX async OK? | |
362 | uintptr_t pval = (uintptr_t) dataset & ~pagesize_m1; | |
363 | msync ((void *) pval, | |
364 | ((uintptr_t) dataset & pagesize_m1) + total + n, | |
365 | MS_ASYNC); | |
366 | } | |
14e9dd67 | 367 | |
a95a08b4 UD |
368 | /* NB: in the following code we always must add the entry |
369 | marked with FIRST first. Otherwise we end up with | |
370 | dangling "pointers" in case a latter hash entry cannot be | |
371 | added. */ | |
797ed6f7 | 372 | bool first = true; |
dc630ccc | 373 | |
a95a08b4 | 374 | /* If the request was by GID, add that entry first. */ |
797ed6f7 | 375 | if (req->type == GETGRBYGID) |
a95a08b4 | 376 | { |
3d73c4ba | 377 | if (cache_add (GETGRBYGID, cp, key_offset, &dataset->head, true, |
528741cb | 378 | db, owner, he == NULL) < 0) |
7e71e55f | 379 | goto out; |
797ed6f7 UD |
380 | |
381 | first = false; | |
a95a08b4 UD |
382 | } |
383 | /* If the key is different from the name add a separate entry. */ | |
384 | else if (strcmp (key_copy, gr_name) != 0) | |
385 | { | |
386 | if (cache_add (GETGRBYNAME, key_copy, key_len + 1, | |
528741cb | 387 | &dataset->head, true, db, owner, he == NULL) < 0) |
7e71e55f | 388 | goto out; |
a95a08b4 UD |
389 | |
390 | first = false; | |
391 | } | |
392 | ||
393 | /* We have to add the value for both, byname and byuid. */ | |
797ed6f7 UD |
394 | if ((req->type == GETGRBYNAME || db->propagate) |
395 | && __builtin_expect (cache_add (GETGRBYNAME, gr_name, | |
396 | gr_name_len, | |
528741cb UD |
397 | &dataset->head, first, db, owner, |
398 | he == NULL) | |
797ed6f7 | 399 | == 0, 1)) |
a95a08b4 | 400 | { |
797ed6f7 | 401 | if (req->type == GETGRBYNAME && db->propagate) |
3d73c4ba | 402 | (void) cache_add (GETGRBYGID, cp, key_offset, &dataset->head, |
528741cb | 403 | false, db, owner, false); |
a95a08b4 | 404 | } |
00ebd7ed UD |
405 | |
406 | out: | |
407 | pthread_rwlock_unlock (&db->lock); | |
bd499987 AS |
408 | if (he == NULL && db->propagate) |
409 | pthread_mutex_unlock (&db->prune_run_lock); | |
a95a08b4 | 410 | } |
d67281a7 UD |
411 | } |
412 | ||
306dfba9 | 413 | if (__builtin_expect (!all_written, 0) && debug_level > 0) |
d67281a7 | 414 | { |
67479a70 UD |
415 | char buf[256]; |
416 | dbg_log (_("short write in %s: %s"), __FUNCTION__, | |
417 | strerror_r (errno, buf, sizeof (buf))); | |
d67281a7 | 418 | } |
a4c7ea7b UD |
419 | |
420 | return timeout; | |
d67281a7 UD |
421 | } |
422 | ||
d67281a7 | 423 | |
a95a08b4 UD |
424 | union keytype |
425 | { | |
426 | void *v; | |
427 | gid_t g; | |
428 | }; | |
429 | ||
430 | ||
431 | static int | |
432 | lookup (int type, union keytype key, struct group *resultbufp, char *buffer, | |
433 | size_t buflen, struct group **grp) | |
434 | { | |
435 | if (type == GETGRBYNAME) | |
436 | return __getgrnam_r (key.v, resultbufp, buffer, buflen, grp); | |
437 | else | |
438 | return __getgrgid_r (key.g, resultbufp, buffer, buflen, grp); | |
439 | } | |
440 | ||
441 | ||
a4c7ea7b | 442 | static time_t |
a95a08b4 UD |
443 | addgrbyX (struct database_dyn *db, int fd, request_header *req, |
444 | union keytype key, const char *keystr, uid_t uid, | |
445 | struct hashentry *he, struct datahead *dh) | |
67479a70 UD |
446 | { |
447 | /* Search for the entry matching the key. Please note that we don't | |
448 | look again in the table whether the dataset is now available. We | |
449 | simply insert it. It does not matter if it is in there twice. The | |
450 | pruning function only will look at the timestamp. */ | |
a95a08b4 | 451 | size_t buflen = 1024; |
c7a9b6e2 | 452 | char *buffer = (char *) alloca (buflen); |
67479a70 UD |
453 | struct group resultbuf; |
454 | struct group *grp; | |
0472723a | 455 | bool use_malloc = false; |
a95a08b4 | 456 | int errval = 0; |
d67281a7 | 457 | |
a1ffb40e | 458 | if (__glibc_unlikely (debug_level > 0)) |
a95a08b4 UD |
459 | { |
460 | if (he == NULL) | |
461 | dbg_log (_("Haven't found \"%s\" in group cache!"), keystr); | |
462 | else | |
463 | dbg_log (_("Reloading \"%s\" in group cache!"), keystr); | |
464 | } | |
d67281a7 | 465 | |
a95a08b4 UD |
466 | while (lookup (req->type, key, &resultbuf, buffer, buflen, &grp) != 0 |
467 | && (errval = errno) == ERANGE) | |
d67281a7 | 468 | { |
67479a70 | 469 | errno = 0; |
0472723a | 470 | |
a1ffb40e | 471 | if (__glibc_unlikely (buflen > 32768)) |
0472723a | 472 | { |
b21fa963 | 473 | char *old_buffer = buffer; |
4379b403 | 474 | buflen *= 2; |
0472723a UD |
475 | buffer = (char *) realloc (use_malloc ? buffer : NULL, buflen); |
476 | if (buffer == NULL) | |
477 | { | |
478 | /* We ran out of memory. We cannot do anything but | |
479 | sending a negative response. In reality this should | |
480 | never happen. */ | |
481 | grp = NULL; | |
482 | buffer = old_buffer; | |
a95a08b4 UD |
483 | |
484 | /* We set the error to indicate this is (possibly) a | |
485 | temporary error and that it does not mean the entry | |
486 | is not available at all. */ | |
487 | errval = EAGAIN; | |
0472723a UD |
488 | break; |
489 | } | |
490 | use_malloc = true; | |
491 | } | |
492 | else | |
9caf4f1c UD |
493 | /* Allocate a new buffer on the stack. If possible combine it |
494 | with the previously allocated buffer. */ | |
4379b403 | 495 | buffer = (char *) extend_alloca (buffer, buflen, 2 * buflen); |
d67281a7 | 496 | } |
d67281a7 | 497 | |
a4c7ea7b | 498 | time_t timeout = cache_addgr (db, fd, req, keystr, grp, uid, he, dh, errval); |
0472723a UD |
499 | |
500 | if (use_malloc) | |
501 | free (buffer); | |
a4c7ea7b UD |
502 | |
503 | return timeout; | |
d67281a7 UD |
504 | } |
505 | ||
d67281a7 | 506 | |
67479a70 | 507 | void |
a95a08b4 UD |
508 | addgrbyname (struct database_dyn *db, int fd, request_header *req, |
509 | void *key, uid_t uid) | |
510 | { | |
511 | union keytype u = { .v = key }; | |
512 | ||
513 | addgrbyX (db, fd, req, u, key, uid, NULL, NULL); | |
514 | } | |
515 | ||
516 | ||
a4c7ea7b | 517 | time_t |
a95a08b4 UD |
518 | readdgrbyname (struct database_dyn *db, struct hashentry *he, |
519 | struct datahead *dh) | |
520 | { | |
521 | request_header req = | |
522 | { | |
523 | .type = GETGRBYNAME, | |
524 | .key_len = he->len | |
525 | }; | |
526 | union keytype u = { .v = db->data + he->key }; | |
527 | ||
a4c7ea7b | 528 | return addgrbyX (db, -1, &req, u, db->data + he->key, he->owner, he, dh); |
a95a08b4 UD |
529 | } |
530 | ||
531 | ||
532 | void | |
533 | addgrbygid (struct database_dyn *db, int fd, request_header *req, | |
a1c542bf | 534 | void *key, uid_t uid) |
67479a70 | 535 | { |
8e9b2075 | 536 | char *ep; |
a95a08b4 | 537 | gid_t gid = strtoul ((char *) key, &ep, 10); |
0472723a | 538 | |
a95a08b4 | 539 | if (*(char *) key == '\0' || *ep != '\0') /* invalid numeric uid */ |
8e9b2075 UD |
540 | { |
541 | if (debug_level > 0) | |
a4c7ea7b | 542 | dbg_log (_("Invalid numeric gid \"%s\"!"), (char *) key); |
8e9b2075 UD |
543 | |
544 | errno = EINVAL; | |
545 | return; | |
546 | } | |
d67281a7 | 547 | |
a95a08b4 | 548 | union keytype u = { .g = gid }; |
d67281a7 | 549 | |
a95a08b4 UD |
550 | addgrbyX (db, fd, req, u, key, uid, NULL, NULL); |
551 | } | |
a1c542bf | 552 | |
0472723a | 553 | |
a4c7ea7b | 554 | time_t |
a95a08b4 UD |
555 | readdgrbygid (struct database_dyn *db, struct hashentry *he, |
556 | struct datahead *dh) | |
557 | { | |
558 | char *ep; | |
559 | gid_t gid = strtoul (db->data + he->key, &ep, 10); | |
d67281a7 | 560 | |
a95a08b4 UD |
561 | /* Since the key has been added before it must be OK. */ |
562 | assert (*(db->data + he->key) != '\0' && *ep == '\0'); | |
a1c542bf | 563 | |
a95a08b4 UD |
564 | request_header req = |
565 | { | |
566 | .type = GETGRBYGID, | |
567 | .key_len = he->len | |
568 | }; | |
569 | union keytype u = { .g = gid }; | |
0472723a | 570 | |
a4c7ea7b | 571 | return addgrbyX (db, -1, &req, u, db->data + he->key, he->owner, he, dh); |
d67281a7 | 572 | } |