該樓層疑似違規已被系統折疊?隱藏此樓查看此樓

操作系統中關于信號量操作的代碼示例(Linux+windows)

原文：操作系統中關于信號量操作的代碼示例(Linux+windows)

有一個生產者進程，有兩個消費者進程。生產者產生1-100的100個數。兩個消費者從共享內存中取數。

/*windows?部分*/

//?Thread.cpp?:?定義控制臺應用程序的入口點。

//-----------Windows下生產者、消費者實例程序---------------------

//--------------author:zhangwei----------------------------------

//--------------Date?12/10/2004---------------------------------

#include?"stdafx.h"

//作為倉庫存放數據，最多可以放五個數據

int?array[5];

//記錄生成數據的個數

int?pointer;

//記錄取得的數據的位置

int?pointerget;

//用來保存數據和

int?sum;

//臨界區對象

CRITICAL_SECTION?csArray;

//句柄，保存Full信號量

HANDLE?hFull;

//句柄，保存Empty信號量

HANDLE?hEmpty;

//生產者函數

DWORD?WINAPI?Producer(LPVOID?lpParam)

{

int?i?=?0;

pointer?=?0;

while(?i?

{

WaitForSingleObject(hEmpty,INFINITE);

EnterCriticalSection(?&csArray);

array[(pointer++)%5]?=?i?+?1;

LeaveCriticalSection(?&csArray);

ReleaseSemaphore(hFull,1,NULL);

i++;

}

return?0;

}

//消費者函數A

DWORD?WINAPI?ConsumerA(LPVOID?lpParam)

{

while(1)

{

WaitForSingleObject(hFull,INFINITE);

EnterCriticalSection(?&csArray);

sum?+=?array[(pointerget?++?)%5];

printf("ConsumerA?get?%d?\n",array[(pointerget?-1)%5]);

if(pointerget?==?100)

printf("The?sum?is?%d",sum);

LeaveCriticalSection(?&csArray);

ReleaseSemaphore(hEmpty,1,NULL);

}

return?0;

}

//消費者函數B

DWORD?WINAPI?ConsumerB(LPVOID?lpParam)

{

while(1)

{

WaitForSingleObject(hFull,INFINITE);

EnterCriticalSection(?&csArray);

sum?+=?array[(pointerget?++?)%5];

printf("ConsumerB?get?%d?\n",array[(pointerget?-1?)%5]);

if(pointerget?==?100)

printf("The?sum?is?%d",sum);

LeaveCriticalSection(?&csArray);

ReleaseSemaphore(hEmpty,1,NULL);

}

return?0;

}

//主函數

void?main()

{

HANDLE?hThreadProducer,hThreadConsumerA,hThreadComsumerB;

sum?=?0;

pointerget?=?0;

InitializeCriticalSection(?&csArray);

hFull?=?CreateSemaphore(NULL,0,5,NULL);

hEmpty?=?CreateSemaphore(NULL,5,5,NULL);

hThreadProducer?=?CreateThread(NULL,0,

Producer,NULL,0,NULL);

hThreadConsumerA?=?CreateThread(NULL,0,

ConsumerA,NULL,0,NULL);

hThreadComsumerB?=?CreateThread(NULL,0,

ConsumerB,NULL,0,NULL);

_getch();

}

/*Linux?部分*/

#include

#include

#include?

#include

#include

#include

#include

#include

#define?MAXSEM?5

//聲明三個信號燈ID

int?fullid;

int?emptyid;

int?mutxid;

int?main()

{

struct?sembuf?P,V;;

union?semun?arg;

//聲明共享內存

int?*array;

int?*sum;

int?*set;

int?*get;

//映射共享內存

array?=?(int?*)mmap(NULL?,?sizeof(?int?)*5,PROT_READ|PROT_WRITE,MAP_SHARED|MAP_ANONYMOUS,-1,0);

sum?=?(int?*)mmap(NULL?,?sizeof(?int?),PROT_READ|PROT_WRITE,MAP_SHARED|MAP_ANONYMOUS,-1,0);

get?=?(int?*)mmap(NULL?,?sizeof(?int?),PROT_READ|PROT_WRITE,MAP_SHARED|MAP_ANONYMOUS,-1,0);

set?=?(int?*)mmap(NULL?,?sizeof(?int?),PROT_READ|PROT_WRITE,MAP_SHARED|MAP_ANONYMOUS,-1,0);

*sum?=?0;

*get?=?0;

*set?=?0;

//生成信號燈

fullid=?semget(IPC_PRIVATE,1,IPC_CREAT|00666);

emptyid=semget(IPC_PRIVATE,1,IPC_CREAT|00666);

mutxid=semget(IPC_PRIVATE,1,IPC_CREAT|00666);

//為信號燈賦值

arg.val?=?0;

if(semctl(fullid?,?0?,?SETVAL?,?arg)?==?-1)?perror("semctl?setval?error");

arg.val?=?MAXSEM;

if(semctl(emptyid?,?0?,SETVAL?,?arg)?==?-1)?perror("semctl?setval?error");

arg.val?=?1;

if(semctl(mutxid?,?0?,SETVAL?,?arg)?==?-1)?perror("setctl?setval?error");

//初始化P,V操作

V.sem_num=0;

V.sem_op?=1;

V.sem_flg=SEM_UNDO;

P.sem_num=0;

P.sem_op?=-1;

P.sem_flg=SEM_UNDO;

//生產者進程

if(fork()?==?0?)?{

int?i?=?0;

while(?i?

{

semop(emptyid?,?&P?,1?);

semop(mutxid?,?&P?,?1);

array[*(set)%MAXSEM]?=?i?+?1;

printf("Producer?%d\n",?array[(*set)%MAXSEM]);

(*set)++;

semop(mutxid?,?&V?,?1);

semop(fullid?,?&V?,?1);

i++;

}

sleep(10);

printf("Producer?is?over");

exit(0);

}else?{

//ConsumerA?進程

if(fork()==0)?{

while(1){

semop(fullid?,?&P?,?1);

semop(mutxid?,?&P?,?1);

if(*get?==?100)

break;

*sum?+=?array[(*get)%MAXSEM];

printf("The?ComsumerA?Get?Number?%d\n",?array[(*get)%MAXSEM]?);

(*get)++;

if(?*get?==100)

printf("The?sum?is?%d?\n?",?*sum);

semop(mutxid?,?&V?,?1);

semop(emptyid?,?&V?,1?);

sleep(1);

}

printf("ConsumerA?is?over");

exit(0);

}else?{

//Consumer?B進程

if(fork()==0)?{

while(1){

semop(fullid?,?&P?,?1);

semop(mutxid?,?&P?,?1);

if(*get?==?100)

break;

*sum?+=?array[(*get)%MAXSEM];

printf("The?ComsumerB?Get?Number?%d\n",?array[(*get)%MAXSEM]?);

(*get)++;

if(?*get?==100)

printf("The?sum?is?%d?\n?",?*sum);

semop(mutxid?,?&V?,?1);

semop(emptyid?,?&V?,1?);

sleep(1);

}

printf("ConsumerB?is?over");

exit(0);

}

}

}

//?sleep(20);

return?0;

}

我的第一篇文章，多多指教。如需練習mail:dawei_zhang81@163.com

總結

以上是生活随笔為你收集整理的c语言p,用C语言实现P、V操作的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。