pthread_cond_wait 详解
配套使用。pthread_cond_wait()函数一进入wait状态就会自动release mutex。当其他线程通过pthread_cond_signal()或pthread_cond_broadcast,把该线程唤醒,使pthread_cond_wait()通过(返回)时,该线程又自动获得该mutex。
wait,而且规范要求pthread_cond_signal至少唤醒一个pthread_cond_wait上的线程,其实有些实现为了简单在单处理器上也会唤醒多个线程.
int x,y;pthread_mutex_t mut = PTHREAD_MUTEX_INITIALIZER;pthread_cond_t cond = PTHREAD_COND_INITIALIZER;
pthread_mutex_lock(&mut);while (x <= y) {pthread_cond_wait(&cond, &mut);}/* operate on x and y */pthread_mutex_unlock(&mut);
pthread_mutex_lock(&mut);/* modify x and y */if (x > y) pthread_cond_broadcast(&cond);pthread_mutex_unlock(&mut);
#include <stdio.h>#include <stdlib.h>#include <unistd.h>#include <pthread.h>#define BUFFER_SIZE 8struct Products{int buffer[BUFFER_SIZE];/*保证存取操作的原子性 互斥性*/pthread_mutex_t locker;/*是否可读*/pthread_cond_t notEmpty;/*是否可写*/pthread_cond_t notFull;int posReadFrom;int posWriteTo;};int BufferIsFull(struct Products* products){if ((products->posWriteTo + 1) % BUFFER_SIZE == products->posReadFrom){return (1);}return (0);}int BufferIsEmpty(struct Products* products){if (products->posWriteTo == products->posReadFrom){return (1);}return (0);}/*制造产品*/。void Produce(struct Products* products, int item){/*原子操作*/pthread_mutex_lock(&products->locker);/*无空间可写入*/while (BufferIsFull(products)){pthread_cond_wait(&products->notFull, &products->locker);}/*写入数据*/products->buffer[products->posWriteTo] = item;products->posWriteTo++;if (products->posWriteTo >= BUFFER_SIZE)products->posWriteTo = 0;/*发信*/pthread_cond_signal(&products->notEmpty);/*解锁*/pthread_mutex_unlock(&products->locker);}int Consume(struct Products* products){int item;pthread_mutex_lock(&products->locker);/*为空时持续等待,无数据可读*/while (BufferIsEmpty(products)){pthread_cond_wait(&products->notEmpty, &products->locker);}/*提取数据*/item = products->buffer[products->posReadFrom];products->posReadFrom++;/*如果到末尾,从头读取*/if (products->posReadFrom >= BUFFER_SIZE)products->posReadFrom = 0;pthread_cond_signal(&products->notFull);pthread_mutex_unlock(&products->locker);return item;}#define END_FLAG (-1)struct Products products;void* ProducerThread(void* data){int i;for (i = 0; i < 16; ++i){printf("producer: %d\n", i);Produce(&products, i);}Produce(&products, END_FLAG);return NULL;}void* ConsumerThread(void* data){int item;while (1){item = Consume(&products);if (END_FLAG == item)break;printf("consumer: %d\n", item);}return (NULL);}int main(int argc, char* argv[]){pthread_t producer;pthread_t consumer;int result;pthread_create(&producer, NULL, &ProducerThread, NULL);pthread_create(&consumer, NULL, &ConsumerThread, NULL);pthread_join(producer, (void *)&result);pthread_join(consumer, (void *)&result);exit(EXIT_SUCCESS);}
#include <pthread.h>
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <string.h>
pthread_mutex_t mymutex1 = PTHREAD_MUTEX_INITIALIZER;
pthread_mutex_t mymutex2 = PTHREAD_MUTEX_INITIALIZER;
pthread_cond_t mycond = PTHREAD_COND_INITIALIZER;
void *mythread1(void *param)
{
printf("begin mythread1.\n");
pthread_mutex_lock(&mymutex1);
printf("wait in mythread1.\n");
pthread_cond_wait(&mycond,&mymutex1);
pthread_mutex_unlock(&mymutex1);
printf("end mythread1.\n");
return NULL;
}
void *mythread2(void *param)
{
printf("begin mythread2.\n");
pthread_mutex_lock(&mymutex2);
printf("wait in mythread2.\n");
pthread_cond_wait(&mycond,&mymutex2);
pthread_mutex_unlock(&mymutex2);
printf("end mythread2.\n");
return NULL;
}
int main(void)
{
printf("begin main thread.\n");
int i;
pthread_t tid1,tid2;
pthread_create(&tid1,NULL,mythread1,NULL);
pthread_create(&tid2,NULL,mythread2,NULL);
sleep(5);
printf("try to wake up mythread1 and mythread2 in main thread.\n");
if(pthread_cond_broadcast(&mycond)){
printf("error\n");
return 1;
}
void *res;
pthread_join(tid1, &res);
pthread_join(tid2, &res);
printf("end main thread.\n");
return 0;
}
- #include <pthread.h>
- #include <stdlib.h>
- #include <stdio.h>
- #include <unistd.h>
- #include <string.h>
- pthread_mutex_t mymutex1 = PTHREAD_MUTEX_INITIALIZER;
- pthread_mutex_t mymutex2 = PTHREAD_MUTEX_INITIALIZER;
- pthread_cond_t mycond = PTHREAD_COND_INITIALIZER;
- void *mythread1(void *param)
- {
- printf("begin mythread1.\n");
- pthread_mutex_lock(&mymutex1);
- printf("wait in mythread1.\n");
- pthread_cond_wait(&mycond,&mymutex1);
- pthread_mutex_unlock(&mymutex1);
- printf("end mythread1.\n");
- return NULL;
- }
- void *mythread2(void *param)
- {
- printf("begin mythread2.\n");
- pthread_mutex_lock(&mymutex2);
- printf("wait in mythread2.\n");
- pthread_cond_wait(&mycond,&mymutex2);
- pthread_mutex_unlock(&mymutex2);
- printf("end mythread2.\n");
- return NULL;
- }
- int main(void)
- {
- printf("begin main thread.\n");
- int i;
- pthread_t tid1,tid2;
- pthread_create(&tid1,NULL,mythread1,NULL);
- pthread_create(&tid2,NULL,mythread2,NULL);
- sleep(2);
- printf("try to wake up mythread1 and mythread2 in main thread.\n");
- if(pthread_cond_broadcast(&mycond)){
- printf("error\n");
- return 1;
- }
- void *res;
- pthread_join(tid1, &res);
- pthread_join(tid2, &res);
- printf("end main thread.\n");
- return 0;
- }
begin main thread.
begin mythread1.
wait in mythread1.
begin mythread2.
wait in mythread2.
end mythread2.
try to wake up mythread1 and mythread2 in main thread.
end mythread1.
end main thread.
- #include <pthread.h>
- #include <stdlib.h>
- #include <stdio.h>
- #include <unistd.h>
- #include <string.h>
- pthread_mutex_t mymutex1 = PTHREAD_MUTEX_INITIALIZER;
- //pthread_mutex_t mymutex2 = PTHREAD_MUTEX_INITIALIZER;
- pthread_cond_t mycond = PTHREAD_COND_INITIALIZER;
- void *mythread1(void *param)
- {
- printf("begin mythread1.\n");
- pthread_mutex_lock(&mymutex1);
- printf("wait in mythread1.\n");
- pthread_cond_wait(&mycond,&mymutex1);
- pthread_mutex_unlock(&mymutex1);
- printf("end mythread1.\n");
- return NULL;
- }
- void *mythread2(void *param)
- {
- printf("begin mythread2.\n");
- pthread_mutex_lock(&mymutex1);
- printf("wait in mythread2.\n");
- pthread_cond_wait(&mycond,&mymutex1);
- pthread_mutex_unlock(&mymutex1);
- printf("end mythread2.\n");
- return NULL;
- }
- int main(void)
- {
- printf("begin main thread.\n");
- int i;
- pthread_t tid1,tid2;
- pthread_create(&tid1,NULL,mythread1,NULL);
- pthread_create(&tid2,NULL,mythread2,NULL);
- sleep(2);
- printf("try to wake up mythread1 and mythread2 in main thread.\n");
- if(pthread_cond_broadcast(&mycond)){
- printf("error\n");
- return 1;
- }
- void *res;
- pthread_join(tid1, &res);
- pthread_join(tid2, &res);
- printf("end main thread.\n");
- return 0;
- }
$ gcc threadTest.c -o test.exe
123@xyy ~/gcc-test
$ ./test.exe
begin main thread.
begin mythread1.
wait in mythread1.
begin mythread2.
wait in mythread2.
try to wake up mythread1 and mythread2 in main thread.
end mythread1.
end mythread1.
end main thread.
结束!
pthread_cond_wait 详解的更多相关文章
- pthread_cond_signal与pthread_cond_wait详解
转:http://blog.chinaunix.net/uid-11572501-id-3456343.html //pthread_cond_signal 只发信号,内部不会解锁,在Linux 线程 ...
- 条件变量pthread_cond_wait()和pthread_cond_signal()详解
条件变量 条件变量是利用线程间共享的全局变量进行同步的一种机制,主要包括两个动作:一个线程等待"条件变量的条件成立"而挂起:另一个线程使"条件成立" ...
- 转载~kxcfzyk:Linux C语言多线程库Pthread中条件变量的的正确用法逐步详解
Linux C语言多线程库Pthread中条件变量的的正确用法逐步详解 多线程c语言linuxsemaphore条件变量 (本文的读者定位是了解Pthread常用多线程API和Pthread互斥锁 ...
- 通用线程:POSIX 线程详解,第 3 部分 条件互斥量(pthread_cond_t)
使用条件变量提高效率 本文是 POSIX 线程三部曲系列的最后一部分,Daniel 将详细讨论如何使用条件变量.条件变量是 POSIX 线程结构,可以让您在遇到某些条件时“唤醒”线程.可以将它们看作是 ...
- 通用线程:POSIX 线程详解,第 3 部分
通用线程:POSIX 线程详解,第 3 部分 使用条件变量提高效率 Daniel Robbins, 总裁兼 CEO, Gentoo Technologies, Inc. 简介: 本文是 POSIX 线 ...
- POSIX 线程详解(经典必看)
http://www.cnblogs.com/sunminmin/p/4479952.html 总共三部分: 第一部分:POSIX 线程详解 ...
- JUC中的AQS底层详细超详解
摘要:当你使用java实现一个线程同步的对象时,一定会包含一个问题:你该如何保证多个线程访问该对象时,正确地进行阻塞等待,正确地被唤醒? 本文分享自华为云社区<JUC中的AQS底层详细超详解,剖 ...
- Linq之旅:Linq入门详解(Linq to Objects)
示例代码下载:Linq之旅:Linq入门详解(Linq to Objects) 本博文详细介绍 .NET 3.5 中引入的重要功能:Language Integrated Query(LINQ,语言集 ...
- 架构设计:远程调用服务架构设计及zookeeper技术详解(下篇)
一.下篇开头的废话 终于开写下篇了,这也是我写远程调用框架的第三篇文章,前两篇都被博客园作为[编辑推荐]的文章,很兴奋哦,嘿嘿~~~~,本人是个很臭美的人,一定得要截图为证: 今天是2014年的第一天 ...
随机推荐
- 解决spring、springMVC重复扫描导致事务失效的问题
在主容器中(applicationContext.xml),将Controller的注解排除掉 1 2 3 而在springMVC配置文件中将Service注解给去掉 1 2 3 4 因为spring ...
- mongod无法启动
今天遇到了一个奇葩问题,我在Linux系统里备份了数据库,结果不知道为什么,系统用不了了,后来经过同事的检查,发现原来是我的硬盘快满了,导致mongod数据无法启动,真是.......
- MAC 系列 之XCode7.1 + HBuilder MUI 离线打包 ipa 上次application leader 问题:ERROR ITMS - 90032
90032 解决方法:
- js的值类型和引用类型
(1)值类型:String.Boolean.Number.null.undefined.(原始值) var a = 2; var b = a; b=3; a ==>2; b ==>3 原 ...
- JavaWeb -- JSP+JavaBean模式
SUN公司推出JSP技术后,同时也推荐了两种web应用程序的开发模式,一种是JSP+JavaBean模式,一种是Servlet+JSP+JavaBean模式. JSP+JavaBean模式适合开发业务 ...
- js判断是pc还是移动端
//判断pc还是移动端 var isM = function () { var ua = navigator.userAgent; /* navigator.userAgent 浏览器发送的用户代理标 ...
- iTunes 12恢复.ipsw固件
恢复.ipsw步骤: 1. 下载好与移动设备对应的.ipsw固件(zip文件可以解压出来). 2. 将移动设备连接到安装有iTunes的电脑,解锁并信任这台电脑 3. 启动iTunes,选择这个移动设 ...
- vue cli关闭eslint严格语法检查
eslint是一个JavaScript的校验插件,通常用来校验语法或代码的书写风格. 官方文档:https://eslint.org 这篇文章总结了eslint的规则:Eslint规则说明 1.关闭e ...
- Codeforces Round #260(div2)C(递推)
有明显的递推关系: f[i]表示i为数列中最大值时所求结果.num[i]表示数i在数列中出现了几次. 对于数i,要么删i,要么删i-1,只有这两种情况,且子问题还是一样的思路.那么很显然递推一下就行了 ...
- Gym - 100502G Outing (强连通缩点+树形依赖背包)
题目链接 问题:有n个人,最多选k个,如果选了某个人就必须选他指定的另一个人,问最多能选多少个人. 将每个人所指定的人向他连一条单向边,则每一个点都有唯一的前驱,形成的图是个基环树森林,在同一个强连通 ...