最近刚开始看陈硕大牛的《linux多线程服务端编程》,开篇的竞态条件场景很好理解,并顺手编了个小程序以作辅证:
贴码如下:
#include <iostream>
#include <pthread.h>
#include <stdlib.h>
using namespace std;
class testdog
{
public:
static int number;
static void *zizeng(void *);
static void *zizeng1(void *);
testdog(int a,int b,int c);
private:
int a1,a2,a3;
};
int testdog::number = 0;
void *testdog::zizeng(void *)
{
cout<<"ni hao"<<endl;
for(int i=0;i<400000000;++i)
{
++number;
}
}
void *testdog::zizeng1(void *)
{
for(int i=0;i<400000000;++i)
{
++number;
}
}
testdog::testdog(int a,int b,int c)
{
a1 = a;
a2 = b;
a3 = c;
}
int main()
{
testdog dog1(1,2,3);
cout<<testdog::number<<endl;
pthread_t tid1,tid2;
int res1 = pthread_create(&tid1,NULL,testdog::zizeng,NULL);
cout<<res1<<endl;
int res2 = pthread_create(&tid2,NULL,testdog::zizeng1,NULL);
cout<<res2<<endl;
pthread_join(tid1,NULL);
pthread_join(tid2,NULL);
cout<<testdog::number<<endl;
return 0;
}
运行结果
可见打印出的结果不是800000000,