Rev 2655 | Rev 2663 | Go to most recent revision | Show entire file | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2655 | Rev 2658 | ||
---|---|---|---|
Line 43... | Line 43... | ||
43 | #include <errno.h> |
43 | #include <errno.h> |
44 | #include <atomic.h> |
44 | #include <atomic.h> |
45 | #include <stdlib.h> |
45 | #include <stdlib.h> |
46 | #include <string.h> |
46 | #include <string.h> |
47 | #include <stdio.h> |
47 | #include <stdio.h> |
- | 48 | #include <sys/types.h> |
|
- | 49 | #include <libadt/hash_table.h> |
|
- | 50 | #include <as.h> |
|
- | 51 | ||
- | 52 | #define min(a, b) ((a) < (b) ? (a) : (b)) |
|
- | 53 | #define max(a, b) ((a) > (b) ? (a) : (b)) |
|
48 | 54 | ||
49 | #define PLB_GET_CHAR(i) (tmpfs_reg.plb_ro[(i) % PLB_SIZE]) |
55 | #define PLB_GET_CHAR(i) (tmpfs_reg.plb_ro[(i) % PLB_SIZE]) |
50 | 56 | ||
- | 57 | #define DENTRIES_BUCKETS 256 |
|
- | 58 | ||
- | 59 | /* |
|
- | 60 | * Hash table of all directory entries. |
|
- | 61 | */ |
|
- | 62 | hash_table_t dentries; |
|
- | 63 | ||
- | 64 | static hash_index_t dentries_hash(unsigned long *key) |
|
- | 65 | { |
|
- | 66 | return *key % DENTRIES_BUCKETS; |
|
- | 67 | } |
|
- | 68 | ||
- | 69 | static int dentries_compare(unsigned long *key, hash_count_t keys, |
|
- | 70 | link_t *item) |
|
- | 71 | { |
|
- | 72 | tmpfs_dentry_t *dentry = hash_table_get_instance(item, tmpfs_dentry_t, |
|
- | 73 | dh_link); |
|
- | 74 | return dentry->index == *key; |
|
- | 75 | } |
|
- | 76 | ||
- | 77 | static void dentries_remove_callback(link_t *item) |
|
- | 78 | { |
|
- | 79 | } |
|
- | 80 | ||
- | 81 | /** TMPFS dentries hash table operations. */ |
|
- | 82 | hash_table_operations_t dentries_ops = { |
|
- | 83 | .hash = dentries_hash, |
|
- | 84 | .compare = dentries_compare, |
|
- | 85 | .remove_callback = dentries_remove_callback |
|
- | 86 | }; |
|
- | 87 | ||
51 | unsigned tmpfs_next_index = 1; |
88 | unsigned tmpfs_next_index = 1; |
52 | 89 | ||
53 | static void tmpfs_dentry_initialize(tmpfs_dentry_t *dentry) |
90 | static void tmpfs_dentry_initialize(tmpfs_dentry_t *dentry) |
54 | { |
91 | { |
55 | dentry->index = 0; |
92 | dentry->index = 0; |
Line 58... | Line 95... | ||
58 | dentry->child = NULL; |
95 | dentry->child = NULL; |
59 | dentry->name = NULL; |
96 | dentry->name = NULL; |
60 | dentry->type = TMPFS_NONE; |
97 | dentry->type = TMPFS_NONE; |
61 | dentry->size = 0; |
98 | dentry->size = 0; |
62 | dentry->data = NULL; |
99 | dentry->data = NULL; |
- | 100 | link_initialize(&dentry->dh_link); |
|
63 | } |
101 | } |
64 | 102 | ||
65 | /* |
103 | /* |
66 | * For now, we don't distinguish between different dev_handles/instances. All |
104 | * For now, we don't distinguish between different dev_handles/instances. All |
67 | * requests resolve to the only instance, rooted in the following variable. |
105 | * requests resolve to the only instance, rooted in the following variable. |
68 | */ |
106 | */ |
69 | static tmpfs_dentry_t *root; |
107 | static tmpfs_dentry_t *root; |
70 | 108 | ||
71 | static bool tmpfs_init(void) |
109 | static bool tmpfs_init(void) |
72 | { |
110 | { |
- | 111 | if (!hash_table_create(&dentries, DENTRIES_BUCKETS, 1, &dentries_ops)) |
|
- | 112 | return false; |
|
- | 113 | ||
73 | root = (tmpfs_dentry_t *) malloc(sizeof(tmpfs_dentry_t)); |
114 | root = (tmpfs_dentry_t *) malloc(sizeof(tmpfs_dentry_t)); |
74 | if (!root) { |
115 | if (!root) |
75 | return false; |
116 | return false; |
76 | } |
- | |
77 | tmpfs_dentry_initialize(root); |
117 | tmpfs_dentry_initialize(root); |
78 | root->index = tmpfs_next_index++; |
118 | root->index = tmpfs_next_index++; |
79 | root->name = ""; |
119 | root->name = ""; |
80 | root->type = TMPFS_DIRECTORY; |
120 | root->type = TMPFS_DIRECTORY; |
- | 121 | hash_table_insert(&dentries, &root->index, &root->dh_link); |
|
81 | 122 | ||
82 | /* |
123 | /* |
83 | * This is only for debugging. Once we can create files and directories |
124 | * This is only for debugging. Once we can create files and directories |
84 | * using VFS, we can get rid of this. |
125 | * using VFS, we can get rid of this. |
85 | */ |
126 | */ |
Line 94... | Line 135... | ||
94 | d->index = tmpfs_next_index++; |
135 | d->index = tmpfs_next_index++; |
95 | root->child = d; |
136 | root->child = d; |
96 | d->parent = root; |
137 | d->parent = root; |
97 | d->type = TMPFS_DIRECTORY; |
138 | d->type = TMPFS_DIRECTORY; |
98 | d->name = "dir1"; |
139 | d->name = "dir1"; |
- | 140 | hash_table_insert(&dentries, &d->index, &d->dh_link); |
|
99 | 141 | ||
100 | d = (tmpfs_dentry_t *) malloc(sizeof(tmpfs_dentry_t)); |
142 | d = (tmpfs_dentry_t *) malloc(sizeof(tmpfs_dentry_t)); |
101 | if (!d) { |
143 | if (!d) { |
102 | free(root->child); |
144 | free(root->child); |
103 | free(root); |
145 | free(root); |
Line 108... | Line 150... | ||
108 | d->index = tmpfs_next_index++; |
150 | d->index = tmpfs_next_index++; |
109 | root->child->sibling = d; |
151 | root->child->sibling = d; |
110 | d->parent = root; |
152 | d->parent = root; |
111 | d->type = TMPFS_DIRECTORY; |
153 | d->type = TMPFS_DIRECTORY; |
112 | d->name = "dir2"; |
154 | d->name = "dir2"; |
- | 155 | hash_table_insert(&dentries, &d->index, &d->dh_link); |
|
113 | 156 | ||
114 | d = (tmpfs_dentry_t *) malloc(sizeof(tmpfs_dentry_t)); |
157 | d = (tmpfs_dentry_t *) malloc(sizeof(tmpfs_dentry_t)); |
115 | if (!d) { |
158 | if (!d) { |
116 | free(root->child->sibling); |
159 | free(root->child->sibling); |
117 | free(root->child); |
160 | free(root->child); |
Line 125... | Line 168... | ||
125 | d->parent = root->child; |
168 | d->parent = root->child; |
126 | d->type = TMPFS_FILE; |
169 | d->type = TMPFS_FILE; |
127 | d->name = "file1"; |
170 | d->name = "file1"; |
128 | d->data = "This is the contents of /dir1/file1.\n"; |
171 | d->data = "This is the contents of /dir1/file1.\n"; |
129 | d->size = strlen(d->data); |
172 | d->size = strlen(d->data); |
- | 173 | hash_table_insert(&dentries, &d->index, &d->dh_link); |
|
130 | 174 | ||
131 | d = (tmpfs_dentry_t *) malloc(sizeof(tmpfs_dentry_t)); |
175 | d = (tmpfs_dentry_t *) malloc(sizeof(tmpfs_dentry_t)); |
132 | if (!d) { |
176 | if (!d) { |
133 | free(root->child->sibling); |
177 | free(root->child->sibling); |
134 | free(root->child->child); |
178 | free(root->child->child); |
Line 143... | Line 187... | ||
143 | d->parent = root->child->sibling; |
187 | d->parent = root->child->sibling; |
144 | d->type = TMPFS_FILE; |
188 | d->type = TMPFS_FILE; |
145 | d->name = "file2"; |
189 | d->name = "file2"; |
146 | d->data = "This is the contents of /dir2/file2.\n"; |
190 | d->data = "This is the contents of /dir2/file2.\n"; |
147 | d->size = strlen(d->data); |
191 | d->size = strlen(d->data); |
- | 192 | hash_table_insert(&dentries, &d->index, &d->dh_link); |
|
148 | 193 | ||
149 | return true; |
194 | return true; |
150 | } |
195 | } |
151 | 196 | ||
152 | /** Compare one component of path to a directory entry. |
197 | /** Compare one component of path to a directory entry. |
Line 230... | Line 275... | ||
230 | } |
275 | } |
231 | 276 | ||
232 | ipc_answer_3(rid, EOK, tmpfs_reg.fs_handle, dev_handle, dcur->index); |
277 | ipc_answer_3(rid, EOK, tmpfs_reg.fs_handle, dev_handle, dcur->index); |
233 | } |
278 | } |
234 | 279 | ||
- | 280 | void tmpfs_read(ipc_callid_t rid, ipc_call_t *request) |
|
- | 281 | { |
|
- | 282 | int dev_handle = IPC_GET_ARG1(*request); |
|
- | 283 | unsigned long index = IPC_GET_ARG2(*request); |
|
- | 284 | off_t pos = IPC_GET_ARG3(*request); |
|
- | 285 | size_t size = IPC_GET_ARG4(*request); |
|
- | 286 | ||
- | 287 | /* |
|
- | 288 | * Lookup the respective dentry. |
|
- | 289 | */ |
|
- | 290 | link_t *hlp; |
|
- | 291 | hlp = hash_table_find(&dentries, &index); |
|
- | 292 | if (!hlp) { |
|
- | 293 | ipc_answer_0(rid, ENOENT); |
|
- | 294 | return; |
|
- | 295 | } |
|
- | 296 | tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t, |
|
- | 297 | dh_link); |
|
- | 298 | ||
- | 299 | /* |
|
- | 300 | * Receive the communication area. |
|
- | 301 | */ |
|
- | 302 | ipc_callid_t callid; |
|
- | 303 | ipc_call_t call; |
|
- | 304 | callid = async_get_call(&call); |
|
- | 305 | if (IPC_GET_METHOD(call) != IPC_M_AS_AREA_SEND) { |
|
- | 306 | ipc_answer_0(callid, EINVAL); |
|
- | 307 | ipc_answer_0(rid, EINVAL); |
|
- | 308 | return; |
|
- | 309 | } |
|
- | 310 | ||
- | 311 | int flags = IPC_GET_ARG3(call); |
|
- | 312 | if (!(flags & AS_AREA_WRITE)) { |
|
- | 313 | ipc_answer_0(callid, EINVAL); |
|
- | 314 | ipc_answer_0(rid, EINVAL); |
|
- | 315 | return; |
|
- | 316 | } |
|
- | 317 | size_t sz = IPC_GET_ARG2(call); |
|
- | 318 | uint8_t *buf = as_get_mappable_page(sz); |
|
- | 319 | if (!buf) { |
|
- | 320 | ipc_answer_0(callid, ENOMEM); |
|
- | 321 | ipc_answer_0(rid, ENOMEM); |
|
- | 322 | return; |
|
- | 323 | } |
|
- | 324 | ipc_answer_1(callid, EOK, buf); /* commit to share the area */ |
|
- | 325 | ||
- | 326 | size_t bytes = max(0, min(dentry->size - pos, size)); |
|
- | 327 | memcpy(buf, dentry->data + pos, bytes); |
|
- | 328 | ||
- | 329 | (void) as_area_destroy(buf); |
|
- | 330 | ||
- | 331 | ipc_answer_1(rid, EOK, bytes); |
|
- | 332 | } |
|
- | 333 | ||
235 | /** |
334 | /** |
236 | * @} |
335 | * @} |
237 | */ |
336 | */ |