mqueue.c 7.7 KB

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