remove trailing whitespace
git-svn-id: svn://svn.h5l.se/heimdal/trunk/heimdal@23815 ec53bebd-3082-4978-b11e-865c3cabbd6b
This commit is contained in:
@@ -2,22 +2,22 @@
|
||||
* Copyright (c) 1995 - 2001, 2003 Kungliga Tekniska Högskolan
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
*
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
*
|
||||
*
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
@@ -42,13 +42,13 @@ struct krb_kafs_data {
|
||||
};
|
||||
|
||||
static int
|
||||
get_cred(struct kafs_data *data, const char *name, const char *inst,
|
||||
get_cred(struct kafs_data *data, const char *name, const char *inst,
|
||||
const char *realm, uid_t uid, struct kafs_token *kt)
|
||||
{
|
||||
CREDENTIALS c;
|
||||
KTEXT_ST tkt;
|
||||
int ret = krb_get_cred((char*)name, (char*)inst, (char*)realm, &c);
|
||||
|
||||
|
||||
if (ret) {
|
||||
ret = krb_mk_req(&tkt, (char*)name, (char*)inst, (char*)realm, 0);
|
||||
if (ret == KSUCCESS)
|
||||
@@ -71,7 +71,7 @@ afslog_uid_int(struct kafs_data *data,
|
||||
char name[ANAME_SZ];
|
||||
char inst[INST_SZ];
|
||||
char realm[REALM_SZ];
|
||||
|
||||
|
||||
kt.ticket = NULL;
|
||||
|
||||
if (cell == 0 || cell[0] == 0)
|
||||
@@ -84,7 +84,7 @@ afslog_uid_int(struct kafs_data *data,
|
||||
|
||||
kt.ticket = NULL;
|
||||
ret = _kafs_get_cred(data, cell, realm_hint, realm, uid, &kt);
|
||||
|
||||
|
||||
if (ret == 0) {
|
||||
ret = kafs_settoken_rxkad(cell, &kt.ct, kt.ticket, kt.ticket_len);
|
||||
free(kt.ticket);
|
||||
|
@@ -2,22 +2,22 @@
|
||||
* Copyright (c) 1995-2003 Kungliga Tekniska Högskolan
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
*
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
*
|
||||
*
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
@@ -41,7 +41,7 @@ struct krb5_kafs_data {
|
||||
krb5_const_realm realm;
|
||||
};
|
||||
|
||||
enum {
|
||||
enum {
|
||||
KAFS_RXKAD_2B_KVNO = 213,
|
||||
KAFS_RXKAD_K5_KVNO = 256
|
||||
};
|
||||
@@ -113,7 +113,7 @@ v5_to_kt(krb5_creds *cred, uid_t uid, struct kafs_token *kt, int local524)
|
||||
|
||||
static krb5_error_code
|
||||
v5_convert(krb5_context context, krb5_ccache id,
|
||||
krb5_creds *cred, uid_t uid,
|
||||
krb5_creds *cred, uid_t uid,
|
||||
const char *cell,
|
||||
struct kafs_token *kt)
|
||||
{
|
||||
@@ -129,7 +129,7 @@ v5_convert(krb5_context context, krb5_ccache id,
|
||||
"afs-use-524", "2b", &val);
|
||||
free(c);
|
||||
|
||||
if (strcasecmp(val, "local") == 0 ||
|
||||
if (strcasecmp(val, "local") == 0 ||
|
||||
strcasecmp(val, "2b") == 0)
|
||||
ret = v5_to_kt(cred, uid, kt, 1);
|
||||
else if(strcasecmp(val, "yes") == 0 ||
|
||||
@@ -145,7 +145,7 @@ v5_convert(krb5_context context, krb5_ccache id,
|
||||
goto out;
|
||||
|
||||
ret = _kafs_v4_to_kt(&cred4, uid, kt);
|
||||
} else
|
||||
} else
|
||||
ret = v5_to_kt(cred, uid, kt, 0);
|
||||
|
||||
out:
|
||||
@@ -159,7 +159,7 @@ v5_convert(krb5_context context, krb5_ccache id,
|
||||
*/
|
||||
|
||||
static int
|
||||
get_cred(struct kafs_data *data, const char *name, const char *inst,
|
||||
get_cred(struct kafs_data *data, const char *name, const char *inst,
|
||||
const char *realm, uid_t uid, struct kafs_token *kt)
|
||||
{
|
||||
krb5_error_code ret;
|
||||
@@ -167,7 +167,7 @@ get_cred(struct kafs_data *data, const char *name, const char *inst,
|
||||
struct krb5_kafs_data *d = data->data;
|
||||
|
||||
memset(&in_creds, 0, sizeof(in_creds));
|
||||
ret = krb5_425_conv_principal(d->context, name, inst, realm,
|
||||
ret = krb5_425_conv_principal(d->context, name, inst, realm,
|
||||
&in_creds.server);
|
||||
if(ret)
|
||||
return ret;
|
||||
@@ -183,7 +183,7 @@ get_cred(struct kafs_data *data, const char *name, const char *inst,
|
||||
if(ret)
|
||||
return ret;
|
||||
|
||||
ret = v5_convert(d->context, d->id, out_creds, uid,
|
||||
ret = v5_convert(d->context, d->id, out_creds, uid,
|
||||
(inst != NULL && inst[0] != '\0') ? inst : realm, kt);
|
||||
krb5_free_creds(d->context, out_creds);
|
||||
|
||||
@@ -199,7 +199,7 @@ afslog_uid_int(struct kafs_data *data, const char *cell, const char *rh,
|
||||
krb5_principal princ;
|
||||
const char *trealm; /* ticket realm */
|
||||
struct krb5_kafs_data *d = data->data;
|
||||
|
||||
|
||||
if (cell == 0 || cell[0] == 0)
|
||||
return _kafs_afslog_all_local_cells (data, uid, homedir);
|
||||
|
||||
@@ -212,7 +212,7 @@ afslog_uid_int(struct kafs_data *data, const char *cell, const char *rh,
|
||||
kt.ticket = NULL;
|
||||
ret = _kafs_get_cred(data, cell, d->realm, trealm, uid, &kt);
|
||||
krb5_free_principal (d->context, princ);
|
||||
|
||||
|
||||
if(ret == 0) {
|
||||
ret = kafs_settoken_rxkad(cell, &kt.ct, kt.ticket, kt.ticket_len);
|
||||
free(kt.ticket);
|
||||
@@ -284,7 +284,7 @@ krb5_afslog_uid(krb5_context context,
|
||||
|
||||
krb5_error_code
|
||||
krb5_afslog(krb5_context context,
|
||||
krb5_ccache id,
|
||||
krb5_ccache id,
|
||||
const char *cell,
|
||||
krb5_const_realm realm)
|
||||
{
|
||||
@@ -293,7 +293,7 @@ krb5_afslog(krb5_context context,
|
||||
|
||||
krb5_error_code
|
||||
krb5_afslog_home(krb5_context context,
|
||||
krb5_ccache id,
|
||||
krb5_ccache id,
|
||||
const char *cell,
|
||||
krb5_const_realm realm,
|
||||
const char *homedir)
|
||||
|
@@ -2,22 +2,22 @@
|
||||
* Copyright (c) 1995, 1996, 1997 Kungliga Tekniska Högskolan
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
*
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
*
|
||||
*
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
@@ -31,8 +31,8 @@
|
||||
* SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
/*
|
||||
* This file is only used with AIX
|
||||
/*
|
||||
* This file is only used with AIX
|
||||
*/
|
||||
|
||||
#include "kafs_locl.h"
|
||||
|
@@ -2,22 +2,22 @@
|
||||
* Copyright (c) 1995 - 2000, 2002, 2004, 2005 Kungliga Tekniska Högskolan
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
*
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
*
|
||||
*
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
@@ -117,7 +117,7 @@ try_aix(void)
|
||||
return 1;
|
||||
}
|
||||
Setpag = (int (*)(void))dlsym(ptr, "aix_setpag");
|
||||
Pioctl = (int (*)(char*, int,
|
||||
Pioctl = (int (*)(char*, int,
|
||||
struct ViceIoctl*, int))dlsym(ptr, "aix_pioctl");
|
||||
#endif
|
||||
afs_entry_point = AIX_ENTRY_POINTS;
|
||||
@@ -125,9 +125,9 @@ try_aix(void)
|
||||
}
|
||||
#endif /* _AIX */
|
||||
|
||||
/*
|
||||
/*
|
||||
* This probably only works under Solaris and could get confused if
|
||||
* there's a /etc/name_to_sysnum file.
|
||||
* there's a /etc/name_to_sysnum file.
|
||||
*/
|
||||
|
||||
#if defined(AFS_SYSCALL) || defined(AFS_SYSCALL2) || defined(AFS_SYSCALL3)
|
||||
@@ -165,7 +165,7 @@ map_syscall_name_to_number (const char *str, int *res)
|
||||
}
|
||||
#endif
|
||||
|
||||
static int
|
||||
static int
|
||||
try_ioctlpath(const char *path, unsigned long ioctlnum, int entrypoint)
|
||||
{
|
||||
int fd, ret, saved_errno;
|
||||
@@ -191,13 +191,13 @@ try_ioctlpath(const char *path, unsigned long ioctlnum, int entrypoint)
|
||||
}
|
||||
saved_errno = errno;
|
||||
close(fd);
|
||||
/*
|
||||
/*
|
||||
* Be quite liberal in what error are ok, the first is the one
|
||||
* that should trigger given that params is NULL.
|
||||
*/
|
||||
if (ret &&
|
||||
if (ret &&
|
||||
(saved_errno != EFAULT &&
|
||||
saved_errno != EDOM &&
|
||||
saved_errno != EDOM &&
|
||||
saved_errno != ENOTCONN))
|
||||
return 1;
|
||||
afs_ioctlnum = ioctlnum;
|
||||
@@ -271,7 +271,7 @@ k_pioctl(char *a_path,
|
||||
case AIX_ENTRY_POINTS:
|
||||
return Pioctl(a_path, o_opcode, a_paramsP, a_followSymlinks);
|
||||
#endif
|
||||
}
|
||||
}
|
||||
errno = ENOSYS;
|
||||
#ifdef SIGSYS
|
||||
kill(getpid(), SIGSYS); /* You lose! */
|
||||
@@ -330,7 +330,7 @@ k_setpag(void)
|
||||
return Setpag();
|
||||
#endif
|
||||
}
|
||||
|
||||
|
||||
errno = ENOSYS;
|
||||
#ifdef SIGSYS
|
||||
kill(getpid(), SIGSYS); /* You lose! */
|
||||
@@ -415,7 +415,7 @@ k_hasafs(void)
|
||||
|
||||
if (!issuid())
|
||||
env = getenv ("AFS_SYSCALL");
|
||||
|
||||
|
||||
/*
|
||||
* Already checked presence of AFS syscalls?
|
||||
*/
|
||||
@@ -428,7 +428,7 @@ k_hasafs(void)
|
||||
* If the syscall is absent we recive a SIGSYS.
|
||||
*/
|
||||
afs_entry_point = NO_ENTRY_POINT;
|
||||
|
||||
|
||||
saved_errno = errno;
|
||||
#ifndef NO_AFS
|
||||
#ifdef SIGSYS
|
||||
@@ -456,13 +456,13 @@ k_hasafs(void)
|
||||
VIOC_SYSCALL_PROC, LINUX_PROC_POINT);
|
||||
if (ret == 0)
|
||||
goto done;
|
||||
ret = try_ioctlpath("/proc/fs/nnpfs/afs_ioctl",
|
||||
ret = try_ioctlpath("/proc/fs/nnpfs/afs_ioctl",
|
||||
VIOC_SYSCALL_PROC, LINUX_PROC_POINT);
|
||||
if (ret == 0)
|
||||
goto done;
|
||||
|
||||
#ifdef VIOC_SYSCALL_DEV_OPENAFS
|
||||
ret = try_ioctlpath("/dev/openafs_ioctl",
|
||||
ret = try_ioctlpath("/dev/openafs_ioctl",
|
||||
VIOC_SYSCALL_DEV_OPENAFS, MACOS_DEV_POINT);
|
||||
if (ret == 0)
|
||||
goto done;
|
||||
|
@@ -2,22 +2,22 @@
|
||||
* Copyright (c) 1995 - 2003 Kungliga Tekniska Högskolan
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
*
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
*
|
||||
*
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
|
@@ -1,34 +1,34 @@
|
||||
/*
|
||||
* Copyright (c) 1997 - 2005 Kungliga Tekniska Högskolan
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
*
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#include "kafs_locl.h"
|
||||
@@ -75,7 +75,7 @@ kafs_settoken_rxkad(const char *cell, struct ClearToken *ct,
|
||||
struct ViceIoctl parms;
|
||||
char buf[2048], *t;
|
||||
int32_t sizeof_x;
|
||||
|
||||
|
||||
t = buf;
|
||||
/*
|
||||
* length of secret token followed by secret token
|
||||
@@ -155,7 +155,7 @@ _kafs_v4_to_kt(CREDENTIALS *c, uid_t uid, struct kafs_token *kt)
|
||||
return ENOMEM;
|
||||
kt->ticket_len = c->ticket_st.length;
|
||||
memcpy(kt->ticket, c->ticket_st.dat, kt->ticket_len);
|
||||
|
||||
|
||||
/*
|
||||
* Build a struct ClearToken
|
||||
*/
|
||||
@@ -282,7 +282,7 @@ _kafs_afslog_all_local_cells(struct kafs_data *data,
|
||||
find_cells(_PATH_ARLA_DEBIAN_THISCELL, &cells, &idx);
|
||||
find_cells(_PATH_ARLA_OPENBSD_THESECELLS, &cells, &idx);
|
||||
find_cells(_PATH_ARLA_OPENBSD_THISCELL, &cells, &idx);
|
||||
|
||||
|
||||
ret = afslog_cells(data, cells, idx, uid, homedir);
|
||||
while(idx > 0)
|
||||
free(cells[--idx]);
|
||||
@@ -292,7 +292,7 @@ _kafs_afslog_all_local_cells(struct kafs_data *data,
|
||||
|
||||
|
||||
static int
|
||||
file_find_cell(struct kafs_data *data,
|
||||
file_find_cell(struct kafs_data *data,
|
||||
const char *cell, char **realm, int exact)
|
||||
{
|
||||
FILE *F;
|
||||
@@ -380,7 +380,7 @@ _kafs_try_get_cred(struct kafs_data *data, const char *user, const char *cell,
|
||||
if (kafs_verbose) {
|
||||
char *str;
|
||||
asprintf(&str, "%s tried afs%s%s@%s -> %d",
|
||||
data->name, cell[0] == '\0' ? "" : "/",
|
||||
data->name, cell[0] == '\0' ? "" : "/",
|
||||
cell, realm, ret);
|
||||
(*kafs_verbose)(kafs_verbose_ctx, str);
|
||||
free(str);
|
||||
@@ -392,7 +392,7 @@ _kafs_try_get_cred(struct kafs_data *data, const char *user, const char *cell,
|
||||
|
||||
int
|
||||
_kafs_get_cred(struct kafs_data *data,
|
||||
const char *cell,
|
||||
const char *cell,
|
||||
const char *realm_hint,
|
||||
const char *realm,
|
||||
uid_t uid,
|
||||
@@ -419,13 +419,13 @@ _kafs_get_cred(struct kafs_data *data,
|
||||
* really a long shot.
|
||||
*
|
||||
*/
|
||||
|
||||
|
||||
/* comments on the ordering of these tests */
|
||||
|
||||
/* If the user passes a realm, she probably knows something we don't
|
||||
* know and we should try afs@realm_hint.
|
||||
*/
|
||||
|
||||
|
||||
if (realm_hint) {
|
||||
ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
|
||||
cell, realm_hint, uid, kt);
|
||||
@@ -442,7 +442,7 @@ _kafs_get_cred(struct kafs_data *data,
|
||||
* REALM we still don't have to resort to cross-cell authentication.
|
||||
* Try afs.cell@REALM.
|
||||
*/
|
||||
ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
|
||||
ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
|
||||
cell, realm, uid, kt);
|
||||
if (ret == 0) return 0;
|
||||
|
||||
@@ -465,7 +465,7 @@ _kafs_get_cred(struct kafs_data *data,
|
||||
ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
|
||||
"", CELL, uid, kt);
|
||||
if (ret == 0) return 0;
|
||||
ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
|
||||
ret = _kafs_try_get_cred(data, AUTH_SUPERUSER,
|
||||
cell, CELL, uid, kt);
|
||||
if (ret == 0) return 0;
|
||||
|
||||
|
@@ -213,7 +213,7 @@ void *dlopen(const char *path, int mode)
|
||||
*/
|
||||
} else if (mp->gcc_ctor = (GccCDtorPtr)dlsym(mp, "_GLOBAL__DI")) {
|
||||
(*mp->gcc_ctor)();
|
||||
mp->gcc_dtor = (GccCDtorPtr)dlsym(mp, "_GLOBAL__DD");
|
||||
mp->gcc_dtor = (GccCDtorPtr)dlsym(mp, "_GLOBAL__DD");
|
||||
} else
|
||||
errvalid = 0;
|
||||
return mp;
|
||||
@@ -273,7 +273,7 @@ void *dlsym(void *handle, const char *symbol)
|
||||
return ep->addr;
|
||||
errvalid++;
|
||||
snprintf (errbuf, sizeof(errbuf),
|
||||
"dlsym: undefined symbol %s", symbol);
|
||||
"dlsym: undefined symbol %s", symbol);
|
||||
return NULL;
|
||||
}
|
||||
|
||||
|
@@ -2,22 +2,22 @@
|
||||
* Copyright (c) 1995 - 2001, 2003 Kungliga Tekniska Högskolan
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
*
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
*
|
||||
*
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
@@ -82,7 +82,7 @@
|
||||
#define VIOC_AFS_SYSNAME _VICEIOCTL(38)
|
||||
#define VIOC_EXPORTAFS _VICEIOCTL(39)
|
||||
#define VIOCGETCACHEPARAMS _VICEIOCTL(40)
|
||||
#define VIOC_GCPAGS _VICEIOCTL(48)
|
||||
#define VIOC_GCPAGS _VICEIOCTL(48)
|
||||
|
||||
#define VIOCGETTOK2 _AFSCIOCTL(7)
|
||||
#define VIOCSETTOK2 _AFSCIOCTL(8)
|
||||
@@ -157,7 +157,7 @@ krb5_error_code krb5_afslog_uid (krb5_context context,
|
||||
krb5_const_realm realm,
|
||||
uid_t uid);
|
||||
krb5_error_code krb5_afslog (krb5_context context,
|
||||
krb5_ccache id,
|
||||
krb5_ccache id,
|
||||
const char *cell,
|
||||
krb5_const_realm realm);
|
||||
krb5_error_code krb5_afslog_uid_home (krb5_context context,
|
||||
|
@@ -2,22 +2,22 @@
|
||||
* Copyright (c) 1995, 1996, 1997, 1998, 1999 Kungliga Tekniska Högskolan
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
*
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
*
|
||||
*
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
@@ -117,7 +117,7 @@ typedef int (*afslog_uid_func_t)(struct kafs_data *,
|
||||
uid_t,
|
||||
const char *);
|
||||
|
||||
typedef int (*get_cred_func_t)(struct kafs_data*, const char*, const char*,
|
||||
typedef int (*get_cred_func_t)(struct kafs_data*, const char*, const char*,
|
||||
const char*, uid_t, struct kafs_token *);
|
||||
|
||||
typedef char* (*get_realm_func_t)(struct kafs_data*, const char*);
|
||||
@@ -140,7 +140,7 @@ void _kafs_foldup(char *, const char *);
|
||||
|
||||
int _kafs_afslog_all_local_cells(struct kafs_data*, uid_t, const char*);
|
||||
|
||||
int _kafs_get_cred(struct kafs_data*, const char*, const char*, const char *,
|
||||
int _kafs_get_cred(struct kafs_data*, const char*, const char*, const char *,
|
||||
uid_t, struct kafs_token *);
|
||||
|
||||
int
|
||||
|
@@ -1,34 +1,34 @@
|
||||
/*
|
||||
* Copyright (c) 2001-2002 Kungliga Tekniska Högskolan
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
* (Royal Institute of Technology, Stockholm, Sweden).
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* 1. Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
*
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
* 2. Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in the
|
||||
* documentation and/or other materials provided with the distribution.
|
||||
*
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
* 3. Neither the name of the Institute nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
||||
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||||
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||||
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
||||
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||||
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||||
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||||
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||||
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||||
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||||
* SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
/* $Id$ */
|
||||
|
Reference in New Issue
Block a user