1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
/*
* $Source$
* $Author$
* $Header$
*
* Copyright 1987-1994 by the Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* require a specific license from the United States Government.
* It is the responsibility of any person or organization contemplating
* export to obtain such a license before exporting.
*
* WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
* distribute this software and its documentation for any purpose and
* without fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation, and that
* the name of M.I.T. not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior
* permission. M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is" without express
* or implied warranty.
*
* Include file for address comparison macros.
*/
#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 */
|