Home | History | Annotate | Line # | Download | only in net
compat_ns_ntoa.c revision 1.1 
      1 /*	$NetBSD: compat_ns_ntoa.c,v 1.1 2006/08/26 16:07:01 matt Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1986, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. Neither the name of the University nor the names of its contributors
     16  *    may be used to endorse or promote products derived from this software
     17  *    without specific prior written permission.
     18  *
     19  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  * SUCH DAMAGE.
     30  */
     31 
     32 #include <sys/cdefs.h>
     33 #if defined(LIBC_SCCS) && !defined(lint)
     34 #if 0
     35 static char sccsid[] = "@(#)ns_ntoa.c	8.1 (Berkeley) 6/4/93";
     36 #else
     37 __RCSID("$NetBSD: compat_ns_ntoa.c,v 1.1 2006/08/26 16:07:01 matt Exp $");
     38 #endif
     39 #endif /* LIBC_SCCS and not lint */
     40 
     41 #include <sys/param.h>
     42 #include <compat/include/ns.h>
     43 
     44 #include <assert.h>
     45 #include <stdio.h>
     46 
     47 static char *spectHex __P((char *));
     48 
     49 char *
     50 ns_ntoa(addr)
     51 	struct ns_addr addr;
     52 {
     53 	static char obuf[40];
     54 	union { union ns_net net_e; u_int32_t long_e; } net;
     55 	u_int16_t port = htons(addr.x_port);
     56 	char *cp;
     57 	char *cp2;
     58 	u_int8_t *up = addr.x_host.c_host;
     59 	u_int8_t *uplim = up + 6;
     60 
     61 	net.net_e = addr.x_net;
     62 	sprintf(obuf, "%x", ntohl(net.long_e));
     63 	cp = spectHex(obuf);
     64 	cp2 = cp + 1;
     65 	while (up < uplim && *up==0)
     66 		up++;
     67 	if (up == uplim) {
     68 		if (port) {
     69 			sprintf(cp, ".0");
     70 			cp += 2;
     71 		}
     72 	} else {
     73 		sprintf(cp, ".%x", *up++);
     74 		while (up < uplim) {
     75 			while (*cp) cp++;
     76 			sprintf(cp, "%02x", *up++);
     77 		}
     78 		cp = spectHex(cp2);
     79 	}
     80 	if (port) {
     81 		sprintf(cp, ".%x", port);
     82 		spectHex(cp + 1);
     83 	}
     84 	return (obuf);
     85 }
     86 
     87 static char *
     88 spectHex(p0)
     89 	char *p0;
     90 {
     91 	int ok = 0;
     92 	int nonzero = 0;
     93 	char *p = p0;
     94 
     95 	_DIAGASSERT(p0 != NULL);
     96 
     97 	for (; *p; p++)
     98 		switch (*p) {
     99 		case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
    100 			*p += ('A' - 'a');
    101 			/* FALLTHROUGH */
    102 		case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
    103 			ok = 1;
    104 			/* FALLTHROUGH */
    105 		case '1': case '2': case '3': case '4': case '5':
    106 		case '6': case '7': case '8': case '9':
    107 			nonzero = 1;
    108 		}
    109 	if (nonzero && !ok) { *p++ = 'H'; *p = 0; }
    110 	return (p);
    111 }
    112