Kqueue example: kqueue

Source: Internet
Author: User

Kqueue example: kqueue

Network Servers usually use epoll for asynchronous IO processing, while developers usually use mac. To facilitate development, I transplanted my handy Library to the mac platform. I was surprised that no kqueue examples were found online during the transplantation process. In order to make everyone do not have to spend as much effort on kqueue as I do again, I have compiled a simple and clear kqueue example for your reference.
Kqueue has several functions:

1 // similar to epoll_create 2 int kqueue (void); 3 // both epoll_ctl and epoll_wait functions 4 int kevent (int kq, construst CT kevent * changelist, int nchanges, struct kevent * eventlist, int nevents, const struct timespec * timeout); 5 // set the macro 6 EV_SET of the kevent parameter (& kevent, ident, filter, flags, fflags, data, udata); 7 struct kevent {8 uintptr_t ident;/* identifier for this event */9 int16_t filter;/* filter for event */10 uint16_t flags; /* general flags */11 uint32_t fflags;/* filter-specific flags */12 intptr_t data;/* filter-specific data */13 void * udata; /* opaque user data identifier */14 };

 

Function call example:

1 // create kqueue 2 int epollfd = kqueue (); 3 // Add or modify fd 4 struct kevent ev [2]; 5 int n = 0; 6 if (events & kReadEvent) {7 EV_SET (& ev [n ++], fd, EVFILT_READ, EV_ADD | EV_ENABLE, 0, 0, (void *) (intptr_t) fd); 8} else if (modify) {9 EV_SET (& ev [n ++], fd, EVFILT_READ, EV_DELETE, 0, 0, (void *) (intptr_t) fd); 10} 11 if (events & kWriteEvent) {12 EV_SET (& ev [n ++], fd, EVFILT_WRITE, EV_ADD | EV_ENABLE, 0, 0, (void *) (in Tptr_t) fd); 13} else if (modify) {14 EV_SET (& ev [n ++], fd, EVFILT_WRITE, EV_DELETE, 0, 0, (void *) (intptr_t) fd); 15} 16 printf ("% s fd % d events read % d write % d \ n", 17 modify? "Mod": "add", fd, events & kReadEvent, events & kWriteEvent); 18 int r = kevent (efd, ev, n, NULL, 0, NULL ); 19 // obtain the fd20 struct timespec timeout of ready; 21 timeout. TV _sec = waitms/1000; 22 timeout. TV _nsec = (waitms % 1000) * 1000*1000; 23 const int kMaxEvents = 20; 24 struct kevent activeEvs [kMaxEvents]; 25 int n = kevent (efd, NULL, 0, activeEvs, kMaxEvents, & timeout); 26 // process IO event 27 for (int I = 0; I <n; I ++) {28 int fd = (int) (intptr_t) activeEvs [I]. udata; 29 int events = activeEvs [I]. filter; 30 if (events = EVFILT_READ) {31 handleRead (efd, fd); 32} else if (events = EVFILT_WRITE) {33 handleWrite (efd, fd ); 34} 35}

Note: The biggest difference between kevent and epoll is that the READ/WRITE events are registered separately and returned separately, while Epoll is a fd that returns the READ and WRITE events once and is determined by the flag bit.
The code that can be run is as follows: kqueue-example (handy provides the encapsulated version for kqueue)

 

