#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <assert.h>
#include <stdio.h>
#include <unistd.h>
#include <errno.h>
#include <string.h>
#include <fcntl.h>
#include <stdlib.h>
#include <sys/epoll.h>
#include <pthread.h> #define MAX_EVENT_NUMBER 1024
#define TCP_BUFFER_SIZE 512
#define UDP_BUFFER_SIZE 1024 int setnonblocking( int fd )
{
int old_option = fcntl( fd, F_GETFL );
int new_option = old_option | O_NONBLOCK;
fcntl( fd, F_SETFL, new_option );
return old_option;
} void addfd( int epollfd, int fd )
{
epoll_event event;
event.data.fd = fd;
//event.events = EPOLLIN | EPOLLET;
event.events = EPOLLIN;
epoll_ctl( epollfd, EPOLL_CTL_ADD, fd, &event );
setnonblocking( fd );
} int main( int argc, char* argv[] )
{
if( argc <= 2 )
{
printf( "usage: %s ip_address port_number\n", basename( argv[0] ) );
return 1;
}
const char* ip = argv[1];
int port = atoi( argv[2] ); int ret = 0;
struct sockaddr_in address;
bzero( &address, sizeof( address ) );
address.sin_family = AF_INET;
inet_pton( AF_INET, ip, &address.sin_addr );
address.sin_port = htons( port ); int listenfd = socket( PF_INET, SOCK_STREAM, 0 );
assert( listenfd >= 0 ); ret = bind( listenfd, ( struct sockaddr* )&address, sizeof( address ) );//TCP连接文件描写叙述符listenfd和address绑定了
assert( ret != -1 ); ret = listen( listenfd, 5 );
assert( ret != -1 ); bzero( &address, sizeof( address ) );//清空了address
address.sin_family = AF_INET;//又一次设置address为udpserver端地址信息
inet_pton( AF_INET, ip, &address.sin_addr );
address.sin_port = htons( port );
int udpfd = socket( PF_INET, SOCK_DGRAM, 0 );
assert( udpfd >= 0 ); ret = bind( udpfd, ( struct sockaddr* )&address, sizeof( address ) );//UDP连接文件描写叙述符udpfd和address绑定了
assert( ret != -1 );
//同一个端口上绑定了两个不同类型(TCP和UDP)的socket文件描写叙述符
//创建epoll事件监听模型
epoll_event events[ MAX_EVENT_NUMBER ];
int epollfd = epoll_create( 5 );
assert( epollfd != -1 );
addfd( epollfd, listenfd );//listenfd和udpfd均注冊到内核注冊表epollfd上
addfd( epollfd, udpfd ); while( 1 )
{
int number = epoll_wait( epollfd, events, MAX_EVENT_NUMBER, -1 );
if ( number < 0 )
{
printf( "epoll failure\n" );
break;
} for ( int i = 0; i < number; i++ )
{
int sockfd = events[i].data.fd;
if ( sockfd == listenfd )
{
struct sockaddr_in client_address;
socklen_t client_addrlength = sizeof( client_address );
int connfd = accept( listenfd, ( struct sockaddr* )&client_address, &client_addrlength );
addfd( epollfd, connfd );
}
else if ( sockfd == udpfd )
{
char buf[ UDP_BUFFER_SIZE ];
memset( buf, '\0', UDP_BUFFER_SIZE );
struct sockaddr_in client_address;
socklen_t client_addrlength = sizeof( client_address ); ret = recvfrom( udpfd, buf, UDP_BUFFER_SIZE-1, 0, ( struct sockaddr* )&client_address, &client_addrlength );
if( ret > 0 )
{
sendto( udpfd, buf, UDP_BUFFER_SIZE-1, 0, ( struct sockaddr* )&client_address, client_addrlength );
}
}
else if ( events[i].events & EPOLLIN )
{
char buf[ TCP_BUFFER_SIZE ];
while( 1 )
{
memset( buf, '\0', TCP_BUFFER_SIZE );
ret = recv( sockfd, buf, TCP_BUFFER_SIZE-1, 0 );
if( ret < 0 )
{
if( ( errno == EAGAIN ) || ( errno == EWOULDBLOCK ) )
{
break;
}
close( sockfd );
break;
}
else if( ret == 0 )
{
close( sockfd );
}
else
{
send( sockfd, buf, ret, 0 );
}
}
}
else
{
printf( "something else happened \n" );
}
}
} close( listenfd );
return 0;
}

最新文章

  1. 【POJ-1390】Blocks 区间DP
  2. 实战JS正则表达式
  3. SharePoint 2013 自定义扩展菜单
  4. OOP感悟
  5. ajax-向服务器发送请求
  6. 后缀数组 POJ 3974 Palindrome &amp;&amp; URAL 1297 Palindrome
  7. jquery 事件冒泡 解决 ie firefox 兼容性问题
  8. UI1_ScrollViewHomeWork
  9. js时间日期转时间戳
  10. window scipy install
  11. MyEclipse 8.0注冊码+原版下载_Java开发软件
  12. Windows Phone开发(11):常用控件(下)
  13. Cocos2D场景中对象引用为nil时的判断
  14. Atitit 项目版本管理gitflow 与 Forking的对比与使用
  15. 新版本grafana添加数据源报错!
  16. shell统计当前文件夹下的文件个数、目录个数
  17. 《Linux内核分析》第一周学习小结 计算机是如何工作的?
  18. 查看dll导出函数的方法
  19. bootstrap.yml与application.yml的区别
  20. selenium+Python(生成html测试报告)

热门文章

  1. js获得 json对象的个数(长度)
  2. UNIX基础【UNIX入门经典】
  3. POJ 2183
  4. [CSS3] Create Dynamic Styles with CSS Variables
  5. 在fragment中显示对话框出现异常
  6. 【LeetCode-面试算法经典-Java实现】【145-Binary Tree Postorder Traversal(二叉树非递归后序遍历)】
  7. dexposed框架Android在线热修复
  8. BZOJ 3112 [Zjoi2013]防守战线 线性规划
  9. javaScript常用知识点有哪些
  10. 创建表空间及plsql查看远程表空间路径