共享内存测试程序

在操作系统课程里学习过进程间通信的方式有“管道”，“信号量”，“消息”，“共享内存”，“套接字”等。自己在学习共享内存过程中写了下面的测试小程序。目的是把用到的API列到这里，在需要详细了解的时候查看相关手册。

在cycle.cc程序中，count存在于共享内存中，循环对count进行累加操作，然后打印出来。

在control.cc程序中，把count的值置为0。在执行了control.cc程序后，可以看到cycle.cc重新从1开始打印count。

一般对共享内存需要互斥访问，所以我用信号量的方式实现了一个CriticalSection的类，用来实现cycle.cc和control.cc两个程序对共享内存中count变量的互斥访问。

cycle.cc程序几乎是个无限循环，如果中断它的运行，可能导致信号量，共享内存挂住。可以用ipcs命令来查看当前创建的IPC资源。可以用ipcrm命令来删除已创建的IPC资源。

 

//cycle.cc //this program print count++ repeatedly, where counter is in shared memory //the key of shared memory is from command arguments #include <unistd.h> #include <stdio.h> #include <stdlib.h> #include <errno.h> #include <sys/ipc.h> #include <sys/shm.h> #include "criticalsection.h" void errexit() { perror("err"); exit(1); } void usageexit(char* exe) { printf("usage: %s <int_key>/n",exe); exit(1); } int main(int argc,char** argv) { int *pcounter=NULL; const int max_int=0x7FFFFFFF; int shmid=-1; int res; if(argc<2) usageexit(argv[0]); int key=atoi(argv[1]); res=shmget(key,sizeof (int),IPC_CREAT | 0666); if(-1== res) errexit(); shmid=res; pcounter=(int*)shmat(shmid,NULL,0); if(pcounter==(int*)-1) errexit(); CriticalSection critical(key); for(*pcounter=0;*pcounter<max_int; ) { critical.Enter(); (*pcounter)++; sleep(3);//3 seconds printf("count=%d/n",*pcounter); critical.Leave(); } res=shmdt(pcounter); if(-1==res) errexit(); res=shmctl(shmid,IPC_RMID,0); if(-1==res) errexit(); return 0; }

 

//control.cc //this program change the counter value in shared memory to 0, //so that cycle.cc will restart count from 0 //the key of shared memory is from command arguments #include <stdio.h> #include <stdlib.h> #include <errno.h> #include <sys/ipc.h> #include <sys/shm.h> #include "criticalsection.h" void errexit() { perror("err"); exit(1); } void usageexit(char* exe) { printf("usage: %s <int_key>/n",exe); exit(1); } int main(int argc,char** argv) { int *pcounter=NULL; const int max_int=0x7FFFFFFF; int shmid=-1; int res; if(argc<2) usageexit(argv[0]); int key=atoi(argv[1]); res=shmget(key,sizeof (int),0); if(-1== res) errexit(); shmid=res; pcounter=(int*)shmat(shmid,NULL,0); if(pcounter==(int*)-1) errexit(); CriticalSection critical(key); //for(*pcounter=0;*pcounter<max_int; ) //{ critical.Enter(); (*pcounter)=0; // printf("count=%d/n",*pcounter); critical.Leave(); //} res=shmdt(pcounter); if(-1==res) errexit(); // res=shmctl(shmid,IPC_RMID,0);//who create, who release // if(-1==res) errexit(); return 0; }

 

//criticalsection.h //implement a critical section class, using semaphore #include <stdio.h> #include <sys/types.h> #include <sys/ipc.h> #include <sys/sem.h> #include <stdlib.h> union semun { int val; //<= value for SETVAL struct semid_ds *buf; //<= buffer for IPC_STAT & IPC_SET unsigned short int *array; //<= array for GETALL & SETALL struct seminfo *__buf; //<= buffer for IPC_INFO }; class CriticalSection { private: int mSemid; bool mOwner; public: CriticalSection(int key) { mSemid=semget(key,1,IPC_CREAT|0600|IPC_EXCL); mOwner=true; if(-1==mSemid) { //already exist if (errno==EEXIST) { mSemid=semget(key,1,0); mOwner=false; } } if(-1==mSemid) throw 1; //new created, initialize it if(mOwner) { union semun semarg; semarg.val=1; int res=semctl(mSemid,0,SETVAL,semarg); if (-1==res) throw 2; } }//constructor ~CriticalSection() { if (mSemid==-1) return; if(!mOwner) return;//owner release the semaphore int res=semctl(mSemid,0,IPC_RMID); if(-1==res) throw 1; } void Enter() { struct sembuf buf; buf.sem_num=0;//the first sem in set buf.sem_op=-1; buf.sem_flg=0; if (-1==semop(mSemid,&buf,1)) throw 1; } void Leave() { struct sembuf buf; buf.sem_num=0;//the first sem in set buf.sem_op=1; buf.sem_flg=0; if (-1==semop(mSemid,&buf,1)) throw 1; } };