mqueue.c 7.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341
  1. /*
  2. * File : mqueue.c
  3. * This file is part of RT-Thread RTOS
  4. * COPYRIGHT (C) 2012, 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. */
  23. #include <string.h>
  24. #include "mqueue.h"
  25. #include "pthread_internal.h"
  26. static mqd_t posix_mq_list = RT_NULL;
  27. static struct rt_semaphore posix_mq_lock;
  28. void posix_mq_system_init()
  29. {
  30. rt_sem_init(&posix_mq_lock, "pmq", 1, RT_IPC_FLAG_FIFO);
  31. }
  32. rt_inline void posix_mq_insert(mqd_t pmq)
  33. {
  34. pmq->next = posix_mq_list;
  35. posix_mq_list = pmq;
  36. }
  37. static void posix_mq_delete(mqd_t pmq)
  38. {
  39. mqd_t iter;
  40. if (posix_mq_list == pmq)
  41. {
  42. posix_mq_list = pmq->next;
  43. rt_mq_delete(pmq->mq);
  44. rt_free(pmq);
  45. return;
  46. }
  47. for (iter = posix_mq_list; iter->next != RT_NULL; iter = iter->next)
  48. {
  49. if (iter->next == pmq)
  50. {
  51. /* delete this mq */
  52. if (pmq->next != RT_NULL)
  53. iter->next = pmq->next;
  54. else
  55. iter->next = RT_NULL;
  56. /* delete RT-Thread mqueue */
  57. rt_mq_delete(pmq->mq);
  58. rt_free(pmq);
  59. return ;
  60. }
  61. }
  62. }
  63. static mqd_t posix_mq_find(const char* name)
  64. {
  65. mqd_t iter;
  66. rt_object_t object;
  67. for (iter = posix_mq_list; iter != RT_NULL; iter = iter->next)
  68. {
  69. object = (rt_object_t)(iter->mq);
  70. if (strncmp(object->name, name, RT_NAME_MAX) == 0)
  71. {
  72. return iter;
  73. }
  74. }
  75. return RT_NULL;
  76. }
  77. int mq_setattr(mqd_t mqdes,
  78. const struct mq_attr *mqstat,
  79. struct mq_attr *omqstat)
  80. {
  81. rt_set_errno(-RT_ERROR);
  82. return -1;
  83. }
  84. RTM_EXPORT(mq_setattr);
  85. int mq_getattr(mqd_t mqdes, struct mq_attr *mqstat)
  86. {
  87. if ((mqdes == RT_NULL) || mqstat == RT_NULL)
  88. {
  89. rt_set_errno(EBADF);
  90. return -1;
  91. }
  92. mqstat->mq_maxmsg = mqdes->mq->max_msgs;
  93. mqstat->mq_msgsize = mqdes->mq->msg_size;
  94. mqstat->mq_curmsgs = 0;
  95. mqstat->mq_flags = 0;
  96. return 0;
  97. }
  98. RTM_EXPORT(mq_getattr);
  99. mqd_t mq_open(const char *name, int oflag, ...)
  100. {
  101. mqd_t mqdes;
  102. va_list arg;
  103. struct mq_attr *attr = RT_NULL;
  104. /* lock posix mqueue list */
  105. rt_sem_take(&posix_mq_lock, RT_WAITING_FOREVER);
  106. mqdes = RT_NULL;
  107. if (oflag & O_CREAT)
  108. {
  109. va_start(arg, oflag);
  110. attr = (struct mq_attr *)va_arg(arg, struct mq_attr *);
  111. va_end(arg);
  112. if (oflag & O_EXCL)
  113. {
  114. if (posix_mq_find(name) != RT_NULL)
  115. {
  116. rt_set_errno(EEXIST);
  117. goto __return;
  118. }
  119. }
  120. mqdes = (mqd_t) rt_malloc (sizeof(struct mqdes));
  121. if (mqdes == RT_NULL)
  122. {
  123. rt_set_errno(ENFILE);
  124. goto __return;
  125. }
  126. /* create RT-Thread message queue */
  127. mqdes->mq = rt_mq_create(name, attr->mq_msgsize, attr->mq_maxmsg, RT_IPC_FLAG_FIFO);
  128. if (mqdes->mq == RT_NULL) /* create failed */
  129. {
  130. rt_set_errno(ENFILE);
  131. goto __return;
  132. }
  133. /* initialize reference count */
  134. mqdes->refcount = 1;
  135. mqdes->unlinked = 0;
  136. /* insert mq to posix mq list */
  137. posix_mq_insert(mqdes);
  138. }
  139. else
  140. {
  141. /* find mqueue */
  142. mqdes = posix_mq_find(name);
  143. if (mqdes != RT_NULL)
  144. {
  145. mqdes->refcount ++; /* increase reference count */
  146. }
  147. else
  148. {
  149. rt_set_errno(ENOENT);
  150. goto __return;
  151. }
  152. }
  153. rt_sem_release(&posix_mq_lock);
  154. return mqdes;
  155. __return:
  156. /* release lock */
  157. rt_sem_release(&posix_mq_lock);
  158. /* release allocated memory */
  159. if (mqdes != RT_NULL)
  160. {
  161. if (mqdes->mq != RT_NULL)
  162. {
  163. /* delete RT-Thread message queue */
  164. rt_mq_delete(mqdes->mq);
  165. }
  166. rt_free(mqdes);
  167. }
  168. return RT_NULL;
  169. }
  170. RTM_EXPORT(mq_open);
  171. ssize_t mq_receive(mqd_t mqdes, char *msg_ptr, size_t msg_len, unsigned *msg_prio)
  172. {
  173. rt_err_t result;
  174. if ((mqdes == RT_NULL) || (msg_ptr == RT_NULL))
  175. {
  176. rt_set_errno(EINVAL);
  177. return -1;
  178. }
  179. result = rt_mq_recv(mqdes->mq, msg_ptr, msg_len, RT_WAITING_FOREVER);
  180. if (result == RT_EOK)
  181. return msg_len;
  182. rt_set_errno(EBADF);
  183. return -1;
  184. }
  185. RTM_EXPORT(mq_receive);
  186. int mq_send(mqd_t mqdes, const char *msg_ptr, size_t msg_len, unsigned msg_prio)
  187. {
  188. rt_err_t result;
  189. if ((mqdes == RT_NULL) || (msg_ptr == RT_NULL))
  190. {
  191. rt_set_errno(EINVAL);
  192. return -1;
  193. }
  194. result = rt_mq_send(mqdes->mq, (void*)msg_ptr, msg_len);
  195. if (result == RT_EOK)
  196. return 0;
  197. rt_set_errno(EBADF);
  198. return -1;
  199. }
  200. RTM_EXPORT(mq_send);
  201. ssize_t mq_timedreceive(mqd_t mqdes,
  202. char *msg_ptr,
  203. size_t msg_len,
  204. unsigned *msg_prio,
  205. const struct timespec *abs_timeout)
  206. {
  207. int tick;
  208. rt_err_t result;
  209. /* parameters check */
  210. if ((mqdes == RT_NULL) || (msg_ptr == RT_NULL))
  211. {
  212. rt_set_errno(EINVAL);
  213. return -1;
  214. }
  215. tick = clock_time_to_tick(abs_timeout);
  216. result = rt_mq_recv(mqdes->mq, msg_ptr, msg_len, tick);
  217. if (result == RT_EOK)
  218. return msg_len;
  219. if (result == -RT_ETIMEOUT)
  220. rt_set_errno(ETIMEDOUT);
  221. else
  222. rt_set_errno(EBADMSG);
  223. return -1;
  224. }
  225. RTM_EXPORT(mq_timedreceive);
  226. int mq_timedsend(mqd_t mqdes,
  227. const char *msg_ptr,
  228. size_t msg_len,
  229. unsigned msg_prio,
  230. const struct timespec *abs_timeout)
  231. {
  232. /* RT-Thread does not support timed send */
  233. return mq_send(mqdes, msg_ptr, msg_len, msg_prio);
  234. }
  235. RTM_EXPORT(mq_timedsend);
  236. int mq_notify(mqd_t mqdes, const struct sigevent *notification)
  237. {
  238. rt_set_errno(-RT_ERROR);
  239. return -1;
  240. }
  241. RTM_EXPORT(mq_notify);
  242. int mq_close(mqd_t mqdes)
  243. {
  244. if (mqdes == RT_NULL)
  245. {
  246. rt_set_errno(EINVAL);
  247. return -1;
  248. }
  249. /* lock posix mqueue list */
  250. rt_sem_take(&posix_mq_lock, RT_WAITING_FOREVER);
  251. mqdes->refcount --;
  252. if (mqdes->refcount == 0)
  253. {
  254. /* delete from posix mqueue list */
  255. if (mqdes->unlinked)
  256. posix_mq_delete(mqdes);
  257. }
  258. rt_sem_release(&posix_mq_lock);
  259. return 0;
  260. }
  261. RTM_EXPORT(mq_close);
  262. int mq_unlink(const char *name)
  263. {
  264. mqd_t pmq;
  265. /* lock posix mqueue list */
  266. rt_sem_take(&posix_mq_lock, RT_WAITING_FOREVER);
  267. pmq = posix_mq_find(name);
  268. if (pmq != RT_NULL)
  269. {
  270. pmq->unlinked = 1;
  271. if (pmq->refcount == 0)
  272. {
  273. /* remove this mqueue */
  274. posix_mq_delete(pmq);
  275. }
  276. rt_sem_release(&posix_mq_lock);
  277. return 0;
  278. }
  279. rt_sem_release(&posix_mq_lock);
  280. /* no this entry */
  281. rt_set_errno(ENOENT);
  282. return -1;
  283. }
  284. RTM_EXPORT(mq_unlink);