| 1 | /*
|
|---|
| 2 | * Copyright (c) 2000 Kungliga Tekniska Högskolan
|
|---|
| 3 | * (Royal Institute of Technology, Stockholm, Sweden).
|
|---|
| 4 | * All rights reserved.
|
|---|
| 5 | *
|
|---|
| 6 | * Redistribution and use in source and binary forms, with or without
|
|---|
| 7 | * modification, are permitted provided that the following conditions
|
|---|
| 8 | * are met:
|
|---|
| 9 | *
|
|---|
| 10 | * 1. Redistributions of source code must retain the above copyright
|
|---|
| 11 | * notice, this list of conditions and the following disclaimer.
|
|---|
| 12 | *
|
|---|
| 13 | * 2. Redistributions in binary form must reproduce the above copyright
|
|---|
| 14 | * notice, this list of conditions and the following disclaimer in the
|
|---|
| 15 | * documentation and/or other materials provided with the distribution.
|
|---|
| 16 | *
|
|---|
| 17 | * 3. Neither the name of the Institute nor the names of its contributors
|
|---|
| 18 | * may be used to endorse or promote products derived from this software
|
|---|
| 19 | * without specific prior written permission.
|
|---|
| 20 | *
|
|---|
| 21 | * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
|
|---|
| 22 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|---|
| 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|---|
| 24 | * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
|
|---|
| 25 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|---|
| 26 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|---|
| 27 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|---|
| 28 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|---|
| 29 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|---|
| 30 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|---|
| 31 | * SUCH DAMAGE.
|
|---|
| 32 | */
|
|---|
| 33 |
|
|---|
| 34 | /* $Id$ */
|
|---|
| 35 |
|
|---|
| 36 | #ifndef __ifaddrs_h__
|
|---|
| 37 | #define __ifaddrs_h__
|
|---|
| 38 |
|
|---|
| 39 | #ifndef ROKEN_LIB_FUNCTION
|
|---|
| 40 | #ifdef _WIN32
|
|---|
| 41 | #define ROKEN_LIB_FUNCTION
|
|---|
| 42 | #define ROKEN_LIB_CALL _stdcall
|
|---|
| 43 | #else
|
|---|
| 44 | #define ROKEN_LIB_FUNCTION
|
|---|
| 45 | #define ROKEN_LIB_CALL
|
|---|
| 46 | #endif
|
|---|
| 47 | #endif
|
|---|
| 48 |
|
|---|
| 49 | /*
|
|---|
| 50 | * the interface is defined in terms of the fields below, and this is
|
|---|
| 51 | * sometimes #define'd, so there seems to be no simple way of solving
|
|---|
| 52 | * this and this seemed the best. */
|
|---|
| 53 |
|
|---|
| 54 | #undef ifa_dstaddr
|
|---|
| 55 |
|
|---|
| 56 | struct ifaddrs {
|
|---|
| 57 | struct ifaddrs *ifa_next;
|
|---|
| 58 | char *ifa_name;
|
|---|
| 59 | unsigned int ifa_flags;
|
|---|
| 60 | struct sockaddr *ifa_addr;
|
|---|
| 61 | struct sockaddr *ifa_netmask;
|
|---|
| 62 | struct sockaddr *ifa_dstaddr;
|
|---|
| 63 | void *ifa_data;
|
|---|
| 64 | };
|
|---|
| 65 |
|
|---|
| 66 | #ifndef ifa_broadaddr
|
|---|
| 67 | #define ifa_broadaddr ifa_dstaddr
|
|---|
| 68 | #endif
|
|---|
| 69 |
|
|---|
| 70 | int ROKEN_LIB_FUNCTION
|
|---|
| 71 | rk_getifaddrs(struct ifaddrs**);
|
|---|
| 72 |
|
|---|
| 73 | void ROKEN_LIB_FUNCTION
|
|---|
| 74 | rk_freeifaddrs(struct ifaddrs*);
|
|---|
| 75 |
|
|---|
| 76 | #define getifaddrs(a) rk_getifaddrs(a)
|
|---|
| 77 | #define freeifaddrs(a) rk_freeifaddrs(a)
|
|---|
| 78 |
|
|---|
| 79 | #endif /* __ifaddrs_h__ */
|
|---|
