├── .gitignore ├── LICENSE ├── Makefile ├── README.md ├── ae.c ├── ae.h ├── ae_epoll.c ├── anet.c ├── anet.h └── main.c /.gitignore: -------------------------------------------------------------------------------- 1 | # Object files 2 | *.o 3 | *.ko 4 | *.obj 5 | *.elf 6 | 7 | # Precompiled Headers 8 | *.gch 9 | *.pch 10 | 11 | # Libraries 12 | *.lib 13 | *.a 14 | *.la 15 | *.lo 16 | 17 | # Shared objects (inc. Windows DLLs) 18 | *.dll 19 | *.so 20 | *.so.* 21 | *.dylib 22 | 23 | # Executables 24 | *.exe 25 | *.out 26 | *.app 27 | *.i*86 28 | *.x86_64 29 | *.hex 30 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 2, June 1991 3 | 4 | Copyright (C) 1989, 1991 Free Software Foundation, Inc., 5 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 6 | Everyone is permitted to copy and distribute verbatim copies 7 | of this license document, but changing it is not allowed. 8 | 9 | Preamble 10 | 11 | The licenses for most software are designed to take away your 12 | freedom to share and change it. By contrast, the GNU General Public 13 | License is intended to guarantee your freedom to share and change free 14 | software--to make sure the software is free for all its users. This 15 | General Public License applies to most of the Free Software 16 | Foundation's software and to any other program whose authors commit to 17 | using it. (Some other Free Software Foundation software is covered by 18 | the GNU Lesser General Public License instead.) You can apply it to 19 | your programs, too. 20 | 21 | When we speak of free software, we are referring to freedom, not 22 | price. Our General Public Licenses are designed to make sure that you 23 | have the freedom to distribute copies of free software (and charge for 24 | this service if you wish), that you receive source code or can get it 25 | if you want it, that you can change the software or use pieces of it 26 | in new free programs; and that you know you can do these things. 27 | 28 | To protect your rights, we need to make restrictions that forbid 29 | anyone to deny you these rights or to ask you to surrender the rights. 30 | These restrictions translate to certain responsibilities for you if you 31 | distribute copies of the software, or if you modify it. 32 | 33 | For example, if you distribute copies of such a program, whether 34 | gratis or for a fee, you must give the recipients all the rights that 35 | you have. You must make sure that they, too, receive or can get the 36 | source code. And you must show them these terms so they know their 37 | rights. 38 | 39 | We protect your rights with two steps: (1) copyright the software, and 40 | (2) offer you this license which gives you legal permission to copy, 41 | distribute and/or modify the software. 42 | 43 | Also, for each author's protection and ours, we want to make certain 44 | that everyone understands that there is no warranty for this free 45 | software. If the software is modified by someone else and passed on, we 46 | want its recipients to know that what they have is not the original, so 47 | that any problems introduced by others will not reflect on the original 48 | authors' reputations. 49 | 50 | Finally, any free program is threatened constantly by software 51 | patents. We wish to avoid the danger that redistributors of a free 52 | program will individually obtain patent licenses, in effect making the 53 | program proprietary. To prevent this, we have made it clear that any 54 | patent must be licensed for everyone's free use or not licensed at all. 55 | 56 | The precise terms and conditions for copying, distribution and 57 | modification follow. 58 | 59 | GNU GENERAL PUBLIC LICENSE 60 | TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 61 | 62 | 0. This License applies to any program or other work which contains 63 | a notice placed by the copyright holder saying it may be distributed 64 | under the terms of this General Public License. The "Program", below, 65 | refers to any such program or work, and a "work based on the Program" 66 | means either the Program or any derivative work under copyright law: 67 | that is to say, a work containing the Program or a portion of it, 68 | either verbatim or with modifications and/or translated into another 69 | language. (Hereinafter, translation is included without limitation in 70 | the term "modification".) Each licensee is addressed as "you". 71 | 72 | Activities other than copying, distribution and modification are not 73 | covered by this License; they are outside its scope. The act of 74 | running the Program is not restricted, and the output from the Program 75 | is covered only if its contents constitute a work based on the 76 | Program (independent of having been made by running the Program). 77 | Whether that is true depends on what the Program does. 78 | 79 | 1. You may copy and distribute verbatim copies of the Program's 80 | source code as you receive it, in any medium, provided that you 81 | conspicuously and appropriately publish on each copy an appropriate 82 | copyright notice and disclaimer of warranty; keep intact all the 83 | notices that refer to this License and to the absence of any warranty; 84 | and give any other recipients of the Program a copy of this License 85 | along with the Program. 86 | 87 | You may charge a fee for the physical act of transferring a copy, and 88 | you may at your option offer warranty protection in exchange for a fee. 89 | 90 | 2. You may modify your copy or copies of the Program or any portion 91 | of it, thus forming a work based on the Program, and copy and 92 | distribute such modifications or work under the terms of Section 1 93 | above, provided that you also meet all of these conditions: 94 | 95 | a) You must cause the modified files to carry prominent notices 96 | stating that you changed the files and the date of any change. 97 | 98 | b) You must cause any work that you distribute or publish, that in 99 | whole or in part contains or is derived from the Program or any 100 | part thereof, to be licensed as a whole at no charge to all third 101 | parties under the terms of this License. 102 | 103 | c) If the modified program normally reads commands interactively 104 | when run, you must cause it, when started running for such 105 | interactive use in the most ordinary way, to print or display an 106 | announcement including an appropriate copyright notice and a 107 | notice that there is no warranty (or else, saying that you provide 108 | a warranty) and that users may redistribute the program under 109 | these conditions, and telling the user how to view a copy of this 110 | License. (Exception: if the Program itself is interactive but 111 | does not normally print such an announcement, your work based on 112 | the Program is not required to print an announcement.) 113 | 114 | These requirements apply to the modified work as a whole. If 115 | identifiable sections of that work are not derived from the Program, 116 | and can be reasonably considered independent and separate works in 117 | themselves, then this License, and its terms, do not apply to those 118 | sections when you distribute them as separate works. But when you 119 | distribute the same sections as part of a whole which is a work based 120 | on the Program, the distribution of the whole must be on the terms of 121 | this License, whose permissions for other licensees extend to the 122 | entire whole, and thus to each and every part regardless of who wrote it. 123 | 124 | Thus, it is not the intent of this section to claim rights or contest 125 | your rights to work written entirely by you; rather, the intent is to 126 | exercise the right to control the distribution of derivative or 127 | collective works based on the Program. 128 | 129 | In addition, mere aggregation of another work not based on the Program 130 | with the Program (or with a work based on the Program) on a volume of 131 | a storage or distribution medium does not bring the other work under 132 | the scope of this License. 133 | 134 | 3. You may copy and distribute the Program (or a work based on it, 135 | under Section 2) in object code or executable form under the terms of 136 | Sections 1 and 2 above provided that you also do one of the following: 137 | 138 | a) Accompany it with the complete corresponding machine-readable 139 | source code, which must be distributed under the terms of Sections 140 | 1 and 2 above on a medium customarily used for software interchange; or, 141 | 142 | b) Accompany it with a written offer, valid for at least three 143 | years, to give any third party, for a charge no more than your 144 | cost of physically performing source distribution, a complete 145 | machine-readable copy of the corresponding source code, to be 146 | distributed under the terms of Sections 1 and 2 above on a medium 147 | customarily used for software interchange; or, 148 | 149 | c) Accompany it with the information you received as to the offer 150 | to distribute corresponding source code. (This alternative is 151 | allowed only for noncommercial distribution and only if you 152 | received the program in object code or executable form with such 153 | an offer, in accord with Subsection b above.) 154 | 155 | The source code for a work means the preferred form of the work for 156 | making modifications to it. For an executable work, complete source 157 | code means all the source code for all modules it contains, plus any 158 | associated interface definition files, plus the scripts used to 159 | control compilation and installation of the executable. However, as a 160 | special exception, the source code distributed need not include 161 | anything that is normally distributed (in either source or binary 162 | form) with the major components (compiler, kernel, and so on) of the 163 | operating system on which the executable runs, unless that component 164 | itself accompanies the executable. 165 | 166 | If distribution of executable or object code is made by offering 167 | access to copy from a designated place, then offering equivalent 168 | access to copy the source code from the same place counts as 169 | distribution of the source code, even though third parties are not 170 | compelled to copy the source along with the object code. 171 | 172 | 4. You may not copy, modify, sublicense, or distribute the Program 173 | except as expressly provided under this License. Any attempt 174 | otherwise to copy, modify, sublicense or distribute the Program is 175 | void, and will automatically terminate your rights under this License. 176 | However, parties who have received copies, or rights, from you under 177 | this License will not have their licenses terminated so long as such 178 | parties remain in full compliance. 179 | 180 | 5. You are not required to accept this License, since you have not 181 | signed it. However, nothing else grants you permission to modify or 182 | distribute the Program or its derivative works. These actions are 183 | prohibited by law if you do not accept this License. Therefore, by 184 | modifying or distributing the Program (or any work based on the 185 | Program), you indicate your acceptance of this License to do so, and 186 | all its terms and conditions for copying, distributing or modifying 187 | the Program or works based on it. 188 | 189 | 6. Each time you redistribute the Program (or any work based on the 190 | Program), the recipient automatically receives a license from the 191 | original licensor to copy, distribute or modify the Program subject to 192 | these terms and conditions. You may not impose any further 193 | restrictions on the recipients' exercise of the rights granted herein. 194 | You are not responsible for enforcing compliance by third parties to 195 | this License. 196 | 197 | 7. If, as a consequence of a court judgment or allegation of patent 198 | infringement or for any other reason (not limited to patent issues), 199 | conditions are imposed on you (whether by court order, agreement or 200 | otherwise) that contradict the conditions of this License, they do not 201 | excuse you from the conditions of this License. If you cannot 202 | distribute so as to satisfy simultaneously your obligations under this 203 | License and any other pertinent obligations, then as a consequence you 204 | may not distribute the Program at all. For example, if a patent 205 | license would not permit royalty-free redistribution of the Program by 206 | all those who receive copies directly or indirectly through you, then 207 | the only way you could satisfy both it and this License would be to 208 | refrain entirely from distribution of the Program. 209 | 210 | If any portion of this section is held invalid or unenforceable under 211 | any particular circumstance, the balance of the section is intended to 212 | apply and the section as a whole is intended to apply in other 213 | circumstances. 214 | 215 | It is not the purpose of this section to induce you to infringe any 216 | patents or other property right claims or to contest validity of any 217 | such claims; this section has the sole purpose of protecting the 218 | integrity of the free software distribution system, which is 219 | implemented by public license practices. Many people have made 220 | generous contributions to the wide range of software distributed 221 | through that system in reliance on consistent application of that 222 | system; it is up to the author/donor to decide if he or she is willing 223 | to distribute software through any other system and a licensee cannot 224 | impose that choice. 225 | 226 | This section is intended to make thoroughly clear what is believed to 227 | be a consequence of the rest of this License. 228 | 229 | 8. If the distribution and/or use of the Program is restricted in 230 | certain countries either by patents or by copyrighted interfaces, the 231 | original copyright holder who places the Program under this License 232 | may add an explicit geographical distribution limitation excluding 233 | those countries, so that distribution is permitted only in or among 234 | countries not thus excluded. In such case, this License incorporates 235 | the limitation as if written in the body of this License. 236 | 237 | 9. The Free Software Foundation may publish revised and/or new versions 238 | of the General Public License from time to time. Such new versions will 239 | be similar in spirit to the present version, but may differ in detail to 240 | address new problems or concerns. 241 | 242 | Each version is given a distinguishing version number. If the Program 243 | specifies a version number of this License which applies to it and "any 244 | later version", you have the option of following the terms and conditions 245 | either of that version or of any later version published by the Free 246 | Software Foundation. If the Program does not specify a version number of 247 | this License, you may choose any version ever published by the Free Software 248 | Foundation. 249 | 250 | 10. If you wish to incorporate parts of the Program into other free 251 | programs whose distribution conditions are different, write to the author 252 | to ask for permission. For software which is copyrighted by the Free 253 | Software Foundation, write to the Free Software Foundation; we sometimes 254 | make exceptions for this. Our decision will be guided by the two goals 255 | of preserving the free status of all derivatives of our free software and 256 | of promoting the sharing and reuse of software generally. 257 | 258 | NO WARRANTY 259 | 260 | 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY 261 | FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN 262 | OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES 263 | PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED 264 | OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF 265 | MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS 266 | TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE 267 | PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, 268 | REPAIR OR CORRECTION. 269 | 270 | 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 271 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR 272 | REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, 273 | INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING 274 | OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED 275 | TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY 276 | YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER 277 | PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE 278 | POSSIBILITY OF SUCH DAMAGES. 279 | 280 | END OF TERMS AND CONDITIONS 281 | 282 | How to Apply These Terms to Your New Programs 283 | 284 | If you develop a new program, and you want it to be of the greatest 285 | possible use to the public, the best way to achieve this is to make it 286 | free software which everyone can redistribute and change under these terms. 287 | 288 | To do so, attach the following notices to the program. It is safest 289 | to attach them to the start of each source file to most effectively 290 | convey the exclusion of warranty; and each file should have at least 291 | the "copyright" line and a pointer to where the full notice is found. 292 | 293 | {description} 294 | Copyright (C) {year} {fullname} 295 | 296 | This program is free software; you can redistribute it and/or modify 297 | it under the terms of the GNU General Public License as published by 298 | the Free Software Foundation; either version 2 of the License, or 299 | (at your option) any later version. 300 | 301 | This program is distributed in the hope that it will be useful, 302 | but WITHOUT ANY WARRANTY; without even the implied warranty of 303 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 304 | GNU General Public License for more details. 305 | 306 | You should have received a copy of the GNU General Public License along 307 | with this program; if not, write to the Free Software Foundation, Inc., 308 | 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. 309 | 310 | Also add information on how to contact you by electronic and paper mail. 311 | 312 | If the program is interactive, make it output a short notice like this 313 | when it starts in an interactive mode: 314 | 315 | Gnomovision version 69, Copyright (C) year name of author 316 | Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 317 | This is free software, and you are welcome to redistribute it 318 | under certain conditions; type `show c' for details. 319 | 320 | The hypothetical commands `show w' and `show c' should show the appropriate 321 | parts of the General Public License. Of course, the commands you use may 322 | be called something other than `show w' and `show c'; they could even be 323 | mouse-clicks or menu items--whatever suits your program. 324 | 325 | You should also get your employer (if you work as a programmer) or your 326 | school, if any, to sign a "copyright disclaimer" for the program, if 327 | necessary. Here is a sample; alter the names: 328 | 329 | Yoyodyne, Inc., hereby disclaims all copyright interest in the program 330 | `Gnomovision' (which makes passes at compilers) written by James Hacker. 331 | 332 | {signature of Ty Coon}, 1 April 1989 333 | Ty Coon, President of Vice 334 | 335 | This General Public License does not permit incorporating your program into 336 | proprietary programs. If your program is a subroutine library, you may 337 | consider it more useful to permit linking proprietary applications with the 338 | library. If this is what you want to do, use the GNU Lesser General 339 | Public License instead of this License. 340 | 341 | -------------------------------------------------------------------------------- /Makefile: -------------------------------------------------------------------------------- 1 | TARGET = main 2 | OBJS = ae.o ae_epoll.o anet.o main.o 3 | DEPS = ae.h anet.h 4 | CPPFLAGS = -g 5 | CC = gcc 6 | 7 | $(TARGET) : $(OBJS) 8 | $(CC) -o $(TARGET) $(OBJS) $(CFLAGS) 9 | 10 | ae.o : ae.c 11 | ae_epoll.o : ae_epoll.c 12 | anet.o : anet.c 13 | main.o : main.c $(DEPS) 14 | 15 | clean : 16 | rm $(OBJS) $(TARGET) -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | redis封装了一个小型网络库供自己使用，这个网络库只有几百行代码，却基本实现了一个高效的异步网络事件框架，而且与其他redis模块相对独立，故我将其独立出来，方便以后复用。与著名的libevent相比，它代码精简，只实现了最基本的功能，而且没有用上什么高深的技术，十分适合我们学习和借鉴。 2 | 3 | 以下这个程序实现了一个简单的回显服务器，并且每秒钟在控制台输出一句话。它简单地演示了redis网络模块的使用。 4 | 5 | 这个程序由6个源文件组成，ae.h, ae.c, ae_epoll.c, anet.h, anet.c, main.c组成，main.c由我原创，其他源文件来自于redis源代码（注释版，有改动） 6 | -------------------------------------------------------------------------------- /ae.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/qch-china/redis-network/bea9eb4e81eb11a709702d4f30b3b16aa51e280b/ae.c -------------------------------------------------------------------------------- /ae.h: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/qch-china/redis-network/bea9eb4e81eb11a709702d4f30b3b16aa51e280b/ae.h -------------------------------------------------------------------------------- /ae_epoll.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include "ae.h" 3 | 4 | typedef struct aeApiState { 5 | int epfd; 6 | struct epoll_event *events; 7 | } aeApiState; 8 | 9 | static int aeApiCreate(aeEventLoop *eventLoop) { 10 | aeApiState *state = malloc(sizeof(aeApiState)); 11 | 12 | if (!state) return -1; 13 | state->events = malloc(sizeof(struct epoll_event)*eventLoop->setsize); 14 | if (!state->events) { 15 | free(state); 16 | return -1; 17 | } 18 | state->epfd = epoll_create(1024); /* 1024 is just an hint for the kernel */ 19 | if (state->epfd == -1) { 20 | free(state->events); 21 | free(state); 22 | return -1; 23 | } 24 | eventLoop->apidata = state; 25 | return 0; 26 | } 27 | 28 | static void aeApiFree(aeEventLoop *eventLoop) { 29 | aeApiState *state = eventLoop->apidata; 30 | 31 | close(state->epfd); 32 | free(state->events); 33 | free(state); 34 | } 35 | 36 | static int aeApiAddEvent(aeEventLoop *eventLoop, int fd, int mask) { 37 | aeApiState *state = eventLoop->apidata; 38 | struct epoll_event ee; 39 | /* If the fd was already monitored for some event, we need a MOD 40 | * operation. Otherwise we need an ADD operation. */ 41 | int op = eventLoop->events[fd].mask == AE_NONE ? 42 | EPOLL_CTL_ADD : EPOLL_CTL_MOD; 43 | 44 | ee.events = 0; 45 | mask |= eventLoop->events[fd].mask; /* Merge old events */ 46 | if (mask & AE_READABLE) ee.events |= EPOLLIN; 47 | if (mask & AE_WRITABLE) ee.events |= EPOLLOUT; 48 | ee.data.u64 = 0; /* avoid valgrind warning */ 49 | ee.data.fd = fd; 50 | if (epoll_ctl(state->epfd,op,fd,&ee) == -1) return -1; 51 | return 0; 52 | } 53 | 54 | static void aeApiDelEvent(aeEventLoop *eventLoop, int fd, int delmask) { 55 | aeApiState *state = eventLoop->apidata; 56 | struct epoll_event ee; 57 | int mask = eventLoop->events[fd].mask & (~delmask); 58 | 59 | ee.events = 0; 60 | if (mask & AE_READABLE) ee.events |= EPOLLIN; 61 | if (mask & AE_WRITABLE) ee.events |= EPOLLOUT; 62 | ee.data.u64 = 0; /* avoid valgrind warning */ 63 | ee.data.fd = fd; 64 | if (mask != AE_NONE) { 65 | epoll_ctl(state->epfd,EPOLL_CTL_MOD,fd,&ee); 66 | } else { 67 | /* Note, Kernel < 2.6.9 requires a non null event pointer even for 68 | * EPOLL_CTL_DEL. */ 69 | epoll_ctl(state->epfd,EPOLL_CTL_DEL,fd,&ee); 70 | } 71 | } 72 | 73 | static int aeApiPoll(aeEventLoop *eventLoop, struct timeval *tvp) { 74 | aeApiState *state = eventLoop->apidata; 75 | int retval, numevents = 0; 76 | 77 | retval = epoll_wait(state->epfd,state->events,eventLoop->setsize, 78 | tvp ? (tvp->tv_sec*1000 + tvp->tv_usec/1000) : -1); 79 | if (retval > 0) { 80 | int j; 81 | 82 | numevents = retval; 83 | for (j = 0; j < numevents; j++) { 84 | int mask = 0; 85 | struct epoll_event *e = state->events+j; 86 | 87 | if (e->events & EPOLLIN) mask |= AE_READABLE; 88 | if (e->events & EPOLLOUT) mask |= AE_WRITABLE; 89 | if (e->events & EPOLLERR) mask |= AE_WRITABLE; 90 | if (e->events & EPOLLHUP) mask |= AE_WRITABLE; 91 | eventLoop->fired[j].fd = e->data.fd; 92 | eventLoop->fired[j].mask = mask; 93 | } 94 | } 95 | return numevents; 96 | } 97 | 98 | static char *aeApiName(void) { 99 | return "epoll"; 100 | } 101 | -------------------------------------------------------------------------------- /anet.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | 16 | #include "anet.h" 17 | 18 | static void anetSetError(char *err, const char *fmt, ...) 19 | { 20 | va_list ap; 21 | 22 | if (!err) return; 23 | va_start(ap, fmt); 24 | vsnprintf(err, ANET_ERR_LEN, fmt, ap); 25 | va_end(ap); 26 | } 27 | 28 | int anetNonBlock(char *err, int fd) 29 | { 30 | int flags; 31 | 32 | /* Set the socket nonblocking. 33 | * Note that fcntl(2) for F_GETFL and F_SETFL can't be 34 | * interrupted by a signal. */ 35 | if ((flags = fcntl(fd, F_GETFL)) == -1) { 36 | anetSetError(err, "fcntl(F_GETFL): %s", strerror(errno)); 37 | return ANET_ERR; 38 | } 39 | if (fcntl(fd, F_SETFL, flags | O_NONBLOCK) == -1) { 40 | anetSetError(err, "fcntl(F_SETFL,O_NONBLOCK): %s", strerror(errno)); 41 | return ANET_ERR; 42 | } 43 | return ANET_OK; 44 | } 45 | 46 | int anetTcpNoDelay(char *err, int fd) 47 | { 48 | int yes = 1; 49 | if (setsockopt(fd, IPPROTO_TCP, TCP_NODELAY, &yes, sizeof(yes)) == -1) 50 | { 51 | anetSetError(err, "setsockopt TCP_NODELAY: %s", strerror(errno)); 52 | return ANET_ERR; 53 | } 54 | return ANET_OK; 55 | } 56 | 57 | int anetSetSendBuffer(char *err, int fd, int buffsize) 58 | { 59 | if (setsockopt(fd, SOL_SOCKET, SO_SNDBUF, &buffsize, sizeof(buffsize)) == -1) 60 | { 61 | anetSetError(err, "setsockopt SO_SNDBUF: %s", strerror(errno)); 62 | return ANET_ERR; 63 | } 64 | return ANET_OK; 65 | } 66 | 67 | int anetTcpKeepAlive(char *err, int fd) 68 | { 69 | int yes = 1; 70 | if (setsockopt(fd, SOL_SOCKET, SO_KEEPALIVE, &yes, sizeof(yes)) == -1) { 71 | anetSetError(err, "setsockopt SO_KEEPALIVE: %s", strerror(errno)); 72 | return ANET_ERR; 73 | } 74 | return ANET_OK; 75 | } 76 | 77 | int anetResolve(char *err, char *host, char *ipbuf) 78 | { 79 | struct sockaddr_in sa; 80 | 81 | sa.sin_family = AF_INET; 82 | if (inet_aton(host, &sa.sin_addr) == 0) { 83 | struct hostent *he; 84 | 85 | he = gethostbyname(host); 86 | if (he == NULL) { 87 | anetSetError(err, "can't resolve: %s", host); 88 | return ANET_ERR; 89 | } 90 | memcpy(&sa.sin_addr, he->h_addr, sizeof(struct in_addr)); 91 | } 92 | strcpy(ipbuf,inet_ntoa(sa.sin_addr)); 93 | return ANET_OK; 94 | } 95 | 96 | static int anetCreateSocket(char *err, int domain) { 97 | int s, on = 1; 98 | if ((s = socket(domain, SOCK_STREAM, 0)) == -1) { 99 | anetSetError(err, "creating socket: %s", strerror(errno)); 100 | return ANET_ERR; 101 | } 102 | 103 | /* Make sure connection-intensive things like the redis benckmark 104 | * will be able to close/open sockets a zillion of times */ 105 | if (setsockopt(s, SOL_SOCKET, SO_REUSEADDR, &on, sizeof(on)) == -1) { 106 | anetSetError(err, "setsockopt SO_REUSEADDR: %s", strerror(errno)); 107 | return ANET_ERR; 108 | } 109 | return s; 110 | } 111 | 112 | #define ANET_CONNECT_NONE 0 113 | #define ANET_CONNECT_NONBLOCK 1 114 | static int anetTcpGenericConnect(char *err, char *addr, int port, int flags) 115 | { 116 | int s; 117 | struct sockaddr_in sa; 118 | 119 | if ((s = anetCreateSocket(err,AF_INET)) == ANET_ERR) 120 | return ANET_ERR; 121 | 122 | sa.sin_family = AF_INET; 123 | sa.sin_port = htons(port); 124 | if (inet_aton(addr, &sa.sin_addr) == 0) { 125 | struct hostent *he; 126 | 127 | he = gethostbyname(addr); 128 | if (he == NULL) { 129 | anetSetError(err, "can't resolve: %s", addr); 130 | close(s); 131 | return ANET_ERR; 132 | } 133 | memcpy(&sa.sin_addr, he->h_addr, sizeof(struct in_addr)); 134 | } 135 | if (flags & ANET_CONNECT_NONBLOCK) { 136 | if (anetNonBlock(err,s) != ANET_OK) 137 | return ANET_ERR; 138 | } 139 | if (connect(s, (struct sockaddr*)&sa, sizeof(sa)) == -1) { 140 | if (errno == EINPROGRESS && 141 | flags & ANET_CONNECT_NONBLOCK) 142 | return s; 143 | 144 | anetSetError(err, "connect: %s", strerror(errno)); 145 | close(s); 146 | return ANET_ERR; 147 | } 148 | return s; 149 | } 150 | 151 | int anetTcpConnect(char *err, char *addr, int port) 152 | { 153 | return anetTcpGenericConnect(err,addr,port,ANET_CONNECT_NONE); 154 | } 155 | 156 | int anetTcpNonBlockConnect(char *err, char *addr, int port) 157 | { 158 | return anetTcpGenericConnect(err,addr,port,ANET_CONNECT_NONBLOCK); 159 | } 160 | 161 | int anetUnixGenericConnect(char *err, char *path, int flags) 162 | { 163 | int s; 164 | struct sockaddr_un sa; 165 | 166 | if ((s = anetCreateSocket(err,AF_LOCAL)) == ANET_ERR) 167 | return ANET_ERR; 168 | 169 | sa.sun_family = AF_LOCAL; 170 | strncpy(sa.sun_path,path,sizeof(sa.sun_path)-1); 171 | if (flags & ANET_CONNECT_NONBLOCK) { 172 | if (anetNonBlock(err,s) != ANET_OK) 173 | return ANET_ERR; 174 | } 175 | if (connect(s,(struct sockaddr*)&sa,sizeof(sa)) == -1) { 176 | if (errno == EINPROGRESS && 177 | flags & ANET_CONNECT_NONBLOCK) 178 | return s; 179 | 180 | anetSetError(err, "connect: %s", strerror(errno)); 181 | close(s); 182 | return ANET_ERR; 183 | } 184 | return s; 185 | } 186 | 187 | int anetUnixConnect(char *err, char *path) 188 | { 189 | return anetUnixGenericConnect(err,path,ANET_CONNECT_NONE); 190 | } 191 | 192 | int anetUnixNonBlockConnect(char *err, char *path) 193 | { 194 | return anetUnixGenericConnect(err,path,ANET_CONNECT_NONBLOCK); 195 | } 196 | 197 | /* Like read(2) but make sure 'count' is read before to return 198 | * (unless error or EOF condition is encountered) */ 199 | int anetRead(int fd, char *buf, int count) 200 | { 201 | int nread, totlen = 0; 202 | while(totlen != count) { 203 | nread = read(fd,buf,count-totlen); 204 | if (nread == 0) return totlen; 205 | if (nread == -1) return -1; 206 | totlen += nread; 207 | buf += nread; 208 | } 209 | return totlen; 210 | } 211 | 212 | /* Like write(2) but make sure 'count' is read before to return 213 | * (unless error is encountered) */ 214 | int anetWrite(int fd, char *buf, int count) 215 | { 216 | int nwritten, totlen = 0; 217 | while(totlen != count) { 218 | nwritten = write(fd,buf,count-totlen); 219 | if (nwritten == 0) return totlen; 220 | if (nwritten == -1) return -1; 221 | totlen += nwritten; 222 | buf += nwritten; 223 | } 224 | return totlen; 225 | } 226 | 227 | static int anetListen(char *err, int s, struct sockaddr *sa, socklen_t len) { 228 | if (bind(s,sa,len) == -1) { 229 | anetSetError(err, "bind: %s", strerror(errno)); 230 | close(s); 231 | return ANET_ERR; 232 | } 233 | 234 | /* Use a backlog of 512 entries. We pass 511 to the listen() call because 235 | * the kernel does: backlogsize = roundup_pow_of_two(backlogsize + 1); 236 | * which will thus give us a backlog of 512 entries */ 237 | if (listen(s, 511) == -1) { 238 | anetSetError(err, "listen: %s", strerror(errno)); 239 | close(s); 240 | return ANET_ERR; 241 | } 242 | return ANET_OK; 243 | } 244 | 245 | int anetTcpServer(char *err, int port, char *bindaddr) 246 | { 247 | int s; 248 | struct sockaddr_in sa; 249 | 250 | if ((s = anetCreateSocket(err,AF_INET)) == ANET_ERR) 251 | return ANET_ERR; 252 | 253 | memset(&sa,0,sizeof(sa)); 254 | sa.sin_family = AF_INET; 255 | sa.sin_port = htons(port); 256 | sa.sin_addr.s_addr = htonl(INADDR_ANY); 257 | if (bindaddr && inet_aton(bindaddr, &sa.sin_addr) == 0) { 258 | anetSetError(err, "invalid bind address"); 259 | close(s); 260 | return ANET_ERR; 261 | } 262 | if (anetListen(err,s,(struct sockaddr*)&sa,sizeof(sa)) == ANET_ERR) 263 | return ANET_ERR; 264 | return s; 265 | } 266 | 267 | int anetUnixServer(char *err, char *path, mode_t perm) 268 | { 269 | int s; 270 | struct sockaddr_un sa; 271 | 272 | if ((s = anetCreateSocket(err,AF_LOCAL)) == ANET_ERR) 273 | return ANET_ERR; 274 | 275 | memset(&sa,0,sizeof(sa)); 276 | sa.sun_family = AF_LOCAL; 277 | strncpy(sa.sun_path,path,sizeof(sa.sun_path)-1); 278 | if (anetListen(err,s,(struct sockaddr*)&sa,sizeof(sa)) == ANET_ERR) 279 | return ANET_ERR; 280 | if (perm) 281 | chmod(sa.sun_path, perm); 282 | return s; 283 | } 284 | 285 | static int anetGenericAccept(char *err, int s, struct sockaddr *sa, socklen_t *len) { 286 | int fd; 287 | while(1) { 288 | fd = accept(s,sa,len); 289 | if (fd == -1) { 290 | if (errno == EINTR) 291 | continue; 292 | else { 293 | anetSetError(err, "accept: %s", strerror(errno)); 294 | return ANET_ERR; 295 | } 296 | } 297 | break; 298 | } 299 | return fd; 300 | } 301 | 302 | int anetTcpAccept(char *err, int s, char *ip, int *port) { 303 | int fd; 304 | struct sockaddr_in sa; 305 | socklen_t salen = sizeof(sa); 306 | if ((fd = anetGenericAccept(err,s,(struct sockaddr*)&sa,&salen)) == ANET_ERR) 307 | return ANET_ERR; 308 | 309 | if (ip) strcpy(ip,inet_ntoa(sa.sin_addr)); 310 | if (port) *port = ntohs(sa.sin_port); 311 | return fd; 312 | } 313 | 314 | int anetUnixAccept(char *err, int s) { 315 | int fd; 316 | struct sockaddr_un sa; 317 | socklen_t salen = sizeof(sa); 318 | if ((fd = anetGenericAccept(err,s,(struct sockaddr*)&sa,&salen)) == ANET_ERR) 319 | return ANET_ERR; 320 | 321 | return fd; 322 | } 323 | 324 | int anetPeerToString(int fd, char *ip, int *port) { 325 | struct sockaddr_in sa; 326 | socklen_t salen = sizeof(sa); 327 | 328 | if (getpeername(fd,(struct sockaddr*)&sa,&salen) == -1) { 329 | *port = 0; 330 | ip[0] = '?'; 331 | ip[1] = '\0'; 332 | return -1; 333 | } 334 | if (ip) strcpy(ip,inet_ntoa(sa.sin_addr)); 335 | if (port) *port = ntohs(sa.sin_port); 336 | return 0; 337 | } 338 | 339 | int anetSockName(int fd, char *ip, int *port) { 340 | struct sockaddr_in sa; 341 | socklen_t salen = sizeof(sa); 342 | 343 | if (getsockname(fd,(struct sockaddr*)&sa,&salen) == -1) { 344 | *port = 0; 345 | ip[0] = '?'; 346 | ip[1] = '\0'; 347 | return -1; 348 | } 349 | if (ip) strcpy(ip,inet_ntoa(sa.sin_addr)); 350 | if (port) *port = ntohs(sa.sin_port); 351 | return 0; 352 | } 353 | -------------------------------------------------------------------------------- /anet.h: -------------------------------------------------------------------------------- 1 | #ifndef ANET_H 2 | #define ANET_H 3 | 4 | #define ANET_OK 0 5 | #define ANET_ERR -1 6 | #define ANET_ERR_LEN 256 7 | 8 | int anetTcpConnect(char *err, char *addr, int port); 9 | int anetTcpNonBlockConnect(char *err, char *addr, int port); 10 | int anetUnixConnect(char *err, char *path); 11 | int anetUnixNonBlockConnect(char *err, char *path); 12 | int anetRead(int fd, char *buf, int count); 13 | int anetResolve(char *err, char *host, char *ipbuf); 14 | int anetTcpServer(char *err, int port, char *bindaddr); 15 | int anetUnixServer(char *err, char *path, mode_t perm); 16 | int anetTcpAccept(char *err, int serversock, char *ip, int *port); 17 | int anetUnixAccept(char *err, int serversock); 18 | int anetWrite(int fd, char *buf, int count); 19 | int anetNonBlock(char *err, int fd); 20 | int anetTcpNoDelay(char *err, int fd); 21 | int anetTcpKeepAlive(char *err, int fd); 22 | int anetPeerToString(int fd, char *ip, int *port); 23 | 24 | #endif 25 | -------------------------------------------------------------------------------- /main.c: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/qch-china/redis-network/bea9eb4e81eb11a709702d4f30b3b16aa51e280b/main.c --------------------------------------------------------------------------------