Rev 3597 | Rev 4377 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 3597 | Rev 3675 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2008 Jakub Jermar |
2 | * Copyright (c) 2008 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
13 | * documentation and/or other materials provided with the distribution. |
14 | * - The name of the author may not be used to endorse or promote products |
14 | * - The name of the author may not be used to endorse or promote products |
15 | * derived from this software without specific prior written permission. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup fs |
29 | /** @addtogroup fs |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** |
33 | /** |
34 | * @file tmpfs_ops.c |
34 | * @file tmpfs_ops.c |
35 | * @brief Implementation of VFS operations for the TMPFS file system |
35 | * @brief Implementation of VFS operations for the TMPFS file system |
36 | * server. |
36 | * server. |
37 | */ |
37 | */ |
38 | 38 | ||
39 | #include "tmpfs.h" |
39 | #include "tmpfs.h" |
40 | #include "../../vfs/vfs.h" |
40 | #include "../../vfs/vfs.h" |
41 | #include <ipc/ipc.h> |
41 | #include <ipc/ipc.h> |
42 | #include <async.h> |
42 | #include <async.h> |
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 <assert.h> |
48 | #include <assert.h> |
49 | #include <sys/types.h> |
49 | #include <sys/types.h> |
50 | #include <libadt/hash_table.h> |
50 | #include <libadt/hash_table.h> |
51 | #include <as.h> |
51 | #include <as.h> |
52 | #include <libfs.h> |
52 | #include <libfs.h> |
53 | 53 | ||
54 | #define min(a, b) ((a) < (b) ? (a) : (b)) |
54 | #define min(a, b) ((a) < (b) ? (a) : (b)) |
55 | #define max(a, b) ((a) > (b) ? (a) : (b)) |
55 | #define max(a, b) ((a) > (b) ? (a) : (b)) |
56 | 56 | ||
57 | #define DENTRIES_BUCKETS 256 |
57 | #define DENTRIES_BUCKETS 256 |
58 | 58 | ||
59 | #define NAMES_BUCKETS 4 |
59 | #define NAMES_BUCKETS 4 |
60 | 60 | ||
61 | /* |
61 | /* |
62 | * For now, we don't distinguish between different dev_handles/instances. All |
62 | * For now, we don't distinguish between different dev_handles/instances. All |
63 | * requests resolve to the only instance, rooted in the following variable. |
63 | * requests resolve to the only instance, rooted in the following variable. |
64 | */ |
64 | */ |
65 | static tmpfs_dentry_t *root; |
65 | static tmpfs_dentry_t *root; |
66 | 66 | ||
67 | #define TMPFS_DEV 0 /**< Dummy device handle for TMPFS */ |
67 | #define TMPFS_DEV 0 /**< Dummy device handle for TMPFS */ |
68 | 68 | ||
69 | /* |
69 | /* |
70 | * Implementation of the libfs interface. |
70 | * Implementation of the libfs interface. |
71 | */ |
71 | */ |
72 | 72 | ||
73 | /* Forward declarations of static functions. */ |
73 | /* Forward declarations of static functions. */ |
74 | static void *tmpfs_match(void *, const char *); |
74 | static void *tmpfs_match(void *, const char *); |
75 | static void *tmpfs_node_get(dev_handle_t, fs_index_t); |
75 | static void *tmpfs_node_get(dev_handle_t, fs_index_t); |
76 | static void tmpfs_node_put(void *); |
76 | static void tmpfs_node_put(void *); |
77 | static void *tmpfs_create_node(dev_handle_t, int); |
77 | static void *tmpfs_create_node(dev_handle_t, int); |
78 | static bool tmpfs_link_node(void *, void *, const char *); |
78 | static int tmpfs_link_node(void *, void *, const char *); |
79 | static int tmpfs_unlink_node(void *, void *); |
79 | static int tmpfs_unlink_node(void *, void *); |
80 | static int tmpfs_destroy_node(void *); |
80 | static int tmpfs_destroy_node(void *); |
81 | 81 | ||
82 | /* Implementation of helper functions. */ |
82 | /* Implementation of helper functions. */ |
83 | static fs_index_t tmpfs_index_get(void *nodep) |
83 | static fs_index_t tmpfs_index_get(void *nodep) |
84 | { |
84 | { |
85 | return ((tmpfs_dentry_t *) nodep)->index; |
85 | return ((tmpfs_dentry_t *) nodep)->index; |
86 | } |
86 | } |
87 | 87 | ||
88 | static size_t tmpfs_size_get(void *nodep) |
88 | static size_t tmpfs_size_get(void *nodep) |
89 | { |
89 | { |
90 | return ((tmpfs_dentry_t *) nodep)->size; |
90 | return ((tmpfs_dentry_t *) nodep)->size; |
91 | } |
91 | } |
92 | 92 | ||
93 | static unsigned tmpfs_lnkcnt_get(void *nodep) |
93 | static unsigned tmpfs_lnkcnt_get(void *nodep) |
94 | { |
94 | { |
95 | return ((tmpfs_dentry_t *) nodep)->lnkcnt; |
95 | return ((tmpfs_dentry_t *) nodep)->lnkcnt; |
96 | } |
96 | } |
97 | 97 | ||
98 | static bool tmpfs_has_children(void *nodep) |
98 | static bool tmpfs_has_children(void *nodep) |
99 | { |
99 | { |
100 | return ((tmpfs_dentry_t *) nodep)->child != NULL; |
100 | return ((tmpfs_dentry_t *) nodep)->child != NULL; |
101 | } |
101 | } |
102 | 102 | ||
103 | static void *tmpfs_root_get(dev_handle_t dev_handle) |
103 | static void *tmpfs_root_get(dev_handle_t dev_handle) |
104 | { |
104 | { |
105 | return root; |
105 | return root; |
106 | } |
106 | } |
107 | 107 | ||
108 | static char tmpfs_plb_get_char(unsigned pos) |
108 | static char tmpfs_plb_get_char(unsigned pos) |
109 | { |
109 | { |
110 | return tmpfs_reg.plb_ro[pos % PLB_SIZE]; |
110 | return tmpfs_reg.plb_ro[pos % PLB_SIZE]; |
111 | } |
111 | } |
112 | 112 | ||
113 | static bool tmpfs_is_directory(void *nodep) |
113 | static bool tmpfs_is_directory(void *nodep) |
114 | { |
114 | { |
115 | return ((tmpfs_dentry_t *) nodep)->type == TMPFS_DIRECTORY; |
115 | return ((tmpfs_dentry_t *) nodep)->type == TMPFS_DIRECTORY; |
116 | } |
116 | } |
117 | 117 | ||
118 | static bool tmpfs_is_file(void *nodep) |
118 | static bool tmpfs_is_file(void *nodep) |
119 | { |
119 | { |
120 | return ((tmpfs_dentry_t *) nodep)->type == TMPFS_FILE; |
120 | return ((tmpfs_dentry_t *) nodep)->type == TMPFS_FILE; |
121 | } |
121 | } |
122 | 122 | ||
123 | /** libfs operations */ |
123 | /** libfs operations */ |
124 | libfs_ops_t tmpfs_libfs_ops = { |
124 | libfs_ops_t tmpfs_libfs_ops = { |
125 | .match = tmpfs_match, |
125 | .match = tmpfs_match, |
126 | .node_get = tmpfs_node_get, |
126 | .node_get = tmpfs_node_get, |
127 | .node_put = tmpfs_node_put, |
127 | .node_put = tmpfs_node_put, |
128 | .create = tmpfs_create_node, |
128 | .create = tmpfs_create_node, |
129 | .destroy = tmpfs_destroy_node, |
129 | .destroy = tmpfs_destroy_node, |
130 | .link = tmpfs_link_node, |
130 | .link = tmpfs_link_node, |
131 | .unlink = tmpfs_unlink_node, |
131 | .unlink = tmpfs_unlink_node, |
132 | .index_get = tmpfs_index_get, |
132 | .index_get = tmpfs_index_get, |
133 | .size_get = tmpfs_size_get, |
133 | .size_get = tmpfs_size_get, |
134 | .lnkcnt_get = tmpfs_lnkcnt_get, |
134 | .lnkcnt_get = tmpfs_lnkcnt_get, |
135 | .has_children = tmpfs_has_children, |
135 | .has_children = tmpfs_has_children, |
136 | .root_get = tmpfs_root_get, |
136 | .root_get = tmpfs_root_get, |
137 | .plb_get_char = tmpfs_plb_get_char, |
137 | .plb_get_char = tmpfs_plb_get_char, |
138 | .is_directory = tmpfs_is_directory, |
138 | .is_directory = tmpfs_is_directory, |
139 | .is_file = tmpfs_is_file |
139 | .is_file = tmpfs_is_file |
140 | }; |
140 | }; |
141 | 141 | ||
142 | /** Hash table of all directory entries. */ |
142 | /** Hash table of all directory entries. */ |
143 | hash_table_t dentries; |
143 | hash_table_t dentries; |
144 | 144 | ||
145 | /* Implementation of hash table interface for the dentries hash table. */ |
145 | /* Implementation of hash table interface for the dentries hash table. */ |
146 | static hash_index_t dentries_hash(unsigned long *key) |
146 | static hash_index_t dentries_hash(unsigned long *key) |
147 | { |
147 | { |
148 | return *key % DENTRIES_BUCKETS; |
148 | return *key % DENTRIES_BUCKETS; |
149 | } |
149 | } |
150 | 150 | ||
151 | static int dentries_compare(unsigned long *key, hash_count_t keys, |
151 | static int dentries_compare(unsigned long *key, hash_count_t keys, |
152 | link_t *item) |
152 | link_t *item) |
153 | { |
153 | { |
154 | tmpfs_dentry_t *dentry = hash_table_get_instance(item, tmpfs_dentry_t, |
154 | tmpfs_dentry_t *dentry = hash_table_get_instance(item, tmpfs_dentry_t, |
155 | dh_link); |
155 | dh_link); |
156 | return dentry->index == *key; |
156 | return dentry->index == *key; |
157 | } |
157 | } |
158 | 158 | ||
159 | static void dentries_remove_callback(link_t *item) |
159 | static void dentries_remove_callback(link_t *item) |
160 | { |
160 | { |
161 | } |
161 | } |
162 | 162 | ||
163 | /** TMPFS dentries hash table operations. */ |
163 | /** TMPFS dentries hash table operations. */ |
164 | hash_table_operations_t dentries_ops = { |
164 | hash_table_operations_t dentries_ops = { |
165 | .hash = dentries_hash, |
165 | .hash = dentries_hash, |
166 | .compare = dentries_compare, |
166 | .compare = dentries_compare, |
167 | .remove_callback = dentries_remove_callback |
167 | .remove_callback = dentries_remove_callback |
168 | }; |
168 | }; |
169 | 169 | ||
170 | fs_index_t tmpfs_next_index = 1; |
170 | fs_index_t tmpfs_next_index = 1; |
171 | 171 | ||
172 | typedef struct { |
172 | typedef struct { |
173 | char *name; |
173 | char *name; |
174 | tmpfs_dentry_t *parent; |
174 | tmpfs_dentry_t *parent; |
175 | link_t link; |
175 | link_t link; |
176 | } tmpfs_name_t; |
176 | } tmpfs_name_t; |
177 | 177 | ||
178 | /* Implementation of hash table interface for the names hash table. */ |
178 | /* Implementation of hash table interface for the names hash table. */ |
179 | static hash_index_t names_hash(unsigned long *key) |
179 | static hash_index_t names_hash(unsigned long *key) |
180 | { |
180 | { |
181 | tmpfs_dentry_t *dentry = (tmpfs_dentry_t *) *key; |
181 | tmpfs_dentry_t *dentry = (tmpfs_dentry_t *) *key; |
182 | return dentry->index % NAMES_BUCKETS; |
182 | return dentry->index % NAMES_BUCKETS; |
183 | } |
183 | } |
184 | 184 | ||
185 | static int names_compare(unsigned long *key, hash_count_t keys, link_t *item) |
185 | static int names_compare(unsigned long *key, hash_count_t keys, link_t *item) |
186 | { |
186 | { |
187 | tmpfs_dentry_t *dentry = (tmpfs_dentry_t *) *key; |
187 | tmpfs_dentry_t *dentry = (tmpfs_dentry_t *) *key; |
188 | tmpfs_name_t *namep = hash_table_get_instance(item, tmpfs_name_t, |
188 | tmpfs_name_t *namep = hash_table_get_instance(item, tmpfs_name_t, |
189 | link); |
189 | link); |
190 | return dentry == namep->parent; |
190 | return dentry == namep->parent; |
191 | } |
191 | } |
192 | 192 | ||
193 | static void names_remove_callback(link_t *item) |
193 | static void names_remove_callback(link_t *item) |
194 | { |
194 | { |
195 | tmpfs_name_t *namep = hash_table_get_instance(item, tmpfs_name_t, |
195 | tmpfs_name_t *namep = hash_table_get_instance(item, tmpfs_name_t, |
196 | link); |
196 | link); |
197 | free(namep->name); |
197 | free(namep->name); |
198 | free(namep); |
198 | free(namep); |
199 | } |
199 | } |
200 | 200 | ||
201 | /** TMPFS node names hash table operations. */ |
201 | /** TMPFS node names hash table operations. */ |
202 | static hash_table_operations_t names_ops = { |
202 | static hash_table_operations_t names_ops = { |
203 | .hash = names_hash, |
203 | .hash = names_hash, |
204 | .compare = names_compare, |
204 | .compare = names_compare, |
205 | .remove_callback = names_remove_callback |
205 | .remove_callback = names_remove_callback |
206 | }; |
206 | }; |
207 | 207 | ||
208 | static void tmpfs_name_initialize(tmpfs_name_t *namep) |
208 | static void tmpfs_name_initialize(tmpfs_name_t *namep) |
209 | { |
209 | { |
210 | namep->name = NULL; |
210 | namep->name = NULL; |
211 | namep->parent = NULL; |
211 | namep->parent = NULL; |
212 | link_initialize(&namep->link); |
212 | link_initialize(&namep->link); |
213 | } |
213 | } |
214 | 214 | ||
215 | static bool tmpfs_dentry_initialize(tmpfs_dentry_t *dentry) |
215 | static bool tmpfs_dentry_initialize(tmpfs_dentry_t *dentry) |
216 | { |
216 | { |
217 | dentry->index = 0; |
217 | dentry->index = 0; |
218 | dentry->sibling = NULL; |
218 | dentry->sibling = NULL; |
219 | dentry->child = NULL; |
219 | dentry->child = NULL; |
220 | dentry->type = TMPFS_NONE; |
220 | dentry->type = TMPFS_NONE; |
221 | dentry->lnkcnt = 0; |
221 | dentry->lnkcnt = 0; |
222 | dentry->size = 0; |
222 | dentry->size = 0; |
223 | dentry->data = NULL; |
223 | dentry->data = NULL; |
224 | link_initialize(&dentry->dh_link); |
224 | link_initialize(&dentry->dh_link); |
225 | return (bool)hash_table_create(&dentry->names, NAMES_BUCKETS, 1, |
225 | return (bool)hash_table_create(&dentry->names, NAMES_BUCKETS, 1, |
226 | &names_ops); |
226 | &names_ops); |
227 | } |
227 | } |
228 | 228 | ||
229 | static bool tmpfs_init(void) |
229 | static bool tmpfs_init(void) |
230 | { |
230 | { |
231 | if (!hash_table_create(&dentries, DENTRIES_BUCKETS, 1, &dentries_ops)) |
231 | if (!hash_table_create(&dentries, DENTRIES_BUCKETS, 1, &dentries_ops)) |
232 | return false; |
232 | return false; |
233 | root = (tmpfs_dentry_t *) tmpfs_create_node(TMPFS_DEV, L_DIRECTORY); |
233 | root = (tmpfs_dentry_t *) tmpfs_create_node(TMPFS_DEV, L_DIRECTORY); |
234 | if (!root) { |
234 | if (!root) { |
235 | hash_table_destroy(&dentries); |
235 | hash_table_destroy(&dentries); |
236 | return false; |
236 | return false; |
237 | } |
237 | } |
238 | root->lnkcnt = 0; /* FS root is not linked */ |
238 | root->lnkcnt = 0; /* FS root is not linked */ |
239 | return true; |
239 | return true; |
240 | } |
240 | } |
241 | 241 | ||
242 | /** Compare one component of path to a directory entry. |
242 | /** Compare one component of path to a directory entry. |
243 | * |
243 | * |
244 | * @param parentp Pointer to node from which we descended. |
244 | * @param parentp Pointer to node from which we descended. |
245 | * @param childp Pointer to node to compare the path component with. |
245 | * @param childp Pointer to node to compare the path component with. |
246 | * @param component Array of characters holding component name. |
246 | * @param component Array of characters holding component name. |
247 | * |
247 | * |
248 | * @return True on match, false otherwise. |
248 | * @return True on match, false otherwise. |
249 | */ |
249 | */ |
250 | static bool |
250 | static bool |
251 | tmpfs_match_one(tmpfs_dentry_t *parentp, tmpfs_dentry_t *childp, |
251 | tmpfs_match_one(tmpfs_dentry_t *parentp, tmpfs_dentry_t *childp, |
252 | const char *component) |
252 | const char *component) |
253 | { |
253 | { |
254 | unsigned long key = (unsigned long) parentp; |
254 | unsigned long key = (unsigned long) parentp; |
255 | link_t *hlp = hash_table_find(&childp->names, &key); |
255 | link_t *hlp = hash_table_find(&childp->names, &key); |
256 | assert(hlp); |
256 | assert(hlp); |
257 | tmpfs_name_t *namep = hash_table_get_instance(hlp, tmpfs_name_t, link); |
257 | tmpfs_name_t *namep = hash_table_get_instance(hlp, tmpfs_name_t, link); |
258 | return !strcmp(namep->name, component); |
258 | return !strcmp(namep->name, component); |
259 | } |
259 | } |
260 | 260 | ||
261 | void *tmpfs_match(void *prnt, const char *component) |
261 | void *tmpfs_match(void *prnt, const char *component) |
262 | { |
262 | { |
263 | tmpfs_dentry_t *parentp = (tmpfs_dentry_t *) prnt; |
263 | tmpfs_dentry_t *parentp = (tmpfs_dentry_t *) prnt; |
264 | tmpfs_dentry_t *childp = parentp->child; |
264 | tmpfs_dentry_t *childp = parentp->child; |
265 | 265 | ||
266 | while (childp && !tmpfs_match_one(parentp, childp, component)) |
266 | while (childp && !tmpfs_match_one(parentp, childp, component)) |
267 | childp = childp->sibling; |
267 | childp = childp->sibling; |
268 | 268 | ||
269 | return (void *) childp; |
269 | return (void *) childp; |
270 | } |
270 | } |
271 | 271 | ||
272 | void * |
272 | void * |
273 | tmpfs_node_get(dev_handle_t dev_handle, fs_index_t index) |
273 | tmpfs_node_get(dev_handle_t dev_handle, fs_index_t index) |
274 | { |
274 | { |
275 | unsigned long key = index; |
275 | unsigned long key = index; |
276 | link_t *lnk = hash_table_find(&dentries, &key); |
276 | link_t *lnk = hash_table_find(&dentries, &key); |
277 | if (!lnk) |
277 | if (!lnk) |
278 | return NULL; |
278 | return NULL; |
279 | return hash_table_get_instance(lnk, tmpfs_dentry_t, dh_link); |
279 | return hash_table_get_instance(lnk, tmpfs_dentry_t, dh_link); |
280 | } |
280 | } |
281 | 281 | ||
282 | void tmpfs_node_put(void *node) |
282 | void tmpfs_node_put(void *node) |
283 | { |
283 | { |
284 | /* nothing to do */ |
284 | /* nothing to do */ |
285 | } |
285 | } |
286 | 286 | ||
287 | void *tmpfs_create_node(dev_handle_t dev_handle, int lflag) |
287 | void *tmpfs_create_node(dev_handle_t dev_handle, int lflag) |
288 | { |
288 | { |
289 | assert((lflag & L_FILE) ^ (lflag & L_DIRECTORY)); |
289 | assert((lflag & L_FILE) ^ (lflag & L_DIRECTORY)); |
290 | 290 | ||
291 | tmpfs_dentry_t *node = malloc(sizeof(tmpfs_dentry_t)); |
291 | tmpfs_dentry_t *node = malloc(sizeof(tmpfs_dentry_t)); |
292 | if (!node) |
292 | if (!node) |
293 | return NULL; |
293 | return NULL; |
294 | 294 | ||
295 | if (!tmpfs_dentry_initialize(node)) { |
295 | if (!tmpfs_dentry_initialize(node)) { |
296 | free(node); |
296 | free(node); |
297 | return NULL; |
297 | return NULL; |
298 | } |
298 | } |
299 | node->index = tmpfs_next_index++; |
299 | node->index = tmpfs_next_index++; |
300 | if (lflag & L_DIRECTORY) |
300 | if (lflag & L_DIRECTORY) |
301 | node->type = TMPFS_DIRECTORY; |
301 | node->type = TMPFS_DIRECTORY; |
302 | else |
302 | else |
303 | node->type = TMPFS_FILE; |
303 | node->type = TMPFS_FILE; |
304 | 304 | ||
305 | /* Insert the new node into the dentry hash table. */ |
305 | /* Insert the new node into the dentry hash table. */ |
306 | unsigned long key = node->index; |
306 | unsigned long key = node->index; |
307 | hash_table_insert(&dentries, &key, &node->dh_link); |
307 | hash_table_insert(&dentries, &key, &node->dh_link); |
308 | return (void *) node; |
308 | return (void *) node; |
309 | } |
309 | } |
310 | 310 | ||
311 | bool tmpfs_link_node(void *prnt, void *chld, const char *nm) |
311 | int tmpfs_link_node(void *prnt, void *chld, const char *nm) |
312 | { |
312 | { |
313 | tmpfs_dentry_t *parentp = (tmpfs_dentry_t *) prnt; |
313 | tmpfs_dentry_t *parentp = (tmpfs_dentry_t *) prnt; |
314 | tmpfs_dentry_t *childp = (tmpfs_dentry_t *) chld; |
314 | tmpfs_dentry_t *childp = (tmpfs_dentry_t *) chld; |
315 | 315 | ||
316 | assert(parentp->type == TMPFS_DIRECTORY); |
316 | assert(parentp->type == TMPFS_DIRECTORY); |
317 | 317 | ||
318 | tmpfs_name_t *namep = malloc(sizeof(tmpfs_name_t)); |
318 | tmpfs_name_t *namep = malloc(sizeof(tmpfs_name_t)); |
319 | if (!namep) |
319 | if (!namep) |
320 | return false; |
320 | return ENOMEM; |
321 | tmpfs_name_initialize(namep); |
321 | tmpfs_name_initialize(namep); |
322 | size_t len = strlen(nm); |
322 | size_t len = strlen(nm); |
323 | namep->name = malloc(len + 1); |
323 | namep->name = malloc(len + 1); |
324 | if (!namep->name) { |
324 | if (!namep->name) { |
325 | free(namep); |
325 | free(namep); |
326 | return false; |
326 | return ENOMEM; |
327 | } |
327 | } |
328 | strcpy(namep->name, nm); |
328 | strcpy(namep->name, nm); |
329 | namep->parent = parentp; |
329 | namep->parent = parentp; |
330 | 330 | ||
331 | childp->lnkcnt++; |
331 | childp->lnkcnt++; |
332 | 332 | ||
333 | unsigned long key = (unsigned long) parentp; |
333 | unsigned long key = (unsigned long) parentp; |
334 | hash_table_insert(&childp->names, &key, &namep->link); |
334 | hash_table_insert(&childp->names, &key, &namep->link); |
335 | 335 | ||
336 | /* Insert the new node into the namespace. */ |
336 | /* Insert the new node into the namespace. */ |
337 | if (parentp->child) { |
337 | if (parentp->child) { |
338 | tmpfs_dentry_t *tmp = parentp->child; |
338 | tmpfs_dentry_t *tmp = parentp->child; |
339 | while (tmp->sibling) |
339 | while (tmp->sibling) |
340 | tmp = tmp->sibling; |
340 | tmp = tmp->sibling; |
341 | tmp->sibling = childp; |
341 | tmp->sibling = childp; |
342 | } else { |
342 | } else { |
343 | parentp->child = childp; |
343 | parentp->child = childp; |
344 | } |
344 | } |
345 | 345 | ||
346 | return true; |
346 | return EOK; |
347 | } |
347 | } |
348 | 348 | ||
349 | int tmpfs_unlink_node(void *prnt, void *chld) |
349 | int tmpfs_unlink_node(void *prnt, void *chld) |
350 | { |
350 | { |
351 | tmpfs_dentry_t *parentp = (tmpfs_dentry_t *)prnt; |
351 | tmpfs_dentry_t *parentp = (tmpfs_dentry_t *)prnt; |
352 | tmpfs_dentry_t *childp = (tmpfs_dentry_t *)chld; |
352 | tmpfs_dentry_t *childp = (tmpfs_dentry_t *)chld; |
353 | 353 | ||
354 | if (!parentp) |
354 | if (!parentp) |
355 | return EBUSY; |
355 | return EBUSY; |
356 | 356 | ||
357 | if (childp->child) |
357 | if (childp->child) |
358 | return ENOTEMPTY; |
358 | return ENOTEMPTY; |
359 | 359 | ||
360 | if (parentp->child == childp) { |
360 | if (parentp->child == childp) { |
361 | parentp->child = childp->sibling; |
361 | parentp->child = childp->sibling; |
362 | } else { |
362 | } else { |
363 | /* TODO: consider doubly linked list for organizing siblings. */ |
363 | /* TODO: consider doubly linked list for organizing siblings. */ |
364 | tmpfs_dentry_t *tmp = parentp->child; |
364 | tmpfs_dentry_t *tmp = parentp->child; |
365 | while (tmp->sibling != childp) |
365 | while (tmp->sibling != childp) |
366 | tmp = tmp->sibling; |
366 | tmp = tmp->sibling; |
367 | tmp->sibling = childp->sibling; |
367 | tmp->sibling = childp->sibling; |
368 | } |
368 | } |
369 | childp->sibling = NULL; |
369 | childp->sibling = NULL; |
370 | 370 | ||
371 | unsigned long key = (unsigned long) parentp; |
371 | unsigned long key = (unsigned long) parentp; |
372 | hash_table_remove(&childp->names, &key, 1); |
372 | hash_table_remove(&childp->names, &key, 1); |
373 | 373 | ||
374 | childp->lnkcnt--; |
374 | childp->lnkcnt--; |
375 | 375 | ||
376 | return EOK; |
376 | return EOK; |
377 | } |
377 | } |
378 | 378 | ||
379 | int tmpfs_destroy_node(void *nodep) |
379 | int tmpfs_destroy_node(void *nodep) |
380 | { |
380 | { |
381 | tmpfs_dentry_t *dentry = (tmpfs_dentry_t *) nodep; |
381 | tmpfs_dentry_t *dentry = (tmpfs_dentry_t *) nodep; |
382 | 382 | ||
383 | assert(!dentry->lnkcnt); |
383 | assert(!dentry->lnkcnt); |
384 | assert(!dentry->child); |
384 | assert(!dentry->child); |
385 | assert(!dentry->sibling); |
385 | assert(!dentry->sibling); |
386 | 386 | ||
387 | unsigned long key = dentry->index; |
387 | unsigned long key = dentry->index; |
388 | hash_table_remove(&dentries, &key, 1); |
388 | hash_table_remove(&dentries, &key, 1); |
389 | 389 | ||
390 | hash_table_destroy(&dentry->names); |
390 | hash_table_destroy(&dentry->names); |
391 | 391 | ||
392 | if (dentry->type == TMPFS_FILE) |
392 | if (dentry->type == TMPFS_FILE) |
393 | free(dentry->data); |
393 | free(dentry->data); |
394 | free(dentry); |
394 | free(dentry); |
395 | return EOK; |
395 | return EOK; |
396 | } |
396 | } |
397 | 397 | ||
398 | void tmpfs_mounted(ipc_callid_t rid, ipc_call_t *request) |
398 | void tmpfs_mounted(ipc_callid_t rid, ipc_call_t *request) |
399 | { |
399 | { |
400 | dev_handle_t dev_handle = (dev_handle_t) IPC_GET_ARG1(*request); |
400 | dev_handle_t dev_handle = (dev_handle_t) IPC_GET_ARG1(*request); |
401 | 401 | ||
402 | /* Initialize TMPFS. */ |
402 | /* Initialize TMPFS. */ |
403 | if (!root && !tmpfs_init()) { |
403 | if (!root && !tmpfs_init()) { |
404 | ipc_answer_0(rid, ENOMEM); |
404 | ipc_answer_0(rid, ENOMEM); |
405 | return; |
405 | return; |
406 | } |
406 | } |
407 | 407 | ||
408 | if (dev_handle >= 0) { |
408 | if (dev_handle >= 0) { |
409 | if (tmpfs_restore(dev_handle)) |
409 | if (tmpfs_restore(dev_handle)) |
410 | ipc_answer_3(rid, EOK, root->index, root->size, |
410 | ipc_answer_3(rid, EOK, root->index, root->size, |
411 | root->lnkcnt); |
411 | root->lnkcnt); |
412 | else |
412 | else |
413 | ipc_answer_0(rid, ELIMIT); |
413 | ipc_answer_0(rid, ELIMIT); |
414 | } else { |
414 | } else { |
415 | ipc_answer_3(rid, EOK, root->index, root->size, root->lnkcnt); |
415 | ipc_answer_3(rid, EOK, root->index, root->size, root->lnkcnt); |
416 | } |
416 | } |
417 | } |
417 | } |
418 | 418 | ||
419 | void tmpfs_mount(ipc_callid_t rid, ipc_call_t *request) |
419 | void tmpfs_mount(ipc_callid_t rid, ipc_call_t *request) |
420 | { |
420 | { |
421 | dev_handle_t mp_dev_handle = (dev_handle_t) IPC_GET_ARG1(*request); |
421 | dev_handle_t mp_dev_handle = (dev_handle_t) IPC_GET_ARG1(*request); |
422 | fs_index_t mp_index = (fs_index_t) IPC_GET_ARG2(*request); |
422 | fs_index_t mp_index = (fs_index_t) IPC_GET_ARG2(*request); |
423 | fs_handle_t mr_fs_handle = (fs_handle_t) IPC_GET_ARG3(*request); |
423 | fs_handle_t mr_fs_handle = (fs_handle_t) IPC_GET_ARG3(*request); |
424 | dev_handle_t mr_dev_handle = (dev_handle_t) IPC_GET_ARG4(*request); |
424 | dev_handle_t mr_dev_handle = (dev_handle_t) IPC_GET_ARG4(*request); |
425 | 425 | ||
426 | ipc_answer_0(rid, ENOTSUP); |
426 | ipc_answer_0(rid, ENOTSUP); |
427 | } |
427 | } |
428 | 428 | ||
429 | void tmpfs_lookup(ipc_callid_t rid, ipc_call_t *request) |
429 | void tmpfs_lookup(ipc_callid_t rid, ipc_call_t *request) |
430 | { |
430 | { |
431 | libfs_lookup(&tmpfs_libfs_ops, tmpfs_reg.fs_handle, rid, request); |
431 | libfs_lookup(&tmpfs_libfs_ops, tmpfs_reg.fs_handle, rid, request); |
432 | } |
432 | } |
433 | 433 | ||
434 | void tmpfs_read(ipc_callid_t rid, ipc_call_t *request) |
434 | void tmpfs_read(ipc_callid_t rid, ipc_call_t *request) |
435 | { |
435 | { |
436 | dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request); |
436 | dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request); |
437 | fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request); |
437 | fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request); |
438 | off_t pos = (off_t)IPC_GET_ARG3(*request); |
438 | off_t pos = (off_t)IPC_GET_ARG3(*request); |
439 | 439 | ||
440 | /* |
440 | /* |
441 | * Lookup the respective dentry. |
441 | * Lookup the respective dentry. |
442 | */ |
442 | */ |
443 | link_t *hlp; |
443 | link_t *hlp; |
444 | unsigned long key = index; |
444 | unsigned long key = index; |
445 | hlp = hash_table_find(&dentries, &key); |
445 | hlp = hash_table_find(&dentries, &key); |
446 | if (!hlp) { |
446 | if (!hlp) { |
447 | ipc_answer_0(rid, ENOENT); |
447 | ipc_answer_0(rid, ENOENT); |
448 | return; |
448 | return; |
449 | } |
449 | } |
450 | tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t, |
450 | tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t, |
451 | dh_link); |
451 | dh_link); |
452 | 452 | ||
453 | /* |
453 | /* |
454 | * Receive the read request. |
454 | * Receive the read request. |
455 | */ |
455 | */ |
456 | ipc_callid_t callid; |
456 | ipc_callid_t callid; |
457 | size_t len; |
457 | size_t len; |
458 | if (!ipc_data_read_receive(&callid, &len)) { |
458 | if (!ipc_data_read_receive(&callid, &len)) { |
459 | ipc_answer_0(callid, EINVAL); |
459 | ipc_answer_0(callid, EINVAL); |
460 | ipc_answer_0(rid, EINVAL); |
460 | ipc_answer_0(rid, EINVAL); |
461 | return; |
461 | return; |
462 | } |
462 | } |
463 | 463 | ||
464 | size_t bytes; |
464 | size_t bytes; |
465 | if (dentry->type == TMPFS_FILE) { |
465 | if (dentry->type == TMPFS_FILE) { |
466 | bytes = max(0, min(dentry->size - pos, len)); |
466 | bytes = max(0, min(dentry->size - pos, len)); |
467 | (void) ipc_data_read_finalize(callid, dentry->data + pos, |
467 | (void) ipc_data_read_finalize(callid, dentry->data + pos, |
468 | bytes); |
468 | bytes); |
469 | } else { |
469 | } else { |
470 | int i; |
470 | int i; |
471 | tmpfs_dentry_t *cur; |
471 | tmpfs_dentry_t *cur; |
472 | 472 | ||
473 | assert(dentry->type == TMPFS_DIRECTORY); |
473 | assert(dentry->type == TMPFS_DIRECTORY); |
474 | 474 | ||
475 | /* |
475 | /* |
476 | * Yes, we really use O(n) algorithm here. |
476 | * Yes, we really use O(n) algorithm here. |
477 | * If it bothers someone, it could be fixed by introducing a |
477 | * If it bothers someone, it could be fixed by introducing a |
478 | * hash table. |
478 | * hash table. |
479 | */ |
479 | */ |
480 | for (i = 0, cur = dentry->child; i < pos && cur; i++, |
480 | for (i = 0, cur = dentry->child; i < pos && cur; i++, |
481 | cur = cur->sibling) |
481 | cur = cur->sibling) |
482 | ; |
482 | ; |
483 | 483 | ||
484 | if (!cur) { |
484 | if (!cur) { |
485 | ipc_answer_0(callid, ENOENT); |
485 | ipc_answer_0(callid, ENOENT); |
486 | ipc_answer_1(rid, ENOENT, 0); |
486 | ipc_answer_1(rid, ENOENT, 0); |
487 | return; |
487 | return; |
488 | } |
488 | } |
489 | 489 | ||
490 | unsigned long key = (unsigned long) dentry; |
490 | unsigned long key = (unsigned long) dentry; |
491 | link_t *hlp = hash_table_find(&cur->names, &key); |
491 | link_t *hlp = hash_table_find(&cur->names, &key); |
492 | assert(hlp); |
492 | assert(hlp); |
493 | tmpfs_name_t *namep = hash_table_get_instance(hlp, tmpfs_name_t, |
493 | tmpfs_name_t *namep = hash_table_get_instance(hlp, tmpfs_name_t, |
494 | link); |
494 | link); |
495 | 495 | ||
496 | (void) ipc_data_read_finalize(callid, namep->name, |
496 | (void) ipc_data_read_finalize(callid, namep->name, |
497 | strlen(namep->name) + 1); |
497 | strlen(namep->name) + 1); |
498 | bytes = 1; |
498 | bytes = 1; |
499 | } |
499 | } |
500 | 500 | ||
501 | /* |
501 | /* |
502 | * Answer the VFS_READ call. |
502 | * Answer the VFS_READ call. |
503 | */ |
503 | */ |
504 | ipc_answer_1(rid, EOK, bytes); |
504 | ipc_answer_1(rid, EOK, bytes); |
505 | } |
505 | } |
506 | 506 | ||
507 | void tmpfs_write(ipc_callid_t rid, ipc_call_t *request) |
507 | void tmpfs_write(ipc_callid_t rid, ipc_call_t *request) |
508 | { |
508 | { |
509 | dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request); |
509 | dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request); |
510 | fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request); |
510 | fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request); |
511 | off_t pos = (off_t)IPC_GET_ARG3(*request); |
511 | off_t pos = (off_t)IPC_GET_ARG3(*request); |
512 | 512 | ||
513 | /* |
513 | /* |
514 | * Lookup the respective dentry. |
514 | * Lookup the respective dentry. |
515 | */ |
515 | */ |
516 | link_t *hlp; |
516 | link_t *hlp; |
517 | unsigned long key = index; |
517 | unsigned long key = index; |
518 | hlp = hash_table_find(&dentries, &key); |
518 | hlp = hash_table_find(&dentries, &key); |
519 | if (!hlp) { |
519 | if (!hlp) { |
520 | ipc_answer_0(rid, ENOENT); |
520 | ipc_answer_0(rid, ENOENT); |
521 | return; |
521 | return; |
522 | } |
522 | } |
523 | tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t, |
523 | tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t, |
524 | dh_link); |
524 | dh_link); |
525 | 525 | ||
526 | /* |
526 | /* |
527 | * Receive the write request. |
527 | * Receive the write request. |
528 | */ |
528 | */ |
529 | ipc_callid_t callid; |
529 | ipc_callid_t callid; |
530 | size_t len; |
530 | size_t len; |
531 | if (!ipc_data_write_receive(&callid, &len)) { |
531 | if (!ipc_data_write_receive(&callid, &len)) { |
532 | ipc_answer_0(callid, EINVAL); |
532 | ipc_answer_0(callid, EINVAL); |
533 | ipc_answer_0(rid, EINVAL); |
533 | ipc_answer_0(rid, EINVAL); |
534 | return; |
534 | return; |
535 | } |
535 | } |
536 | 536 | ||
537 | /* |
537 | /* |
538 | * Check whether the file needs to grow. |
538 | * Check whether the file needs to grow. |
539 | */ |
539 | */ |
540 | if (pos + len <= dentry->size) { |
540 | if (pos + len <= dentry->size) { |
541 | /* The file size is not changing. */ |
541 | /* The file size is not changing. */ |
542 | (void) ipc_data_write_finalize(callid, dentry->data + pos, len); |
542 | (void) ipc_data_write_finalize(callid, dentry->data + pos, len); |
543 | ipc_answer_2(rid, EOK, len, dentry->size); |
543 | ipc_answer_2(rid, EOK, len, dentry->size); |
544 | return; |
544 | return; |
545 | } |
545 | } |
546 | size_t delta = (pos + len) - dentry->size; |
546 | size_t delta = (pos + len) - dentry->size; |
547 | /* |
547 | /* |
548 | * At this point, we are deliberately extremely straightforward and |
548 | * At this point, we are deliberately extremely straightforward and |
549 | * simply realloc the contents of the file on every write that grows the |
549 | * simply realloc the contents of the file on every write that grows the |
550 | * file. In the end, the situation might not be as bad as it may look: |
550 | * file. In the end, the situation might not be as bad as it may look: |
551 | * our heap allocator can save us and just grow the block whenever |
551 | * our heap allocator can save us and just grow the block whenever |
552 | * possible. |
552 | * possible. |
553 | */ |
553 | */ |
554 | void *newdata = realloc(dentry->data, dentry->size + delta); |
554 | void *newdata = realloc(dentry->data, dentry->size + delta); |
555 | if (!newdata) { |
555 | if (!newdata) { |
556 | ipc_answer_0(callid, ENOMEM); |
556 | ipc_answer_0(callid, ENOMEM); |
557 | ipc_answer_2(rid, EOK, 0, dentry->size); |
557 | ipc_answer_2(rid, EOK, 0, dentry->size); |
558 | return; |
558 | return; |
559 | } |
559 | } |
560 | /* Clear any newly allocated memory in order to emulate gaps. */ |
560 | /* Clear any newly allocated memory in order to emulate gaps. */ |
561 | memset(newdata + dentry->size, 0, delta); |
561 | memset(newdata + dentry->size, 0, delta); |
562 | dentry->size += delta; |
562 | dentry->size += delta; |
563 | dentry->data = newdata; |
563 | dentry->data = newdata; |
564 | (void) ipc_data_write_finalize(callid, dentry->data + pos, len); |
564 | (void) ipc_data_write_finalize(callid, dentry->data + pos, len); |
565 | ipc_answer_2(rid, EOK, len, dentry->size); |
565 | ipc_answer_2(rid, EOK, len, dentry->size); |
566 | } |
566 | } |
567 | 567 | ||
568 | void tmpfs_truncate(ipc_callid_t rid, ipc_call_t *request) |
568 | void tmpfs_truncate(ipc_callid_t rid, ipc_call_t *request) |
569 | { |
569 | { |
570 | dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request); |
570 | dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request); |
571 | fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request); |
571 | fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request); |
572 | size_t size = (off_t)IPC_GET_ARG3(*request); |
572 | size_t size = (off_t)IPC_GET_ARG3(*request); |
573 | 573 | ||
574 | /* |
574 | /* |
575 | * Lookup the respective dentry. |
575 | * Lookup the respective dentry. |
576 | */ |
576 | */ |
577 | link_t *hlp; |
577 | link_t *hlp; |
578 | unsigned long key = index; |
578 | unsigned long key = index; |
579 | hlp = hash_table_find(&dentries, &key); |
579 | hlp = hash_table_find(&dentries, &key); |
580 | if (!hlp) { |
580 | if (!hlp) { |
581 | ipc_answer_0(rid, ENOENT); |
581 | ipc_answer_0(rid, ENOENT); |
582 | return; |
582 | return; |
583 | } |
583 | } |
584 | tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t, |
584 | tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t, |
585 | dh_link); |
585 | dh_link); |
586 | 586 | ||
587 | if (size == dentry->size) { |
587 | if (size == dentry->size) { |
588 | ipc_answer_0(rid, EOK); |
588 | ipc_answer_0(rid, EOK); |
589 | return; |
589 | return; |
590 | } |
590 | } |
591 | 591 | ||
592 | void *newdata = realloc(dentry->data, size); |
592 | void *newdata = realloc(dentry->data, size); |
593 | if (!newdata) { |
593 | if (!newdata) { |
594 | ipc_answer_0(rid, ENOMEM); |
594 | ipc_answer_0(rid, ENOMEM); |
595 | return; |
595 | return; |
596 | } |
596 | } |
597 | if (size > dentry->size) { |
597 | if (size > dentry->size) { |
598 | size_t delta = size - dentry->size; |
598 | size_t delta = size - dentry->size; |
599 | memset(newdata + dentry->size, 0, delta); |
599 | memset(newdata + dentry->size, 0, delta); |
600 | } |
600 | } |
601 | dentry->size = size; |
601 | dentry->size = size; |
602 | dentry->data = newdata; |
602 | dentry->data = newdata; |
603 | ipc_answer_0(rid, EOK); |
603 | ipc_answer_0(rid, EOK); |
604 | } |
604 | } |
605 | 605 | ||
606 | void tmpfs_destroy(ipc_callid_t rid, ipc_call_t *request) |
606 | void tmpfs_destroy(ipc_callid_t rid, ipc_call_t *request) |
607 | { |
607 | { |
608 | dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request); |
608 | dev_handle_t dev_handle = (dev_handle_t)IPC_GET_ARG1(*request); |
609 | fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request); |
609 | fs_index_t index = (fs_index_t)IPC_GET_ARG2(*request); |
610 | int rc; |
610 | int rc; |
611 | 611 | ||
612 | link_t *hlp; |
612 | link_t *hlp; |
613 | unsigned long key = index; |
613 | unsigned long key = index; |
614 | hlp = hash_table_find(&dentries, &key); |
614 | hlp = hash_table_find(&dentries, &key); |
615 | if (!hlp) { |
615 | if (!hlp) { |
616 | ipc_answer_0(rid, ENOENT); |
616 | ipc_answer_0(rid, ENOENT); |
617 | return; |
617 | return; |
618 | } |
618 | } |
619 | tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t, |
619 | tmpfs_dentry_t *dentry = hash_table_get_instance(hlp, tmpfs_dentry_t, |
620 | dh_link); |
620 | dh_link); |
621 | rc = tmpfs_destroy_node(dentry); |
621 | rc = tmpfs_destroy_node(dentry); |
622 | ipc_answer_0(rid, rc); |
622 | ipc_answer_0(rid, rc); |
623 | } |
623 | } |
624 | 624 | ||
625 | /** |
625 | /** |
626 | * @} |
626 | * @} |
627 | */ |
627 | */ |
628 | 628 |