mirror of
https://github.com/oliverschmidt/contiki.git
synced 2024-11-17 21:09:03 +00:00
95 lines
3.4 KiB
C
95 lines
3.4 KiB
C
/*
|
|
* Copyright (c) 2010, Swedish Institute of Computer Science.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the Institute nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
*/
|
|
|
|
/**
|
|
* \file
|
|
* A set of debugging tools for the IP stack
|
|
* \author
|
|
* Nicolas Tsiftes <nvt@sics.se>
|
|
* Niclas Finne <nfi@sics.se>
|
|
* Joakim Eriksson <joakime@sics.se>
|
|
*/
|
|
|
|
#include "net/ip/uip-debug.h"
|
|
#include "net/ip/ip64-addr.h"
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
uip_debug_ipaddr_print(const uip_ipaddr_t *addr)
|
|
{
|
|
#if NETSTACK_CONF_WITH_IPV6
|
|
uint16_t a;
|
|
unsigned int i;
|
|
int f;
|
|
#endif /* NETSTACK_CONF_WITH_IPV6 */
|
|
if(addr == NULL) {
|
|
PRINTA("(NULL IP addr)");
|
|
return;
|
|
}
|
|
#if NETSTACK_CONF_WITH_IPV6
|
|
if(ip64_addr_is_ipv4_mapped_addr(addr)) {
|
|
/*
|
|
* Printing IPv4-mapped addresses is done according to RFC 3513 [1]
|
|
*
|
|
* "An alternative form that is sometimes more
|
|
* convenient when dealing with a mixed environment
|
|
* of IPv4 and IPv6 nodes is x:x:x:x:x:x:d.d.d.d,
|
|
* where the 'x's are the hexadecimal values of the
|
|
* six high-order 16-bit pieces of the address, and
|
|
* the 'd's are the decimal values of the four
|
|
* low-order 8-bit pieces of the address (standard
|
|
* IPv4 representation)."
|
|
*
|
|
* [1] https://tools.ietf.org/html/rfc3513#page-5
|
|
*/
|
|
PRINTA("::FFFF:%u.%u.%u.%u", addr->u8[12], addr->u8[13], addr->u8[14], addr->u8[15]);
|
|
} else {
|
|
for(i = 0, f = 0; i < sizeof(uip_ipaddr_t); i += 2) {
|
|
a = (addr->u8[i] << 8) + addr->u8[i + 1];
|
|
if(a == 0 && f >= 0) {
|
|
if(f++ == 0) {
|
|
PRINTA("::");
|
|
}
|
|
} else {
|
|
if(f > 0) {
|
|
f = -1;
|
|
} else if(i > 0) {
|
|
PRINTA(":");
|
|
}
|
|
PRINTA("%x", a);
|
|
}
|
|
}
|
|
}
|
|
#else /* NETSTACK_CONF_WITH_IPV6 */
|
|
PRINTA("%u.%u.%u.%u", addr->u8[0], addr->u8[1], addr->u8[2], addr->u8[3]);
|
|
#endif /* NETSTACK_CONF_WITH_IPV6 */
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|