一、思维导图
二、测试错误检查锁和递归锁是否会造成死锁状态
#include <myhead.h>
typedef struct sockaddr_in addr_in_t;
typedef struct sockaddr addr_t;
typedef struct sockaddr_un addr_un_t;
pthread_mutex_t a;
pthread_mutex_t b;
pthread_mutexattr_t attr;
pthread_mutexattr_t bttr;
void *run(void *arg)
{
while(1){
pthread_mutex_lock(&b);
// pthread_mutex_trylock(&b);
printf("子线程b\n");
usleep(500000);
}
}
int main(int argc, const char *argv[])
{
//错误检查锁创建
// pthread_mutex_attr attr;
// pthread_mutex_attr bttr;
pthread_mutexattr_init(&attr);
pthread_mutexattr_init(&bttr);
// pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_ERRORCHECK_NP);//属性设置为错误检查锁
// pthread_mutexattr_settype(&bttr, PTHREAD_MUTEX_ERRORCHECK_NP);
pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_RECURSIVE_NP); //属性设置为递归锁
pthread_mutexattr_settype(&bttr, PTHREAD_MUTEX_RECURSIVE_NP);
pthread_mutex_init(&a, &attr);
pthread_mutex_init(&b, &bttr);
pthread_t id;
pthread_create(&id, 0, run, 0);
pthread_detach(id);
while(1){
pthread_mutex_lock(&a);
// pthread_mutex_trylock(&a);
printf("主线程a\n");
usleep(500000);
}
return 0;
}
三、有2条隧道,一条快速隧道,一条普通隧道。有5列火车,3列复兴号,2列绿皮扭扭车 要求,复兴号2条隧道都能走,绿皮车只能走普通隧道 模拟火车过隧道的场景
#include <myhead.h>
typedef struct sockaddr_in addr_in_t;
typedef struct sockaddr addr_t;
typedef struct sockaddr_un addr_un_t;
typedef struct{
char name[10];
}Train;
pthread_mutex_t FT = PTHREAD_MUTEX_INITIALIZER; //快速隧道
pthread_mutex_t NT = PTHREAD_MUTEX_INITIALIZER; //普通隧道
void *run(void *arg)
{
Train* train = (Train*)arg;
while(1){
if(train->name[0] == 'D'){
if(rand() % 2 == 1){
int res = pthread_mutex_trylock(&FT);
if(res != 0){continue;}
printf("复兴号 %s 通过快速隧道\n", train->name);
sleep(2);
pthread_mutex_unlock(&FT);
}else{
pthread_mutex_lock(&NT);
printf("复兴号 %s 通过普通隧道\n", train->name);
sleep(2);
pthread_mutex_unlock(&NT);
}
}else if(train->name[0] == 'K'){
pthread_mutex_lock(&NT);
printf("列车 %s 通过普通隧道\n",train->name);
sleep(2);
pthread_mutex_unlock(&NT);
}
sleep(2);
}
return NULL;
}
int main(int argc, const char *argv[])
{
srand(time(0));
Train trains[5] = {
{"D1"},
{"D2"},
{"D3"},
{"K1"},
{"K2"},
};
pthread_t id[5];
//创建线程
for(int i = 0; i < 5; i++){
pthread_create(&id[i], 0, run, (void*)&trains[i]);
}
//回收
for(int i = 0; i < 5; i++){
pthread_join(id[i], NULL);
}
return 0;
}