inet.cc revision 2 
1/*
2 * Copyright (c) 2003 The Regents of The University of Michigan
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include <sstream>
30#include <string>
31
32#include "cprintf.hh"
33#include "host.hh"
34#include "inet.hh"
35
36using namespace::std;
37string
38eaddr_string(const uint8_t a[6])
39{
40    stringstream stream;
41    ccprintf(stream, "%x:%x:%x:%x:%x:%x", a[0], a[1], a[2], a[3], a[4], a[5]);
42
43    return stream.str();
44}
45
46/*
47 * Copyright (c) 1988, 1992, 1993
48 *	The Regents of the University of California.  All rights reserved.
49 *
50 * Redistribution and use in source and binary forms, with or without
51 * modification, are permitted provided that the following conditions
52 * are met:
53 * 1. Redistributions of source code must retain the above copyright
54 *    notice, this list of conditions and the following disclaimer.
55 * 2. Redistributions in binary form must reproduce the above copyright
56 *    notice, this list of conditions and the following disclaimer in the
57 *    documentation and/or other materials provided with the distribution.
58 * 3. All advertising materials mentioning features or use of this software
59 *    must display the following acknowledgement:
60 *	This product includes software developed by the University of
61 *	California, Berkeley and its contributors.
62 * 4. Neither the name of the University nor the names of its contributors
63 *    may be used to endorse or promote products derived from this software
64 *    without specific prior written permission.
65 *
66 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
67 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
68 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
69 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
70 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
71 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
72 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
73 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
74 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
75 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
76 * SUCH DAMAGE.
77 */
78/***********************************************************************
79                 This section of code taken from NetBSD
80***********************************************************************/
81
82#define ETHER_CRC_POLY_LE 0xedb88320
83#define ETHER_CRC_POLY_BE 0x04c11db6
84
85#if 0
86/*
87 * This is for reference.  We have a table-driven version
88 * of the little-endian crc32 generator, which is faster
89 * than the double-loop.
90 */
91uint32_t
92crc32le(const uint8_t *buf, size_t len)
93{
94    uint32_t c, crc, carry;
95    size_t i, j;
96
97    crc = 0xffffffffU;      /* initial value */
98
99    for (i = 0; i < len; i++) {
100        c = buf[i];
101        for (j = 0; j < 8; j++) {
102            carry = ((crc & 0x01) ? 1 : 0) ^ (c & 0x01);
103            crc >>= 1;
104            c >>= 1;
105            if (carry)
106                crc = (crc ^ ETHER_CRC_POLY_LE);
107        }
108    }
109
110    return (crc);
111}
112#else
113uint32_t
114crc32le(const uint8_t *buf, size_t len)
115{
116    static const uint32_t crctab[] = {
117        0x00000000, 0x1db71064, 0x3b6e20c8, 0x26d930ac,
118        0x76dc4190, 0x6b6b51f4, 0x4db26158, 0x5005713c,
119        0xedb88320, 0xf00f9344, 0xd6d6a3e8, 0xcb61b38c,
120        0x9b64c2b0, 0x86d3d2d4, 0xa00ae278, 0xbdbdf21c
121    };
122    uint32_t crc;
123    int i;
124
125    crc = 0xffffffffU;      /* initial value */
126
127    for (i = 0; i < len; i++) {
128        crc ^= buf[i];
129        crc = (crc >> 4) ^ crctab[crc & 0xf];
130        crc = (crc >> 4) ^ crctab[crc & 0xf];
131    }
132
133    return (crc);
134}
135#endif
136
137uint32_t
138crc32be(const uint8_t *buf, size_t len)
139{
140    uint32_t c, crc, carry;
141    size_t i, j;
142
143    crc = 0xffffffffU;      /* initial value */
144
145    for (i = 0; i < len; i++) {
146        c = buf[i];
147        for (j = 0; j < 8; j++) {
148            carry = ((crc & 0x80000000U) ? 1 : 0) ^ (c & 0x01);
149            crc <<= 1;
150            c >>= 1;
151            if (carry)
152                crc = (crc ^ ETHER_CRC_POLY_BE) | carry;
153        }
154    }
155
156    return (crc);
157}
158
159/***********************************************************************
160                 This is the end of the NetBSD code
161***********************************************************************/
162