2001-02-13 16:46:19 +00:00
|
|
|
/*
|
2011-10-05 07:23:29 +00:00
|
|
|
* Copyright (c) 2000 Kungliga Tekniska Högskolan
|
2001-02-13 16:46:19 +00:00
|
|
|
* (Royal Institute of Technology, Stockholm, Sweden).
|
|
|
|
|
* 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.
|
|
|
|
|
*/
|
|
|
|
|
|
2011-10-05 07:23:29 +00:00
|
|
|
/* $Id$ */
|
2001-02-13 16:46:19 +00:00
|
|
|
|
|
|
|
|
#ifndef __ifaddrs_h__
|
|
|
|
|
#define __ifaddrs_h__
|
|
|
|
|
|
2008-05-07 13:39:42 +00:00
|
|
|
#ifndef ROKEN_LIB_FUNCTION
|
|
|
|
|
#ifdef _WIN32
|
2011-10-05 07:23:29 +00:00
|
|
|
#define ROKEN_LIB_FUNCTION
|
|
|
|
|
#define ROKEN_LIB_CALL _stdcall
|
2008-05-07 13:39:42 +00:00
|
|
|
#else
|
|
|
|
|
#define ROKEN_LIB_FUNCTION
|
2011-10-05 07:23:29 +00:00
|
|
|
#define ROKEN_LIB_CALL
|
2008-05-07 13:39:42 +00:00
|
|
|
#endif
|
|
|
|
|
#endif
|
|
|
|
|
|
2001-02-13 16:46:19 +00:00
|
|
|
/*
|
|
|
|
|
* the interface is defined in terms of the fields below, and this is
|
|
|
|
|
* sometimes #define'd, so there seems to be no simple way of solving
|
|
|
|
|
* this and this seemed the best. */
|
|
|
|
|
|
|
|
|
|
#undef ifa_dstaddr
|
|
|
|
|
|
|
|
|
|
struct ifaddrs {
|
|
|
|
|
struct ifaddrs *ifa_next;
|
|
|
|
|
char *ifa_name;
|
|
|
|
|
unsigned int ifa_flags;
|
|
|
|
|
struct sockaddr *ifa_addr;
|
|
|
|
|
struct sockaddr *ifa_netmask;
|
|
|
|
|
struct sockaddr *ifa_dstaddr;
|
|
|
|
|
void *ifa_data;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#ifndef ifa_broadaddr
|
|
|
|
|
#define ifa_broadaddr ifa_dstaddr
|
|
|
|
|
#endif
|
|
|
|
|
|
2008-05-07 13:39:42 +00:00
|
|
|
int ROKEN_LIB_FUNCTION
|
|
|
|
|
rk_getifaddrs(struct ifaddrs**);
|
|
|
|
|
|
|
|
|
|
void ROKEN_LIB_FUNCTION
|
|
|
|
|
rk_freeifaddrs(struct ifaddrs*);
|
2001-02-13 16:46:19 +00:00
|
|
|
|
2008-05-07 13:39:42 +00:00
|
|
|
#define getifaddrs(a) rk_getifaddrs(a)
|
|
|
|
|
#define freeifaddrs(a) rk_freeifaddrs(a)
|
2001-02-13 16:46:19 +00:00
|
|
|
|
|
|
|
|
#endif /* __ifaddrs_h__ */
|
