socket 映射服务器--(可处理多客户端连接(fork),显示退出信息)
2024-08-24 13:22:54
server
#include <stdio.h>
#include <sys/types.h> /* See NOTES */
#include <sys/socket.h>
#include <unistd.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <string.h>
#include <stdlib.h> void do_service(int conn)
{
char recvbuf[];
while()
{
memset(recvbuf,,sizeof(recvbuf));
int ret = read(conn,recvbuf,sizeof(recvbuf));
if(ret == )
{
printf("client close\n");
break;
}
else if (ret == -)
{
printf("read failed \n");
exit();
}
fputs(recvbuf,stdout);
write(conn,recvbuf,ret);
}
} int main(void)
{
int listenfd;
listenfd = socket(PF_INET,SOCK_STREAM,);
if(listenfd < )
{
printf("creat socket failed\n");
exit();
}
struct sockaddr_in servaddr;
memset(&servaddr,,sizeof(servaddr));
servaddr.sin_family = AF_INET;
servaddr.sin_port = htons();
servaddr.sin_addr.s_addr = htonl(INADDR_ANY);//host any address int n=;
if(setsockopt(listenfd,SOL_SOCKET,SO_REUSEADDR,&n,sizeof(n))<)
{
printf("set resueaddr failed\n");
exit();
} if(bind(listenfd,(struct sockaddr*)&servaddr,sizeof(servaddr))<)
{
printf("bind fialed\n");
exit();
}
if(listen(listenfd,SOMAXCONN)<)
{
printf("listen failed\n");
exit();
}
struct sockaddr_in peeraddr;
socklen_t peerlen = sizeof(peeraddr);
int conn;
pid_t pid;
while()
{
if((conn=accept(listenfd,(struct sockaddr*)&peeraddr,&peerlen))<)
{
printf("accept failed\n");
exit();
}
printf("ip=%s, port=%d\n",inet_ntoa(peeraddr.sin_addr),ntohs(peeraddr.
sin_port));
pid = fork();
if(pid == -)
{
printf("fork failed\n");
exit();
}
if (pid == )
{
close(listenfd);
do_service(conn);
exit();
}
else
{
close(conn);
}
} return ;
}
client 参考http://www.cnblogs.com/Malphite/p/7529200.html
最新文章
- jquery向苹果或者android发送请求
- ISPA
- JAVA窗口程序实例一
- .NET删除字节数组中的0字节
- 复习sqldataread
- 在word里插入图片,并设置图片的格式
- JS中定义类的方法
- phpcms list页实现分页
- php之属性重载和方法重载
- 常用的邮箱服务器(SMTP、POP3)地址、端口
- oc中对象的初始化
- Codeforces Round #248 (Div. 2)C 题
- DuiLib(三)——控件消息
- Microsoft.SharePoint.Security的问题
- 多线程09-Lock和Condition
- 文本域、bootstrap-table显示以及MySQL三者间的换行符问题
- Echarts图表legend的排版问题(转载)
- 一个完整Java Web项目背后的密码
- BFS广度优先 vs DFS深度优先 for Binary Tree
- ATM自动取款机程序感想