Return to addr_comp.h CVS log

Up to [CSRG BSD Unix] / 43BSDReno / kerberosIV / include

BSD 4.3reno

/*
 * $Source: /var/lib/cvsd/repos/CSRG/43BSDReno/kerberosIV/include/addr_comp.h,v $
 * $Author: root $
 * $Header: /var/lib/cvsd/repos/CSRG/43BSDReno/kerberosIV/include/addr_comp.h,v 1.1.1.1 2018/04/24 16:12:56 root Exp $
 *
 * Copyright 1987, 1988, 1989 by the Massachusetts Institute of Technology. 
 *
 * For copying and distribution information, please see the file
 * <mit-copyright.h>. 
 *
 * Include file for address comparison macros.
 */

#include <mit-copyright.h>

#ifndef ADDR_COMP_DEFS
#define ADDR_COMP_DEFS

/*
** Look boys and girls, a big kludge
** We need to compare the two internet addresses in network byte order, not
**   local byte order.  This is a *really really slow way of doing that*
** But.....
**         .....it works
** so we run with it
**
** long_less_than gets fed two (u_char *)'s....
*/

#define u_char_comp(x,y) \
        (((x)>(y))?(1):(((x)==(y))?(0):(-1)))

#define long_less_than(x,y) \
        (u_char_comp((x)[0],(y)[0])?u_char_comp((x)[0],(y)[0]): \
	 (u_char_comp((x)[1],(y)[1])?u_char_comp((x)[1],(y)[1]): \
	  (u_char_comp((x)[2],(y)[2])?u_char_comp((x)[2],(y)[2]): \
	   (u_char_comp((x)[3],(y)[3])))))

#endif /* ADDR_COMP_DEFS */

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.