IO 0719

第一题：

测试错误检查锁和递归锁是否会造成死锁状态

pthread_mutex_t a;
pthread_mutex_t b;
pthread_mutexattr_t attr;
void* run(void* arg)
{
	while(1){
		pthread_mutex_lock(&b);
		printf("b\n");

	}
}
int main(int argc, const char *argv[])
{

	pthread_mutexattr_init(&attr);
	pthread_mutexattr_settype(&attr,PTHREAD_MUTEX_RECURSIVE_NP);
	pthread_mutex_init(&a,&attr);
	pthread_mutex_init(&b,&attr);

	pthread_t id;
	pthread_create(&id,0,run,0);
	pthread_detach(id);

	while(1){
		pthread_mutex_lock(&a);
		printf("a\n");
	}
	return 0;
}

pthread_mutex_t a;
pthread_mutex_t b;
pthread_mutexattr_t attr;
void* run(void* arg)
{
	while(1){
		pthread_mutex_lock(&b);
		printf("b\n");

	}
}
int main(int argc, const char *argv[])
{

	pthread_mutexattr_init(&attr);
	pthread_mutexattr_settype(&attr,PTHREAD_MUTEX_ERRORCHECK_NP);
	pthread_mutex_init(&a,&attr);
	pthread_mutex_init(&b,&attr);

	pthread_t id;
	pthread_create(&id,0,run,0);
	pthread_detach(id);

	while(1){
		pthread_mutex_lock(&a);
		printf("a\n");
	}
	return 0;
}

 第二题：

有2条隧道，一条快速隧道，一条普通隧道。有5列火车，3列复兴号，2列绿皮扭扭车 要求，复兴号2条隧道都能走，绿皮车只能走普通隧道 模拟火车过隧道的场景

pthread_mutex_t m1;
pthread_mutex_t m2;
int tunnel1 = 0;
int tunnel2 = 0;
void* run1(void* arg){
	while(1){
		pthread_mutex_lock(&m1);
		tunnel1 = 1;
		printf("绿皮车占据慢速隧道......\n");
		sleep(1);

		tunnel1 = 0;
		pthread_mutex_unlock(&m1);
		usleep(100000);
	}
}

void* run2(void* arg){
	while(1){
		int i = rand()%2+1;
		if(i==1){
			int res = pthread_mutex_trylock(&m1);
			if(res !=0){continue;}
			tunnel1 = 1;
			printf("高铁占据了慢速隧道......\n");
			sleep(2);
			tunnel2 = 0;
			pthread_mutex_unlock(&m1);
		}else{
			pthread_mutex_lock(&m2);
			tunnel2 = 1;
			printf("高铁占据了快速隧道......\n");
			sleep(2);
			tunnel2 = 0;
			pthread_mutex_unlock(&m2);
		}
	}
}

int main(int argc, const char *argv[])
{
	srand(time(0));
	pthread_mutex_init(&m1,0);
	pthread_mutex_init(&m2,0);

	pthread_t id1,id2;
	pthread_create(&id1,0,run1,0);
	pthread_create(&id2,0,run2,0);

	pthread_join(id1,0);
	pthread_join(id2,0);

	return 0;
}