OpenCores
URL https://opencores.org/ocsvn/openrisc_me/openrisc_me/trunk

Subversion Repositories openrisc_me

[/] [openrisc/] [trunk/] [gnu-src/] [newlib-1.17.0/] [newlib/] [libc/] [sys/] [linux/] [net/] [inet_ntop.c] - Diff between revs 148 and 158

Only display areas with differences | Details | Blame | View Log

Rev 148 Rev 158
/* Copyright (c) 1996 by Internet Software Consortium.
/* Copyright (c) 1996 by Internet Software Consortium.
 *
 *
 * Permission to use, copy, modify, and distribute this software for any
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 * copyright notice and this permission notice appear in all copies.
 *
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
 * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS
 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
 * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
 * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE
 * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
 * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL
 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
 * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
 * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS
 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
 * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
 * SOFTWARE.
 * SOFTWARE.
 */
 */
 
 
#if defined(LIBC_SCCS) && !defined(lint)
#if defined(LIBC_SCCS) && !defined(lint)
static char rcsid[] = "$Id: inet_ntop.c 148 2010-06-30 19:21:22Z jeremybennett $";
static char rcsid[] = "$Id: inet_ntop.c 148 2010-06-30 19:21:22Z jeremybennett $";
#endif /* LIBC_SCCS and not lint */
#endif /* LIBC_SCCS and not lint */
#include <sys/cdefs.h>
#include <sys/cdefs.h>
#include <sys/types.h>
#include <sys/types.h>
 
 
#include <sys/param.h>
#include <sys/param.h>
#include <sys/types.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <arpa/inet.h>
#include <arpa/nameser.h>
#include <arpa/nameser.h>
#include <errno.h>
#include <errno.h>
#include <stdio.h>
#include <stdio.h>
#include <string.h>
#include <string.h>
 
 
#define SPRINTF(x) ((socklen_t)sprintf x)
#define SPRINTF(x) ((socklen_t)sprintf x)
 
 
/*
/*
 * WARNING: Don't even consider trying to compile this on a system where
 * WARNING: Don't even consider trying to compile this on a system where
 * sizeof(int) < 4.  sizeof(int) > 4 is fine; all the world's not a VAX.
 * sizeof(int) < 4.  sizeof(int) > 4 is fine; all the world's not a VAX.
 */
 */
 
 
static const char *inet_ntop4(const u_char *src, char *dst, socklen_t size);
static const char *inet_ntop4(const u_char *src, char *dst, socklen_t size);
static const char *inet_ntop6(const u_char *src, char *dst, socklen_t size);
static const char *inet_ntop6(const u_char *src, char *dst, socklen_t size);
 
 
/* char *
/* char *
 * inet_ntop(af, src, dst, size)
 * inet_ntop(af, src, dst, size)
 *      convert a network format address to presentation format.
 *      convert a network format address to presentation format.
 * return:
 * return:
 *      pointer to presentation format address (`dst'), or NULL (see errno).
 *      pointer to presentation format address (`dst'), or NULL (see errno).
 * author:
 * author:
 *      Paul Vixie, 1996.
 *      Paul Vixie, 1996.
 */
 */
