semaphore.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399
  1. /*
  2. * File : semaphore.c
  3. * This file is part of RT-Thread RTOS
  4. * COPYRIGHT (C) 2006 - 2010, RT-Thread Development Team
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License along
  17. * with this program; if not, write to the Free Software Foundation, Inc.,
  18. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  19. *
  20. * Change Logs:
  21. * Date Author Notes
  22. * 2010-10-26 Bernard the first version
  23. */
  24. #include <rtthread.h>
  25. #include <string.h>
  26. #include "semaphore.h"
  27. #include "pthread_internal.h"
  28. static sem_t *posix_sem_list = RT_NULL;
  29. static struct rt_semaphore posix_sem_lock;
  30. void posix_sem_system_init()
  31. {
  32. rt_sem_init(&posix_sem_lock, "psem", 1, RT_IPC_FLAG_FIFO);
  33. }
  34. rt_inline void posix_sem_insert(sem_t *psem)
  35. {
  36. psem->next = posix_sem_list;
  37. posix_sem_list = psem;
  38. }
  39. static void posix_sem_delete(sem_t *psem)
  40. {
  41. sem_t *iter;
  42. if (posix_sem_list == psem)
  43. {
  44. posix_sem_list = psem->next;
  45. rt_sem_delete(psem->sem);
  46. rt_free(psem);
  47. return;
  48. }
  49. for (iter = posix_sem_list; iter->next != RT_NULL; iter = iter->next)
  50. {
  51. if (iter->next == psem)
  52. {
  53. /* delete this mq */
  54. if (psem->next != RT_NULL)
  55. iter->next = psem->next;
  56. else
  57. iter->next = RT_NULL;
  58. /* delete RT-Thread mqueue */
  59. rt_sem_delete(psem->sem);
  60. rt_free(psem);
  61. return ;
  62. }
  63. }
  64. }
  65. static sem_t *posix_sem_find(const char* name)
  66. {
  67. sem_t *iter;
  68. rt_object_t object;
  69. for (iter = posix_sem_list; iter != RT_NULL; iter = iter->next)
  70. {
  71. object = (rt_object_t)&(iter->sem);
  72. if (strncmp(object->name, name, RT_NAME_MAX) == 0)
  73. {
  74. return iter;
  75. }
  76. }
  77. return RT_NULL;
  78. }
  79. int sem_close(sem_t *sem)
  80. {
  81. if (sem == RT_NULL)
  82. {
  83. rt_set_errno(EINVAL);
  84. return -1;
  85. }
  86. /* lock posix semaphore list */
  87. rt_sem_take(&posix_sem_lock, RT_WAITING_FOREVER);
  88. sem->refcount --;
  89. if (sem->refcount == 0)
  90. {
  91. /* delete from posix semaphore list */
  92. if (sem->unlinked)
  93. posix_sem_delete(sem);
  94. sem = RT_NULL;
  95. }
  96. rt_sem_release(&posix_sem_lock);
  97. return 0;
  98. }
  99. RTM_EXPORT(sem_close);
  100. int sem_destroy(sem_t *sem)
  101. {
  102. rt_err_t result;
  103. if ((!sem) || !(sem->unamed))
  104. {
  105. rt_set_errno(EINVAL);
  106. return -1;
  107. }
  108. /* lock posix semaphore list */
  109. rt_sem_take(&posix_sem_lock, RT_WAITING_FOREVER);
  110. result = rt_sem_trytake(sem->sem);
  111. if (result != RT_EOK)
  112. {
  113. rt_sem_release(&posix_sem_lock);
  114. rt_set_errno(EBUSY);
  115. return -1;
  116. }
  117. /* destroy an unamed posix semaphore */
  118. posix_sem_delete(sem);
  119. rt_sem_release(&posix_sem_lock);
  120. return 0;
  121. }
  122. RTM_EXPORT(sem_destroy);
  123. int sem_unlink(const char *name)
  124. {
  125. sem_t *psem;
  126. /* lock posix semaphore list */
  127. rt_sem_take(&posix_sem_lock, RT_WAITING_FOREVER);
  128. psem = posix_sem_find(name);
  129. if (psem != RT_NULL)
  130. {
  131. psem->unlinked = 1;
  132. if (psem->refcount == 0)
  133. {
  134. /* remove this semaphore */
  135. posix_sem_delete(psem);
  136. }
  137. rt_sem_release(&posix_sem_lock);
  138. return 0;
  139. }
  140. rt_sem_release(&posix_sem_lock);
  141. /* no this entry */
  142. rt_set_errno(ENOENT);
  143. return -1;
  144. }
  145. RTM_EXPORT(sem_unlink);
  146. int sem_getvalue(sem_t *sem, int *sval)
  147. {
  148. if (!sem || !sval)
  149. {
  150. rt_set_errno(EINVAL);
  151. return -1;
  152. }
  153. *sval = sem->sem->value;
  154. return 0;
  155. }
  156. RTM_EXPORT(sem_getvalue);
  157. int sem_init(sem_t *sem, int pshared, unsigned int value)
  158. {
  159. char name[RT_NAME_MAX];
  160. static rt_uint16_t psem_number = 0;
  161. if (sem == RT_NULL)
  162. {
  163. rt_set_errno(EINVAL);
  164. return -1;
  165. }
  166. rt_snprintf(name, sizeof(name), "psem%02d", psem_number++);
  167. sem->sem = rt_sem_create(name, value, RT_IPC_FLAG_FIFO);
  168. if (sem == RT_NULL)
  169. {
  170. rt_set_errno(ENOMEM);
  171. return -1;
  172. }
  173. /* initialize posix semaphore */
  174. sem->refcount = 1;
  175. sem->unlinked = 0;
  176. sem->unamed = 1;
  177. /* lock posix semaphore list */
  178. rt_sem_take(&posix_sem_lock, RT_WAITING_FOREVER);
  179. posix_sem_insert(sem);
  180. rt_sem_release(&posix_sem_lock);
  181. return 0;
  182. }
  183. RTM_EXPORT(sem_init);
  184. sem_t *sem_open(const char *name, int oflag, ...)
  185. {
  186. sem_t* sem;
  187. va_list arg;
  188. unsigned int value;
  189. sem = RT_NULL;
  190. /* lock posix semaphore list */
  191. rt_sem_take(&posix_sem_lock, RT_WAITING_FOREVER);
  192. if (oflag & O_CREAT)
  193. {
  194. va_start(arg, oflag);
  195. value = va_arg( arg, unsigned int);
  196. va_end(arg);
  197. if (oflag & O_EXCL)
  198. {
  199. if (posix_sem_find(name) != RT_NULL)
  200. {
  201. rt_set_errno(EEXIST);
  202. goto __return;
  203. }
  204. }
  205. sem = (sem_t*) rt_malloc (sizeof(struct posix_sem));
  206. if (sem == RT_NULL)
  207. {
  208. rt_set_errno(ENFILE);
  209. goto __return;
  210. }
  211. /* create RT-Thread semaphore */
  212. sem->sem = rt_sem_create(name, value, RT_IPC_FLAG_FIFO);
  213. if (sem->sem == RT_NULL) /* create failed */
  214. {
  215. rt_set_errno(ENFILE);
  216. goto __return;
  217. }
  218. /* initialize reference count */
  219. sem->refcount = 1;
  220. sem->unlinked = 0;
  221. sem->unamed = 0;
  222. /* insert semaphore to posix semaphore list */
  223. posix_sem_insert(sem);
  224. }
  225. else
  226. {
  227. /* find semaphore */
  228. sem = posix_sem_find(name);
  229. if (sem != RT_NULL)
  230. {
  231. sem->refcount ++; /* increase reference count */
  232. }
  233. else
  234. {
  235. rt_set_errno(ENOENT);
  236. goto __return;
  237. }
  238. }
  239. rt_sem_release(&posix_sem_lock);
  240. return sem;
  241. __return:
  242. /* release lock */
  243. rt_sem_release(&posix_sem_lock);
  244. /* release allocated memory */
  245. if (sem != RT_NULL)
  246. {
  247. /* delete RT-Thread semaphore */
  248. if (sem->sem != RT_NULL)
  249. rt_sem_delete(sem->sem);
  250. rt_free(sem);
  251. }
  252. return RT_NULL;
  253. }
  254. RTM_EXPORT(sem_open);
  255. int sem_post(sem_t *sem)
  256. {
  257. rt_err_t result;
  258. if (!sem)
  259. {
  260. rt_set_errno(EINVAL);
  261. return -1;
  262. }
  263. result = rt_sem_release(sem->sem);
  264. if (result == RT_EOK)
  265. return 0;
  266. rt_set_errno(EINVAL);
  267. return -1;
  268. }
  269. RTM_EXPORT(sem_post);
  270. int sem_timedwait(sem_t *sem, const struct timespec *abs_timeout)
  271. {
  272. rt_err_t result;
  273. rt_int32_t tick;
  274. if (!sem || !abs_timeout)
  275. return EINVAL;
  276. /* calculate os tick */
  277. tick = clock_time_to_tick(abs_timeout);
  278. result = rt_sem_take(sem->sem, tick);
  279. if (result == -RT_ETIMEOUT)
  280. {
  281. rt_set_errno(ETIMEDOUT);
  282. return -1;
  283. }
  284. if (result == RT_EOK)
  285. return 0;
  286. rt_set_errno(EINTR);
  287. return -1;
  288. }
  289. RTM_EXPORT(sem_timedwait);
  290. int sem_trywait(sem_t *sem)
  291. {
  292. rt_err_t result;
  293. if (!sem)
  294. {
  295. rt_set_errno(EINVAL);
  296. return -1;
  297. }
  298. result = rt_sem_take(sem->sem, RT_WAITING_FOREVER);
  299. if (result == -RT_ETIMEOUT)
  300. {
  301. rt_set_errno(EAGAIN);
  302. return -1;
  303. }
  304. if (result == RT_EOK)
  305. return 0;
  306. rt_set_errno(EINTR);
  307. return -1;
  308. }
  309. RTM_EXPORT(sem_trywait);
  310. int sem_wait(sem_t *sem)
  311. {
  312. rt_err_t result;
  313. if (!sem)
  314. {
  315. rt_set_errno(EINVAL);
  316. return -1;
  317. }
  318. result = rt_sem_take(sem->sem, RT_WAITING_FOREVER);
  319. if (result == RT_EOK)
  320. return 0;
  321. rt_set_errno(EINTR);
  322. return -1;
  323. }
  324. RTM_EXPORT(sem_wait);