Rtthread 互斥量

已于 2024-01-30 13:46:21 修改
阅读量409 收藏 10
点赞数 3
文章标签： c语言
于 2024-01-30 11:49:48 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_49452863/article/details/135929655
版权 
#include <rtthread.h>

#define THREAD_PRIORITY         8
#define THREAD_TIMESLICE        5

/* 指向互斥量的指针 */
static rt_mutex_t dynamic_mutex = RT_NULL;
static rt_uint8_t number1,number2 = 0;

ALIGN(RT_ALIGN_SIZE) 
// RT_ALIGN_SIZE此处为4，要求给下面的数组分配地址时满足4字节对齐
//作用：提高CPU访问效率。变量的内存地址正好位于它长度的整数倍（自然对齐，比如32位单片机是4字节）
//对齐跟数据在内存中的位置有关。一般设置的对齐方式为1，2，4字节对齐方式。
static char thread1_stack[1024];
static struct rt_thread thread1;
static void rt_thread_entry1(void *parameter)
{
      while(1)
      {
          /* 线程 1 获取到互斥量后，先后对 number1、number2 进行加 1 操作，然后释放互斥量 */
          rt_mutex_take(dynamic_mutex, RT_WAITING_FOREVER);
          number1++;
          rt_kprintf("_1Entry1_1++!\n");
          rt_thread_mdelay(10);
          number2++;
          rt_kprintf("_1Entry1 __2number2++\n");
          rt_mutex_release(dynamic_mutex);
          rt_kprintf("_1_____Release Entry1___!\n");
       }
}

ALIGN(RT_ALIGN_SIZE)
static char thread2_stack[1024];
static struct rt_thread thread2;
static void rt_thread_entry2(void *parameter)
{
      while(1)
      {
          /* 线程 2 获取到互斥量后，检查 number1、number2 的值是否相同，相同则表示 mutex 起到了锁的作用 */
          rt_mutex_take(dynamic_mutex, RT_WAITING_FOREVER);
          if(number1 != number2)
          {
            rt_kprintf("not protect.number1 = %d, mumber2 = %d \n",number1 ,number2);
          }
          else
          {
            rt_kprintf("mutex protect ,number1 = mumber2 is %d\n",number1);
          }

           number1++;
           number2++;
           rt_kprintf("2entry2 ##!!\n");
           rt_mutex_release(dynamic_mutex);
           rt_kprintf("2Release Entry2!!%% \n");
          if(number1>=50)
              return;
      }
}

/* 互斥量示例的初始化 */
int mutex_sample(void)
{
    /* 创建一个动态互斥量 */
    dynamic_mutex = rt_mutex_create("dmutex", RT_IPC_FLAG_PRIO);
    if (dynamic_mutex == RT_NULL)
    {
        rt_kprintf("create dynamic mutex failed.\n");
        return -1;
    }

    rt_thread_init(&thread1,
                   "thread1",
                   rt_thread_entry1,
                   RT_NULL,
                   &thread1_stack[0],
                   sizeof(thread1_stack),
                   THREAD_PRIORITY, THREAD_TIMESLICE);
    rt_thread_startup(&thread1);
    rt_kprintf("$$$$11111Startup thread 1 .!\n");
    rt_thread_init(&thread2,
                   "thread2",
                   rt_thread_entry2,
                   RT_NULL,
                   &thread2_stack[0],
                   sizeof(thread2_stack),
                   THREAD_PRIORITY-1, THREAD_TIMESLICE);
    rt_thread_startup(&thread2);
    rt_kprintf("$$$$22222Startup thread 2 .!\n");
    return 0;
}

/* 导出到 MSH 命令列表中 */
MSH_CMD_EXPORT(mutex_sample, mutex sample);

运算结果：

 msh />mutex_sample
_1Entry1_1++!
$$$$11111Startup thread 1 .!
$$$$22222Startup thread 2 .!
msh />_1Entry1 __2number2++
mutex protect ,number1 = mumber2 is 1
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 2
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 3
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 4
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 5
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 6
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 7
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 8
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 9
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 10
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 11
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 12
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 13
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 14
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 15
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 16
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 17
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 18
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 19
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 20
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 21
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 22
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 23
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 24
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 25
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 26
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 27
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 28
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 29
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 30
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 31
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 32
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 33
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 34
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 35
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 36
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 37
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 38
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 39
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 40
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 41
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 42
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 43
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 44
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 45
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 46
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 47
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 48
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 49
2entry2 ##!!
2Release Entry2!!%
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!

