dfs_mqueue.c 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241
  1. /*
  2. * Copyright (c) 2006-2023, RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2023-07-04 zhkag first Version
  9. */
  10. #include <rtthread.h>
  11. #include <rthw.h>
  12. #include <dfs.h>
  13. #include <dfs_fs.h>
  14. #include <dfs_file.h>
  15. #include <dfs_dentry.h>
  16. #include <dfs_mnt.h>
  17. #include "dfs_mqueue.h"
  18. static rt_list_t _mqueue_file_list = RT_LIST_OBJECT_INIT(_mqueue_file_list);
  19. struct rt_spinlock mqueue_lock;
  20. void dfs_mqueue_insert_after(rt_list_t *n) {
  21. rt_spin_lock(&mqueue_lock);
  22. rt_list_insert_after(&(_mqueue_file_list), n);
  23. rt_spin_unlock(&mqueue_lock);
  24. }
  25. struct mqueue_file *dfs_mqueue_lookup(const char *path, rt_size_t *size) {
  26. struct mqueue_file *file;
  27. rt_list_t *node;
  28. rt_spin_lock(&mqueue_lock);
  29. rt_list_for_each(node, &_mqueue_file_list) {
  30. file = rt_list_entry(node, struct mqueue_file, list);
  31. if (rt_strncmp(file->name, path, RT_NAME_MAX) == 0) {
  32. *size = file->size;
  33. rt_spin_unlock(&mqueue_lock);
  34. return file;
  35. }
  36. }
  37. rt_spin_unlock(&mqueue_lock);
  38. return RT_NULL;
  39. }
  40. int dfs_mqueue_mount(struct dfs_mnt *mnt, unsigned long rwflag, const void *data) {
  41. return RT_EOK;
  42. }
  43. int dfs_mqueue_umount(struct dfs_mnt *mnt) {
  44. return RT_EOK;
  45. }
  46. int dfs_mqueue_statfs(struct dfs_mnt *mnt, struct statfs *buf) {
  47. return RT_EOK;
  48. }
  49. int dfs_mqueue_close(struct dfs_file *file) {
  50. return RT_EOK;
  51. }
  52. int dfs_mqueue_open(struct dfs_file *file) {
  53. return 0;
  54. }
  55. int dfs_mqueue_stat(struct dfs_dentry *dentry, struct stat *st) {
  56. struct dfs_vnode *vnode = RT_NULL;
  57. if (dentry && dentry->vnode) {
  58. vnode = dentry->vnode;
  59. st->st_dev = 0;
  60. st->st_gid = vnode->gid;
  61. st->st_uid = vnode->uid;
  62. st->st_ino = 0;
  63. st->st_mode = vnode->mode;
  64. st->st_nlink = vnode->nlink;
  65. st->st_size = vnode->size;
  66. st->st_mtim.tv_nsec = vnode->mtime.tv_nsec;
  67. st->st_mtim.tv_sec = vnode->mtime.tv_sec;
  68. st->st_ctim.tv_nsec = vnode->ctime.tv_nsec;
  69. st->st_ctim.tv_sec = vnode->ctime.tv_sec;
  70. st->st_atim.tv_nsec = vnode->atime.tv_nsec;
  71. st->st_atim.tv_sec = vnode->atime.tv_sec;
  72. }
  73. return RT_EOK;
  74. }
  75. int dfs_mqueue_getdents(struct dfs_file *file, struct dirent *dirp, uint32_t count) {
  76. rt_size_t index, end;
  77. struct dirent *d;
  78. count = (count / sizeof(struct dirent));
  79. end = file->fpos + count;
  80. index = 0;
  81. count = 0;
  82. struct mqueue_file *mq_file;
  83. rt_list_t *node;
  84. rt_spin_lock(&mqueue_lock);
  85. rt_list_for_each(node, &_mqueue_file_list) {
  86. if (index >= (rt_size_t)file->fpos) {
  87. mq_file = rt_list_entry(node, struct mqueue_file, list);
  88. d = dirp + count;
  89. d->d_namlen = RT_NAME_MAX;
  90. d->d_reclen = (rt_uint16_t)sizeof(struct dirent);
  91. rt_strncpy(d->d_name, mq_file->name, RT_NAME_MAX);
  92. count += 1;
  93. file->fpos += 1;
  94. }
  95. index += 1;
  96. if (index >= end) {
  97. break;
  98. }
  99. }
  100. rt_spin_unlock(&mqueue_lock);
  101. return count * sizeof(struct dirent);
  102. }
  103. int dfs_mqueue_unlink(struct dfs_dentry *dentry) {
  104. rt_size_t size;
  105. struct mqueue_file *mq_file;
  106. mq_file = dfs_mqueue_lookup(dentry->pathname + 1, &size);
  107. if (mq_file == RT_NULL)
  108. return -ENOENT;
  109. rt_list_remove(&(mq_file->list));
  110. if (mq_file->data != RT_NULL)
  111. rt_mq_delete((rt_mq_t)mq_file->data);
  112. rt_free(mq_file);
  113. return RT_EOK;
  114. }
  115. static struct dfs_vnode *dfs_mqueue_create_vnode(struct dfs_dentry *dentry, int type, mode_t mode) {
  116. struct dfs_vnode *vnode = RT_NULL;
  117. rt_size_t size;
  118. struct mqueue_file *mq_file;
  119. if (dentry == NULL || dentry->mnt == NULL) {
  120. return NULL;
  121. }
  122. vnode = dfs_vnode_create();
  123. if (vnode) {
  124. mq_file = dfs_mqueue_lookup(dentry->pathname + 1, &size);
  125. if (mq_file == RT_NULL) {
  126. mq_file = (struct mqueue_file *)rt_malloc(sizeof(struct mqueue_file));
  127. if (mq_file == RT_NULL) {
  128. return NULL;
  129. }
  130. mq_file->msg_size = 8192;
  131. mq_file->max_msgs = 10;
  132. strncpy(mq_file->name, dentry->pathname + 1, RT_NAME_MAX);
  133. dfs_mqueue_insert_after(&(mq_file->list));
  134. }
  135. vnode->mode = S_IFREG | (S_IRWXU | S_IRWXG | S_IRWXO);
  136. vnode->type = FT_REGULAR;
  137. rt_mq_t mq = rt_mq_create(dentry->pathname + 1, mq_file->msg_size, mq_file->max_msgs,
  138. RT_IPC_FLAG_FIFO);
  139. mq_file->data = (void *)mq;
  140. vnode->data = mq_file;
  141. vnode->size = 0;
  142. }
  143. return vnode;
  144. }
  145. static int dfs_mqueue_free_vnode(struct dfs_vnode *vnode) {
  146. /* nothing to be freed */
  147. if (vnode && vnode->ref_count <= 1) {
  148. vnode->data = NULL;
  149. }
  150. return 0;
  151. }
  152. static const struct dfs_file_ops _mqueue_fops = {
  153. .open = dfs_mqueue_open,
  154. .close = dfs_mqueue_close,
  155. .getdents = dfs_mqueue_getdents,
  156. };
  157. struct dfs_vnode *_dfs_mqueue_lookup(struct dfs_dentry *dentry) {
  158. struct dfs_vnode *vnode = RT_NULL;
  159. rt_size_t size;
  160. // struct tmpfs_sb *superblock;
  161. struct mqueue_file *mq_file;
  162. if (dentry == NULL || dentry->mnt == NULL) {
  163. return NULL;
  164. }
  165. if (dentry->pathname[0] == '/' && dentry->pathname[1] == '\0') {
  166. }
  167. mq_file = dfs_mqueue_lookup(dentry->pathname + 1, &size);
  168. vnode = dfs_vnode_create();
  169. if (mq_file && mq_file->data) {
  170. vnode->mode = S_IFREG | (S_IRWXU | S_IRWXG | S_IRWXO);
  171. vnode->type = FT_REGULAR;
  172. vnode->mnt = dentry->mnt;
  173. vnode->data = mq_file;
  174. vnode->size = mq_file->size;
  175. } else {
  176. vnode->size = 0;
  177. vnode->nlink = 1;
  178. vnode->fops = &_mqueue_fops;
  179. vnode->mnt = dentry->mnt;
  180. vnode->type = FT_DIRECTORY;
  181. vnode->mode = S_IFDIR | (S_IRUSR | S_IXUSR | S_IRGRP | S_IXGRP | S_IROTH | S_IXOTH);
  182. }
  183. return vnode;
  184. }
  185. static const struct dfs_filesystem_ops _mqueue_ops = {
  186. .name = "mqueue",
  187. .flags = DFS_FS_FLAG_DEFAULT,
  188. .default_fops = &_mqueue_fops,
  189. .mount = dfs_mqueue_mount,
  190. .umount = dfs_mqueue_umount,
  191. .statfs = dfs_mqueue_statfs,
  192. .unlink = dfs_mqueue_unlink,
  193. .stat = dfs_mqueue_stat,
  194. .lookup = _dfs_mqueue_lookup,
  195. .create_vnode = dfs_mqueue_create_vnode,
  196. .free_vnode = dfs_mqueue_free_vnode
  197. };
  198. static struct dfs_filesystem_type _mqueue = {
  199. .fs_ops = &_mqueue_ops,
  200. };
  201. int dfs_mqueue_init(void) {
  202. /* register mqueue file system */
  203. dfs_register(&_mqueue);
  204. mkdir("/dev/mqueue", 0x777);
  205. if (dfs_mount(RT_NULL, "/dev/mqueue", "mqueue", 0, 0) != 0)
  206. {
  207. rt_kprintf("Dir /dev/mqueue mount failed!\n");
  208. }
  209. return 0;
  210. }
  211. INIT_COMPONENT_EXPORT(dfs_mqueue_init);