rsvp_mac.h

radius协议源码÷The Radius Stack will connect to a Radius Server. This stack implementation is built upo

/*
 * @(#) $Id: rsvp_mac.h,v 1.1.1.1 2000/05/08 22:51:24 wenqing Exp $
 */
/****************************************************************************

            RSVPD -- ReSerVation Protocol Daemon

                USC Information Sciences Institute
                Marina del Rey, California

		Original Version: Shai Herzog, Nov. 1993.
		Current Version: Steven Berson & Bob Braden, May 1996.

  Copyright (c) 1996 by the University of Southern California
  All rights reserved.

  Permission to use, copy, modify, and distribute this software and its
  documentation in source and binary forms for any purpose and without
  fee is hereby granted, provided that both the above copyright notice
  and this permission notice appear in all copies, and that any
  documentation, advertising materials, and other materials related to
  such distribution and use acknowledge that the software was developed
  in part by the University of Southern California, Information
  Sciences Institute.  The name of the University may not be used to
  endorse or promote products derived from this software without
  specific prior written permission.

  THE UNIVERSITY OF SOUTHERN CALIFORNIA makes no representations about
  the suitability of this software for any purpose.  THIS SOFTWARE IS
  PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES,
  INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
  MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.

  Other copyrights might apply to parts of this software and are so
  noted when applicable.

********************************************************************/

#ifndef __rsvp_mac_h__
#define __rsvp_mac_h__

/* bitmap routines */

#define BIT_ZERO(X)      ((X) = 0)
#define BIT_SET(X,n)     ((X) |= 1 << (n))
#define BIT_CLR(X,n)     ((X) &= ~(1 << (n)))
#define BIT_TST(X,n)     ((X) & 1 << (n))

/* timer comparison -- 32bit modular arithmetic
 */
#define LT(X,Y)       ((int)((X)-(Y)) < 0)
#define LTE(X,Y)      ((int)((X)-(Y)) <= 0)

/*
 * Macros for fast min/max.
 */
#ifndef MIN
#define MIN(a,b) (((a)<(b))?(a):(b))
#endif
#ifndef MAX
#define MAX(a,b) (((a)>(b))?(a):(b))
#endif

/*
 *	Local interfaces corresponding to given vif # or if #
 */
#define	GET_IF(if)		(if_vec[if].if_addr)
#define Get_local_interface	GET_IF(local_v4)
#define Get_local_addr		NET_GET_IF_PHY_ADDR(&Get_local_interface)
#ifdef	USE_IPV6
#define Get_local_interface6	GET_IF(local_v6)
#define Get_local_addr6		NET_GET_IF_PHY_ADDR(&Get_local_interface6)
#endif	/* USE_IPV6 */


/*
 *	Operations on objects
 */
#define Obj_Data(x)	(((char *)(x))+sizeof(Object_header))   /*SH*/
#define After_Obj(x,cls)	((char *)(x)+Object_Size(Ver_Obj(x,cls)))
#define Ver_Obj(x,cls)	((Obj_Class(x)== class_##cls) ? (x) : NULL)
#define Object_of(x)	(Object_header *)(x)
#define Next_Object(x)  Object_of((char *) (x) + Obj_Length(x))
#define Object_Size(x)  ((x)? Obj_Length(x): 0)

#define copy_spec(x) (FlowSpec *) copy_object((Object_header *) x)
#define copy_filter(x) (FilterSpec *) copy_object((Object_header *) x)
#define copy_tspec(x) (SENDER_TSPEC *) copy_object((Object_header *) x)
#define copy_adspec(x) (ADSPEC *) copy_object((Object_header *) x)
#define copy_scope(x) (SCOPE *) copy_object((Object_header *) x)
#define copy_route(x) (ROUTE *) copy_object((Object_header *) x)

#define Move_Object(f,t) move_object((Object_header *)(f),(Object_header *)(t))


/* Initialize an object at location x, with given class and ctype.
 *	Zeros rest of object.
 */
#define Init_Object(x, cls, cty) {\
		memset((x), 0, sizeof(Object_header) + sizeof(cty)); \
		((Object_header *) x)->obj_class = class_##cls;\
		((Object_header *) x)->obj_ctype = ctype_##cty;\
		((Object_header *) x)->obj_length = \
			sizeof(Object_header) + sizeof(cty); }

#define Init_Var_Obj(x, cls, cty, len) { \
		memset((x), 0, len); \
		((Object_header *) x)->obj_class = class_##cls;\
		((Object_header *) x)->obj_ctype = ctype_##cty;\
		((Object_header *) x)->obj_length = len; }

/*
 *	Log memory full condition (maybe should just increment counter?)
 */
#define Log_Mem_Full(where) log(LOG_WARNING, 0, "Memory full @ %s\n", where);
	
/*
 * Control debug printout
 */
#define IsDebug(type)  (l_debug >= LOG_DEBUG && (m_debug & (type)))

/*
 *	Pack and unpack rsvp_errno = 256*Error_val + Error_Code
 */
#define Set_Errno(code, val) ((val)<<8 | (code))
#define Get_Errcode(errno) ((errno)&255)
#define Get_Errval(errno) ((errno)>>8)

#endif	/* __rsvp_mac_h__ */