过程分析：

二、更改mdelay后：

static void rt_thread_entry1(void *parameter)
{
      while(1)
      {
          /* 线程 1 获取到互斥量后，先后对 number1、number2 进行加 1 操作，然后释放互斥量 */
          rt_mutex_take(dynamic_mutex, RT_WAITING_FOREVER);
          number1++;
          rt_kprintf("_1Entry1_1++!\n");
//          rt_thread_mdelay(10);
          number2++;
          rt_kprintf("_1Entry1 __2number2++\n");
          rt_mutex_release(dynamic_mutex);
          rt_kprintf("_1_____Release Entry1___!\n");
          rt_thread_mdelay(10);
       }
}

运行结果：

msh />mutex_sample
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
$$$$11111Startup thread 1 .!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
mutex protect ,number1 = mumber2 is 2
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 3
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 4
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 5
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 6
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 7
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 8
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 9
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 10
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 11
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 12
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 13
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 14
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 15
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 16
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 17
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 18
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 19
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 20
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 21
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 22
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 23
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 24
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 25
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 26
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 27
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 28
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 29
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 30
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 31
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 32
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 33
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 34
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 35
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 36
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 37
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 38
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 39
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 40
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 41
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 42
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 43
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 44
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 45
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 46
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 47
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 48
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 49
2entry2 ##!!
2Release Entry2!!%
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
$$$$22222Startup thread 2 .!
msh />_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++

 三、更改mutex初始化  线程2优先级

/* 互斥量示例的初始化 */
int mutex_sample(void)
{
    /* 创建一个动态互斥量 */
    dynamic_mutex = rt_mutex_create("dmutex", RT_IPC_FLAG_PRIO);
    if (dynamic_mutex == RT_NULL)
    {
        rt_kprintf("create dynamic mutex failed.\n");
        return -1;
    }

    rt_thread_init(&thread1,
                   "thread1",
                   rt_thread_entry1,
                   RT_NULL,
                   &thread1_stack[0],
                   sizeof(thread1_stack),
                   THREAD_PRIORITY, THREAD_TIMESLICE);
    rt_thread_startup(&thread1);
    rt_kprintf("$$$$11111Startup thread 1 .!\n");
    rt_thread_init(&thread2,
                   "thread2",
                   rt_thread_entry2,
                   RT_NULL,
                   &thread2_stack[0],
                   sizeof(thread2_stack),
                   THREAD_PRIORITY+1, THREAD_TIMESLICE);
    rt_thread_startup(&thread2);
    rt_kprintf("$$$$22222Startup thread 2 .!\n");
    return 0;
}

更改后所有代码：

#include <rtthread.h>

#define THREAD_PRIORITY         8
#define THREAD_TIMESLICE        5

/* 指向互斥量的指针 */
static rt_mutex_t dynamic_mutex = RT_NULL;
static rt_uint8_t number1,number2 = 0;

ALIGN(RT_ALIGN_SIZE)
static char thread1_stack[1024];
static struct rt_thread thread1;
static void rt_thread_entry1(void *parameter)
{
      while(1)
      {
          /* 线程 1 获取到互斥量后，先后对 number1、number2 进行加 1 操作，然后释放互斥量 */
          rt_mutex_take(dynamic_mutex, RT_WAITING_FOREVER);
          number1++;
          rt_kprintf("_1Entry1_1++!\n");
//          rt_thread_mdelay(10);
          number2++;
          rt_kprintf("_1Entry1 __2number2++\n");
          rt_mutex_release(dynamic_mutex);
          rt_kprintf("_1_____Release Entry1___!\n");
          rt_thread_mdelay(10);
       }
}

ALIGN(RT_ALIGN_SIZE)
static char thread2_stack[1024];
static struct rt_thread thread2;
static void rt_thread_entry2(void *parameter)
{
      while(1)
      {
          /* 线程 2 获取到互斥量后，检查 number1、number2 的值是否相同，相同则表示 mutex 起到了锁的作用 */
          rt_mutex_take(dynamic_mutex, RT_WAITING_FOREVER);
          if(number1 != number2)
          {
            rt_kprintf("not protect.number1 = %d, mumber2 = %d \n",number1 ,number2);
          }
          else
          {
            rt_kprintf("mutex protect ,number1 = mumber2 is %d\n",number1);
          }

           number1++;
           number2++;
           rt_kprintf("2entry2 ##!!\n");
           rt_mutex_release(dynamic_mutex);
           rt_kprintf("2Release Entry2!!%% \n");
          if(number1>=50)
              return;
      }
}