const char *
const char *
inet_ntop(af, src, dst, size)
inet_ntop(af, src, dst, size)
        int af;
        int af;
        const void *src;
        const void *src;
        char *dst;
        char *dst;
        socklen_t size;
        socklen_t size;
{
{
        switch (af) {
        switch (af) {
        case AF_INET:
        case AF_INET:
                return (inet_ntop4(src, dst, size));
                return (inet_ntop4(src, dst, size));
        case AF_INET6:
        case AF_INET6:
                return (inet_ntop6(src, dst, size));
                return (inet_ntop6(src, dst, size));
        default:
        default:
                errno = EAFNOSUPPORT;
                errno = EAFNOSUPPORT;
                return (NULL);
                return (NULL);
        }
        }
        /* NOTREACHED */
        /* NOTREACHED */
}
}
 
 
/* const char *
/* const char *
 * inet_ntop4(src, dst, size)
 * inet_ntop4(src, dst, size)
 *      format an IPv4 address, more or less like inet_ntoa()
 *      format an IPv4 address, more or less like inet_ntoa()
 * return:
 * return:
 *      `dst' (as a const)
 *      `dst' (as a const)
 * notes:
 * notes:
 *      (1) uses no statics
 *      (1) uses no statics
 *      (2) takes a u_char* not an in_addr as input
 *      (2) takes a u_char* not an in_addr as input
 * author:
 * author:
 *      Paul Vixie, 1996.
 *      Paul Vixie, 1996.
 */
 */
static const char *
static const char *
inet_ntop4(src, dst, size)
inet_ntop4(src, dst, size)
        const u_char *src;
        const u_char *src;
        char *dst;
        char *dst;
        socklen_t size;
        socklen_t size;
{
{
        static const char fmt[] = "%u.%u.%u.%u";
        static const char fmt[] = "%u.%u.%u.%u";
        char tmp[sizeof "255.255.255.255"];
        char tmp[sizeof "255.255.255.255"];
 
 
        if (SPRINTF((tmp, fmt, src[0], src[1], src[2], src[3])) > size) {
        if (SPRINTF((tmp, fmt, src[0], src[1], src[2], src[3])) > size) {
                errno = ENOSPC;
                errno = ENOSPC;
                return (NULL);
                return (NULL);
        }
        }
        strcpy(dst, tmp);
        strcpy(dst, tmp);
        return (dst);
        return (dst);
}
}
 
 
/* const char *
/* const char *
 * inet_ntop6(src, dst, size)
 * inet_ntop6(src, dst, size)
 *      convert IPv6 binary address into presentation (printable) format
 *      convert IPv6 binary address into presentation (printable) format
 * author:
 * author:
 *      Paul Vixie, 1996.
 *      Paul Vixie, 1996.
 */
 */