1 # include <sys/socket. h> 2 # include <sys/event. h> 3 # include <netinet/in. h> 4 # include <arpa/inet. h> 5 # include <fcntl. h> 6 # include <unistd. h> 7 # include <stdio. h> 8 # include <errno. h> 9 # include <string. h> 10 # include <stdlib. h> 11 12 # define exit_if (r ,...) if (r) {printf (_ VA_ARGS _); printf ("error no: % d error msg % s \ n", errno, strerror (errno )); exit (1);} 13 14 const int kReadEvent = 1; 15 con St int kWriteEvent = 2; 16 17 void setNonBlock (int fd) {18 int flags = fcntl (fd, F_GETFL, 0); 19 exit_if (flags <0, "fcntl failed"); 20 int r = fcntl (fd, F_SETFL, flags | O_NONBLOCK); 21 exit_if (r <0, "fcntl failed "); 22} 23 24 void updateEvents (int efd, int fd, int events, bool modify) {25 struct kevent ev [2]; 26 int n = 0; 27 if (events & kReadEvent) {28 EV_SET (& ev [n ++], fd, EVFILT_READ, EV_ADD | EV_ENABLE, 0, 0, (void *) (intptr_t) fd); 29} else if (modify) {30 EV_SET (& ev [n ++], fd, EVFILT_READ, EV_DELETE, 0, 0, (void *) (intptr_t) fd); 31} 32 if (events & kWriteEvent) {33 EV_SET (& ev [n ++], fd, EVFILT_WRITE, EV_ADD | EV_ENABLE, 0, 0, (void *) (intptr_t) fd); 34} else if (modify) {35 EV_SET (& ev [n ++], fd, EVFILT_WRITE, EV_DELETE, 0, 0, (void *) (intptr_t) fd); 36} 37 printf ("% s fd % d events read % d w Rite % d \ n ", 38 modify? "Mod": "add", fd, events & kReadEvent, events & kWriteEvent); 39 int r = kevent (efd, ev, n, NULL, 0, NULL ); 40 exit_if (r, "kevent failed"); 41} 42 43 void handleAccept (int efd, int fd) {44 struct sockaddr_in raddr; 45 socklen_t rsz = sizeof (raddr ); 46 int cfd = accept (fd, (struct sockaddr *) & raddr, & rsz); 47 exit_if (cfd <0, "accept failed"); 48 sockaddr_in peer, local; 49 socklen_t alen = sizeof (peer); 50 int r = getpeername (cfd, (sockaddr *) & peer, & alen); 51 exit_if (r <0, "getpeername failed"); 52 printf ("accept a connection from % s \ n", inet_ntoa (raddr. sin_addr); 53 setNonBlock (cfd); 54 updateEvents (efd, cfd, kReadEvent | kWriteEvent, false); 55} 56 57 void handleRead (int efd, int fd) {58 char buf [4096]; 59 int n = 0; 60 while (n =: read (fd, buf, sizeof buf)> 0) {61 printf ("read % d bytes \ n", n); 62 int r =: write (fd, buf, n ); // write read data 63 // in actual application, write data may return EAGAIN. At this time, you should listen to writable events, when writing data, write 64 exit_if (r <= 0, "write error "); 65} 66 if (n <0 & (errno = EAGAIN | errno = EWOULDBLOCK) 67 return; 68 exit_if (n <0, "read error "); // In actual application, errors such as EINTR 69 printf ("fd % d closed \ n", fd) and 70 close (fd) should be checked for n <0 ); 71} 72 73 void handleWrite (int efd, int fd) {74 // the actual application should write data when writing. If no data can be written, the write event 75 updateEvents (efd, fd, kReadEvent, true); 76} 77 78 void loop_once (int efd, int lfd, int waitms) {79 struct timespec timeout; 80 timeout. TV _sec = waitms/1000; 81 timeout. TV _nsec = (waitms % 1000) * 1000*1000; 82 const int kMaxEvents = 20; 83 struct kevent activeEvs [kMaxEvents]; 84 int n = kevent (efd, NULL, 0, activeEvs, kMaxEvents, & timeout); 85 printf ("epoll_wait return % d \ n", n); 86 for (int I = 0; I <n; I ++) {87 int fd = (int) (intptr_t) activeEvs [I]. udata; 88 int events = activeEvs [I]. filter; 89 if (events = EVFILT_READ) {90 if (fd = lfd) {91 handleAccept (efd, fd); 92} else {93 handleRead (efd, fd ); 94} 95} else if (events = EVFILT_WRITE) {96 handleWrite (efd, fd); 97} else {98 exit_if (1, "unknown event "); 99} 100} 101} 102 103 int main () {104 short port = 99; 105 int epollfd = kqueue (); 106 exit_if (epollfd <0, "epoll_create failed "); 107 int listenfd = socket (AF_INET, SOCK_STREAM, 0); 108 exit_if (listenfd <0, "socket failed"); 109 struct sockaddr_in addr; 110 memset (& addr, 0, sizeof addr); 111 addr. sin_family = AF_INET; 112 addr. sin_port = htons (port); 113 addr. sin_addr.s_addr = INADDR_ANY; 114 int r =: bind (listenfd, (struct sockaddr *) & addr, sizeof (struct sockaddr); 115 exit_if (r, "bind to 0.0.0.0: % d failed % d % s ", port, errno, strerror (errno); 116 r = listen (listenfd, 20); 117 exit_if (r, "listen failed % d % s", errno, strerror (errno); 118 printf ("fd % d listening at % d \ n", listenfd, port ); 119 setNonBlock (listenfd); 120 updateEvents (epollfd, listenfd, kReadEvent, false); 121 for (;) {// The signal processing function should be registered for actual applications, clear resource 122 loop_once (epollfd, listenfd, 10000); 123} 124 return 0; 125} When exiting}

 

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.