/* 互斥量示例的初始化 */
int mutex_sample(void)
{
    /* 创建一个动态互斥量 */
    dynamic_mutex = rt_mutex_create("dmutex", RT_IPC_FLAG_PRIO);
    if (dynamic_mutex == RT_NULL)
    {
        rt_kprintf("create dynamic mutex failed.\n");
        return -1;
    }

    rt_thread_init(&thread1,
                   "thread1",
                   rt_thread_entry1,
                   RT_NULL,
                   &thread1_stack[0],
                   sizeof(thread1_stack),
                   THREAD_PRIORITY, THREAD_TIMESLICE);
    rt_thread_startup(&thread1);
    rt_kprintf("$$$$11111Startup thread 1 .!\n");
    rt_thread_init(&thread2,
                   "thread2",
                   rt_thread_entry2,
                   RT_NULL,
                   &thread2_stack[0],
                   sizeof(thread2_stack),
                   THREAD_PRIORITY+1, THREAD_TIMESLICE);
    rt_thread_startup(&thread2);
    rt_kprintf("$$$$22222Startup thread 2 .!\n");
    return 0;
}

/* 导出到 MSH 命令列表中 */
MSH_CMD_EXPORT(mutex_sample, mutex sample);

 运行结果：

msh />mutex_sample
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
$$$$11111Startup thread 1 .!
mutex protect ,number1 = mumber2 is 1
2entry2 ##!!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 3
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 4
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 5
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 6
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 7
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 8
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 9
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 10
2entry2 ##!!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 12
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 13
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 14
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 15
2entry2 ##!!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 17
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 18
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 19
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 20
2entry2 ##!!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
21_____Release Entrymutex protect ,number1 = mumber2 is 22
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 23
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 24
2entry2 ##!!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 26
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 27
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 28
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 29
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 30
2entry2 ##!!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 32
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 33
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 34
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 35
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 36
2entry2 ##!!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 38
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 39
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 40
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 41
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 42
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 43
2entry2 ##!!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 45
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 46
2entry2 ##!!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 48
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 49
2entry2 ##!!
2Release Entry2!!%
$$$$22222Startup thread 2 .!
msh />_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!

四、更改mutex初始化 线程2优先级

#include <rtthread.h>

#define THREAD_PRIORITY         8
#define THREAD_TIMESLICE        5

/* 指向互斥量的指针 */
static rt_mutex_t dynamic_mutex = RT_NULL;
static rt_uint8_t number1,number2 = 0;

ALIGN(RT_ALIGN_SIZE)
static char thread1_stack[1024];
static struct rt_thread thread1;
static void rt_thread_entry1(void *parameter)
{
      while(1)
      {
          /* 线程 1 获取到互斥量后，先后对 number1、number2 进行加 1 操作，然后释放互斥量 */
          rt_mutex_take(dynamic_mutex, RT_WAITING_FOREVER);
          number1++;
          rt_kprintf("_1Entry1_1++!\n");
//          rt_thread_mdelay(10);
          number2++;
          rt_kprintf("_1Entry1 __2number2++\n");
          rt_mutex_release(dynamic_mutex);
          rt_kprintf("_1_____Release Entry1___!\n");
          rt_thread_mdelay(10);
       }
}

ALIGN(RT_ALIGN_SIZE)
static char thread2_stack[1024];
static struct rt_thread thread2;
static void rt_thread_entry2(void *parameter)
{
      while(1)
      {
          /* 线程 2 获取到互斥量后，检查 number1、number2 的值是否相同，相同则表示 mutex 起到了锁的作用 */
          rt_mutex_take(dynamic_mutex, RT_WAITING_FOREVER);
          if(number1 != number2)
          {
            rt_kprintf("not protect.number1 = %d, mumber2 = %d \n",number1 ,number2);
          }
          else
          {
            rt_kprintf("mutex protect ,number1 = mumber2 is %d\n",number1);
          }

           number1++;
           number2++;
           rt_kprintf("2entry2 ##!!\n");
           rt_mutex_release(dynamic_mutex);
           rt_kprintf("2Release Entry2!!%% \n");
          if(number1>=50)
              return;
      }
}

