【实验二】Linux的消息队列编程

目录

一、问题

二、代码实现

1、serMain.cpp

2、server.h

3、server.cpp

 4、cliMain.cpp

5、client.h

6、client.cpp

7、message.h

8、message.cpp

9、msg.mk

三、运行结果


一、问题

通过消息队列实现进程间的通信:

服务端命令行输入:./serMain  server.cpp 1000

客户端命令行输入:./cliMain   server.cpp 1000

博客1

博客2 

二、代码实现

1、serMain.cpp

#include<stdlib.h>
#include"server.h"
int main(int argc, char* argv[]){
	server(argv[1],atol(argv[2]));
	return 0;
}

2、server.h

void server(const char *msgname,const long msgtype);

3、server.cpp

#include<iostream>
#include<sys/types.h>
#include<sys/ipc.h>
#include<sys/msg.h>
#include<string.h>
#include"server.h"
#include"message.h"
const int PROID=100;

void han_mes(Message& m){
	switch(m.op){
		case 0:
			m.res=m.oprand1+m.oprand2;
			break;
		case 1:
			m.res=m.oprand1-m.oprand2;
			break;
		case 2:
			m.res=m.oprand1*m.oprand2;
			break;
		case 3:
			if(m.oprand2!=0){
				m.res=m.oprand1/m.oprand2;
			}else{
				m.status='F';
			}
			break;

		default:
			m.status='N';
			break;
	}
}

void process(const int msgid,const long msgtype){
	while(true){
		Message m;
		memset(&m,0,sizeof(m));
		msgrcv(msgid,&m,sizeof(m)-sizeof(long),msgtype,0);
		long rtype=m.rtype;
		han_mes(m);
		m.mtype=rtype;
		msgsnd(msgid,&m,sizeof(m)-sizeof(long),0);
	}
}

void server(const char* msgname,const long msgtype){
	int msgid;
	do{
		key_t msgkey=ftok(msgname,PROID);
		if(msgkey == -1){
			std::cerr<<"ftok wrong\n";
			break;
		}
		msgid=msgget(msgkey,IPC_CREAT|0664);
		if(msgid == -1){
			std::cerr<<"msgget wrong\n";
			break;
		}
		process(msgid,msgtype);	
	}while(0);
}

 4、cliMain.cpp

#include<stdlib.h>
#include"client.h"
int main(int argc,char* argv[]){
	client(argv[1],atol(argv[2]));
	return 0;
}

5、client.h

void client (const char* msgname,const long msgtype);

6、client.cpp

#include<iostream>
#include<sys/types.h>
#include<sys/ipc.h>
#include<sys/msg.h>
#include<unistd.h>
#include<string.h>
#include"client.h"
#include"message.h"
const int PROID=100;


void process(const int msgid,const long msgtype){
	while(true){
		Message m;
		memset(&m,0,sizeof(m));
		std::cout<<"please enter expression:";
		std::cin>>m;
		if(std::cin.eof()) break;
		m.status='S';
		m.mtype=msgtype;
		long rtype=getpid();
		m.rtype=rtype;
		msgsnd(msgid,&m,sizeof(m)-sizeof(long),0);
		msgrcv(msgid,&m,sizeof(m)-sizeof(long),rtype,0);
		std::cout<<m<<std::endl;
	}
}

void client(const char* msgname,const long msgtype){
	int msgid;
	do{
		key_t msgkey=ftok(msgname,PROID);
		if(msgkey == -1){
			std::cerr<<"ftok wrong\n";
			break;
		}
		msgid=msgget(msgkey,IPC_CREAT|0664);
		if(msgid == -1){
			std::cerr<<"msgget wrong\n";
			break;
		}
		process(msgid,msgtype);	
	}while(0);
}

7、message.h

#include<iostream>
struct Message{
	long mtype;
	long rtype;
	int oprand1;
	int op;
	int oprand2;
	int res;
	char status;
};

std::istream &operator >>(std::istream& in, Message& m);
std::ostream &operator <<(std::ostream& out,const Message& m);

8、message.cpp

#include"message.h"

std::istream& operator >>(std::istream&  in ,Message& m){
	in>>m.oprand1>>m.op>>m.oprand2;
	return in;
}

std::ostream& operator <<(std::ostream& out ,const Message& m){
	char ops[]={'+','-','*','/'};
	if(m.status=='S'){
		out<<m.oprand1<<ops[m.op]<<m.oprand2<<"="<<m.res;
	}else if(m.status=='F'){
		out<<"The divisor cannot be 0";
	}else if(m.status=='N'){
		out<<"Opreator iuput error";
	}
	
	return out;
}

9、msg.mk

GCC=g++
CFLAG=-c
OFLAG=-o
SEXE=serMain
SOBJ=serMain.o server.o
CEXE=cliMain
COBJ=cliMain.o client.o message.o
all:${SEXE} ${CEXE}
${SEXE}:${SOBJ}
        ${GCC} ${OFLAG} $@ $^
${CEXE}:${COBJ}
        ${GCC} ${OFLAG} $@ $^
%.o:%.cpp
        ${GCC} ${CFLAG} $^
clean:   
        rm *.o

三、运行结果

1cd0e74e41534dca95c8b883d98127bd.png

f1a6d85f99d942fc8f3367cecf4bee1d.png

0615c3c74a5f4ef6b02f0cc916f08c61.png

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值