1 #pragma ident "%Z%%M% %I% %E% SMI" 2 /* 3 * lib/krb5/krb/addr_order.c 4 * 5 * Copyright 1990 by the Massachusetts Institute of Technology. 6 * All Rights Reserved. 7 * 8 * Export of this software from the United States of America may 9 * require a specific license from the United States Government. 10 * It is the responsibility of any person or organization contemplating 11 * export to obtain such a license before exporting. 12 * 13 * WITHIN THAT CONSTRAINT, permission to use, copy, modify, and 14 * distribute this software and its documentation for any purpose and 15 * without fee is hereby granted, provided that the above copyright 16 * notice appear in all copies and that both that copyright notice and 17 * this permission notice appear in supporting documentation, and that 18 * the name of M.I.T. not be used in advertising or publicity pertaining 19 * to distribution of the software without specific, written prior 20 * permission. Furthermore if you modify this software you must label 21 * your software as modified software and not distribute it in such a 22 * fashion that it might be confused with the original M.I.T. software. 23 * M.I.T. makes no representations about the suitability of 24 * this software for any purpose. It is provided "as is" without express 25 * or implied warranty. 26 * 27 * 28 * krb5_address_order() 29 */ 30 31 #include <k5-int.h> 32 33 #ifndef min 34 #define min(a,b) ((a) < (b) ? (a) : (b)) 35 #endif 36 37 /* 38 * Return an ordering on two addresses: 0 if the same, 39 * < 0 if first is less than 2nd, > 0 if first is greater than 2nd. 40 */ 41 /*ARGSUSED*/ 42 int 43 krb5_address_order(context, addr1, addr2) 44 krb5_context context; 45 register krb5_const krb5_address *addr1; 46 register krb5_const krb5_address *addr2; 47 { 48 int dir; 49 register int i; 50 const int minlen = min(addr1->length, addr2->length); 51 52 if (addr1->addrtype != addr2->addrtype) 53 return(FALSE); 54 55 dir = addr1->length - addr2->length; 56 57 58 for (i = 0; i < minlen; i++) { 59 if ((unsigned char) addr1->contents[i] < 60 (unsigned char) addr2->contents[i]) 61 return -1; 62 else if ((unsigned char) addr1->contents[i] > 63 (unsigned char) addr2->contents[i]) 64 return 1; 65 } 66 /* compared equal so far...which is longer? */ 67 return dir; 68 } 69