/* 互斥量示例的初始化 */
int mutex_sample(void)
{
    /* 创建一个动态互斥量 */
    dynamic_mutex = rt_mutex_create("dmutex", RT_IPC_FLAG_PRIO);
    if (dynamic_mutex == RT_NULL)
    {
        rt_kprintf("create dynamic mutex failed.\n");
        return -1;
    }

    rt_thread_init(&thread1,
                   "thread1",
                   rt_thread_entry1,
                   RT_NULL,
                   &thread1_stack[0],
                   sizeof(thread1_stack),
                   THREAD_PRIORITY, THREAD_TIMESLICE);
    rt_thread_startup(&thread1);
    rt_kprintf("$$$$11111Startup thread 1 .!\n");
    rt_thread_init(&thread2,
                   "thread2",
                   rt_thread_entry2,
                   RT_NULL,
                   &thread2_stack[0],
                   sizeof(thread2_stack),
                   THREAD_PRIORITY-1, THREAD_TIMESLICE);
    rt_thread_startup(&thread2);
    rt_kprintf("$$$$22222Startup thread 2 .!\n");
    return 0;
}

/* 导出到 MSH 命令列表中 */
MSH_CMD_EXPORT(mutex_sample, mutex sample);

运行结果：

msh />mutex_sample
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
$$$$11111Startup thread 1 .!
mutex protect ,number1 = mumber2 is 1
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 2
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 3
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 4
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 5
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 6
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 7
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 8
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 9
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 10
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 11
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 12
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 13
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 14
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 15
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 16
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 17
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 18
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 19
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 20
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 21
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 22
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 23
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 24
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 25
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 26
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 27
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 28
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 29
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 30
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 31
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 32
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 33
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 34
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 35
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 36
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 37
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 38
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 39
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 40
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 41
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 42
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 43
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 44
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 45
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 46
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 47
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 48
2entry2 ##!!
2Release Entry2!!%
mutex protect ,number1 = mumber2 is 49
2entry2 ##!!
2Release Entry2!!%
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
$$$$22222Startup th_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
y1___!
!
msh />_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!
_1Entry1_1++!
_1Entry1 __2number2++
_1_____Release Entry1___!

