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
|
/**
* @file os_thread.c
* @author ALLWINNERTECH IOT WLAN Team
*/
/*
* Copyright (C) 2017 ALLWINNERTECH TECHNOLOGY CO., LTD. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the
* distribution.
* 3. Neither the name of ALLWINNERTECH TECHNOLOGY CO., LTD. nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "os_thread.h"
#include "os_util.h"
/**
* @brief Create and start a thread
*
* This function starts a new thread. The new thread starts execution by
* invoking entry(). The argument arg is passed as the sole argument of entry().
*
* @note After finishing execution, the new thread should call OS_ThreadDelete()
* to delete itself. Failing to do this and just returning from entry()
* will result in undefined behavior.
*
* @param[in] thread Pointer to the thread object
* @param[in] name A descriptive name for the thread. This is mainly used to
* facilitate debugging.
* @param[in] entry Entry, which is a function pointer, to the thread function
* @param[in] arg The sole argument passed to entry()
* @param[in] priority The priority at which the thread will execute
* @param[in] stackSize The number of bytes the thread stack can hold
* @retval OS_Status, OS_OK on success
*/
OS_Status OS_ThreadCreate(OS_Thread_t *thread, const char *name,
OS_ThreadEntry_t entry, void *arg,
OS_Priority priority, uint32_t stackSize)
{
BaseType_t ret;
OS_HANDLE_ASSERT(!OS_ThreadIsValid(thread), thread->handle);
ret = xTaskCreate(entry, name, stackSize / sizeof(StackType_t), arg,
priority, &thread->handle);
if (ret != pdPASS) {
OS_ERR("err %"OS_BASETYPE_F"\n", ret);
OS_ThreadSetInvalid(thread);
return OS_FAIL;
}
return OS_OK;
}
/**
* @brief Terminate the thread
* @note Only memory that is allocated to a thread by the kernel itself is
* automatically freed when a thread is deleted. Memory, or any other
* resource, that the application (rather than the kernel) allocates
* to a thread must be explicitly freed by the application when the task
* is deleted.
* @param[in] thread Pointer to the thread object to be deleted.
* A thread can delete itself by passing NULL in place of a
* valid thread object.
* @retval OS_Status, OS_OK on success
*/
OS_Status OS_ThreadDelete(OS_Thread_t *thread)
{
TaskHandle_t handle;
TaskHandle_t curHandle;
if (thread == NULL) {
vTaskDelete(NULL); /* delete self */
return OS_OK;
}
OS_HANDLE_ASSERT(OS_ThreadIsValid(thread), thread->handle);
handle = thread->handle;
curHandle = xTaskGetCurrentTaskHandle();
if (handle == curHandle) {
/* delete self */
OS_ThreadSetInvalid(thread);
vTaskDelete(NULL);
} else {
/* delete other thread */
OS_WRN("thread %"OS_HANDLE_F" delete %"OS_HANDLE_F"\n", curHandle, handle);
vTaskDelete(handle);
OS_ThreadSetInvalid(thread);
}
return OS_OK;
}
#if INCLUDE_uxTaskGetStackHighWaterMark
/**
* @brief Get the minimum amount of free stack space that has been available
* since the thread started executing.
* @param[in] thread Pointer to the thread object
* @return The minimum amount of free stack space that has been available since
* the thread started executing. This is the amount of stack that
* remained unused when stack usage was at its greatest (or deepest)
* value.
*/
uint32_t OS_ThreadGetStackMinFreeSize(OS_Thread_t *thread)
{
TaskHandle_t handle;
handle = thread ? thread->handle : NULL;
return (uxTaskGetStackHighWaterMark(handle) * sizeof(StackType_t));
}
#endif
#if (configCHECK_FOR_STACK_OVERFLOW > 0)
/*
void vApplicationStackOverflowHook(TaskHandle_t xTask, char *pcTaskName)
{
OS_ERR("task %p(%s) stack over flow\n", xTask, pcTaskName);
OS_ABORT();
}
*/
#endif
#if (configUSE_TRACE_FACILITY == 1)
void OS_ThreadList(void)
{
#if 0
TaskStatus_t *taskStatusArray;
UBaseType_t taskNum, i;
char state;
taskNum = uxTaskGetNumberOfTasks();
taskStatusArray = OS_Malloc(taskNum * sizeof(TaskStatus_t));
if (taskStatusArray == NULL) {
OS_ERR("no mem\n");
return;
}
i = uxTaskGetSystemState(taskStatusArray, taskNum, NULL);
if (i != taskNum) {
OS_WRN("task num %lu != %lu\n", i, taskNum);
}
OS_LOG(1, "%*sState Pri Idx StkCur StkBot StkFree StkFreeMin\n",
-configMAX_TASK_NAME_LEN, "Name");
for (i = 0; i < taskNum; ++i) {
OS_LOG(1, "%*.*s", -configMAX_TASK_NAME_LEN, configMAX_TASK_NAME_LEN,
taskStatusArray[i].pcTaskName);
switch (taskStatusArray[i].eCurrentState) {
case eReady: state = 'R'; break;
case eBlocked: state = 'B'; break;
case eSuspended: state = 'S'; break;
case eDeleted: state = 'D'; break;
default: state = '?'; break;
}
OS_LOG(1, "%-5c %-3lu %-3lu %-u\n",
state,
taskStatusArray[i].uxCurrentPriority,
taskStatusArray[i].xTaskNumber,
//taskStatusArray[i].pxTopOfStack,
//taskStatusArray[i].pxStack,
//(taskStatusArray[i].pxTopOfStack - taskStatusArray[i].pxStack) * sizeof(StackType_t),
taskStatusArray[i].usStackHighWaterMark * sizeof(StackType_t));
/*
OS_LOG(1, "%-5c %-3lu %-3lu %-10p %-10p %-7u %-u\n",
state,
taskStatusArray[i].uxCurrentPriority,
taskStatusArray[i].xTaskNumber,
taskStatusArray[i].pxTopOfStack,
taskStatusArray[i].pxStack,
(taskStatusArray[i].pxTopOfStack - taskStatusArray[i].pxStack) * sizeof(StackType_t),
taskStatusArray[i].usStackHighWaterMark * sizeof(StackType_t));
*/
}
OS_Free(taskStatusArray);
#endif
}
#endif
|
