Travis Geiselbrecht | 1d0df69 | 2008-09-01 02:26:09 -0700 | [diff] [blame^] | 1 | /* |
| 2 | * Copyright (c) 2001-2004 Swedish Institute of Computer Science. |
| 3 | * All rights reserved. |
| 4 | * |
| 5 | * Redistribution and use in source and binary forms, with or without modification, |
| 6 | * are permitted provided that the following conditions are met: |
| 7 | * |
| 8 | * 1. Redistributions of source code must retain the above copyright notice, |
| 9 | * this list of conditions and the following disclaimer. |
| 10 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| 11 | * this list of conditions and the following disclaimer in the documentation |
| 12 | * and/or other materials provided with the distribution. |
| 13 | * 3. The name of the author may not be used to endorse or promote products |
| 14 | * derived from this software without specific prior written permission. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR IMPLIED |
| 17 | * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF |
| 18 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT |
| 19 | * SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| 20 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT |
| 21 | * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 22 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 23 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING |
| 24 | * IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY |
| 25 | * OF SUCH DAMAGE. |
| 26 | * |
| 27 | * This file is part of the lwIP TCP/IP stack. |
| 28 | * |
| 29 | * Author: Adam Dunkels <adam@sics.se> |
| 30 | * |
| 31 | */ |
| 32 | |
| 33 | #include "lwip/ip_addr.h" |
| 34 | #include "lwip/inet.h" |
| 35 | |
| 36 | |
| 37 | u8_t |
| 38 | ip_addr_netcmp(struct ip_addr *addr1, struct ip_addr *addr2, |
| 39 | struct ip_addr *mask) |
| 40 | { |
| 41 | return((addr1->addr[0] & mask->addr[0]) == (addr2->addr[0] & mask->addr[0]) && |
| 42 | (addr1->addr[1] & mask->addr[1]) == (addr2->addr[1] & mask->addr[1]) && |
| 43 | (addr1->addr[2] & mask->addr[2]) == (addr2->addr[2] & mask->addr[2]) && |
| 44 | (addr1->addr[3] & mask->addr[3]) == (addr2->addr[3] & mask->addr[3])); |
| 45 | |
| 46 | } |
| 47 | |
| 48 | u8_t |
| 49 | ip_addr_cmp(struct ip_addr *addr1, struct ip_addr *addr2) |
| 50 | { |
| 51 | return(addr1->addr[0] == addr2->addr[0] && |
| 52 | addr1->addr[1] == addr2->addr[1] && |
| 53 | addr1->addr[2] == addr2->addr[2] && |
| 54 | addr1->addr[3] == addr2->addr[3]); |
| 55 | } |
| 56 | |
| 57 | void |
| 58 | ip_addr_set(struct ip_addr *dest, struct ip_addr *src) |
| 59 | { |
| 60 | memcpy(dest, src, sizeof(struct ip_addr)); |
| 61 | /* dest->addr[0] = src->addr[0]; |
| 62 | dest->addr[1] = src->addr[1]; |
| 63 | dest->addr[2] = src->addr[2]; |
| 64 | dest->addr[3] = src->addr[3];*/ |
| 65 | } |
| 66 | |
| 67 | u8_t |
| 68 | ip_addr_isany(struct ip_addr *addr) |
| 69 | { |
| 70 | if (addr == NULL) return 1; |
| 71 | return((addr->addr[0] | addr->addr[1] | addr->addr[2] | addr->addr[3]) == 0); |
| 72 | } |
| 73 | |
| 74 | |
| 75 | /*#if IP_DEBUG*/ |
| 76 | void |
| 77 | ip_addr_debug_print(struct ip_addr *addr) |
| 78 | { |
| 79 | printf("%"X32_F":%"X32_F":%"X32_F":%"X32_F":%"X32_F":%"X32_F":%"X32_F":%"X32_F", |
| 80 | ntohl(addr->addr[0]) >> 16 & 0xffff, |
| 81 | ntohl(addr->addr[0]) & 0xffff, |
| 82 | ntohl(addr->addr[1]) >> 16 & 0xffff, |
| 83 | ntohl(addr->addr[1]) & 0xffff, |
| 84 | ntohl(addr->addr[2]) >> 16 & 0xffff, |
| 85 | ntohl(addr->addr[2]) & 0xffff, |
| 86 | ntohl(addr->addr[3]) >> 16 & 0xffff, |
| 87 | ntohl(addr->addr[3]) & 0xffff); |
| 88 | } |
| 89 | /*#endif*/ /* IP_DEBUG */ |
| 90 | |