2 * Copyright (c) 1997 - 2005 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the name of the Institute nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include "kafs_locl.h"
36 #define AUTH_SUPERUSER "afs"
39 * Here only ASCII characters are relevant.
42 #define IsAsciiLower(c) ('a' <= (c) && (c) <= 'z')
44 #define ToAsciiUpper(c) ((c) - 'a' + 'A')
46 static void (*kafs_verbose)(void *, const char *);
47 static void *kafs_verbose_ctx;
50 _kafs_foldup(char *a, const char *b)
54 *a = ToAsciiUpper(*b);
61 kafs_set_verbose(void (*f)(void *, const char *), void *ctx)
65 kafs_verbose_ctx = ctx;
70 kafs_settoken_rxkad(const char *cell, struct ClearToken *ct,
71 void *ticket, size_t ticket_len)
73 struct ViceIoctl parms;
79 * length of secret token followed by secret token
81 sizeof_x = ticket_len;
82 memcpy(t, &sizeof_x, sizeof(sizeof_x));
83 t += sizeof(sizeof_x);
84 memcpy(t, ticket, sizeof_x);
87 * length of clear token followed by clear token
89 sizeof_x = sizeof(*ct);
90 memcpy(t, &sizeof_x, sizeof(sizeof_x));
91 t += sizeof(sizeof_x);
92 memcpy(t, ct, sizeof_x);
96 * do *not* mark as primary cell
99 memcpy(t, &sizeof_x, sizeof(sizeof_x));
100 t += sizeof(sizeof_x);
102 * follow with cell name
104 sizeof_x = strlen(cell) + 1;
105 memcpy(t, cell, sizeof_x);
109 * Build argument block
112 parms.in_size = t - buf;
116 return k_pioctl(0, VIOCSETTOK, &parms, 0);
120 _kafs_fixup_viceid(struct ClearToken *ct, uid_t uid)
122 #define ODD(x) ((x) & 1)
123 /* According to Transarc conventions ViceId is valid iff
124 * (EndTimestamp - BeginTimestamp) is odd. By decrementing EndTime
125 * the transformations:
127 * (issue_date, life) -> (StartTime, EndTime) -> (issue_date, life)
128 * preserves the original values.
130 if (uid != 0) /* valid ViceId */
132 if (!ODD(ct->EndTimestamp - ct->BeginTimestamp))
135 else /* not valid ViceId */
137 if (ODD(ct->EndTimestamp - ct->BeginTimestamp))
142 /* Try to get a db-server for an AFS cell from a AFSDB record */
145 dns_find_cell(const char *cell, char *dbserver, size_t len)
147 struct rk_dns_reply *r;
149 r = rk_dns_lookup(cell, "afsdb");
151 struct rk_resource_record *rr = r->head;
153 if(rr->type == rk_ns_t_afsdb && rr->u.afsdb->preference == 1){
169 * Try to find the cells we should try to klog to in "file".
172 find_cells(const char *file, char ***cells, int *idx)
179 f = fopen(file, "r");
182 while (fgets(cell, sizeof(cell), f)) {
184 t = cell + strlen(cell);
185 for (; t >= cell; t--)
186 if (*t == '\n' || *t == '\t' || *t == ' ')
188 if (cell[0] == '\0' || cell[0] == '#')
190 for(i = 0; i < ind; i++)
191 if(strcmp((*cells)[i], cell) == 0)
196 tmp = realloc(*cells, (ind + 1) * sizeof(**cells));
200 (*cells)[ind] = strdup(cell);
201 if ((*cells)[ind] == NULL)
211 * Get tokens for all cells[]
214 afslog_cells(struct kafs_data *data, char **cells, int max, uid_t uid,
219 for (i = 0; i < max; i++) {
220 int er = (*data->afslog_uid)(data, cells[i], 0, uid, homedir);
228 _kafs_afslog_all_local_cells(struct kafs_data *data,
229 uid_t uid, const char *homedir)
236 homedir = getenv("HOME");
237 if (homedir != NULL) {
238 char home[MaxPathLen];
239 snprintf(home, sizeof(home), "%s/.TheseCells", homedir);
240 find_cells(home, &cells, &idx);
242 find_cells(_PATH_THESECELLS, &cells, &idx);
243 find_cells(_PATH_THISCELL, &cells, &idx);
244 find_cells(_PATH_ARLA_THESECELLS, &cells, &idx);
245 find_cells(_PATH_ARLA_THISCELL, &cells, &idx);
246 find_cells(_PATH_OPENAFS_DEBIAN_THESECELLS, &cells, &idx);
247 find_cells(_PATH_OPENAFS_DEBIAN_THISCELL, &cells, &idx);
248 find_cells(_PATH_OPENAFS_MACOSX_THESECELLS, &cells, &idx);
249 find_cells(_PATH_OPENAFS_MACOSX_THISCELL, &cells, &idx);
250 find_cells(_PATH_ARLA_DEBIAN_THESECELLS, &cells, &idx);
251 find_cells(_PATH_ARLA_DEBIAN_THISCELL, &cells, &idx);
252 find_cells(_PATH_ARLA_OPENBSD_THESECELLS, &cells, &idx);
253 find_cells(_PATH_ARLA_OPENBSD_THISCELL, &cells, &idx);
255 ret = afslog_cells(data, cells, idx, uid, homedir);
264 file_find_cell(struct kafs_data *data,
265 const char *cell, char **realm, int exact)
272 if ((F = fopen(_PATH_CELLSERVDB, "r"))
273 || (F = fopen(_PATH_ARLA_CELLSERVDB, "r"))
274 || (F = fopen(_PATH_OPENAFS_DEBIAN_CELLSERVDB, "r"))
275 || (F = fopen(_PATH_OPENAFS_MACOSX_CELLSERVDB, "r"))
276 || (F = fopen(_PATH_ARLA_DEBIAN_CELLSERVDB, "r"))) {
277 while (fgets(buf, sizeof(buf), F)) {
281 continue; /* Not a cell name line, try next line */
283 strsep(&p, " \t\n#");
286 cmp = strcmp(buf + 1, cell);
288 cmp = strncmp(buf + 1, cell, strlen(cell));
292 * We found the cell name we're looking for.
293 * Read next line on the form ip-address '#' hostname
295 if (fgets(buf, sizeof(buf), F) == NULL)
296 break; /* Read failed, give up */
297 p = strchr(buf, '#');
299 break; /* No '#', give up */
301 if (buf[strlen(buf) - 1] == '\n')
302 buf[strlen(buf) - 1] = '\0';
303 *realm = (*data->get_realm)(data, p);
304 if (*realm && **realm != '\0')
306 break; /* Won't try any more */
314 /* Find the realm associated with cell. Do this by opening CellServDB
315 file and getting the realm-of-host for the first VL-server for the
318 This does not work when the VL-server is living in one realm, but
319 the cell it is serving is living in another realm.
321 Return 0 on success, -1 otherwise.
325 _kafs_realm_of_cell(struct kafs_data *data,
326 const char *cell, char **realm)
331 ret = file_find_cell(data, cell, realm, 1);
334 if (dns_find_cell(cell, buf, sizeof(buf)) == 0) {
335 *realm = (*data->get_realm)(data, buf);
339 return file_find_cell(data, cell, realm, 0);
343 _kafs_try_get_cred(struct kafs_data *data, const char *user, const char *cell,
344 const char *realm, uid_t uid, struct kafs_token *kt)
348 ret = (*data->get_cred)(data, user, cell, realm, uid, kt);
350 const char *estr = (*data->get_error)(data, ret);
352 asprintf(&str, "%s tried afs%s%s@%s -> %s (%d)",
353 data->name, cell ? "/" : "",
354 cell ? cell : "", realm, estr ? estr : "unknown", ret);
355 (*kafs_verbose)(kafs_verbose_ctx, str);
357 (*data->free_error)(data, estr);
366 _kafs_get_cred(struct kafs_data *data,
368 const char *realm_hint,
371 struct kafs_token *kt)
377 /* We're about to find the realm that holds the key for afs in
378 * the specified cell. The problem is that null-instance
379 * afs-principals are common and that hitting the wrong realm might
380 * yield the wrong afs key. The following assumptions were made.
382 * Any realm passed to us is preferred.
384 * If there is a realm with the same name as the cell, it is most
385 * likely the correct realm to talk to.
387 * In most (maybe even all) cases the database servers of the cell
388 * will live in the realm we are looking for.
390 * Try the local realm, but if the previous cases fail, this is
391 * really a long shot.
395 /* comments on the ordering of these tests */
397 /* If the user passes a realm, she probably knows something we don't
398 * know and we should try afs@realm_hint.
402 ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
403 cell, realm_hint, uid, kt);
404 if (ret == 0) return 0;
405 ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
406 NULL, realm_hint, uid, kt);
407 if (ret == 0) return 0;
410 _kafs_foldup(CELL, cell);
413 * If the AFS servers have a file /usr/afs/etc/krb.conf containing
414 * REALM we still don't have to resort to cross-cell authentication.
415 * Try afs.cell@REALM.
417 ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
418 cell, realm, uid, kt);
419 if (ret == 0) return 0;
422 * If cell == realm we don't need no cross-cell authentication.
425 if (strcmp(CELL, realm) == 0) {
426 ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
427 NULL, realm, uid, kt);
428 if (ret == 0) return 0;
432 * We failed to get ``first class tickets'' for afs,
433 * fall back to cross-cell authentication.
437 ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
438 NULL, CELL, uid, kt);
439 if (ret == 0) return 0;
440 ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
441 cell, CELL, uid, kt);
442 if (ret == 0) return 0;
445 * Perhaps the cell doesn't correspond to any realm?
446 * Use realm of first volume location DB server.
447 * Try afs.cell@VL_REALM.
448 * Try afs@VL_REALM???
450 if (_kafs_realm_of_cell(data, cell, &vl_realm) == 0
451 && strcmp(vl_realm, realm) != 0
452 && strcmp(vl_realm, CELL) != 0) {
453 ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
454 cell, vl_realm, uid, kt);
456 ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
457 NULL, vl_realm, uid, kt);
459 if (ret == 0) return 0;