static const char *
static const char *
inet_ntop6(src, dst, size)
inet_ntop6(src, dst, size)
        const u_char *src;
        const u_char *src;
        char *dst;
        char *dst;
        socklen_t size;
        socklen_t size;
{
{
        /*
        /*
         * Note that int32_t and int16_t need only be "at least" large enough
         * Note that int32_t and int16_t need only be "at least" large enough
         * to contain a value of the specified size.  On some systems, like
         * to contain a value of the specified size.  On some systems, like
         * Crays, there is no such thing as an integer variable with 16 bits.
         * Crays, there is no such thing as an integer variable with 16 bits.
         * Keep this in mind if you think this function should have been coded
         * Keep this in mind if you think this function should have been coded
         * to use pointer overlays.  All the world's not a VAX.
         * to use pointer overlays.  All the world's not a VAX.
         */
         */
        char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;
        char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;
        struct { int base, len; } best, cur;
        struct { int base, len; } best, cur;
        u_int words[NS_IN6ADDRSZ / NS_INT16SZ];
        u_int words[NS_IN6ADDRSZ / NS_INT16SZ];
        int i;
        int i;
 
 
        /*
        /*
         * Preprocess:
         * Preprocess:
         *      Copy the input (bytewise) array into a wordwise array.
         *      Copy the input (bytewise) array into a wordwise array.
         *      Find the longest run of 0x00's in src[] for :: shorthanding.
         *      Find the longest run of 0x00's in src[] for :: shorthanding.
         */
         */
        memset(words, '\0', sizeof words);
        memset(words, '\0', sizeof words);
        for (i = 0; i < NS_IN6ADDRSZ; i++)
        for (i = 0; i < NS_IN6ADDRSZ; i++)
                words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
                words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));
        best.base = -1;
        best.base = -1;
        cur.base = -1;
        cur.base = -1;
        for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
        for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
                if (words[i] == 0) {
                if (words[i] == 0) {
                        if (cur.base == -1)
                        if (cur.base == -1)
                                cur.base = i, cur.len = 1;
                                cur.base = i, cur.len = 1;
                        else
                        else
                                cur.len++;
                                cur.len++;
                } else {
                } else {
                        if (cur.base != -1) {
                        if (cur.base != -1) {
                                if (best.base == -1 || cur.len > best.len)
                                if (best.base == -1 || cur.len > best.len)
                                        best = cur;
                                        best = cur;
                                cur.base = -1;
                                cur.base = -1;
                        }
                        }
                }
                }
        }
        }
        if (cur.base != -1) {
        if (cur.base != -1) {
                if (best.base == -1 || cur.len > best.len)
                if (best.base == -1 || cur.len > best.len)
                        best = cur;
                        best = cur;
        }
        }
        if (best.base != -1 && best.len < 2)
        if (best.base != -1 && best.len < 2)
                best.base = -1;
                best.base = -1;
 
 
        /*
        /*
         * Format the result.
         * Format the result.
         */
         */
        tp = tmp;
        tp = tmp;
        for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
        for (i = 0; i < (NS_IN6ADDRSZ / NS_INT16SZ); i++) {
                /* Are we inside the best run of 0x00's? */
                /* Are we inside the best run of 0x00's? */
                if (best.base != -1 && i >= best.base &&
                if (best.base != -1 && i >= best.base &&
                    i < (best.base + best.len)) {
                    i < (best.base + best.len)) {
                        if (i == best.base)
                        if (i == best.base)
                                *tp++ = ':';
                                *tp++ = ':';
                        continue;
                        continue;
                }
                }
                /* Are we following an initial run of 0x00s or any real hex? */
                /* Are we following an initial run of 0x00s or any real hex? */
                if (i != 0)
                if (i != 0)
                        *tp++ = ':';
                        *tp++ = ':';
                /* Is this address an encapsulated IPv4? */
                /* Is this address an encapsulated IPv4? */
                if (i == 6 && best.base == 0 &&
                if (i == 6 && best.base == 0 &&
                    (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
                    (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {
                        if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))
                        if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))
                                return (NULL);
                                return (NULL);
                        tp += strlen(tp);
                        tp += strlen(tp);
                        break;
                        break;
                }
                }
                tp += SPRINTF((tp, "%x", words[i]));
                tp += SPRINTF((tp, "%x", words[i]));
        }
        }
        /* Was it a trailing run of 0x00's? */
        /* Was it a trailing run of 0x00's? */
        if (best.base != -1 && (best.base + best.len) ==
        if (best.base != -1 && (best.base + best.len) ==
            (NS_IN6ADDRSZ / NS_INT16SZ))
            (NS_IN6ADDRSZ / NS_INT16SZ))
                *tp++ = ':';
                *tp++ = ':';
        *tp++ = '\0';
        *tp++ = '\0';
 
 
        /*
        /*
         * Check for overflow, copy, and we're done.
         * Check for overflow, copy, and we're done.
         */
         */
        if ((socklen_t)(tp - tmp) > size) {
        if ((socklen_t)(tp - tmp) > size) {
                errno = ENOSPC;
                errno = ENOSPC;
                return (NULL);
                return (NULL);
        }
        }
        strcpy(dst, tmp);
        strcpy(dst, tmp);
        return (dst);
        return (dst);
}
}
 
 
/*
/*
 * Weak aliases for applications that use certain private entry points,
 * Weak aliases for applications that use certain private entry points,
 * and fail to include <arpa/inet.h>.
 * and fail to include <arpa/inet.h>.
 */
 */
#undef inet_ntop
#undef inet_ntop
__weak_reference(__inet_ntop, inet_ntop);
__weak_reference(__inet_ntop, inet_ntop);
 
 

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.