semaphore.c 8.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400
  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 "semaphore.h"
  26. #include "pthread_internal.h"
  27. static sem_t *posix_sem_list = RT_NULL;
  28. static struct rt_semaphore posix_sem_lock;
  29. void posix_sem_system_init()
  30. {
  31. rt_sem_init(&posix_sem_lock, "psem", 1, RT_IPC_FLAG_FIFO);
  32. }
  33. rt_inline void posix_sem_insert(sem_t *psem)
  34. {
  35. psem->next = posix_sem_list;
  36. posix_sem_list = psem;
  37. }
  38. static void posix_sem_delete(sem_t *psem)
  39. {
  40. sem_t *iter;
  41. if (posix_sem_list == psem)
  42. {
  43. posix_sem_list = psem->next;
  44. rt_sem_delete(psem->sem);
  45. rt_free(psem);
  46. return;
  47. }
  48. for (iter = posix_sem_list; iter->next != RT_NULL; iter = iter->next)
  49. {
  50. if (iter->next == psem)
  51. {
  52. /* delete this mq */
  53. if (psem->next != RT_NULL)
  54. iter->next = psem->next;
  55. else
  56. iter->next = RT_NULL;
  57. /* delete RT-Thread mqueue */
  58. rt_sem_delete(psem->sem);
  59. rt_free(psem);
  60. return ;
  61. }
  62. }
  63. }
  64. static sem_t *posix_sem_find(const char* name)
  65. {
  66. sem_t *iter;
  67. rt_object_t object;
  68. for (iter = posix_sem_list; iter != RT_NULL; iter = iter->next)
  69. {
  70. object = (rt_object_t)&(iter->sem);
  71. if (strncmp(object->name, name, RT_NAME_MAX) == 0)
  72. {
  73. return iter;
  74. }
  75. }
  76. return RT_NULL;
  77. }
  78. int sem_close(sem_t *sem)
  79. {
  80. if (sem == RT_NULL)
  81. {
  82. rt_set_errno(EINVAL);
  83. return -1;
  84. }
  85. /* lock posix semaphore list */
  86. rt_sem_take(&posix_sem_lock, RT_WAITING_FOREVER);
  87. sem->refcount --;
  88. if (sem->refcount == 0)
  89. {
  90. /* delete from posix semaphore list */
  91. if (sem->unlinked)
  92. posix_sem_delete(sem);
  93. sem = RT_NULL;
  94. }
  95. rt_sem_release(&posix_sem_lock);
  96. return 0;
  97. }
  98. RTM_EXPORT(sem_close);
  99. int sem_destroy(sem_t *sem)
  100. {
  101. rt_err_t result;
  102. if ((!sem) || !(sem->unamed))
  103. {
  104. rt_set_errno(EINVAL);
  105. return -1;
  106. }
  107. /* lock posix semaphore list */
  108. rt_sem_take(&posix_sem_lock, RT_WAITING_FOREVER);
  109. result = rt_sem_trytake(sem->sem);
  110. if (result != RT_EOK)
  111. {
  112. rt_sem_release(&posix_sem_lock);
  113. rt_set_errno(EBUSY);
  114. return -1;
  115. }
  116. /* destroy an unamed posix semaphore */
  117. posix_sem_delete(sem);
  118. rt_sem_release(&posix_sem_lock);
  119. return 0;
  120. }
  121. RTM_EXPORT(sem_destroy);
  122. int sem_unlink(const char *name)
  123. {
  124. sem_t *psem;
  125. /* lock posix semaphore list */
  126. rt_sem_take(&posix_sem_lock, RT_WAITING_FOREVER);
  127. psem = posix_sem_find(name);
  128. if (psem != RT_NULL)
  129. {
  130. psem->unlinked = 1;
  131. if (psem->refcount == 0)
  132. {
  133. /* remove this semaphore */
  134. posix_sem_delete(psem);
  135. }
  136. rt_sem_release(&posix_sem_lock);
  137. return 0;
  138. }
  139. rt_sem_release(&posix_sem_lock);
  140. /* no this entry */
  141. rt_set_errno(ENOENT);
  142. return -1;
  143. }
  144. RTM_EXPORT(sem_unlink);
  145. int sem_getvalue(sem_t *sem, int *sval)
  146. {
  147. if (!sem || !sval)
  148. {
  149. rt_set_errno(EINVAL);
  150. return -1;
  151. }
  152. *sval = sem->sem->value;
  153. return 0;
  154. }
  155. RTM_EXPORT(sem_getvalue);
  156. int sem_init(sem_t *sem, int pshared, unsigned int value)
  157. {
  158. char name[RT_NAME_MAX];
  159. static rt_uint16_t psem_number = 0;
  160. if (sem == RT_NULL)
  161. {
  162. rt_set_errno(EINVAL);
  163. return -1;
  164. }
  165. rt_snprintf(name, sizeof(name), "psem%02d", psem_number++);
  166. sem->sem = rt_sem_create(name, value, RT_IPC_FLAG_FIFO);
  167. if (sem == RT_NULL)
  168. {
  169. rt_set_errno(ENOMEM);
  170. return -1;
  171. }
  172. /* initialize posix semaphore */
  173. sem->refcount = 1;
  174. sem->unlinked = 0;
  175. sem->unamed = 1;
  176. /* lock posix semaphore list */
  177. rt_sem_take(&posix_sem_lock, RT_WAITING_FOREVER);
  178. posix_sem_insert(sem);
  179. rt_sem_release(&posix_sem_lock);
  180. return 0;
  181. }
  182. RTM_EXPORT(sem_init);
  183. sem_t *sem_open(const char *name, int oflag, ...)
  184. {
  185. sem_t* sem;
  186. va_list arg;
  187. mode_t mode;
  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. mode = (mode_t) va_arg( arg, unsigned int); mode = mode;
  196. value = va_arg( arg, unsigned int);
  197. va_end(arg);
  198. if (oflag & O_EXCL)
  199. {
  200. if (posix_sem_find(name) != RT_NULL)
  201. {
  202. rt_set_errno(EEXIST);
  203. goto __return;
  204. }
  205. }
  206. sem = (sem_t*) rt_malloc (sizeof(struct posix_sem));
  207. if (sem == RT_NULL)
  208. {
  209. rt_set_errno(ENFILE);
  210. goto __return;
  211. }
  212. /* create RT-Thread semaphore */
  213. sem->sem = rt_sem_create(name, value, RT_IPC_FLAG_FIFO);
  214. if (sem->sem == RT_NULL) /* create failed */
  215. {
  216. rt_set_errno(ENFILE);
  217. goto __return;
  218. }
  219. /* initialize reference count */
  220. sem->refcount = 1;
  221. sem->unlinked = 0;
  222. sem->unamed = 0;
  223. /* insert semaphore to posix semaphore list */
  224. posix_sem_insert(sem);
  225. }
  226. else
  227. {
  228. /* find semaphore */
  229. sem = posix_sem_find(name);
  230. if (sem != RT_NULL)
  231. {
  232. sem->refcount ++; /* increase reference count */
  233. }
  234. else
  235. {
  236. rt_set_errno(ENOENT);
  237. goto __return;
  238. }
  239. }
  240. rt_sem_release(&posix_sem_lock);
  241. return sem;
  242. __return:
  243. /* release lock */
  244. rt_sem_release(&posix_sem_lock);
  245. /* release allocated memory */
  246. if (sem != RT_NULL)
  247. {
  248. /* delete RT-Thread semaphore */
  249. if (sem->sem != RT_NULL)
  250. rt_sem_delete(sem->sem);
  251. rt_free(sem);
  252. }
  253. return RT_NULL;
  254. }
  255. RTM_EXPORT(sem_open);
  256. int sem_post(sem_t *sem)
  257. {
  258. rt_err_t result;
  259. if (!sem)
  260. {
  261. rt_set_errno(EINVAL);
  262. return -1;
  263. }
  264. result = rt_sem_release(sem->sem);
  265. if (result == RT_EOK)
  266. return 0;
  267. rt_set_errno(EINVAL);
  268. return -1;
  269. }
  270. RTM_EXPORT(sem_post);
  271. int sem_timedwait(sem_t *sem, const struct timespec *abs_timeout)
  272. {
  273. rt_err_t result;
  274. rt_int32_t tick;
  275. if (!sem || !abs_timeout)
  276. return EINVAL;
  277. /* calculate os tick */
  278. tick = clock_time_to_tick(abs_timeout);
  279. result = rt_sem_take(sem->sem, tick);
  280. if (result == -RT_ETIMEOUT)
  281. {
  282. rt_set_errno(ETIMEDOUT);
  283. return -1;
  284. }
  285. if (result == RT_EOK)
  286. return 0;
  287. rt_set_errno(EINTR);
  288. return -1;
  289. }
  290. RTM_EXPORT(sem_timedwait);
  291. int sem_trywait(sem_t *sem)
  292. {
  293. rt_err_t result;
  294. if (!sem)
  295. {
  296. rt_set_errno(EINVAL);
  297. return -1;
  298. }
  299. result = rt_sem_take(sem->sem, RT_WAITING_FOREVER);
  300. if (result == -RT_ETIMEOUT)
  301. {
  302. rt_set_errno(EAGAIN);
  303. return -1;
  304. }
  305. if (result == RT_EOK)
  306. return 0;
  307. rt_set_errno(EINTR);
  308. return -1;
  309. }
  310. RTM_EXPORT(sem_trywait);
  311. int sem_wait(sem_t *sem)
  312. {
  313. rt_err_t result;
  314. if (!sem)
  315. {
  316. rt_set_errno(EINVAL);
  317. return -1;
  318. }
  319. result = rt_sem_take(sem->sem, RT_WAITING_FOREVER);
  320. if (result == RT_EOK)
  321. return 0;
  322. rt_set_errno(EINTR);
  323. return -1;
  324. }
  325. RTM_EXPORT(sem_wait);