linux下Epoll网络模型

--------------------------------------------epollServer.cpp------------------------------------
#include <cstdio>
#include <sys/epoll.h>
#include <sys/time.h>
#include <sys/types.h>
#include <unistd.h>
#include "../Server/SocketHelper.h"
#define MAX_CONNECT 100
int main()
{
	//1.获取套接字
	int serverFd = open_listenfd("8888");
	int epollFd, eventCount;//epoll_event
	epollFd = epoll_create(1);
	epoll_event* allEvent = new epoll_event[MAX_CONNECT];
	epoll_event event;  //客户端的监听事件
	//添加客户端的监听事件
	event.events = EPOLLIN;
	event.data.fd = serverFd;
	epoll_ctl(epollFd, EPOLL_CTL_ADD, serverFd, &event);
	while (true)
	{
		eventCount = epoll_wait(epollFd, allEvent, MAX_CONNECT , 1000);
		if (eventCount < 0) {
			printf("Server error!!\n");
			break;
		}
		else if (eventCount == 0) {
			continue;
		}
		else {
			for (int i = 0; i < eventCount; i++) {
				if (allEvent[i].data.fd == serverFd) {//有客户端连接
					sockaddr clientAdd;
					socklen_t clientAddSize = sizeof(clientAdd);
					char c_hostname[100], c_port[100];
					int c_fd = accept(serverFd, &clientAdd, &clientAddSize);
					getnameinfo(&clientAdd, clientAddSize, c_hostname, 100, c_port, 100, 0);
					cout << "已连接描述符：" << c_fd << endl;
					cout << "客户端地址：" << c_hostname << endl;
					cout << "客户端端口：" << c_port << endl;
					//添加事件
					event.events = EPOLLIN;
					event.data.fd = c_fd;
					epoll_ctl(epollFd, EPOLL_CTL_ADD, c_fd, &event);
				}
				else {//有客户端发来消息
					rio_t rio;
					size_t n;
					char buf[100];
					int clientFd = allEvent[i].data.fd;
					rio_readinitb(&rio, clientFd);
					n = rio_readlineb(&rio, buf, 100);
					if (n == 0) { //关闭连接
						close(clientFd);
						epoll_ctl(epollFd, EPOLL_CTL_DEL, clientFd, NULL);//清除事件
						printf("%d: 客户端断开\n", clientFd);
					}
					else { //反弹
						rio_writen(clientFd, buf, n);
					}
				}
			}
		}
	}
	close(serverFd);
	close(epollFd);
	delete[] allEvent;
}

1.建立epoll_event、这里要设定最大链接数量、将服务端监听描述符加入到epoll_event中

2.每隔固定时间查询epoll_event里是否有准备好已读监听符，并返回准备好已读监听符数量num

3.当num>0时，我们知道有准备好已读监听描述符，并且知道描述符，因此不需要轮询