OS啦
关注
RT-Thread快速入门-互斥量
嵌入式技术开发
07-23 265
所谓的优先级继承是指，提高某个占有某种资源的低优先级线程的优先级，使之与所有等待该资源的线程中优先级最高的那个线程的优先级相等，然后执行，而当这个低优先级线程释放该资源时，优先级重新回到初始设定。若该线程继续获取互斥量，则互斥量的持有计数加 1，当先线程不会挂起等待（即支持递归获取互斥量）。一个线程持有互斥量时，其他线程不能再持有它，持有该互斥量的线程也能够再次获得这个互斥量，而不被挂起，即互斥量可以递归持有。注意，在获得互斥量后，应该尽快释放，并在持有互斥量的过程中，不得再更改持有互斥量线程的优先级。
RT-Thread之互斥量
lhwwd的博客
08-28 345
互斥量又叫相互排斥的信号量，是一种特殊的二值信号量。互斥量类似于只有一个车位的停车场：当有一辆车进入的时候，将停车场大门锁住，其他车辆在外面等候。当里面的车出来时，将停车场大门打开，下一辆车才可以进入。
基础篇_05_IPC之互斥锁
xiangxistu的博客
09-23 459
互斥锁，IPC的一部分。互斥锁，算是信号量中特殊的一个例子，即信号量的数量只为1，只要有任何一个线程获取到这个互斥量，在没有释放这个互斥量之前，任何线程都获取不到。除此之外，互斥锁还有一个作用，那就是提升当前信号量获取线程的的优先级。 /*节选自rt_mutex_take()函数*/ /* change the owner thread priority of mutex */ if (th...
线程间同步之互斥量
lengyuefeng212的博客
02-08 123
文章目录1. 示例代码2.测试结果 1. 示例代码 /* * Copyright (c) 2006-2020, RT-Thread Development Team * * SPDX-License-Identifier: Apache-2.0 * * Change Logs: * Date Author Notes * 2021-02-07 冷月枫 the first version */ /* 线程1对2个number分别进行加1操作
Linux详解 --- 多线程2: 线程互斥(互斥量的使用与原理、线程安全与可重入函数、死锁)
wuqiongjin的博客
04-12 922
线程互斥、互斥量的使用、互斥量的原理、线程安全与可重入函数、死锁、死锁的4个必要条件、预防死锁的措施、避免死锁的算法
RT-Thread学习笔记——互斥量
Sanjay_Wu的博客
01-29 5210
前言 前面学习了RT-Thread的信号量，但信号量在一些场合使用会存在优先级翻转问题，接下来我们学习互斥量，在 RT-Thread 操作系统中，互斥量可以解决优先级翻转问题，实现的是优先级继承算法。互斥量和信号量不同的是：拥有互斥量的线程拥有互斥量的所有权，互斥量支持递归访问且能防止线程优先级翻转；并且互斥量只能由持有线程释放，而信号量则可以由任何线程释放。这里主要讲RT-Thread互斥量...
RT-thread-线程间通讯2-互斥量
ycjunhua的专栏
04-17 505
互斥量体现的是排他性，也是解决多线程同时操作临界区临界资源导致的竟态的一种方法。（类似于特殊的信号量——二值信号量）区别：信号量可由不同线程释放，互斥量只能由同一线程进行释放。互斥量的操作包含：创建 / 初始化互斥量、获取互斥量、释放互斥量、删除 / 脱离互。
RTThread互斥量实验.rar
05-04
在“RTThread互斥量实验.rar”中，我们可以看到一个针对RTThread互斥量功能的实践项目。这个实验是基于Rt-Thread学习笔记系列的第六部分，旨在帮助开发者理解如何在RTThread中使用互斥量。 互斥量是一种同步机制，...
rt-thread信号量_holecev_RT-Thread_rtthread信号量_信号量_
10-04
"holecev"可能是作者或项目的别名，而"RT-Thread_rtthread信号量_信号量_"则是强调了这个资料主要关注RT-Thread中的信号量机制。 信号量在RT-Thread中的应用主要包括以下方面： 1. **同步**：当多个线程需要协同...
Windows下开箱后即时编译体验RT-Thread 的MDK demo工程，包含互斥量Metux的使用示例(含动静态方式)
06-23
Windows下的MDK Keil uVision4的demo工程，STM32F103的IC，开箱即可编译烧写体验： 已包含完整的RT-Thread依赖，可直观体验RT-Thread的使用，代码方面主要未使用互斥量...有趣且实用的RT-Thread互斥量》食用效果更佳。
C语言中的函数，实参，形参，递归
lly_b的博客
09-12 841
递归是解决问题的一种重要技术，通过函数调用自身来解决问题。递归函数必须有一个基准条件，防止无限递归。尽管递归在某些场景下代码简洁优美，但在性能和效率上可能不如迭代，特别是在处理大规模问题时需要谨慎使用。
【2025届华为秋招机考三道编程题之一】华为校招留学生软件开发工程师-真题机考笔试/(200分)- 跳格子3（Java & JS & Python & C）
Dgntsj的博客
09-12 1155
华为校招机考的题型：编程：软件测试工程师，算法，OD岗，三道编程题不限语言【C++，Python，Java】校招：600分 120分钟，100/200/300社招：400分 150分钟， 100/100/200。
基于大模型技术的算力产业监测服务平台设计
09-17
内容概要：本文提出了一种新型算力产业监测服务平台的设计理念，运用国内自主研发的大模型技术支持，通过对传统技术的改进和完善，提出了三层架构的设计方法，即基础设施层（含向量数据库和模型训练）、大模型应用框架层（强化数据处理与多维关系挖掘）及业务层（如智能分析助手）。这种设计方案旨在提高算力产业发展监测与决策制定的质量。 适合人群：电信行业的从业人员及研究人员；算力产业链各环节管理者；政府相关机构和政策决策者。 使用场景及目标：在多种算力相关的应用场景（如云计算中心管理，数据中心监测，政策分析）中辅助决策者进行快速有效的信息获取和技术选择；助力算力产业发展方向的精确把控和战略调整。 其他说明：随着大模型技术的日臻成熟，该算力产业监测服务平台预计将进一步丰富自身的应用领域和服务深度，以促进算力行业更智慧化发展。
This_honeypot_supports_Telnet_and_SSH_two_protocol_FF-Pot.zip
最新发布
09-17
This_honeypot_supports_Telnet_and_SSH_two_protocol_FF-Pot
吉他谱_What I've Done - Linkin Park.pdf
09-17
初级入门吉他谱 guitar tab
吉他谱_Too sweet - Hozier.pdf
09-17
初级入门吉他谱 guitar tab
Linux使用的一些笔记，包括shell命令，软件，一些实用的网站的整理_Linux_note.zip
09-17
Linux使用的一些笔记，包括shell命令，软件，一些实用的网站的整理_Linux_note
基于ssm的机房预约系统设计与实现.docx
09-17
基于ssm的机房预约系统设计与实现.docx
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值