Linux網路編程poll模型

來源:互聯網
上載者:User
//分發進程//listen #include <stdio.h>#include <sys/types.h>#include <sys/socket.h>#include <sys/poll.h>#include <errno.h>#include <netinet/in.h>#include <unistd.h>#include <arpa/inet.h>#include <stdlib.h>#define LISTENQ 5 #define OPEN_MAX 1024#define SERV_PORT  10088#define MAX_LINE 1024#define INFTIM -1 int main(int argc, char** argv){int err, maxpoll, nreadly;struct pollfd client[OPEN_MAX];struct sockaddr_in cliaddr, servaddr;int listenFd = socket(AF_INET, SOCK_STREAM, 0);if( listenFd < 0){printf("socket函數執行失敗");return 1;}servaddr.sin_family = AF_INET;servaddr.sin_addr.s_addr = htonl(INADDR_ANY);//inet_aton('10.132.10.64', &(servaddr.sin_addr));//servaddr.sin_addr.s_addr = inet_addr("10.132.10.64");servaddr.sin_port = htons(SERV_PORT);if(bind(listenFd, (struct sockaddr*)&servaddr, sizeof(servaddr)) < 0){    printf("bind函數執行失敗");  return 1;}if(listen(listenFd, LISTENQ) < 0){printf("listen函數執行失敗");  return 1;}client[0].fd = listenFd;client[0].events = POLLRDNORM;for(int i =1; i < OPEN_MAX; i++){client[i].fd = -1;}maxpoll = 0;printf("listen函數執行成功\n");while(true){  socklen_t clilen = sizeof(cliaddr);nreadly = poll(client, maxpoll + 1, 1000);if(client[0].revents & POLLRDNORM){ int idx = -1; for(int i =1; i < OPEN_MAX; i++) {if(client[i].fd < 0){idx = i;break;} } if(idx == -1) { //丟棄串連 continue; } int connfd = accept(listenFd, (struct sockaddr*)&cliaddr, &clilen); if(connfd < 0) { printf("accept函數執行失敗"); break; } printf("Ip: %s 到此一遊\n", inet_ntoa(cliaddr.sin_addr)); client[idx].fd = connfd; client[idx].events = POLLRDNORM;  maxpoll = (idx > maxpoll ? idx : maxpoll);  if(--nreadly <= 0) { continue; }}for(int i =1; i < OPEN_MAX; i++){int sockfd = client[i].fd;if(sockfd < 0){continue;}if(client[i].revents & (POLLRDNORM | POLLERR)){char line[MAX_LINE];int n = read(sockfd, line, sizeof(line));if(n < 0){if(errno == ECONNRESET){close(sockfd);client[i].fd = -1;printf("異常退出\n");}else{printf("網路異常");exit(-1);}}else if(n == 0){close(sockfd);client[i].fd = -1;printf("正常退出\n");}else{line[n] = 0;printf("接收到資料:%s\n", line);write(sockfd, line, n);}if(--nreadly <= 0)  { continue;  }}}}}

相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

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.