5c099b14c1
pull in just about all of the differences from the crypto-us telnet suite (which includes Kerberos 4 and connection encryption support). Also bring in the Kerberos 5 support from the Heimdal telnet, and frob a little so that it can work with the non-Heimdal telnet suite. There is still some work left to do, specifically: - Add Heimdal's ticket forwarding support to the Berkeley Kerberos 4 module. - Add connection encryption support to the Heimdal Kerberos 5 module. Hints on this can be taken from the MIT Kerberos 5 module which still exists in crypto-us. However, even with the shortcomings listed above, this is a better situation than using the stock Heimdal telnet suite, which does not understand the IPSec policy stuff, and is also based on much older code which contains bugs that we have already fixed in the NetBSD sources.
110 lines
3.7 KiB
C
110 lines
3.7 KiB
C
/* $NetBSD: ring.h,v 1.8 2000/06/22 06:47:48 thorpej Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1988, 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. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. 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.
|
|
*
|
|
* from: @(#)ring.h 8.1 (Berkeley) 6/6/93
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
#define P __P
|
|
|
|
/*
|
|
* This defines a structure for a ring buffer.
|
|
*
|
|
* The circular buffer has two parts:
|
|
*(((
|
|
* full: [consume, supply)
|
|
* empty: [supply, consume)
|
|
*]]]
|
|
*
|
|
*/
|
|
typedef struct {
|
|
unsigned char *consume, /* where data comes out of */
|
|
*supply, /* where data comes in to */
|
|
*bottom, /* lowest address in buffer */
|
|
*top, /* highest address+1 in buffer */
|
|
*mark; /* marker (user defined) */
|
|
#ifdef ENCRYPTION
|
|
unsigned char *clearto; /* Data to this point is clear text */
|
|
unsigned char *encryyptedto; /* Data is encrypted to here */
|
|
#endif /* ENCRYPTION */
|
|
int size; /* size in bytes of buffer */
|
|
u_long consumetime, /* help us keep straight full, empty, etc. */
|
|
supplytime;
|
|
} Ring;
|
|
|
|
/* Ring buffer structures which are shared */
|
|
|
|
extern Ring
|
|
netoring,
|
|
netiring,
|
|
ttyoring,
|
|
ttyiring;
|
|
|
|
/* Here are some functions and macros to deal with the ring buffer */
|
|
|
|
/* Initialization routine */
|
|
extern int
|
|
ring_init P((Ring *ring, unsigned char *buffer, int count));
|
|
|
|
/* Data movement routines */
|
|
extern void
|
|
ring_supply_data P((Ring *ring, unsigned char *buffer, int count));
|
|
#ifdef notdef
|
|
extern void
|
|
ring_consume_data P((Ring *ring, unsigned char *buffer, int count));
|
|
#endif
|
|
|
|
/* Buffer state transition routines */
|
|
extern void
|
|
ring_supplied P((Ring *ring, int count)),
|
|
ring_consumed P((Ring *ring, int count));
|
|
|
|
/* Buffer state query routines */
|
|
extern int
|
|
ring_empty_count P((Ring *ring)),
|
|
ring_empty_consecutive P((Ring *ring)),
|
|
ring_full_count P((Ring *ring)),
|
|
ring_full_consecutive P((Ring *ring)),
|
|
ring_at_mark P((Ring *ring));
|
|
|
|
#ifdef ENCRYPTION
|
|
extern void
|
|
ring_encrypt P((Ring *ring, void (*func)(unsigned char *, int))),
|
|
ring_clearto P((Ring *ring));
|
|
#endif /* ENCRYPTION */
|
|
|
|
extern void
|
|
ring_clear_mark P((Ring *ring)),
|
|
ring_mark P((Ring *ring));
|