mirror of
https://git.FreeBSD.org/src.git
synced 2024-12-02 08:42:48 +00:00
ae77177087
several new kerberos related libraries and applications to FreeBSD:
o kgetcred(1) allows one to manually get a ticket for a particular service.
o kf(1) securily forwards ticket to another host through an authenticated
and encrypted stream.
o kcc(1) is an umbrella program around klist(1), kswitch(1), kgetcred(1)
and other user kerberos operations. klist and kswitch are just symlinks
to kcc(1) now.
o kswitch(1) allows you to easily switch between kerberos credentials if
you're running KCM.
o hxtool(1) is a certificate management tool to use with PKINIT.
o string2key(1) maps a password into key.
o kdigest(8) is a userland tool to access the KDC's digest interface.
o kimpersonate(8) creates a "fake" ticket for a service.
We also now install manpages for some lirbaries that were not installed
before, libheimntlm and libhx509.
- The new HEIMDAL version no longer supports Kerberos 4. All users are
recommended to switch to Kerberos 5.
- Weak ciphers are now disabled by default. To enable DES support (used
by telnet(8)), use "allow_weak_crypto" option in krb5.conf.
- libtelnet, pam_ksu and pam_krb5 are now compiled with error on warnings
disabled due to the function they use (krb5_get_err_text(3)) being
deprecated. I plan to work on this next.
- Heimdal's KDC now require sqlite to operate. We use the bundled version
and install it as libheimsqlite. If some other FreeBSD components will
require it in the future we can rename it to libbsdsqlite and use for these
components as well.
- This is not a latest Heimdal version, the new one was released while I was
working on the update. I will update it to 1.5.2 soon, as it fixes some
important bugs and security issues.
168 lines
6.5 KiB
C
168 lines
6.5 KiB
C
/* $NetBSD: queue.h,v 1.38 2004/04/18 14:12:05 lukem Exp $ */
|
|
/* $Id$ */
|
|
|
|
/*
|
|
* Copyright (c) 1991, 1993
|
|
* The Regents of the University of California. 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 University 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 REGENTS 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 REGENTS 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.
|
|
*
|
|
* @(#)queue.h 8.5 (Berkeley) 8/20/94
|
|
*/
|
|
|
|
#ifndef _HEIM_QUEUE_H_
|
|
#define _HEIM_QUEUE_H_
|
|
|
|
/*
|
|
* Tail queue definitions.
|
|
*/
|
|
#define HEIM_TAILQ_HEAD(name, type) \
|
|
struct name { \
|
|
struct type *tqh_first; /* first element */ \
|
|
struct type **tqh_last; /* addr of last next element */ \
|
|
}
|
|
|
|
#define HEIM_TAILQ_HEAD_INITIALIZER(head) \
|
|
{ NULL, &(head).tqh_first }
|
|
#define HEIM_TAILQ_ENTRY(type) \
|
|
struct { \
|
|
struct type *tqe_next; /* next element */ \
|
|
struct type **tqe_prev; /* address of previous next element */ \
|
|
}
|
|
|
|
/*
|
|
* Tail queue functions.
|
|
*/
|
|
#if defined(_KERNEL) && defined(QUEUEDEBUG)
|
|
#define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \
|
|
if ((head)->tqh_first && \
|
|
(head)->tqh_first->field.tqe_prev != &(head)->tqh_first) \
|
|
panic("HEIM_TAILQ_INSERT_HEAD %p %s:%d", (head), __FILE__, __LINE__);
|
|
#define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \
|
|
if (*(head)->tqh_last != NULL) \
|
|
panic("HEIM_TAILQ_INSERT_TAIL %p %s:%d", (head), __FILE__, __LINE__);
|
|
#define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \
|
|
if ((elm)->field.tqe_next && \
|
|
(elm)->field.tqe_next->field.tqe_prev != \
|
|
&(elm)->field.tqe_next) \
|
|
panic("HEIM_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
|
|
if (*(elm)->field.tqe_prev != (elm)) \
|
|
panic("HEIM_TAILQ_* back %p %s:%d", (elm), __FILE__, __LINE__);
|
|
#define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) \
|
|
if ((elm)->field.tqe_next == NULL && \
|
|
(head)->tqh_last != &(elm)->field.tqe_next) \
|
|
panic("HEIM_TAILQ_PREREMOVE head %p elm %p %s:%d", \
|
|
(head), (elm), __FILE__, __LINE__);
|
|
#define QUEUEDEBUG_HEIM_TAILQ_POSTREMOVE(elm, field) \
|
|
(elm)->field.tqe_next = (void *)1L; \
|
|
(elm)->field.tqe_prev = (void *)1L;
|
|
#else
|
|
#define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field)
|
|
#define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field)
|
|
#define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field)
|
|
#define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field)
|
|
#define QUEUEDEBUG_HEIM_TAILQ_POSTREMOVE(elm, field)
|
|
#endif
|
|
|
|
#define HEIM_TAILQ_INIT(head) do { \
|
|
(head)->tqh_first = NULL; \
|
|
(head)->tqh_last = &(head)->tqh_first; \
|
|
} while (/*CONSTCOND*/0)
|
|
|
|
#define HEIM_TAILQ_INSERT_HEAD(head, elm, field) do { \
|
|
QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD((head), (elm), field) \
|
|
if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
|
|
(head)->tqh_first->field.tqe_prev = \
|
|
&(elm)->field.tqe_next; \
|
|
else \
|
|
(head)->tqh_last = &(elm)->field.tqe_next; \
|
|
(head)->tqh_first = (elm); \
|
|
(elm)->field.tqe_prev = &(head)->tqh_first; \
|
|
} while (/*CONSTCOND*/0)
|
|
|
|
#define HEIM_TAILQ_INSERT_TAIL(head, elm, field) do { \
|
|
QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL((head), (elm), field) \
|
|
(elm)->field.tqe_next = NULL; \
|
|
(elm)->field.tqe_prev = (head)->tqh_last; \
|
|
*(head)->tqh_last = (elm); \
|
|
(head)->tqh_last = &(elm)->field.tqe_next; \
|
|
} while (/*CONSTCOND*/0)
|
|
|
|
#define HEIM_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
|
|
QUEUEDEBUG_HEIM_TAILQ_OP((listelm), field) \
|
|
if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
|
|
(elm)->field.tqe_next->field.tqe_prev = \
|
|
&(elm)->field.tqe_next; \
|
|
else \
|
|
(head)->tqh_last = &(elm)->field.tqe_next; \
|
|
(listelm)->field.tqe_next = (elm); \
|
|
(elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
|
|
} while (/*CONSTCOND*/0)
|
|
|
|
#define HEIM_TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
|
|
QUEUEDEBUG_HEIM_TAILQ_OP((listelm), field) \
|
|
(elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
|
|
(elm)->field.tqe_next = (listelm); \
|
|
*(listelm)->field.tqe_prev = (elm); \
|
|
(listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
|
|
} while (/*CONSTCOND*/0)
|
|
|
|
#define HEIM_TAILQ_REMOVE(head, elm, field) do { \
|
|
QUEUEDEBUG_HEIM_TAILQ_PREREMOVE((head), (elm), field) \
|
|
QUEUEDEBUG_HEIM_TAILQ_OP((elm), field) \
|
|
if (((elm)->field.tqe_next) != NULL) \
|
|
(elm)->field.tqe_next->field.tqe_prev = \
|
|
(elm)->field.tqe_prev; \
|
|
else \
|
|
(head)->tqh_last = (elm)->field.tqe_prev; \
|
|
*(elm)->field.tqe_prev = (elm)->field.tqe_next; \
|
|
QUEUEDEBUG_HEIM_TAILQ_POSTREMOVE((elm), field); \
|
|
} while (/*CONSTCOND*/0)
|
|
|
|
#define HEIM_TAILQ_FOREACH(var, head, field) \
|
|
for ((var) = ((head)->tqh_first); \
|
|
(var); \
|
|
(var) = ((var)->field.tqe_next))
|
|
|
|
#define HEIM_TAILQ_FOREACH_REVERSE(var, head, headname, field) \
|
|
for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last)); \
|
|
(var); \
|
|
(var) = (*(((struct headname *)((var)->field.tqe_prev))->tqh_last)))
|
|
|
|
/*
|
|
* Tail queue access methods.
|
|
*/
|
|
#define HEIM_TAILQ_EMPTY(head) ((head)->tqh_first == NULL)
|
|
#define HEIM_TAILQ_FIRST(head) ((head)->tqh_first)
|
|
#define HEIM_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
|
|
|
|
#define HEIM_TAILQ_LAST(head, headname) \
|
|
(*(((struct headname *)((head)->tqh_last))->tqh_last))
|
|
#define HEIM_TAILQ_PREV(elm, headname, field) \
|
|
(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
|
|
|
|
|
|
#endif /* !_HEIM_QUEUE_H_ */
|