-
Notifications
You must be signed in to change notification settings - Fork 5.1k
/
Copy pathipc.c
4033 lines (3405 loc) · 135 KB
/
ipc.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (c) 2006-2022, RT-Thread Development Team
*
* SPDX-License-Identifier: Apache-2.0
*
* Change Logs:
* Date Author Notes
* 2006-03-14 Bernard the first version
* 2006-04-25 Bernard implement semaphore
* 2006-05-03 Bernard add RT_IPC_DEBUG
* modify the type of IPC waiting time to rt_int32_t
* 2006-05-10 Bernard fix the semaphore take bug and add IPC object
* 2006-05-12 Bernard implement mailbox and message queue
* 2006-05-20 Bernard implement mutex
* 2006-05-23 Bernard implement fast event
* 2006-05-24 Bernard implement event
* 2006-06-03 Bernard fix the thread timer init bug
* 2006-06-05 Bernard fix the mutex release bug
* 2006-06-07 Bernard fix the message queue send bug
* 2006-08-04 Bernard add hook support
* 2009-05-21 Yi.qiu fix the sem release bug
* 2009-07-18 Bernard fix the event clear bug
* 2009-09-09 Bernard remove fast event and fix ipc release bug
* 2009-10-10 Bernard change semaphore and mutex value to unsigned value
* 2009-10-25 Bernard change the mb/mq receive timeout to 0 if the
* re-calculated delta tick is a negative number.
* 2009-12-16 Bernard fix the rt_ipc_object_suspend issue when IPC flag
* is RT_IPC_FLAG_PRIO
* 2010-01-20 mbbill remove rt_ipc_object_decrease function.
* 2010-04-20 Bernard move memcpy outside interrupt disable in mq
* 2010-10-26 yi.qiu add module support in rt_mp_delete and rt_mq_delete
* 2010-11-10 Bernard add IPC reset command implementation.
* 2011-12-18 Bernard add more parameter checking in message queue
* 2013-09-14 Grissiom add an option check in rt_event_recv
* 2018-10-02 Bernard add 64bit support for mailbox
* 2019-09-16 tyx add send wait support for message queue
* 2020-07-29 Meco Man fix thread->event_set/event_info when received an
* event without pending
* 2020-10-11 Meco Man add value overflow-check code
* 2021-01-03 Meco Man implement rt_mb_urgent()
* 2021-05-30 Meco Man implement rt_mutex_trytake()
* 2022-01-07 Gabriel Moving __on_rt_xxxxx_hook to ipc.c
* 2022-01-24 THEWON let rt_mutex_take return thread->error when using signal
* 2022-04-08 Stanley Correct descriptions
* 2022-10-15 Bernard add nested mutex feature
* 2022-10-16 Bernard add prioceiling feature in mutex
* 2023-04-16 Xin-zheqi redesigen queue recv and send function return real message size
* 2023-09-15 xqyjlj perf rt_hw_interrupt_disable/enable
*/
#include <rtthread.h>
#include <rthw.h>
#define DBG_TAG "kernel.ipc"
#define DBG_LVL DBG_INFO
#include <rtdbg.h>
#define GET_MESSAGEBYTE_ADDR(msg) ((struct rt_mq_message *) msg + 1)
#if defined(RT_USING_HOOK) && defined(RT_HOOK_USING_FUNC_PTR)
extern void (*rt_object_trytake_hook)(struct rt_object *object);
extern void (*rt_object_take_hook)(struct rt_object *object);
extern void (*rt_object_put_hook)(struct rt_object *object);
#endif /* RT_USING_HOOK */
/**
* @addtogroup group_IPC
* @{
*/
/**
* @brief This function will initialize an IPC object, such as semaphore, mutex, messagequeue and mailbox.
*
* @note Executing this function will complete an initialization of the suspend thread list of the ipc object.
*
* @param ipc is a pointer to the IPC object.
*
* @return Return the operation status. When the return value is RT_EOK, the initialization is successful.
* When the return value is any other values, it means the initialization failed.
*
* @warning This function can be called from all IPC initialization and creation.
*/
rt_inline rt_err_t _ipc_object_init(struct rt_ipc_object *ipc)
{
/* initialize ipc object */
rt_list_init(&(ipc->suspend_thread));
return RT_EOK;
}
/**
* @brief Dequeue a thread from suspended list and set it to ready. The 2 are
* taken as an atomic operation, so if a thread is returned, it's
* resumed by us, not any other threads or async events. This is useful
* if a consumer may be resumed by timeout, signals... besides its
* producer.
*
* @param susp_list the list thread dequeued from. RT_NULL if no list.
* @param thread_error thread error number of the resuming thread.
* A negative value in this set will be discarded, and thread error
* will not be changed.
*
* @return struct rt_thread * RT_NULL if failed, otherwise the thread resumed
*/
struct rt_thread *rt_susp_list_dequeue(rt_list_t *susp_list, rt_err_t thread_error)
{
rt_sched_lock_level_t slvl;
rt_thread_t thread;
rt_err_t error;
RT_SCHED_DEBUG_IS_UNLOCKED;
RT_ASSERT(susp_list != RT_NULL);
rt_sched_lock(&slvl);
if (!rt_list_isempty(susp_list))
{
thread = RT_THREAD_LIST_NODE_ENTRY(susp_list->next);
error = rt_sched_thread_ready(thread);
if (error)
{
LOG_D("%s [error:%d] failed to resume thread:%p from suspended list",
__func__, error, thread);
thread = RT_NULL;
}
else
{
/* thread error should not be a negative value */
if (thread_error >= 0)
{
/* set thread error code to notified resuming thread */
thread->error = thread_error;
}
}
}
else
{
thread = RT_NULL;
}
rt_sched_unlock(slvl);
LOG_D("resume thread:%s\n", thread->parent.name);
return thread;
}
/**
* @brief This function will resume all suspended threads in the IPC object list,
* including the suspended list of IPC object, and private list of mailbox etc.
*
* @note This function will resume all threads in the IPC object list.
* By contrast, the rt_ipc_list_resume() function will resume a suspended thread in the list of a IPC object.
*
* @param susp_list is a pointer to a suspended thread list of the IPC object.
* @param thread_error thread error number of the resuming thread.
* A negative value in this set will be discarded, and thread error
* will not be changed.
*
* @return Return the operation status. When the return value is RT_EOK, the function is successfully executed.
* When the return value is any other values, it means this operation failed.
*
*/
rt_err_t rt_susp_list_resume_all(rt_list_t *susp_list, rt_err_t thread_error)
{
struct rt_thread *thread;
RT_SCHED_DEBUG_IS_UNLOCKED;
/* wakeup all suspended threads */
thread = rt_susp_list_dequeue(susp_list, thread_error);
while (thread)
{
/*
* resume NEXT thread
* In rt_thread_resume function, it will remove current thread from
* suspended list
*/
thread = rt_susp_list_dequeue(susp_list, thread_error);
}
return RT_EOK;
}
/**
* @brief This function will resume all suspended threads in the IPC object list,
* including the suspended list of IPC object, and private list of mailbox etc.
* A lock is passing and hold while operating.
*
* @note This function will resume all threads in the IPC object list.
* By contrast, the rt_ipc_list_resume() function will resume a suspended thread in the list of a IPC object.
*
* @param susp_list is a pointer to a suspended thread list of the IPC object.
* @param thread_error thread error number of the resuming thread.
* A negative value in this set will be discarded, and thread error
* will not be changed.
* @param lock the lock to be held while operating susp_list
*
* @return Return the operation status. When the return value is RT_EOK, the function is successfully executed.
* When the return value is any other values, it means this operation failed.
*
*/
rt_err_t rt_susp_list_resume_all_irq(rt_list_t *susp_list,
rt_err_t thread_error,
struct rt_spinlock *lock)
{
struct rt_thread *thread;
rt_base_t level;
RT_SCHED_DEBUG_IS_UNLOCKED;
do
{
level = rt_spin_lock_irqsave(lock);
/*
* resume NEXT thread
* In rt_thread_resume function, it will remove current thread from
* suspended list
*/
thread = rt_susp_list_dequeue(susp_list, thread_error);
rt_spin_unlock_irqrestore(lock, level);
}
while (thread);
return RT_EOK;
}
/**
* @brief Add a thread to the suspend list
*
* @note Caller must hold the scheduler lock
*
* @param susp_list the list thread enqueued to
* @param thread the suspended thread
* @param ipc_flags the pattern of suspend list
* @return RT_EOK on succeed, otherwise a failure
*/
rt_err_t rt_susp_list_enqueue(rt_list_t *susp_list, rt_thread_t thread, int ipc_flags)
{
RT_SCHED_DEBUG_IS_LOCKED;
switch (ipc_flags)
{
case RT_IPC_FLAG_FIFO:
rt_list_insert_before(susp_list, &RT_THREAD_LIST_NODE(thread));
break; /* RT_IPC_FLAG_FIFO */
case RT_IPC_FLAG_PRIO:
{
struct rt_list_node *n;
struct rt_thread *sthread;
/* find a suitable position */
for (n = susp_list->next; n != susp_list; n = n->next)
{
sthread = RT_THREAD_LIST_NODE_ENTRY(n);
/* find out */
if (rt_sched_thread_get_curr_prio(thread) < rt_sched_thread_get_curr_prio(sthread))
{
/* insert this thread before the sthread */
rt_list_insert_before(&RT_THREAD_LIST_NODE(sthread), &RT_THREAD_LIST_NODE(thread));
break;
}
}
/*
* not found a suitable position,
* append to the end of suspend_thread list
*/
if (n == susp_list)
rt_list_insert_before(susp_list, &RT_THREAD_LIST_NODE(thread));
}
break;/* RT_IPC_FLAG_PRIO */
default:
RT_ASSERT(0);
break;
}
return RT_EOK;
}
/**
* @brief Print thread on suspend list to system console
*/
void rt_susp_list_print(rt_list_t *list)
{
#ifdef RT_USING_CONSOLE
rt_sched_lock_level_t slvl;
struct rt_thread *thread;
struct rt_list_node *node;
rt_sched_lock(&slvl);
for (node = list->next; node != list; node = node->next)
{
thread = RT_THREAD_LIST_NODE_ENTRY(node);
rt_kprintf("%.*s", RT_NAME_MAX, thread->parent.name);
if (node->next != list)
rt_kprintf("/");
}
rt_sched_unlock(slvl);
#else
(void)list;
#endif
}
#ifdef RT_USING_SEMAPHORE
/**
* @addtogroup group_semaphore Semaphore
* @{
*/
static void _sem_object_init(rt_sem_t sem,
rt_uint16_t value,
rt_uint8_t flag,
rt_uint16_t max_value)
{
/* initialize ipc object */
_ipc_object_init(&(sem->parent));
sem->max_value = max_value;
/* set initial value */
sem->value = value;
/* set parent */
sem->parent.parent.flag = flag;
rt_spin_lock_init(&(sem->spinlock));
}
/**
* @brief This function will initialize a static semaphore object.
*
* @note For the static semaphore object, its memory space is allocated by the compiler during compiling,
* and shall placed on the read-write data segment or on the uninitialized data segment.
* By contrast, the rt_sem_create() function will allocate memory space automatically and initialize
* the semaphore.
*
* @see rt_sem_create()
*
* @param sem is a pointer to the semaphore to initialize. It is assumed that storage for the semaphore will be
* allocated in your application.
*
* @param name is a pointer to the name you would like to give the semaphore.
*
* @param value is the initial value for the semaphore.
* If used to share resources, you should initialize the value as the number of available resources.
* If used to signal the occurrence of an event, you should initialize the value as 0.
*
* @param flag is the semaphore flag, which determines the queuing way of how multiple threads wait
* when the semaphore is not available.
* The semaphore flag can be ONE of the following values:
*
* RT_IPC_FLAG_PRIO The pending threads will queue in order of priority.
*
* RT_IPC_FLAG_FIFO The pending threads will queue in the first-in-first-out method
* (also known as first-come-first-served (FCFS) scheduling strategy).
*
* NOTE: RT_IPC_FLAG_FIFO is a non-real-time scheduling mode. It is strongly recommended to
* use RT_IPC_FLAG_PRIO to ensure the thread is real-time UNLESS your applications concern about
* the first-in-first-out principle, and you clearly understand that all threads involved in
* this semaphore will become non-real-time threads.
*
* @return Return the operation status. When the return value is RT_EOK, the initialization is successful.
* If the return value is any other values, it represents the initialization failed.
*
* @warning This function can ONLY be called from threads.
*/
rt_err_t rt_sem_init(rt_sem_t sem,
const char *name,
rt_uint32_t value,
rt_uint8_t flag)
{
RT_ASSERT(sem != RT_NULL);
RT_ASSERT(value < 0x10000U);
RT_ASSERT((flag == RT_IPC_FLAG_FIFO) || (flag == RT_IPC_FLAG_PRIO));
/* initialize object */
rt_object_init(&(sem->parent.parent), RT_Object_Class_Semaphore, name);
_sem_object_init(sem, value, flag, RT_SEM_VALUE_MAX);
return RT_EOK;
}
RTM_EXPORT(rt_sem_init);
/**
* @brief This function will detach a static semaphore object.
*
* @note This function is used to detach a static semaphore object which is initialized by rt_sem_init() function.
* By contrast, the rt_sem_delete() function will delete a semaphore object.
* When the semaphore is successfully detached, it will resume all suspended threads in the semaphore list.
*
* @see rt_sem_delete()
*
* @param sem is a pointer to a semaphore object to be detached.
*
* @return Return the operation status. When the return value is RT_EOK, the initialization is successful.
* If the return value is any other values, it means that the semaphore detach failed.
*
* @warning This function can ONLY detach a static semaphore initialized by the rt_sem_init() function.
* If the semaphore is created by the rt_sem_create() function, you MUST NOT USE this function to detach it,
* ONLY USE the rt_sem_delete() function to complete the deletion.
*/
rt_err_t rt_sem_detach(rt_sem_t sem)
{
rt_base_t level;
/* parameter check */
RT_ASSERT(sem != RT_NULL);
RT_ASSERT(rt_object_get_type(&sem->parent.parent) == RT_Object_Class_Semaphore);
RT_ASSERT(rt_object_is_systemobject(&sem->parent.parent));
level = rt_spin_lock_irqsave(&(sem->spinlock));
/* wakeup all suspended threads */
rt_susp_list_resume_all(&(sem->parent.suspend_thread), RT_ERROR);
rt_spin_unlock_irqrestore(&(sem->spinlock), level);
/* detach semaphore object */
rt_object_detach(&(sem->parent.parent));
return RT_EOK;
}
RTM_EXPORT(rt_sem_detach);
#ifdef RT_USING_HEAP
/**
* @brief Creating a semaphore object.
*
* @note For the semaphore object, its memory space is allocated automatically.
* By contrast, the rt_sem_init() function will initialize a static semaphore object.
*
* @see rt_sem_init()
*
* @param name is a pointer to the name you would like to give the semaphore.
*
* @param value is the initial value for the semaphore.
* If used to share resources, you should initialize the value as the number of available resources.
* If used to signal the occurrence of an event, you should initialize the value as 0.
*
* @param flag is the semaphore flag, which determines the queuing way of how multiple threads wait
* when the semaphore is not available.
* The semaphore flag can be ONE of the following values:
*
* RT_IPC_FLAG_PRIO The pending threads will queue in order of priority.
*
* RT_IPC_FLAG_FIFO The pending threads will queue in the first-in-first-out method
* (also known as first-come-first-served (FCFS) scheduling strategy).
*
* NOTE: RT_IPC_FLAG_FIFO is a non-real-time scheduling mode. It is strongly recommended to
* use RT_IPC_FLAG_PRIO to ensure the thread is real-time UNLESS your applications concern about
* the first-in-first-out principle, and you clearly understand that all threads involved in
* this semaphore will become non-real-time threads.
*
* @return Return a pointer to the semaphore object. When the return value is RT_NULL, it means the creation failed.
*
* @warning This function can NOT be called in interrupt context. You can use macor RT_DEBUG_NOT_IN_INTERRUPT to check it.
*/
rt_sem_t rt_sem_create(const char *name, rt_uint32_t value, rt_uint8_t flag)
{
rt_sem_t sem;
RT_ASSERT(value < 0x10000U);
RT_ASSERT((flag == RT_IPC_FLAG_FIFO) || (flag == RT_IPC_FLAG_PRIO));
RT_DEBUG_NOT_IN_INTERRUPT;
/* allocate object */
sem = (rt_sem_t)rt_object_allocate(RT_Object_Class_Semaphore, name);
if (sem == RT_NULL)
return sem;
_sem_object_init(sem, value, flag, RT_SEM_VALUE_MAX);
return sem;
}
RTM_EXPORT(rt_sem_create);
/**
* @brief This function will delete a semaphore object and release the memory space.
*
* @note This function is used to delete a semaphore object which is created by the rt_sem_create() function.
* By contrast, the rt_sem_detach() function will detach a static semaphore object.
* When the semaphore is successfully deleted, it will resume all suspended threads in the semaphore list.
*
* @see rt_sem_detach()
*
* @param sem is a pointer to a semaphore object to be deleted.
*
* @return Return the operation status. When the return value is RT_EOK, the operation is successful.
* If the return value is any other values, it means that the semaphore detach failed.
*
* @warning This function can ONLY delete a semaphore initialized by the rt_sem_create() function.
* If the semaphore is initialized by the rt_sem_init() function, you MUST NOT USE this function to delete it,
* ONLY USE the rt_sem_detach() function to complete the detachment.
*/
rt_err_t rt_sem_delete(rt_sem_t sem)
{
rt_ubase_t level;
/* parameter check */
RT_ASSERT(sem != RT_NULL);
RT_ASSERT(rt_object_get_type(&sem->parent.parent) == RT_Object_Class_Semaphore);
RT_ASSERT(rt_object_is_systemobject(&sem->parent.parent) == RT_FALSE);
RT_DEBUG_NOT_IN_INTERRUPT;
level = rt_spin_lock_irqsave(&(sem->spinlock));
/* wakeup all suspended threads */
rt_susp_list_resume_all(&(sem->parent.suspend_thread), RT_ERROR);
rt_spin_unlock_irqrestore(&(sem->spinlock), level);
/* delete semaphore object */
rt_object_delete(&(sem->parent.parent));
return RT_EOK;
}
RTM_EXPORT(rt_sem_delete);
#endif /* RT_USING_HEAP */
/**
* @brief This function will take a semaphore, if the semaphore is unavailable, the thread shall wait for
* the semaphore up to a specified time.
*
* @note When this function is called, the count value of the sem->value will decrease 1 until it is equal to 0.
* When the sem->value is 0, it means that the semaphore is unavailable. At this time, it will suspend the
* thread preparing to take the semaphore.
* On the contrary, the rt_sem_release() function will increase the count value of sem->value by 1 each time.
*
* @see rt_sem_trytake()
*
* @param sem is a pointer to a semaphore object.
*
* @param timeout is a timeout period (unit: an OS tick). If the semaphore is unavailable, the thread will wait for
* the semaphore up to the amount of time specified by this parameter.
*
* NOTE:
* If use Macro RT_WAITING_FOREVER to set this parameter, which means that when the
* message is unavailable in the queue, the thread will be waiting forever.
* If use macro RT_WAITING_NO to set this parameter, which means that this
* function is non-blocking and will return immediately.
*
* @return Return the operation status. ONLY When the return value is RT_EOK, the operation is successful.
* If the return value is any other values, it means that the semaphore take failed.
*
* @warning This function can ONLY be called in the thread context. It MUST NOT BE called in interrupt context.
*/
static rt_err_t _rt_sem_take(rt_sem_t sem, rt_int32_t timeout, int suspend_flag)
{
rt_base_t level;
struct rt_thread *thread;
rt_err_t ret;
/* parameter check */
RT_ASSERT(sem != RT_NULL);
RT_ASSERT(rt_object_get_type(&sem->parent.parent) == RT_Object_Class_Semaphore);
RT_OBJECT_HOOK_CALL(rt_object_trytake_hook, (&(sem->parent.parent)));
/* current context checking */
RT_DEBUG_SCHEDULER_AVAILABLE(1);
level = rt_spin_lock_irqsave(&(sem->spinlock));
LOG_D("thread %s take sem:%s, which value is: %d",
rt_thread_self()->parent.name,
sem->parent.parent.name,
sem->value);
if (sem->value > 0)
{
/* semaphore is available */
sem->value --;
rt_spin_unlock_irqrestore(&(sem->spinlock), level);
}
else
{
/* no waiting, return with timeout */
if (timeout == 0)
{
rt_spin_unlock_irqrestore(&(sem->spinlock), level);
return -RT_ETIMEOUT;
}
else
{
/* semaphore is unavailable, push to suspend list */
/* get current thread */
thread = rt_thread_self();
/* reset thread error number */
thread->error = RT_EINTR;
LOG_D("sem take: suspend thread - %s", thread->parent.name);
/* suspend thread */
ret = rt_thread_suspend_to_list(thread, &(sem->parent.suspend_thread),
sem->parent.parent.flag, suspend_flag);
if (ret != RT_EOK)
{
rt_spin_unlock_irqrestore(&(sem->spinlock), level);
return ret;
}
/* has waiting time, start thread timer */
if (timeout > 0)
{
LOG_D("set thread:%s to timer list", thread->parent.name);
/* reset the timeout of thread timer and start it */
rt_timer_control(&(thread->thread_timer),
RT_TIMER_CTRL_SET_TIME,
&timeout);
rt_timer_start(&(thread->thread_timer));
}
/* enable interrupt */
rt_spin_unlock_irqrestore(&(sem->spinlock), level);
/* do schedule */
rt_schedule();
if (thread->error != RT_EOK)
{
return thread->error > 0 ? -thread->error : thread->error;
}
}
}
RT_OBJECT_HOOK_CALL(rt_object_take_hook, (&(sem->parent.parent)));
return RT_EOK;
}
rt_err_t rt_sem_take(rt_sem_t sem, rt_int32_t time)
{
return _rt_sem_take(sem, time, RT_UNINTERRUPTIBLE);
}
RTM_EXPORT(rt_sem_take);
rt_err_t rt_sem_take_interruptible(rt_sem_t sem, rt_int32_t time)
{
return _rt_sem_take(sem, time, RT_INTERRUPTIBLE);
}
RTM_EXPORT(rt_sem_take_interruptible);
rt_err_t rt_sem_take_killable(rt_sem_t sem, rt_int32_t time)
{
return _rt_sem_take(sem, time, RT_KILLABLE);
}
RTM_EXPORT(rt_sem_take_killable);
/**
* @brief This function will try to take a semaphore, if the semaphore is unavailable, the thread returns immediately.
*
* @note This function is very similar to the rt_sem_take() function, when the semaphore is not available,
* the rt_sem_trytake() function will return immediately without waiting for a timeout.
* In other words, rt_sem_trytake(sem) has the same effect as rt_sem_take(sem, 0).
*
* @see rt_sem_take()
*
* @param sem is a pointer to a semaphore object.
*
* @return Return the operation status. ONLY When the return value is RT_EOK, the operation is successful.
* If the return value is any other values, it means that the semaphore take failed.
*/
rt_err_t rt_sem_trytake(rt_sem_t sem)
{
return rt_sem_take(sem, RT_WAITING_NO);
}
RTM_EXPORT(rt_sem_trytake);
/**
* @brief This function will release a semaphore. If there is thread suspended on the semaphore, it will get resumed.
*
* @note If there are threads suspended on this semaphore, the first thread in the list of this semaphore object
* will be resumed, and a thread scheduling (rt_schedule) will be executed.
* If no threads are suspended on this semaphore, the count value sem->value of this semaphore will increase by 1.
*
* @param sem is a pointer to a semaphore object.
*
* @return Return the operation status. When the return value is RT_EOK, the operation is successful.
* If the return value is any other values, it means that the semaphore release failed.
*/
rt_err_t rt_sem_release(rt_sem_t sem)
{
rt_base_t level;
rt_bool_t need_schedule;
/* parameter check */
RT_ASSERT(sem != RT_NULL);
RT_ASSERT(rt_object_get_type(&sem->parent.parent) == RT_Object_Class_Semaphore);
RT_OBJECT_HOOK_CALL(rt_object_put_hook, (&(sem->parent.parent)));
need_schedule = RT_FALSE;
level = rt_spin_lock_irqsave(&(sem->spinlock));
LOG_D("thread %s releases sem:%s, which value is: %d",
rt_thread_self()->parent.name,
sem->parent.parent.name,
sem->value);
if (!rt_list_isempty(&sem->parent.suspend_thread))
{
/* resume the suspended thread */
rt_susp_list_dequeue(&(sem->parent.suspend_thread), RT_EOK);
need_schedule = RT_TRUE;
}
else
{
if(sem->value < sem->max_value)
{
sem->value ++; /* increase value */
}
else
{
rt_spin_unlock_irqrestore(&(sem->spinlock), level);
return -RT_EFULL; /* value overflowed */
}
}
rt_spin_unlock_irqrestore(&(sem->spinlock), level);
/* resume a thread, re-schedule */
if (need_schedule == RT_TRUE)
rt_schedule();
return RT_EOK;
}
RTM_EXPORT(rt_sem_release);
/**
* @brief This function will set some extra attributions of a semaphore object.
*
* @note Currently this function only supports the RT_IPC_CMD_RESET command to reset the semaphore.
*
* @param sem is a pointer to a semaphore object.
*
* @param cmd is a command word used to configure some attributions of the semaphore.
*
* @param arg is the argument of the function to execute the command.
*
* @return Return the operation status. When the return value is RT_EOK, the operation is successful.
* If the return value is any other values, it means that this function failed to execute.
*/
rt_err_t rt_sem_control(rt_sem_t sem, int cmd, void *arg)
{
rt_base_t level;
/* parameter check */
RT_ASSERT(sem != RT_NULL);
RT_ASSERT(rt_object_get_type(&sem->parent.parent) == RT_Object_Class_Semaphore);
if (cmd == RT_IPC_CMD_RESET)
{
rt_ubase_t value;
/* get value */
value = (rt_uintptr_t)arg;
level = rt_spin_lock_irqsave(&(sem->spinlock));
/* resume all waiting thread */
rt_susp_list_resume_all(&sem->parent.suspend_thread, RT_ERROR);
/* set new value */
sem->value = (rt_uint16_t)value;
rt_spin_unlock_irqrestore(&(sem->spinlock), level);
rt_schedule();
return RT_EOK;
}
else if (cmd == RT_IPC_CMD_SET_VLIMIT)
{
rt_ubase_t max_value;
rt_bool_t need_schedule = RT_FALSE;
max_value = (rt_uint16_t)((rt_uintptr_t)arg);
if (max_value > RT_SEM_VALUE_MAX || max_value < 1)
{
return -RT_EINVAL;
}
level = rt_spin_lock_irqsave(&(sem->spinlock));
if (max_value < sem->value)
{
if (!rt_list_isempty(&sem->parent.suspend_thread))
{
/* resume all waiting thread */
rt_susp_list_resume_all(&sem->parent.suspend_thread, RT_ERROR);
need_schedule = RT_TRUE;
}
}
/* set new value */
sem->max_value = max_value;
rt_spin_unlock_irqrestore(&(sem->spinlock), level);
if (need_schedule)
{
rt_schedule();
}
return RT_EOK;
}
return -RT_ERROR;
}
RTM_EXPORT(rt_sem_control);
/**@}*/
#endif /* RT_USING_SEMAPHORE */
#ifdef RT_USING_MUTEX
/* iterate over each suspended thread to update highest priority in pending threads */
rt_inline rt_uint8_t _mutex_update_priority(struct rt_mutex *mutex)
{
struct rt_thread *thread;
if (!rt_list_isempty(&mutex->parent.suspend_thread))
{
thread = RT_THREAD_LIST_NODE_ENTRY(mutex->parent.suspend_thread.next);
mutex->priority = rt_sched_thread_get_curr_prio(thread);
}
else
{
mutex->priority = 0xff;
}
return mutex->priority;
}
/* get highest priority inside its taken object and its init priority */
rt_inline rt_uint8_t _thread_get_mutex_priority(struct rt_thread* thread)
{
rt_list_t *node = RT_NULL;
struct rt_mutex *mutex = RT_NULL;
rt_uint8_t priority = rt_sched_thread_get_init_prio(thread);
rt_list_for_each(node, &(thread->taken_object_list))
{
mutex = rt_list_entry(node, struct rt_mutex, taken_list);
rt_uint8_t mutex_prio = mutex->priority;
/* prio at least be priority ceiling */
mutex_prio = mutex_prio < mutex->ceiling_priority ? mutex_prio : mutex->ceiling_priority;
if (priority > mutex_prio)
{
priority = mutex_prio;
}
}
return priority;
}
/* update priority of target thread and the thread suspended it if any */
rt_inline void _thread_update_priority(struct rt_thread *thread, rt_uint8_t priority, int suspend_flag)
{
rt_err_t ret = -RT_ERROR;
struct rt_object* pending_obj = RT_NULL;
LOG_D("thread:%s priority -> %d", thread->parent.name, priority);
/* change priority of the thread */
ret = rt_sched_thread_change_priority(thread, priority);
while ((ret == RT_EOK) && rt_sched_thread_is_suspended(thread))
{
/* whether change the priority of taken mutex */
pending_obj = thread->pending_object;
if (pending_obj && rt_object_get_type(pending_obj) == RT_Object_Class_Mutex)
{
rt_uint8_t mutex_priority = 0xff;
struct rt_mutex* pending_mutex = (struct rt_mutex *)pending_obj;
/* re-insert thread to suspended thread list to resort priority list */
rt_list_remove(&RT_THREAD_LIST_NODE(thread));
ret = rt_susp_list_enqueue(
&(pending_mutex->parent.suspend_thread), thread,
pending_mutex->parent.parent.flag);
if (ret == RT_EOK)
{
/* update priority */
_mutex_update_priority(pending_mutex);
/* change the priority of mutex owner thread */
LOG_D("mutex: %s priority -> %d", pending_mutex->parent.parent.name,
pending_mutex->priority);
mutex_priority = _thread_get_mutex_priority(pending_mutex->owner);
if (mutex_priority != rt_sched_thread_get_curr_prio(pending_mutex->owner))
{
thread = pending_mutex->owner;
ret = rt_sched_thread_change_priority(thread, mutex_priority);
}
else
{
ret = -RT_ERROR;
}
}
}
else
{
ret = -RT_ERROR;
}
}
}
static rt_bool_t _check_and_update_prio(rt_thread_t thread, rt_mutex_t mutex)
{
RT_SCHED_DEBUG_IS_LOCKED;
rt_bool_t do_sched = RT_FALSE;
if ((mutex->ceiling_priority != 0xFF) || (rt_sched_thread_get_curr_prio(thread) == mutex->priority))
{
rt_uint8_t priority = 0xff;
/* get the highest priority in the taken list of thread */
priority = _thread_get_mutex_priority(thread);
rt_sched_thread_change_priority(thread, priority);
/**
* notify a pending reschedule. Since scheduler is locked, we will not
* really do a re-schedule at this point
*/
do_sched = RT_TRUE;
}
return do_sched;
}
static void _mutex_before_delete_detach(rt_mutex_t mutex)
{
rt_sched_lock_level_t slvl;
rt_bool_t need_schedule = RT_FALSE;
rt_spin_lock(&(mutex->spinlock));
/* wakeup all suspended threads */
rt_susp_list_resume_all(&(mutex->parent.suspend_thread), RT_ERROR);
rt_sched_lock(&slvl);
/* remove mutex from thread's taken list */
rt_list_remove(&mutex->taken_list);
/* whether change the thread priority */
if (mutex->owner)
{
need_schedule = _check_and_update_prio(mutex->owner, mutex);
}
if (need_schedule)
{
rt_sched_unlock_n_resched(slvl);
}
else
{
rt_sched_unlock(slvl);
}
/* unlock and do necessary reschedule if required */
rt_spin_unlock(&(mutex->spinlock));
}
/**
* @addtogroup group_mutex Mutex
* @{
*/
/**
* @brief Initialize a static mutex object.
*
* @note For the static mutex object, its memory space is allocated by the compiler during compiling,
* and shall placed on the read-write data segment or on the uninitialized data segment.
* By contrast, the rt_mutex_create() function will automatically allocate memory space
* and initialize the mutex.
*
* @see rt_mutex_create()
*
* @param mutex is a pointer to the mutex to initialize. It is assumed that storage for the mutex will be
* allocated in your application.
*
* @param name is a pointer to the name that given to the mutex.
*
* @param flag is the mutex flag, which determines the queuing way of how multiple threads wait
* when the mutex is not available.
* NOTE: This parameter has been obsoleted. It can be RT_IPC_FLAG_PRIO, RT_IPC_FLAG_FIFO or RT_NULL.