| 1 |
/* |
| 2 |
* Copyright (C) Jelmer Vernooij 2005 <[email protected]> |
| 3 |
* Copyright (C) Stefan Metzmacher 2006 <[email protected]> |
| 4 |
* |
| 5 |
* All rights reserved. |
| 6 |
* |
| 7 |
* Redistribution and use in source and binary forms, with or without |
| 8 |
* modification, are permitted provided that the following conditions |
| 9 |
* are met: |
| 10 |
* |
| 11 |
* 1. Redistributions of source code must retain the above copyright |
| 12 |
* notice, this list of conditions and the following disclaimer. |
| 13 |
* |
| 14 |
* 2. Redistributions in binary form must reproduce the above copyright |
| 15 |
* notice, this list of conditions and the following disclaimer in the |
| 16 |
* documentation and/or other materials provided with the distribution. |
| 17 |
* |
| 18 |
* 3. Neither the name of the author nor the names of its contributors |
| 19 |
* may be used to endorse or promote products derived from this software |
| 20 |
* without specific prior written permission. |
| 21 |
* |
| 22 |
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
| 23 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 24 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 25 |
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
| 26 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
| 27 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
| 28 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
| 29 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
| 30 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
| 31 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
| 32 |
* SUCH DAMAGE. |
| 33 |
* |
| 34 |
*/ |
| 35 |
|
| 36 |
#ifndef __SOCKET_WRAPPER_H__ |
| 37 |
#define __SOCKET_WRAPPER_H__ |
| 38 |
|
| 39 |
int swrap_socket(int family, int type, int protocol); |
| 40 |
int swrap_accept(int s, struct sockaddr *addr, socklen_t *addrlen); |
| 41 |
int swrap_connect(int s, const struct sockaddr *serv_addr, socklen_t addrlen); |
| 42 |
int swrap_bind(int s, const struct sockaddr *myaddr, socklen_t addrlen); |
| 43 |
int swrap_listen(int s, int backlog); |
| 44 |
int swrap_getpeername(int s, struct sockaddr *name, socklen_t *addrlen); |
| 45 |
int swrap_getsockname(int s, struct sockaddr *name, socklen_t *addrlen); |
| 46 |
int swrap_getsockopt(int s, int level, int optname, void *optval, socklen_t *optlen); |
| 47 |
int swrap_setsockopt(int s, int level, int optname, const void *optval, socklen_t optlen); |
| 48 |
ssize_t swrap_recvfrom(int s, void *buf, size_t len, int flags, struct sockaddr *from, socklen_t *fromlen); |
| 49 |
ssize_t swrap_sendto(int s, const void *buf, size_t len, int flags, const struct sockaddr *to, socklen_t tolen); |
| 50 |
int swrap_ioctl(int s, int req, void *ptr); |
| 51 |
ssize_t swrap_recv(int s, void *buf, size_t len, int flags); |
| 52 |
ssize_t swrap_send(int s, const void *buf, size_t len, int flags); |
| 53 |
int swrap_close(int); |
| 54 |
int swrap_dup(int); |
| 55 |
int swrap_dup2(int, int); |
| 56 |
|
| 57 |
#ifdef SOCKET_WRAPPER_REPLACE |
| 58 |
|
| 59 |
#ifdef accept |
| 60 |
#undef accept |
| 61 |
#endif |
| 62 |
#define accept(s,addr,addrlen) swrap_accept(s,addr,addrlen) |
| 63 |
|
| 64 |
#ifdef connect |
| 65 |
#undef connect |
| 66 |
#endif |
| 67 |
#define connect(s,serv_addr,addrlen) swrap_connect(s,serv_addr,addrlen) |
| 68 |
|
| 69 |
#ifdef bind |
| 70 |
#undef bind |
| 71 |
#endif |
| 72 |
#define bind(s,myaddr,addrlen) swrap_bind(s,myaddr,addrlen) |
| 73 |
|
| 74 |
#ifdef listen |
| 75 |
#undef listen |
| 76 |
#endif |
| 77 |
#define listen(s,blog) swrap_listen(s,blog) |
| 78 |
|
| 79 |
#ifdef getpeername |
| 80 |
#undef getpeername |
| 81 |
#endif |
| 82 |
#define getpeername(s,name,addrlen) swrap_getpeername(s,name,addrlen) |
| 83 |
|
| 84 |
#ifdef getsockname |
| 85 |
#undef getsockname |
| 86 |
#endif |
| 87 |
#define getsockname(s,name,addrlen) swrap_getsockname(s,name,addrlen) |
| 88 |
|
| 89 |
#ifdef getsockopt |
| 90 |
#undef getsockopt |
| 91 |
#endif |
| 92 |
#define getsockopt(s,level,optname,optval,optlen) swrap_getsockopt(s,level,optname,optval,optlen) |
| 93 |
|
| 94 |
#ifdef setsockopt |
| 95 |
#undef setsockopt |
| 96 |
#endif |
| 97 |
#define setsockopt(s,level,optname,optval,optlen) swrap_setsockopt(s,level,optname,optval,optlen) |
| 98 |
|
| 99 |
#ifdef recvfrom |
| 100 |
#undef recvfrom |
| 101 |
#endif |
| 102 |
#define recvfrom(s,buf,len,flags,from,fromlen) swrap_recvfrom(s,buf,len,flags,from,fromlen) |
| 103 |
|
| 104 |
#ifdef sendto |
| 105 |
#undef sendto |
| 106 |
#endif |
| 107 |
#define sendto(s,buf,len,flags,to,tolen) swrap_sendto(s,buf,len,flags,to,tolen) |
| 108 |
|
| 109 |
#ifdef ioctl |
| 110 |
#undef ioctl |
| 111 |
#endif |
| 112 |
#define ioctl(s,req,ptr) swrap_ioctl(s,req,ptr) |
| 113 |
|
| 114 |
#ifdef recv |
| 115 |
#undef recv |
| 116 |
#endif |
| 117 |
#define recv(s,buf,len,flags) swrap_recv(s,buf,len,flags) |
| 118 |
|
| 119 |
#ifdef send |
| 120 |
#undef send |
| 121 |
#endif |
| 122 |
#define send(s,buf,len,flags) swrap_send(s,buf,len,flags) |
| 123 |
|
| 124 |
#ifdef socket |
| 125 |
#undef socket |
| 126 |
#endif |
| 127 |
#define socket(domain,type,protocol) swrap_socket(domain,type,protocol) |
| 128 |
|
| 129 |
#ifdef close |
| 130 |
#undef close |
| 131 |
#endif |
| 132 |
#define close(s) swrap_close(s) |
| 133 |
|
| 134 |
#ifdef dup |
| 135 |
#undef dup |
| 136 |
#endif |
| 137 |
#define dup(oldd) swrap_dup(oldd) |
| 138 |
|
| 139 |
#ifdef dup2 |
| 140 |
#undef dup2 |
| 141 |
#endif |
| 142 |
#define dup2(oldd, newd) swrap_dup2(oldd, newd) |
| 143 |
|
| 144 |
#endif |
| 145 |
|
| 146 |
#endif /* __SOCKET_WRAPPER_H__ */ |