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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
|
/*
* Copyright (c) 2006-2026, RT-Thread Development Team
*
* SPDX-License-Identifier: Apache-2.0
*
* Change Logs:
* Date Author Notes
* 2006-03-16 Bernard the first version
* 2006-05-25 Bernard rewrite vsprintf
* 2006-08-10 Bernard add rt_show_version
* 2010-03-17 Bernard remove rt_strlcpy function
* fix gcc compiling issue.
* 2010-04-15 Bernard remove weak definition on ICCM16C compiler
* 2012-07-18 Arda add the alignment display for signed integer
* 2012-11-23 Bernard fix IAR compiler error.
* 2012-12-22 Bernard fix rt_kprintf issue, which found by Grissiom.
* 2013-06-24 Bernard remove rt_kprintf if RT_USING_CONSOLE is not defined.
* 2013-09-24 aozima make sure the device is in STREAM mode when used by rt_kprintf.
* 2015-07-06 Bernard Add rt_assert_handler routine.
* 2021-02-28 Meco Man add RT_KSERVICE_USING_STDLIB
* 2021-12-20 Meco Man implement rt_strcpy()
* 2022-01-07 Gabriel add __on_rt_assert_hook
* 2022-06-04 Meco Man remove strnlen
* 2022-08-24 Yunjie make rt_memset word-independent to adapt to ti c28x (16bit word)
* 2022-08-30 Yunjie make rt_vsnprintf adapt to ti c28x (16bit int)
* 2023-02-02 Bernard add Smart ID for logo version show
* 2023-10-16 Shell Add hook point for rt_malloc services
* 2023-10-21 Shell support the common backtrace API which is arch-independent
* 2023-12-10 xqyjlj perf rt_hw_interrupt_disable/enable, fix memheap lock
* 2024-03-10 Meco Man move std libc related functions to rtklibc
* 2026-03-16 Rbb666 Change rt_thread_get_usage to incremental statistics.
*/
#include <rtthread.h>
/* include rt_hw_backtrace macro defined in cpuport.h */
#define RT_HW_INCLUDE_CPUPORT
#include <rthw.h>
#define DBG_TAG "kernel.service"
#ifdef RT_DEBUG_DEVICE
#define DBG_LVL DBG_LOG
#else
#define DBG_LVL DBG_WARNING
#endif /* defined (RT_DEBUG_DEVICE) */
#include <rtdbg.h>
#ifdef RT_USING_MODULE
#include <dlmodule.h>
#endif /* RT_USING_MODULE */
#ifdef RT_USING_SMART
#include <lwp.h>
#include <lwp_user_mm.h>
#endif
/**
* @addtogroup group_kernel_service
* @{
*/
#if defined(RT_USING_DEVICE) && defined(RT_USING_CONSOLE)
static rt_device_t _console_device = RT_NULL;
#endif
rt_weak void rt_hw_us_delay(rt_uint32_t us)
{
(void) us;
LOG_W("rt_hw_us_delay() doesn't support for this board."
"Please consider implementing rt_hw_us_delay() in another file.");
}
rt_weak void rt_hw_cpu_reset(void)
{
LOG_W("rt_hw_cpu_reset() doesn't support for this board."
"Please consider implementing rt_hw_cpu_reset() in another file.");
return;
}
rt_weak void rt_hw_cpu_shutdown(void)
{
LOG_I("CPU shutdown...");
LOG_W("Using default rt_hw_cpu_shutdown()."
"Please consider implementing rt_hw_cpu_shutdown() in another file.");
rt_hw_interrupt_disable();
RT_ASSERT(0);
return;
}
/**
* @note can be overridden by cpuport.h which is defined by a specific arch
*/
#ifndef RT_HW_BACKTRACE_FRAME_GET_SELF
#ifdef __GNUC__
#define RT_HW_BACKTRACE_FRAME_GET_SELF(frame) do { \
(frame)->fp = (rt_uintptr_t)__builtin_frame_address(0U); \
(frame)->pc = ({__label__ pc; pc: (rt_uintptr_t)&&pc;}); \
} while (0)
#else
#define RT_HW_BACKTRACE_FRAME_GET_SELF(frame) do { \
(frame)->fp = 0; \
(frame)->pc = 0; \
} while (0)
#endif /* __GNUC__ */
#endif /* RT_HW_BACKTRACE_FRAME_GET_SELF */
/**
* @brief Get the inner most frame of target thread
*
* @param thread the thread which frame belongs to
* @param frame the specified frame to be unwound
* @return rt_err_t 0 is succeed, otherwise a failure
*/
rt_weak rt_err_t rt_hw_backtrace_frame_get(rt_thread_t thread, struct rt_hw_backtrace_frame *frame)
{
RT_UNUSED(thread);
RT_UNUSED(frame);
LOG_W("%s is not implemented", __func__);
return -RT_ENOSYS;
}
/**
* @brief Unwind the target frame
*
* @param thread the thread which frame belongs to
* @param frame the specified frame to be unwound
* @return rt_err_t 0 is succeed, otherwise a failure
*/
rt_weak rt_err_t rt_hw_backtrace_frame_unwind(rt_thread_t thread, struct rt_hw_backtrace_frame *frame)
{
RT_UNUSED(thread);
RT_UNUSED(frame);
LOG_W("%s is not implemented", __func__);
return -RT_ENOSYS;
}
rt_weak const char *rt_hw_cpu_arch(void)
{
return "unknown";
}
/**
* @brief This function will show the version of rt-thread rtos
*/
void rt_show_version(void)
{
rt_kprintf("\n \\ | /\n");
#if defined(RT_USING_SMART)
rt_kprintf("- RT - Thread Smart Operating System\n");
#elif defined(RT_USING_NANO)
rt_kprintf("- RT - Thread Nano Operating System\n");
#else
rt_kprintf("- RT - Thread Operating System\n");
#endif
rt_kprintf(" / | \\ %d.%d.%d build %s %s\n",
(rt_int32_t)RT_VERSION_MAJOR, (rt_int32_t)RT_VERSION_MINOR, (rt_int32_t)RT_VERSION_PATCH, __DATE__, __TIME__);
rt_kprintf(" 2006 - 2024 Copyright by RT-Thread team\n");
}
RTM_EXPORT(rt_show_version);
#ifdef RT_USING_CONSOLE
#ifdef RT_USING_DEVICE
/**
* @brief This function returns the device using in console.
*
* @return Returns the console device pointer or RT_NULL.
*/
rt_device_t rt_console_get_device(void)
{
return _console_device;
}
RTM_EXPORT(rt_console_get_device);
/**
* @brief This function will set a device as console device.
* After set a device to console, all output of rt_kprintf will be
* redirected to this new device.
*
* @param name is the name of new console device.
*
* @return the old console device handler on successful, or RT_NULL on failure.
*/
rt_device_t rt_console_set_device(const char *name)
{
rt_device_t old_device = _console_device;
rt_device_t new_device = rt_device_find(name);
if (new_device != RT_NULL && new_device != old_device)
{
if (old_device != RT_NULL)
{
/* close old console device */
rt_device_close(old_device);
}
/* set new console device */
rt_device_open(new_device, RT_DEVICE_OFLAG_RDWR | RT_DEVICE_FLAG_STREAM);
_console_device = new_device;
}
return old_device;
}
RTM_EXPORT(rt_console_set_device);
#endif /* RT_USING_DEVICE */
#ifdef RT_USING_CONSOLE_OUTPUT_CTL
static volatile rt_bool_t _console_output_enabled = RT_TRUE;
/**
* @brief Enable or disable console log output.
*
* @param enabled RT_TRUE to enable output, RT_FALSE to disable output.
*/
void rt_console_output_set_enabled(rt_bool_t enabled)
{
_console_output_enabled = enabled;
}
RTM_EXPORT(rt_console_output_set_enabled);
/**
* @brief Get current console log output enable state.
*
* @return RT_TRUE if output is enabled, RT_FALSE otherwise.
*/
rt_bool_t rt_console_output_get_enabled(void)
{
return _console_output_enabled;
}
RTM_EXPORT(rt_console_output_get_enabled);
#endif /* RT_USING_CONSOLE_OUTPUT_CTL */
rt_weak void rt_hw_console_output(const char *str)
{
/* empty console output */
RT_UNUSED(str);
}
RTM_EXPORT(rt_hw_console_output);
#ifdef RT_USING_THREADSAFE_PRINTF
/* system console lock */
static struct rt_spinlock _syscon_lock = RT_SPINLOCK_INIT;
/* lock of kprintf buffer */
static struct rt_spinlock _prbuf_lock = RT_SPINLOCK_INIT;
/* current user of system console */
static rt_thread_t _pr_curr_user;
#ifdef RT_USING_DEBUG
static rt_base_t _pr_critical_level;
#endif /* RT_USING_DEBUG */
/* nested level of current user */
static volatile int _pr_curr_user_nested;
rt_thread_t rt_console_current_user(void)
{
return _pr_curr_user;
}
static void _console_take(void)
{
rt_ubase_t level = rt_spin_lock_irqsave(&_syscon_lock);
rt_thread_t self_thread = rt_thread_self();
rt_base_t critical_level;
RT_UNUSED(critical_level);
while (_pr_curr_user != self_thread)
{
if (_pr_curr_user == RT_NULL)
{
/* no preemption is allowed to avoid dead lock */
critical_level = rt_enter_critical();
#ifdef RT_USING_DEBUG
_pr_critical_level = _syscon_lock.critical_level;
_syscon_lock.critical_level = critical_level;
#endif
_pr_curr_user = self_thread;
break;
}
else
{
rt_spin_unlock_irqrestore(&_syscon_lock, level);
rt_thread_yield();
level = rt_spin_lock_irqsave(&_syscon_lock);
}
}
_pr_curr_user_nested++;
rt_spin_unlock_irqrestore(&_syscon_lock, level);
}
static void _console_release(void)
{
rt_ubase_t level = rt_spin_lock_irqsave(&_syscon_lock);
rt_thread_t self_thread = rt_thread_self();
RT_UNUSED(self_thread);
RT_ASSERT(_pr_curr_user == self_thread);
_pr_curr_user_nested--;
if (!_pr_curr_user_nested)
{
_pr_curr_user = RT_NULL;
#ifdef RT_USING_DEBUG
rt_exit_critical_safe(_syscon_lock.critical_level);
_syscon_lock.critical_level = _pr_critical_level;
#else
rt_exit_critical();
#endif
}
rt_spin_unlock_irqrestore(&_syscon_lock, level);
}
#define CONSOLE_TAKE _console_take()
#define CONSOLE_RELEASE _console_release()
#define PRINTF_BUFFER_TAKE rt_ubase_t level = rt_spin_lock_irqsave(&_prbuf_lock)
#define PRINTF_BUFFER_RELEASE rt_spin_unlock_irqrestore(&_prbuf_lock, level)
#else
#define CONSOLE_TAKE
#define CONSOLE_RELEASE
#define PRINTF_BUFFER_TAKE
#define PRINTF_BUFFER_RELEASE
#endif /* RT_USING_THREADSAFE_PRINTF */
/**
* @brief This function will put string to the console.
*
* @param str is the string output to the console.
*/
static void _kputs(const char *str, long len)
{
#ifdef RT_USING_DEVICE
rt_device_t console_device = rt_console_get_device();
#endif /* RT_USING_DEVICE */
CONSOLE_TAKE;
#ifdef RT_USING_DEVICE
if (console_device == RT_NULL)
{
rt_hw_console_output(str);
}
else
{
rt_device_write(console_device, 0, str, len);
}
#else
RT_UNUSED(len);
rt_hw_console_output(str);
#endif /* RT_USING_DEVICE */
CONSOLE_RELEASE;
}
/**
* @brief This function will put string to the console.
*
* @param str is the string output to the console.
*/
void rt_kputs(const char *str)
{
if (!str)
{
return;
}
if (!rt_console_output_get_enabled())
{
return;
}
_kputs(str, rt_strlen(str));
}
/**
* @brief This function will print a formatted string on system console.
*
* @param fmt is the format parameters.
*
* @return The number of characters actually written to buffer.
*/
rt_weak int rt_kprintf(const char *fmt, ...)
{
va_list args;
rt_size_t length = 0;
static char rt_log_buf[RT_CONSOLEBUF_SIZE];
if (!rt_console_output_get_enabled())
{
return 0;
}
va_start(args, fmt);
PRINTF_BUFFER_TAKE;
/* the return value of vsnprintf is the number of bytes that would be
* written to buffer had if the size of the buffer been sufficiently
* large excluding the terminating null byte. If the output string
* would be larger than the rt_log_buf, we have to adjust the output
* length. */
length = rt_vsnprintf(rt_log_buf, sizeof(rt_log_buf) - 1, fmt, args);
if (length > RT_CONSOLEBUF_SIZE - 1)
{
length = RT_CONSOLEBUF_SIZE - 1;
}
_kputs(rt_log_buf, length);
PRINTF_BUFFER_RELEASE;
va_end(args);
return length;
}
RTM_EXPORT(rt_kprintf);
#endif /* RT_USING_CONSOLE */
/**
* @brief Print backtrace of current thread to system console device
*
* @return rt_err_t 0 is success, otherwise a failure
*/
rt_weak rt_err_t rt_backtrace(void)
{
struct rt_hw_backtrace_frame frame = {0};
rt_thread_t thread = rt_thread_self();
/* cppcheck-suppress uninitvar */
RT_HW_BACKTRACE_FRAME_GET_SELF(&frame);
if (!frame.fp)
return -RT_EINVAL;
/* we don't want this frame to be printed which is nearly garbage info */
rt_hw_backtrace_frame_unwind(thread, &frame);
return rt_backtrace_frame(thread, &frame);
}
/**
* @brief Print backtrace from frame to system console device
*
* @param thread the thread which frame belongs to
* @param frame where backtrace starts from
* @return rt_err_t 0 is success, otherwise a failure
*/
rt_weak rt_err_t rt_backtrace_frame(rt_thread_t thread, struct rt_hw_backtrace_frame *frame)
{
long nesting = 0;
rt_kprintf("please use: addr2line -e rtthread.elf -a -f\n");
while (nesting < RT_BACKTRACE_LEVEL_MAX_NR)
{
rt_kprintf(" 0x%lx", (rt_ubase_t)frame->pc);
if (rt_hw_backtrace_frame_unwind(thread, frame))
{
break;
}
nesting++;
}
rt_kprintf("\n");
return RT_EOK;
}
/**
* @brief Print backtrace from buffer to system console
*
* @param buffer where traced frames saved
* @param buflen number of items in buffer
* @return rt_err_t 0 is success, otherwise a failure
*/
rt_weak rt_err_t rt_backtrace_formatted_print(rt_ubase_t *buffer, long buflen)
{
rt_kprintf("please use: addr2line -e rtthread.elf -a -f\n");
for (rt_size_t i = 0; i < buflen && buffer[i] != 0; i++)
{
rt_kprintf(" 0x%lx", (rt_ubase_t)buffer[i]);
}
rt_kprintf("\n");
return RT_EOK;
}
/**
* @brief Print backtrace from frame to the given buffer
*
* @param thread the thread which frame belongs to
* @param frame where backtrace starts from. NULL if it's the current one
* @param skip the number of frames to discarded counted from calling function.
* Noted that the inner most frame is always discarded and not counted,
* which is obviously reasonable since that's this function itself.
* @param buffer where traced frames saved
* @param buflen max number of items can be saved in buffer. If there are no more
* than buflen items to be saved, there will be a NULL after the
* last saved item in the buffer.
* @return rt_err_t 0 is success, otherwise a failure
*/
rt_weak rt_err_t rt_backtrace_to_buffer(rt_thread_t thread,
struct rt_hw_backtrace_frame *frame,
long skip,
rt_ubase_t *buffer,
long buflen)
{
long nesting = 0;
struct rt_hw_backtrace_frame cur_frame = {0};
if (!thread)
return -RT_EINVAL;
RT_ASSERT(rt_object_get_type(&thread->parent) == RT_Object_Class_Thread);
if (!frame)
{
frame = &cur_frame;
/* cppcheck-suppress uninitvar */
RT_HW_BACKTRACE_FRAME_GET_SELF(frame);
if (!frame->fp)
return -RT_EINVAL;
}
/* discard frames as required. The inner most is always threw. */
do {
rt_hw_backtrace_frame_unwind(thread, frame);
} while (skip-- > 0);
while (nesting < buflen)
{
*buffer++ = (rt_ubase_t)frame->pc;
if (rt_hw_backtrace_frame_unwind(thread, frame))
{
break;
}
nesting++;
}
if (nesting < buflen)
*buffer = RT_NULL;
return RT_EOK;
}
/**
* @brief Print backtrace of a thread to system console device
*
* @param thread which call stack is traced
* @return rt_err_t 0 is success, otherwise a failure
*/
rt_err_t rt_backtrace_thread(rt_thread_t thread)
{
rt_err_t rc;
struct rt_hw_backtrace_frame frame;
if (thread)
{
rc = rt_hw_backtrace_frame_get(thread, &frame);
if (rc == RT_EOK)
{
rc = rt_backtrace_frame(thread, &frame);
}
}
else
{
rc = -RT_EINVAL;
}
return rc;
}
#ifdef RT_USING_CPU_USAGE_TRACER
#define RT_CPU_USAGE_CALC_INTERVAL_TICK \
((RT_TICK_PER_SECOND * RT_CPU_USAGE_CALC_INTERVAL_MS + 999U) / 1000U)
static rt_tick_t _cpu_usage_sample_tick;
static rt_bool_t _cpu_usage_inited = RT_FALSE;
static struct rt_cpu_usage_stats _cpu_usage_prev_cpu_stat[RT_CPUS_NR];
static struct rt_spinlock _cpu_usage_lock = RT_SPINLOCK_INIT;
/*
* Calculate total CPU-time delta for this sampling window and
* refresh per-CPU snapshots.
*
* Each counter delta is computed in rt_ubase_t width first, so wrap-around
* on 32-bit targets is handled naturally by unsigned arithmetic.
*/
static rt_uint64_t _cpu_usage_calc_total_delta(void)
{
rt_uint64_t total_delta = 0;
int i;
for (i = 0; i < RT_CPUS_NR; i++)
{
rt_cpu_t pcpu = rt_cpu_index(i);
rt_ubase_t user_now = pcpu->cpu_stat.user;
rt_ubase_t system_now = pcpu->cpu_stat.system;
rt_ubase_t idle_now = pcpu->cpu_stat.idle;
/* Per-counter delta first to avoid overflow artifacts after sum. */
rt_ubase_t user_delta = (rt_ubase_t)(user_now - _cpu_usage_prev_cpu_stat[i].user);
rt_ubase_t system_delta = (rt_ubase_t)(system_now - _cpu_usage_prev_cpu_stat[i].system);
rt_ubase_t idle_delta = (rt_ubase_t)(idle_now - _cpu_usage_prev_cpu_stat[i].idle);
total_delta += (rt_uint64_t)user_delta;
total_delta += (rt_uint64_t)system_delta;
total_delta += (rt_uint64_t)idle_delta;
_cpu_usage_prev_cpu_stat[i].user = user_now;
_cpu_usage_prev_cpu_stat[i].system = system_now;
_cpu_usage_prev_cpu_stat[i].idle = idle_now;
}
return total_delta;
}
static void _cpu_usage_snapshot_init(void)
{
struct rt_object_information *info;
rt_list_t *list;
rt_list_t *node;
rt_base_t level;
int i;
info = rt_object_get_information(RT_Object_Class_Thread);
list = &info->object_list;
level = rt_spin_lock_irqsave(&info->spinlock);
for (node = list->next; node != list; node = node->next)
{
struct rt_object *obj = rt_list_entry(node, struct rt_object, list);
struct rt_thread *t = (struct rt_thread *)obj;
t->total_time_prev = 0U;
t->cpu_usage = 0U;
}
rt_spin_unlock_irqrestore(&info->spinlock, level);
for (i = 0; i < RT_CPUS_NR; i++)
{
_cpu_usage_prev_cpu_stat[i].user = 0U;
_cpu_usage_prev_cpu_stat[i].system = 0U;
_cpu_usage_prev_cpu_stat[i].idle = 0U;
}
_cpu_usage_sample_tick = rt_tick_get();
_cpu_usage_inited = RT_TRUE;
}
static void _cpu_usage_refresh_threads(rt_uint64_t total_delta)
{
struct rt_object_information *info;
rt_list_t *list;
rt_list_t *node;
rt_base_t level;
info = rt_object_get_information(RT_Object_Class_Thread);
list = &info->object_list;
level = rt_spin_lock_irqsave(&info->spinlock);
for (node = list->next; node != list; node = node->next)
{
struct rt_object *obj = rt_list_entry(node, struct rt_object, list);
struct rt_thread *t = (struct rt_thread *)obj;
rt_ubase_t total_now = (rt_ubase_t)(t->user_time + t->system_time);
rt_ubase_t total_delta_now = (rt_ubase_t)(total_now - t->total_time_prev);
rt_uint64_t thread_delta = (rt_uint64_t)total_delta_now;
if (total_delta > 0U)
{
rt_uint64_t usage = (thread_delta * 100U) / total_delta;
t->cpu_usage = (rt_uint8_t)(usage > 100U ? 100U : usage);
}
else
{
t->cpu_usage = 0U;
}
t->total_time_prev = total_now;
}
rt_spin_unlock_irqrestore(&info->spinlock, level);
}
static void _cpu_usage_update(void)
{
rt_tick_t tick_now;
rt_tick_t delta_tick;
rt_uint64_t total_delta;
rt_bool_t bypass_interval_check = RT_FALSE;
if (!_cpu_usage_inited)
{
_cpu_usage_snapshot_init();
bypass_interval_check = RT_TRUE;
}
tick_now = rt_tick_get();
delta_tick = rt_tick_get_delta(_cpu_usage_sample_tick);
if (!bypass_interval_check && delta_tick < RT_CPU_USAGE_CALC_INTERVAL_TICK)
{
return;
}
total_delta = _cpu_usage_calc_total_delta();
_cpu_usage_refresh_threads(total_delta);
_cpu_usage_sample_tick = tick_now;
}
/**
* @brief Get thread CPU usage percentage in the recent sampling window
*
* This function returns per-thread CPU usage based on delta runtime in the
* latest sampling window, rather than cumulative runtime since boot.
*
* @param thread Pointer to the thread object. Must not be NULL.
*
* @return The CPU usage percentage as an integer value (0-100).
* If sampling interval has not elapsed yet, the previous cached value
* is returned (initial value is 0).
*
* @note This function requires RT_USING_CPU_USAGE_TRACER to be enabled.
* @note The percentage is calculated as
* (thread_time_delta * 100) / total_time_delta,
* where total_time_delta is the sum of user/system/idle deltas of all CPUs.
* @note Sampling interval can be tuned with RT_CPU_USAGE_CALC_INTERVAL_MS.
* @note If thread is NULL, an assertion will be triggered in debug builds.
*/
rt_uint8_t rt_thread_get_usage(rt_thread_t thread)
{
rt_uint8_t usage;
RT_ASSERT(thread != RT_NULL);
rt_spin_lock(&_cpu_usage_lock);
_cpu_usage_update();
usage = thread->cpu_usage;
rt_spin_unlock(&_cpu_usage_lock);
return usage;
}
#endif /* RT_USING_CPU_USAGE_TRACER */
#if defined(RT_USING_LIBC) && defined(RT_USING_FINSH)
#include <limits.h>
#include <stdlib.h> /* for string service */
struct cmd_backtrace_find_ctx
{
rt_uintptr_t pid;
rt_thread_t thread;
};
static rt_err_t cmd_backtrace_match_thread(struct rt_object *object, void *data)
{
struct cmd_backtrace_find_ctx *ctx = data;
if ((rt_uintptr_t)object == ctx->pid)
{
ctx->thread = (rt_thread_t)object;
return 1;
}
return RT_EOK;
}
#if UINTPTR_MAX > ULONG_MAX
static void cmd_backtrace_format_pid(rt_uintptr_t pid, char *buf, rt_size_t size)
{
static const char hex[] = "0123456789abcdef";
char digits[sizeof(rt_uintptr_t) * 2];
rt_size_t count = 0;
rt_size_t index;
if ((buf == RT_NULL) || (size < 4))
{
if ((buf != RT_NULL) && (size > 0))
{
buf[0] = '\0';
}
return;
}
do
{
digits[count++] = hex[pid & 0xf];
pid >>= 4;
}
while ((pid != 0) && (count < sizeof(digits)));
buf[0] = '0';
buf[1] = 'x';
for (index = 0; index < count; index++)
{
buf[2 + index] = digits[count - index - 1];
}
buf[2 + count] = '\0';
}
#endif
static rt_bool_t cmd_backtrace_parse_pid(const char *arg, rt_uintptr_t *pid)
{
char *end_ptr;
#if UINTPTR_MAX > ULONG_MAX
unsigned long long parsed_value;
#else
unsigned long parsed_value;
#endif
rt_uintptr_t value;
if ((arg == RT_NULL) || (pid == RT_NULL))
{
return RT_FALSE;
}
if ((*arg == '+') || (*arg == '-'))
{
return RT_FALSE;
}
errno = 0;
#if UINTPTR_MAX > ULONG_MAX
parsed_value = strtoull(arg, &end_ptr, 0);
#else
parsed_value = strtoul(arg, &end_ptr, 0);
#endif
if ((end_ptr == arg) || (*end_ptr != '\0') ||
(errno == ERANGE) ||
#if UINTPTR_MAX > ULONG_MAX
(parsed_value > (unsigned long long)(rt_uintptr_t)-1))
#else
(parsed_value > (unsigned long)(rt_uintptr_t)-1))
#endif
{
return RT_FALSE;
}
value = (rt_uintptr_t)parsed_value;
if (value == 0)
{
return RT_FALSE;
}
*pid = value;
return RT_TRUE;
}
static rt_thread_t cmd_backtrace_find_thread(rt_uintptr_t pid)
{
struct cmd_backtrace_find_ctx ctx =
{
.pid = pid,
.thread = RT_NULL,
};
rt_object_for_each(RT_Object_Class_Thread, cmd_backtrace_match_thread, &ctx);
return ctx.thread;
}
static void cmd_backtrace(int argc, char** argv)
{
rt_uintptr_t pid;
rt_thread_t target;
#if UINTPTR_MAX > ULONG_MAX
char pid_buf[sizeof(rt_uintptr_t) * 2 + 3];
#endif
if (argc != 2)
{
if (argc == 1)
{
rt_kprintf("[INFO] No thread specified\n"
"[HELP] You can use commands like: backtrace %p\n"
"Printing backtrace of calling stack...\n",
rt_thread_self());
rt_backtrace();
return ;
}
else
{
rt_kprintf("please use: backtrace [thread_address]\n");
return;
}
}
if (!cmd_backtrace_parse_pid(argv[1], &pid))
{
rt_kprintf("Invalid input: %s\n", argv[1]);
return ;
}
target = cmd_backtrace_find_thread(pid);
#if UINTPTR_MAX > ULONG_MAX
cmd_backtrace_format_pid(pid, pid_buf, sizeof(pid_buf));
#endif
if (target != RT_NULL)
{
#if UINTPTR_MAX > ULONG_MAX
rt_kprintf("backtrace %s(%s), from %s\n", target->parent.name, pid_buf, argv[1]);
#else
rt_kprintf("backtrace %s(0x%lx), from %s\n",
target->parent.name, (unsigned long)pid, argv[1]);
#endif
rt_backtrace_thread(target);
}
else
{
#if UINTPTR_MAX > ULONG_MAX
rt_kprintf("Invalid pid: %s\n", pid_buf);
#else
rt_kprintf("Invalid pid: %lx\n", (unsigned long)pid);
#endif
}
}
MSH_CMD_EXPORT_ALIAS(cmd_backtrace, backtrace, print backtrace of a thread);
#endif /* RT_USING_LIBC */
#if defined(RT_USING_HEAP) && !defined(RT_USING_USERHEAP)
#ifdef RT_USING_HOOK
static void (*rt_malloc_hook)(void **ptr, rt_size_t size);
static void (*rt_realloc_entry_hook)(void **ptr, rt_size_t size);
static void (*rt_realloc_exit_hook)(void **ptr, rt_size_t size);
static void (*rt_free_hook)(void **ptr);
/**
* @ingroup group_hook
* @{
*/
/**
* @brief This function will set a hook function, which will be invoked when a memory
* block is allocated from heap memory.
*
* @param hook the hook function.
*/
void rt_malloc_sethook(void (*hook)(void **ptr, rt_size_t size))
{
rt_malloc_hook = hook;
}
/**
* @brief This function will set a hook function, which will be invoked when a memory
* block is allocated from heap memory.
*
* @param hook the hook function.
*/
void rt_realloc_set_entry_hook(void (*hook)(void **ptr, rt_size_t size))
{
rt_realloc_entry_hook = hook;
}
/**
* @brief This function will set a hook function, which will be invoked when a memory
* block is allocated from heap memory.
*
* @param hook the hook function.
*/
void rt_realloc_set_exit_hook(void (*hook)(void **ptr, rt_size_t size))
{
rt_realloc_exit_hook = hook;
}
/**
* @brief This function will set a hook function, which will be invoked when a memory
* block is released to heap memory.
*
* @param hook the hook function
*/
void rt_free_sethook(void (*hook)(void **ptr))
{
rt_free_hook = hook;
}
/**@}*/
#endif /* RT_USING_HOOK */
#if defined(RT_USING_HEAP_ISR)
static struct rt_spinlock _heap_spinlock;
#elif defined(RT_USING_MUTEX)
static struct rt_mutex _lock;
#endif
rt_inline void _heap_lock_init(void)
{
#if defined(RT_USING_HEAP_ISR)
rt_spin_lock_init(&_heap_spinlock);
#elif defined(RT_USING_MUTEX)
rt_mutex_init(&_lock, "heap", RT_IPC_FLAG_PRIO);
#endif
}
rt_inline rt_base_t _heap_lock(void)
{
#if defined(RT_USING_HEAP_ISR)
return rt_spin_lock_irqsave(&_heap_spinlock);
#elif defined(RT_USING_MUTEX)
if (rt_thread_self())
return rt_mutex_take(&_lock, RT_WAITING_FOREVER);
else
return RT_EOK;
#else
rt_enter_critical();
return RT_EOK;
#endif
}
rt_inline void _heap_unlock(rt_base_t level)
{
#if defined(RT_USING_HEAP_ISR)
rt_spin_unlock_irqrestore(&_heap_spinlock, level);
#elif defined(RT_USING_MUTEX)
RT_ASSERT(level == RT_EOK);
if (rt_thread_self())
rt_mutex_release(&_lock);
#else
rt_exit_critical();
#endif
}
#ifdef RT_USING_UTESTCASES
/* export to utest to observe the inner statements */
#ifdef _MSC_VER
#define rt_heap_lock() _heap_lock()
#define rt_heap_unlock() _heap_unlock()
#else
rt_base_t rt_heap_lock(void) __attribute__((alias("_heap_lock")));
void rt_heap_unlock(rt_base_t level) __attribute__((alias("_heap_unlock")));
#endif /* _MSC_VER */
#endif
#if defined(RT_USING_SMALL_MEM_AS_HEAP)
static rt_smem_t system_heap;
rt_inline void _smem_info(rt_size_t *total,
rt_size_t *used, rt_size_t *max_used)
{
if (total)
*total = system_heap->total;
if (used)
*used = system_heap->used;
if (max_used)
*max_used = system_heap->max;
}
#define _MEM_INIT(_name, _start, _size) \
system_heap = rt_smem_init(_name, _start, _size)
#define _MEM_MALLOC(_size) \
rt_smem_alloc(system_heap, _size)
#define _MEM_REALLOC(_ptr, _newsize)\
rt_smem_realloc(system_heap, _ptr, _newsize)
#define _MEM_FREE(_ptr) \
rt_smem_free(_ptr)
#define _MEM_INFO(_total, _used, _max) \
_smem_info(_total, _used, _max)
#elif defined(RT_USING_MEMHEAP_AS_HEAP)
static struct rt_memheap system_heap;
void *_memheap_alloc(struct rt_memheap *heap, rt_size_t size);
void _memheap_free(void *rmem);
void *_memheap_realloc(struct rt_memheap *heap, void *rmem, rt_size_t newsize);
#define _MEM_INIT(_name, _start, _size) \
do {\
rt_memheap_init(&system_heap, _name, _start, _size); \
system_heap.locked = RT_TRUE; \
} while(0)
#define _MEM_MALLOC(_size) \
_memheap_alloc(&system_heap, _size)
#define _MEM_REALLOC(_ptr, _newsize) \
_memheap_realloc(&system_heap, _ptr, _newsize)
#define _MEM_FREE(_ptr) \
_memheap_free(_ptr)
#define _MEM_INFO(_total, _used, _max) \
rt_memheap_info(&system_heap, _total, _used, _max)
#elif defined(RT_USING_SLAB_AS_HEAP)
static rt_slab_t system_heap;
rt_inline void _slab_info(rt_size_t *total,
rt_size_t *used, rt_size_t *max_used)
{
if (total)
*total = system_heap->total;
if (used)
*used = system_heap->used;
if (max_used)
*max_used = system_heap->max;
}
#define _MEM_INIT(_name, _start, _size) \
system_heap = rt_slab_init(_name, _start, _size)
#define _MEM_MALLOC(_size) \
rt_slab_alloc(system_heap, _size)
#define _MEM_REALLOC(_ptr, _newsize) \
rt_slab_realloc(system_heap, _ptr, _newsize)
#define _MEM_FREE(_ptr) \
rt_slab_free(system_heap, _ptr)
#define _MEM_INFO _slab_info
#else
#define _MEM_INIT(...)
#define _MEM_MALLOC(...) RT_NULL
#define _MEM_REALLOC(...) RT_NULL
#define _MEM_FREE(...)
#define _MEM_INFO(...)
#endif
/**
* @brief This function will do the generic system heap initialization.
*
* @param begin_addr the beginning address of system page.
*
* @param end_addr the end address of system page.
*/
void rt_system_heap_init_generic(void *begin_addr, void *end_addr)
{
rt_uintptr_t begin_align = RT_ALIGN((rt_uintptr_t)begin_addr, RT_ALIGN_SIZE);
rt_uintptr_t end_align = RT_ALIGN_DOWN((rt_uintptr_t)end_addr, RT_ALIGN_SIZE);
RT_ASSERT(end_align > begin_align);
/* Initialize system memory heap */
_MEM_INIT("heap", (void *)begin_align, end_align - begin_align);
/* Initialize multi thread contention lock */
_heap_lock_init();
}
/**
* @brief This function will init system heap. User can override this API to
* complete other works, like heap sanitizer initialization.
*
* @param begin_addr the beginning address of system page.
*
* @param end_addr the end address of system page.
*/
rt_weak void rt_system_heap_init(void *begin_addr, void *end_addr)
{
rt_system_heap_init_generic(begin_addr, end_addr);
}
/**
* @brief Allocate a block of memory with a minimum of 'size' bytes.
*
* @param size is the minimum size of the requested block in bytes.
*
* @return the pointer to allocated memory or NULL if no free memory was found.
*/
rt_weak void *rt_malloc(rt_size_t size)
{
rt_base_t level;
void *ptr;
/* Enter critical zone */
level = _heap_lock();
/* allocate memory block from system heap */
ptr = _MEM_MALLOC(size);
/* Exit critical zone */
_heap_unlock(level);
/* call 'rt_malloc' hook */
RT_OBJECT_HOOK_CALL(rt_malloc_hook, (&ptr, size));
return ptr;
}
RTM_EXPORT(rt_malloc);
/**
* @brief This function will change the size of previously allocated memory block.
*
* @param ptr is the pointer to memory allocated by rt_malloc.
*
* @param newsize is the required new size.
*
* @return the changed memory block address.
*/
rt_weak void *rt_realloc(void *ptr, rt_size_t newsize)
{
rt_base_t level;
void *nptr;
/* Entry hook */
RT_OBJECT_HOOK_CALL(rt_realloc_entry_hook, (&ptr, newsize));
/* Enter critical zone */
level = _heap_lock();
/* Change the size of previously allocated memory block */
nptr = _MEM_REALLOC(ptr, newsize);
/* Exit critical zone */
_heap_unlock(level);
/* Exit hook */
RT_OBJECT_HOOK_CALL(rt_realloc_exit_hook, (&nptr, newsize));
return nptr;
}
RTM_EXPORT(rt_realloc);
/**
* @brief This function will contiguously allocate enough space for count objects
* that are size bytes of memory each and returns a pointer to the allocated
* memory.
*
* @note The allocated memory is filled with bytes of value zero.
*
* @param count is the number of objects to allocate.
*
* @param size is the size of one object to allocate.
*
* @return pointer to allocated memory / NULL pointer if there is an error.
*/
rt_weak void *rt_calloc(rt_size_t count, rt_size_t size)
{
void *p;
/* allocate 'count' objects of size 'size' */
p = rt_malloc(count * size);
/* zero the memory */
if (p)
{
rt_memset(p, 0, count * size);
}
return p;
}
RTM_EXPORT(rt_calloc);
/**
* @brief This function will release the previously allocated memory block by
* rt_malloc. The released memory block is taken back to system heap.
*
* @param ptr the address of memory which will be released.
*/
rt_weak void rt_free(void *ptr)
{
rt_base_t level;
/* call 'rt_free' hook */
RT_OBJECT_HOOK_CALL(rt_free_hook, (&ptr));
/* NULL check */
if (ptr == RT_NULL) return;
/* Enter critical zone */
level = _heap_lock();
_MEM_FREE(ptr);
/* Exit critical zone */
_heap_unlock(level);
}
RTM_EXPORT(rt_free);
/**
* @brief This function will caculate the total memory, the used memory, and
* the max used memory.
*
* @param total is a pointer to get the total size of the memory.
*
* @param used is a pointer to get the size of memory used.
*
* @param max_used is a pointer to get the maximum memory used.
*/
rt_weak void rt_memory_info(rt_size_t *total,
rt_size_t *used,
rt_size_t *max_used)
{
rt_base_t level;
/* Enter critical zone */
level = _heap_lock();
_MEM_INFO(total, used, max_used);
/* Exit critical zone */
_heap_unlock(level);
}
RTM_EXPORT(rt_memory_info);
#if defined(RT_USING_SLAB) && defined(RT_USING_SLAB_AS_HEAP)
void *rt_page_alloc(rt_size_t npages)
{
rt_base_t level;
void *ptr;
/* Enter critical zone */
level = _heap_lock();
/* alloc page */
ptr = rt_slab_page_alloc(system_heap, npages);
/* Exit critical zone */
_heap_unlock(level);
return ptr;
}
void rt_page_free(void *addr, rt_size_t npages)
{
rt_base_t level;
/* Enter critical zone */
level = _heap_lock();
/* free page */
rt_slab_page_free(system_heap, addr, npages);
/* Exit critical zone */
_heap_unlock(level);
}
#endif
/**
* @brief This function allocates a memory block, which address is aligned to the
* specified alignment size.
*
* @param size is the allocated memory block size.
*
* @param align is the alignment size.
*
* @return The memory block address was returned successfully, otherwise it was
* returned empty RT_NULL.
*/
rt_weak void *rt_malloc_align(rt_size_t size, rt_size_t align)
{
void *ptr = RT_NULL;
void *align_ptr = RT_NULL;
int uintptr_size = 0;
rt_size_t align_size = 0;
/* sizeof pointer */
uintptr_size = sizeof(void*);
uintptr_size -= 1;
/* align the alignment size to uintptr size byte */
align = ((align + uintptr_size) & ~uintptr_size);
/* get total aligned size */
align_size = ((size + uintptr_size) & ~uintptr_size) + align;
/* allocate memory block from heap */
ptr = rt_malloc(align_size);
if (ptr != RT_NULL)
{
/* the allocated memory block is aligned */
if (((rt_uintptr_t)ptr & (align - 1)) == 0)
{
align_ptr = (void *)((rt_uintptr_t)ptr + align);
}
else
{
align_ptr = (void *)(((rt_uintptr_t)ptr + (align - 1)) & ~(align - 1));
}
/* set the pointer before alignment pointer to the real pointer */
*((rt_uintptr_t *)((rt_uintptr_t)align_ptr - sizeof(void *))) = (rt_uintptr_t)ptr;
ptr = align_ptr;
}
return ptr;
}
RTM_EXPORT(rt_malloc_align);
/**
* @brief This function release the memory block, which is allocated by
* rt_malloc_align function and address is aligned.
*
* @param ptr is the memory block pointer.
*/
rt_weak void rt_free_align(void *ptr)
{
void *real_ptr = RT_NULL;
/* NULL check */
if (ptr == RT_NULL) return;
real_ptr = (void *) * (rt_uintptr_t *)((rt_uintptr_t)ptr - sizeof(void *));
rt_free(real_ptr);
}
RTM_EXPORT(rt_free_align);
#endif /* RT_USING_HEAP */
/**
* @brief Find the index of the most significant set bit in a 32-bit integer.
* @details The result is the position of the highest bit set to 1, counting
* from 1 for the least significant bit. If the input value is 0, the function
* returns 0.
*
* Examples:
* - fls(0) = 0
* - fls(1) = 1
* - fls(0x80000000) = 32
*
* @param val 32-bit integer value to examine.
* @return Position of the most significant set bit (1–32), or 0 if @p val is 0.
*/
int __rt_fls(int val)
{
int bit = 32;
if (!val)
{
return 0;
}
if (!(val & 0xffff0000u))
{
val <<= 16;
bit -= 16;
}
if (!(val & 0xff000000u))
{
val <<= 8;
bit -= 8;
}
if (!(val & 0xf0000000u))
{
val <<= 4;
bit -= 4;
}
if (!(val & 0xc0000000u))
{
val <<= 2;
bit -= 2;
}
if (!(val & 0x80000000u))
{
bit -= 1;
}
return bit;
}
#ifndef RT_USING_CPU_FFS
#ifdef RT_USING_TINY_FFS
const rt_uint8_t __lowest_bit_bitmap[] =
{
/* 0 - 7 */ 0, 1, 2, 27, 3, 24, 28, 32,
/* 8 - 15 */ 4, 17, 25, 31, 29, 12, 32, 14,
/* 16 - 23 */ 5, 8, 18, 32, 26, 23, 32, 16,
/* 24 - 31 */ 30, 11, 13, 7, 32, 22, 15, 10,
/* 32 - 36 */ 6, 21, 9, 20, 19
};
/**
* @brief This function finds the first bit set (beginning with the least significant bit)
* in value and return the index of that bit.
*
* Bits are numbered starting at 1 (the least significant bit). A return value of
* zero from any of these functions means that the argument was zero.
*
* @param value is the value to find the first bit set in.
*
* @return return the index of the first bit set. If value is 0, then this function
* shall return 0.
*/
int __rt_ffs(int value)
{
return __lowest_bit_bitmap[(rt_uint32_t)(value & (value - 1) ^ value) % 37];
}
#else
const rt_uint8_t __lowest_bit_bitmap[] =
{
/* 00 */ 0, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* 10 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* 20 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* 30 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* 40 */ 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* 50 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* 60 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* 70 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* 80 */ 7, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* 90 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* A0 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* B0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* C0 */ 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* D0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* E0 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
/* F0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0
};
/**
* @brief This function finds the first bit set (beginning with the least significant bit)
* in value and return the index of that bit.
*
* Bits are numbered starting at 1 (the least significant bit). A return value of
* zero from any of these functions means that the argument was zero.
*
* @param value is the value to find the first bit set in.
*
* @return Return the index of the first bit set. If value is 0, then this function
* shall return 0.
*/
int __rt_ffs(int value)
{
if (value == 0)
{
return 0;
}
if (value & 0xff)
{
return __lowest_bit_bitmap[value & 0xff] + 1;
}
if (value & 0xff00)
{
return __lowest_bit_bitmap[(value & 0xff00) >> 8] + 9;
}
if (value & 0xff0000)
{
return __lowest_bit_bitmap[(value & 0xff0000) >> 16] + 17;
}
return __lowest_bit_bitmap[(value & 0xff000000) >> 24] + 25;
}
#endif /* RT_USING_TINY_FFS */
#endif /* RT_USING_CPU_FFS */
#ifdef RT_DEBUGING_ASSERT
/* RT_ASSERT(EX)'s hook */
void (*rt_assert_hook)(const char *ex, const char *func, rt_size_t line);
/**
* This function will set a hook function to RT_ASSERT(EX). It will run when the expression is false.
*
* @param hook is the hook function.
*/
void rt_assert_set_hook(void (*hook)(const char *ex, const char *func, rt_size_t line))
{
rt_assert_hook = hook;
}
/**
* The RT_ASSERT function.
*
* @param ex_string is the assertion condition string.
*
* @param func is the function name when assertion.
*
* @param line is the file line number when assertion.
*/
void rt_assert_handler(const char *ex_string, const char *func, rt_size_t line)
{
volatile char dummy = 0;
if (rt_assert_hook == RT_NULL)
{
#ifdef RT_USING_MODULE
if (dlmodule_self())
{
/* close assertion module */
dlmodule_exit(-1);
}
else
#endif /*RT_USING_MODULE*/
{
rt_kprintf("(%s) assertion failed at function:%s, line number:%d \n", ex_string, func, line);
rt_backtrace();
while (dummy == 0);
}
}
else
{
rt_assert_hook(ex_string, func, line);
}
}
RTM_EXPORT(rt_assert_handler);
#endif /* RT_DEBUGING_ASSERT */
/**@}*/
|