Rev 2856 | Rev 2858 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2856 | Rev 2857 | ||
---|---|---|---|
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 fat_ops.c |
34 | * @file fat_ops.c |
35 | * @brief Implementation of VFS operations for the FAT file system server. |
35 | * @brief Implementation of VFS operations for the FAT file system server. |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include "fat.h" |
38 | #include "fat.h" |
39 | #include "../../vfs/vfs.h" |
39 | #include "../../vfs/vfs.h" |
40 | #include <libfs.h> |
40 | #include <libfs.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 <string.h> |
44 | #include <string.h> |
45 | #include <byteorder.h> |
45 | #include <byteorder.h> |
46 | #include <libadt/hash_table.h> |
46 | #include <libadt/hash_table.h> |
47 | #include <libadt/list.h> |
47 | #include <libadt/list.h> |
48 | #include <assert.h> |
48 | #include <assert.h> |
49 | #include <futex.h> |
49 | #include <futex.h> |
50 | 50 | ||
51 | #define BS_BLOCK 0 |
51 | #define BS_BLOCK 0 |
52 | 52 | ||
53 | #define FIN_KEY_DEV_HANDLE 0 |
53 | #define FIN_KEY_DEV_HANDLE 0 |
54 | #define FIN_KEY_INDEX 1 |
54 | #define FIN_KEY_INDEX 1 |
55 | 55 | ||
56 | /** Futex protecting both fin_hash and ffn_head. */ |
56 | /** Futex protecting both fin_hash and ffn_head. */ |
57 | futex_t fin_futex = FUTEX_INITIALIZER; |
57 | futex_t fin_futex = FUTEX_INITIALIZER; |
58 | 58 | ||
59 | /** Hash table of FAT in-core nodes. */ |
59 | /** Hash table of FAT in-core nodes. */ |
60 | hash_table_t fin_hash; |
60 | hash_table_t fin_hash; |
61 | 61 | ||
62 | /** List of free FAT in-core nodes. */ |
62 | /** List of free FAT in-core nodes. */ |
63 | link_t ffn_head; |
63 | link_t ffn_head; |
64 | 64 | ||
65 | #define FAT_NAME_LEN 8 |
65 | #define FAT_NAME_LEN 8 |
66 | #define FAT_EXT_LEN 3 |
66 | #define FAT_EXT_LEN 3 |
67 | 67 | ||
68 | #define FAT_PAD ' ' |
68 | #define FAT_PAD ' ' |
69 | 69 | ||
70 | #define FAT_DENTRY_UNUSED 0x00 |
70 | #define FAT_DENTRY_UNUSED 0x00 |
71 | #define FAT_DENTRY_E5_ESC 0x05 |
71 | #define FAT_DENTRY_E5_ESC 0x05 |
72 | #define FAT_DENTRY_DOT 0x2e |
72 | #define FAT_DENTRY_DOT 0x2e |
73 | #define FAT_DENTRY_ERASED 0xe5 |
73 | #define FAT_DENTRY_ERASED 0xe5 |
74 | 74 | ||
75 | static void dentry_name_canonify(fat_dentry_t *d, char *buf) |
75 | static void dentry_name_canonify(fat_dentry_t *d, char *buf) |
76 | { |
76 | { |
77 | int i; |
77 | int i; |
78 | 78 | ||
79 | for (i = 0; i < FAT_NAME_LEN; i++) { |
79 | for (i = 0; i < FAT_NAME_LEN; i++) { |
80 | if (d->name[i] == FAT_PAD) { |
80 | if (d->name[i] == FAT_PAD) { |
81 | buf++; |
81 | buf++; |
82 | break; |
82 | break; |
83 | } |
83 | } |
84 | if (d->name[i] == FAT_DENTRY_E5_ESC) |
84 | if (d->name[i] == FAT_DENTRY_E5_ESC) |
85 | *buf++ = 0xe5; |
85 | *buf++ = 0xe5; |
86 | else |
86 | else |
87 | *buf++ = d->name[i]; |
87 | *buf++ = d->name[i]; |
88 | } |
88 | } |
89 | if (d->ext[0] != FAT_PAD) |
89 | if (d->ext[0] != FAT_PAD) |
90 | *buf++ = '.'; |
90 | *buf++ = '.'; |
91 | for (i = 0; i < FAT_EXT_LEN; i++) { |
91 | for (i = 0; i < FAT_EXT_LEN; i++) { |
92 | if (d->ext[i] == FAT_PAD) { |
92 | if (d->ext[i] == FAT_PAD) { |
93 | *buf = '\0'; |
93 | *buf = '\0'; |
94 | return; |
94 | return; |
95 | } |
95 | } |
96 | if (d->ext[i] == FAT_DENTRY_E5_ESC) |
96 | if (d->ext[i] == FAT_DENTRY_E5_ESC) |
97 | *buf++ = 0xe5; |
97 | *buf++ = 0xe5; |
98 | else |
98 | else |
99 | *buf++ = d->ext[i]; |
99 | *buf++ = d->ext[i]; |
100 | } |
100 | } |
101 | } |
101 | } |
102 | 102 | ||
103 | /* TODO and also move somewhere else */ |
103 | /* TODO and also move somewhere else */ |
104 | typedef struct { |
104 | typedef struct { |
105 | void *data; |
105 | void *data; |
106 | } block_t; |
106 | } block_t; |
107 | 107 | ||
108 | static block_t *block_get(dev_handle_t dev_handle, off_t offset) |
108 | static block_t *block_get(dev_handle_t dev_handle, off_t offset) |
109 | { |
109 | { |
110 | return NULL; /* TODO */ |
110 | return NULL; /* TODO */ |
111 | } |
111 | } |
112 | 112 | ||
113 | static block_t *fat_block_get(dev_handle_t dev_handle, fs_index_t index, |
113 | static block_t *fat_block_get(dev_handle_t dev_handle, fs_index_t index, |
114 | off_t offset) { |
114 | off_t offset) { |
115 | return NULL; /* TODO */ |
115 | return NULL; /* TODO */ |
116 | } |
116 | } |
117 | 117 | ||
118 | static void block_put(block_t *block) |
118 | static void block_put(block_t *block) |
119 | { |
119 | { |
120 | /* TODO */ |
120 | /* TODO */ |
121 | } |
121 | } |
122 | 122 | ||
123 | static void fat_node_initialize(fat_node_t *node) |
123 | static void fat_node_initialize(fat_node_t *node) |
124 | { |
124 | { |
125 | futex_initialize(&node->lock, 1); |
125 | futex_initialize(&node->lock, 1); |
126 | node->type = 0; |
126 | node->type = 0; |
127 | node->index = 0; |
127 | node->index = 0; |
128 | node->pindex = 0; |
128 | node->pindex = 0; |
129 | node->dev_handle = 0; |
129 | node->dev_handle = 0; |
130 | link_initialize(&node->fin_link); |
130 | link_initialize(&node->fin_link); |
131 | link_initialize(&node->ffn_link); |
131 | link_initialize(&node->ffn_link); |
132 | node->size = 0; |
132 | node->size = 0; |
133 | node->lnkcnt = 0; |
133 | node->lnkcnt = 0; |
134 | node->refcnt = 0; |
134 | node->refcnt = 0; |
135 | node->dirty = false; |
135 | node->dirty = false; |
136 | } |
136 | } |
137 | 137 | ||
138 | static uint16_t fat_bps_get(dev_handle_t dev_handle) |
138 | static uint16_t fat_bps_get(dev_handle_t dev_handle) |
139 | { |
139 | { |
140 | block_t *bb; |
140 | block_t *bb; |
141 | uint16_t bps; |
141 | uint16_t bps; |
142 | 142 | ||
143 | bb = block_get(dev_handle, BS_BLOCK); |
143 | bb = block_get(dev_handle, BS_BLOCK); |
144 | assert(bb != NULL); |
144 | assert(bb != NULL); |
145 | bps = uint16_t_le2host(((fat_bs_t *)bb->data)->bps); |
145 | bps = uint16_t_le2host(((fat_bs_t *)bb->data)->bps); |
146 | block_put(bb); |
146 | block_put(bb); |
147 | 147 | ||
148 | return bps; |
148 | return bps; |
149 | } |
149 | } |
150 | 150 | ||
151 | typedef enum { |
151 | typedef enum { |
152 | FAT_DENTRY_SKIP, |
152 | FAT_DENTRY_SKIP, |
153 | FAT_DENTRY_LAST, |
153 | FAT_DENTRY_LAST, |
154 | FAT_DENTRY_VALID |
154 | FAT_DENTRY_VALID |
155 | } fat_dentry_clsf_t; |
155 | } fat_dentry_clsf_t; |
156 | 156 | ||
157 | static fat_dentry_clsf_t fat_classify_dentry(fat_dentry_t *d) |
157 | static fat_dentry_clsf_t fat_classify_dentry(fat_dentry_t *d) |
158 | { |
158 | { |
159 | if (d->attr & FAT_ATTR_VOLLABEL) { |
159 | if (d->attr & FAT_ATTR_VOLLABEL) { |
160 | /* volume label entry */ |
160 | /* volume label entry */ |
161 | return FAT_DENTRY_SKIP; |
161 | return FAT_DENTRY_SKIP; |
162 | } |
162 | } |
163 | if (d->name[0] == FAT_DENTRY_ERASED) { |
163 | if (d->name[0] == FAT_DENTRY_ERASED) { |
164 | /* not-currently-used entry */ |
164 | /* not-currently-used entry */ |
165 | return FAT_DENTRY_SKIP; |
165 | return FAT_DENTRY_SKIP; |
166 | } |
166 | } |
167 | if (d->name[0] == FAT_DENTRY_UNUSED) { |
167 | if (d->name[0] == FAT_DENTRY_UNUSED) { |
168 | /* never used entry */ |
168 | /* never used entry */ |
169 | return FAT_DENTRY_LAST; |
169 | return FAT_DENTRY_LAST; |
170 | } |
170 | } |
171 | if (d->name[0] == FAT_DENTRY_DOT) { |
171 | if (d->name[0] == FAT_DENTRY_DOT) { |
172 | /* |
172 | /* |
173 | * Most likely '.' or '..'. |
173 | * Most likely '.' or '..'. |
174 | * It cannot occur in a regular file name. |
174 | * It cannot occur in a regular file name. |
175 | */ |
175 | */ |
176 | return FAT_DENTRY_SKIP; |
176 | return FAT_DENTRY_SKIP; |
177 | } |
177 | } |
178 | return FAT_DENTRY_VALID; |
178 | return FAT_DENTRY_VALID; |
179 | } |
179 | } |
180 | 180 | ||
181 | static void fat_sync_node(fat_node_t *node) |
181 | static void fat_sync_node(fat_node_t *node) |
182 | { |
182 | { |
183 | /* TODO */ |
183 | /* TODO */ |
184 | } |
184 | } |
185 | 185 | ||
186 | /** Instantiate a FAT in-core node. |
186 | /** Instantiate a FAT in-core node. |
187 | * |
187 | * |
188 | * FAT stores the info necessary for instantiation of a node in the parent of |
188 | * FAT stores the info necessary for instantiation of a node in the parent of |
189 | * that node. This design necessitated the addition of the parent node index |
189 | * that node. This design necessitated the addition of the parent node index |
190 | * parameter to this otherwise generic libfs API. |
190 | * parameter to this otherwise generic libfs API. |
191 | */ |
191 | */ |
192 | static void * |
192 | static void * |
193 | fat_node_get(dev_handle_t dev_handle, fs_index_t index, fs_index_t pindex) |
193 | fat_node_get(dev_handle_t dev_handle, fs_index_t index, fs_index_t pindex) |
194 | { |
194 | { |
195 | link_t *lnk; |
195 | link_t *lnk; |
196 | fat_node_t *node = NULL; |
196 | fat_node_t *node = NULL; |
197 | block_t *b; |
197 | block_t *b; |
198 | unsigned bps; |
198 | unsigned bps; |
199 | unsigned dps; |
199 | unsigned dps; |
200 | fat_dentry_t *d; |
200 | fat_dentry_t *d; |
201 | unsigned i, j; |
201 | unsigned i, j; |
202 | 202 | ||
203 | unsigned long key[] = { |
203 | unsigned long key[] = { |
204 | [FIN_KEY_DEV_HANDLE] = dev_handle, |
204 | [FIN_KEY_DEV_HANDLE] = dev_handle, |
205 | [FIN_KEY_INDEX] = index |
205 | [FIN_KEY_INDEX] = index |
206 | }; |
206 | }; |
207 | 207 | ||
208 | futex_down(&fin_futex); |
208 | futex_down(&fin_futex); |
209 | lnk = hash_table_find(&fin_hash, key); |
209 | lnk = hash_table_find(&fin_hash, key); |
210 | if (lnk) { |
210 | if (lnk) { |
211 | /* |
211 | /* |
212 | * The in-core node was found in the hash table. |
212 | * The in-core node was found in the hash table. |
213 | */ |
213 | */ |
214 | node = hash_table_get_instance(lnk, fat_node_t, fin_link); |
214 | node = hash_table_get_instance(lnk, fat_node_t, fin_link); |
215 | if (!node->refcnt++) |
215 | if (!node->refcnt++) |
216 | list_remove(&node->ffn_link); |
216 | list_remove(&node->ffn_link); |
217 | futex_up(&fin_futex); |
217 | futex_up(&fin_futex); |
218 | 218 | ||
219 | /* Make sure that the node is fully instantiated. */ |
219 | /* Make sure that the node is fully instantiated. */ |
220 | futex_down(&node->lock); |
220 | futex_down(&node->lock); |
221 | futex_up(&node->lock); |
221 | futex_up(&node->lock); |
222 | 222 | ||
223 | return (void *) node; |
223 | return (void *) node; |
224 | } |
224 | } |
225 | 225 | ||
226 | bps = fat_bps_get(dev_handle); |
226 | bps = fat_bps_get(dev_handle); |
227 | dps = bps / sizeof(fat_dentry_t); |
227 | dps = bps / sizeof(fat_dentry_t); |
228 | 228 | ||
229 | if (!list_empty(&ffn_head)) { |
229 | if (!list_empty(&ffn_head)) { |
230 | /* |
230 | /* |
231 | * We are going to reuse a node from the free list. |
231 | * We are going to reuse a node from the free list. |
232 | */ |
232 | */ |
233 | lnk = ffn_head.next; |
233 | lnk = ffn_head.next; |
234 | list_remove(lnk); |
234 | list_remove(lnk); |
235 | node = list_get_instance(lnk, fat_node_t, ffn_link); |
235 | node = list_get_instance(lnk, fat_node_t, ffn_link); |
236 | assert(!node->refcnt); |
236 | assert(!node->refcnt); |
237 | if (node->dirty) |
237 | if (node->dirty) |
238 | fat_sync_node(node); |
238 | fat_sync_node(node); |
239 | key[FIN_KEY_DEV_HANDLE] = node->dev_handle; |
239 | key[FIN_KEY_DEV_HANDLE] = node->dev_handle; |
240 | key[FIN_KEY_INDEX] = node->index; |
240 | key[FIN_KEY_INDEX] = node->index; |
241 | hash_table_remove(&fin_hash, key, sizeof(key)/sizeof(*key)); |
241 | hash_table_remove(&fin_hash, key, sizeof(key)/sizeof(*key)); |
242 | } else { |
242 | } else { |
243 | /* |
243 | /* |
244 | * We need to allocate a new node. |
244 | * We need to allocate a new node. |
245 | */ |
245 | */ |
246 | node = malloc(sizeof(fat_node_t)); |
246 | node = malloc(sizeof(fat_node_t)); |
247 | if (!node) |
247 | if (!node) |
248 | return NULL; |
248 | return NULL; |
249 | } |
249 | } |
250 | fat_node_initialize(node); |
250 | fat_node_initialize(node); |
251 | node->refcnt++; |
251 | node->refcnt++; |
252 | node->lnkcnt++; |
252 | node->lnkcnt++; |
253 | node->dev_handle = dev_handle; |
253 | node->dev_handle = dev_handle; |
254 | node->index = index; |
254 | node->index = index; |
255 | node->pindex = pindex; |
255 | node->pindex = pindex; |
256 | key[FIN_KEY_DEV_HANDLE] = node->dev_handle; |
256 | key[FIN_KEY_DEV_HANDLE] = node->dev_handle; |
257 | key[FIN_KEY_INDEX] = node->index; |
257 | key[FIN_KEY_INDEX] = node->index; |
258 | hash_table_insert(&fin_hash, key, &node->fin_link); |
258 | hash_table_insert(&fin_hash, key, &node->fin_link); |
259 | 259 | ||
260 | /* |
260 | /* |
261 | * We have already put the node back to fin_hash. |
261 | * We have already put the node back to fin_hash. |
262 | * The node is not yet fully instantiated so we lock it prior to |
262 | * The node is not yet fully instantiated so we lock it prior to |
263 | * unlocking fin_hash. |
263 | * unlocking fin_hash. |
264 | */ |
264 | */ |
265 | futex_down(&node->lock); |
265 | futex_down(&node->lock); |
266 | futex_up(&fin_futex); |
266 | futex_up(&fin_futex); |
267 | 267 | ||
268 | /* |
268 | /* |
269 | * Because of the design of the FAT file system, we have no clue about |
269 | * Because of the design of the FAT file system, we have no clue about |
270 | * how big (i.e. how many directory entries it contains) is the parent |
270 | * how big (i.e. how many directory entries it contains) is the parent |
271 | * of the node we are trying to instantiate. However, we know that it |
271 | * of the node we are trying to instantiate. However, we know that it |
272 | * must contain a directory entry for our node of interest. We simply |
272 | * must contain a directory entry for our node of interest. We simply |
273 | * scan the parent until we find it. |
273 | * scan the parent until we find it. |
274 | */ |
274 | */ |
275 | for (i = 0; ; i++) { |
275 | for (i = 0; ; i++) { |
276 | b = fat_block_get(node->dev_handle, node->pindex, i); |
276 | b = fat_block_get(node->dev_handle, node->pindex, i); |
277 | for (j = 0; j < dps; j++) { |
277 | for (j = 0; j < dps; j++) { |
278 | d = ((fat_dentry_t *)b->data) + j; |
278 | d = ((fat_dentry_t *)b->data) + j; |
279 | if (d->firstc == node->index) |
279 | if (d->firstc == node->index) |
280 | goto found; |
280 | goto found; |
281 | } |
281 | } |
282 | block_put(b); |
282 | block_put(b); |
283 | } |
283 | } |
284 | 284 | ||
285 | found: |
285 | found: |
286 | if (!(d->attr & (FAT_ATTR_SUBDIR | FAT_ATTR_VOLLABEL))) |
286 | if (!(d->attr & (FAT_ATTR_SUBDIR | FAT_ATTR_VOLLABEL))) |
287 | node->type = FAT_FILE; |
287 | node->type = FAT_FILE; |
288 | if ((d->attr & FAT_ATTR_SUBDIR) || !index) |
288 | if ((d->attr & FAT_ATTR_SUBDIR) || !index) |
289 | node->type = FAT_DIRECTORY; |
289 | node->type = FAT_DIRECTORY; |
290 | assert((node->type == FAT_FILE) || (node->type == FAT_DIRECTORY)); |
290 | assert((node->type == FAT_FILE) || (node->type == FAT_DIRECTORY)); |
291 | 291 | ||
292 | node->size = uint32_t_le2host(d->size); |
292 | node->size = uint32_t_le2host(d->size); |
293 | block_put(b); |
293 | block_put(b); |
294 | 294 | ||
295 | futex_up(&node->lock); |
295 | futex_up(&node->lock); |
296 | return node; |
296 | return node; |
297 | } |
297 | } |
298 | 298 | ||
299 | static void fat_node_put(void *node) |
299 | static void fat_node_put(void *node) |
300 | { |
300 | { |
301 | fat_node_t *nodep = (fat_node_t *)node; |
301 | fat_node_t *nodep = (fat_node_t *)node; |
302 | 302 | ||
303 | futex_down(&fin_futex); |
303 | futex_down(&fin_futex); |
304 | if (!--nodep->refcnt) |
304 | if (!--nodep->refcnt) |
305 | list_append(&nodep->ffn_link, &ffn_head); |
305 | list_append(&nodep->ffn_link, &ffn_head); |
306 | futex_up(&fin_futex); |
306 | futex_up(&fin_futex); |
307 | } |
307 | } |
308 | 308 | ||
- | 309 | static void *fat_create(int flags) |
|
- | 310 | { |
|
- | 311 | return NULL; /* not supported at the moment */ |
|
- | 312 | } |
|
- | 313 | ||
- | 314 | static bool fat_destroy(void *node) |
|
- | 315 | { |
|
- | 316 | return false; /* not supported at the moment */ |
|
- | 317 | } |
|
- | 318 | ||
- | 319 | static bool fat_link(void *prnt, void *chld, const char *name) |
|
- | 320 | { |
|
- | 321 | return false; /* not supported at the moment */ |
|
- | 322 | } |
|
- | 323 | ||
- | 324 | static int fat_unlink(void *prnt, void *chld) |
|
- | 325 | { |
|
- | 326 | return ENOTSUP; /* not supported at the moment */ |
|
- | 327 | } |
|
- | 328 | ||
309 | static void *fat_match(void *prnt, const char *component) |
329 | static void *fat_match(void *prnt, const char *component) |
310 | { |
330 | { |
311 | fat_node_t *parentp = (fat_node_t *)prnt; |
331 | fat_node_t *parentp = (fat_node_t *)prnt; |
312 | char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1]; |
332 | char name[FAT_NAME_LEN + 1 + FAT_EXT_LEN + 1]; |
313 | unsigned i, j; |
333 | unsigned i, j; |
314 | unsigned bps; /* bytes per sector */ |
334 | unsigned bps; /* bytes per sector */ |
315 | unsigned dps; /* dentries per sector */ |
335 | unsigned dps; /* dentries per sector */ |
316 | unsigned blocks; |
336 | unsigned blocks; |
317 | fat_dentry_t *d; |
337 | fat_dentry_t *d; |
318 | block_t *b; |
338 | block_t *b; |
319 | 339 | ||
320 | bps = fat_bps_get(parentp->dev_handle); |
340 | bps = fat_bps_get(parentp->dev_handle); |
321 | dps = bps / sizeof(fat_dentry_t); |
341 | dps = bps / sizeof(fat_dentry_t); |
322 | blocks = parentp->size / bps + (parentp->size % bps != 0); |
342 | blocks = parentp->size / bps + (parentp->size % bps != 0); |
323 | for (i = 0; i < blocks; i++) { |
343 | for (i = 0; i < blocks; i++) { |
324 | unsigned dentries; |
344 | unsigned dentries; |
325 | 345 | ||
326 | b = fat_block_get(parentp->dev_handle, parentp->index, i); |
346 | b = fat_block_get(parentp->dev_handle, parentp->index, i); |
327 | dentries = (i == blocks - 1) ? |
347 | dentries = (i == blocks - 1) ? |
328 | parentp->size % sizeof(fat_dentry_t) : |
348 | parentp->size % sizeof(fat_dentry_t) : |
329 | dps; |
349 | dps; |
330 | for (j = 0; j < dentries; j++) { |
350 | for (j = 0; j < dentries; j++) { |
331 | d = ((fat_dentry_t *)b->data) + j; |
351 | d = ((fat_dentry_t *)b->data) + j; |
332 | switch (fat_classify_dentry(d)) { |
352 | switch (fat_classify_dentry(d)) { |
333 | case FAT_DENTRY_SKIP: |
353 | case FAT_DENTRY_SKIP: |
334 | continue; |
354 | continue; |
335 | case FAT_DENTRY_LAST: |
355 | case FAT_DENTRY_LAST: |
336 | block_put(b); |
356 | block_put(b); |
337 | return NULL; |
357 | return NULL; |
338 | default: |
358 | default: |
339 | case FAT_DENTRY_VALID: |
359 | case FAT_DENTRY_VALID: |
340 | dentry_name_canonify(d, name); |
360 | dentry_name_canonify(d, name); |
341 | break; |
361 | break; |
342 | } |
362 | } |
343 | if (strcmp(name, component) == 0) { |
363 | if (strcmp(name, component) == 0) { |
344 | /* hit */ |
364 | /* hit */ |
345 | void *node = fat_node_get(parentp->dev_handle, |
365 | void *node = fat_node_get(parentp->dev_handle, |
346 | (fs_index_t)uint16_t_le2host(d->firstc), |
366 | (fs_index_t)uint16_t_le2host(d->firstc), |
347 | parentp->index); |
367 | parentp->index); |
348 | block_put(b); |
368 | block_put(b); |
349 | return node; |
369 | return node; |
350 | } |
370 | } |
351 | } |
371 | } |
352 | block_put(b); |
372 | block_put(b); |
353 | } |
373 | } |
354 | 374 | ||
355 | return NULL; |
375 | return NULL; |
356 | } |
376 | } |
357 | 377 | ||
358 | static fs_index_t fat_index_get(void *node) |
378 | static fs_index_t fat_index_get(void *node) |
359 | { |
379 | { |
360 | fat_node_t *fnodep = (fat_node_t *)node; |
380 | fat_node_t *fnodep = (fat_node_t *)node; |
361 | if (!fnodep) |
381 | if (!fnodep) |
362 | return 0; |
382 | return 0; |
363 | return fnodep->index; |
383 | return fnodep->index; |
364 | } |
384 | } |
365 | 385 | ||
366 | static size_t fat_size_get(void *node) |
386 | static size_t fat_size_get(void *node) |
367 | { |
387 | { |
368 | return ((fat_node_t *)node)->size; |
388 | return ((fat_node_t *)node)->size; |
369 | } |
389 | } |
370 | 390 | ||
371 | static unsigned fat_lnkcnt_get(void *node) |
391 | static unsigned fat_lnkcnt_get(void *node) |
372 | { |
392 | { |
373 | return ((fat_node_t *)node)->lnkcnt; |
393 | return ((fat_node_t *)node)->lnkcnt; |
374 | } |
394 | } |
375 | 395 | ||
376 | static bool fat_has_children(void *node) |
396 | static bool fat_has_children(void *node) |
377 | { |
397 | { |
378 | fat_node_t *nodep = (fat_node_t *)node; |
398 | fat_node_t *nodep = (fat_node_t *)node; |
379 | unsigned bps; |
399 | unsigned bps; |
380 | unsigned dps; |
400 | unsigned dps; |
381 | unsigned blocks; |
401 | unsigned blocks; |
382 | block_t *b; |
402 | block_t *b; |
383 | unsigned i, j; |
403 | unsigned i, j; |
384 | 404 | ||
385 | if (nodep->type != FAT_DIRECTORY) |
405 | if (nodep->type != FAT_DIRECTORY) |
386 | return false; |
406 | return false; |
387 | 407 | ||
388 | bps = fat_bps_get(nodep->dev_handle); |
408 | bps = fat_bps_get(nodep->dev_handle); |
389 | dps = bps / sizeof(fat_dentry_t); |
409 | dps = bps / sizeof(fat_dentry_t); |
390 | 410 | ||
391 | blocks = nodep->size / bps + (nodep->size % bps != 0); |
411 | blocks = nodep->size / bps + (nodep->size % bps != 0); |
392 | 412 | ||
393 | for (i = 0; i < blocks; i++) { |
413 | for (i = 0; i < blocks; i++) { |
394 | unsigned dentries; |
414 | unsigned dentries; |
395 | fat_dentry_t *d; |
415 | fat_dentry_t *d; |
396 | 416 | ||
397 | b = fat_block_get(nodep->dev_handle, nodep->index, i); |
417 | b = fat_block_get(nodep->dev_handle, nodep->index, i); |
398 | dentries = (i == blocks - 1) ? |
418 | dentries = (i == blocks - 1) ? |
399 | nodep->size % sizeof(fat_dentry_t) : |
419 | nodep->size % sizeof(fat_dentry_t) : |
400 | dps; |
420 | dps; |
401 | for (j = 0; j < dentries; j++) { |
421 | for (j = 0; j < dentries; j++) { |
402 | d = ((fat_dentry_t *)b->data) + j; |
422 | d = ((fat_dentry_t *)b->data) + j; |
403 | switch (fat_classify_dentry(d)) { |
423 | switch (fat_classify_dentry(d)) { |
404 | case FAT_DENTRY_SKIP: |
424 | case FAT_DENTRY_SKIP: |
405 | continue; |
425 | continue; |
406 | case FAT_DENTRY_LAST: |
426 | case FAT_DENTRY_LAST: |
407 | block_put(b); |
427 | block_put(b); |
408 | return false; |
428 | return false; |
409 | default: |
429 | default: |
410 | case FAT_DENTRY_VALID: |
430 | case FAT_DENTRY_VALID: |
411 | block_put(b); |
431 | block_put(b); |
412 | return true; |
432 | return true; |
413 | } |
433 | } |
414 | block_put(b); |
434 | block_put(b); |
415 | return true; |
435 | return true; |
416 | } |
436 | } |
417 | block_put(b); |
437 | block_put(b); |
418 | } |
438 | } |
419 | 439 | ||
420 | return false; |
440 | return false; |
421 | } |
441 | } |
422 | 442 | ||
423 | static void *fat_root_get(dev_handle_t dev_handle) |
443 | static void *fat_root_get(dev_handle_t dev_handle) |
424 | { |
444 | { |
425 | return fat_node_get(dev_handle, 0, 0); |
445 | return fat_node_get(dev_handle, 0, 0); |
426 | } |
446 | } |
427 | 447 | ||
428 | static char fat_plb_get_char(unsigned pos) |
448 | static char fat_plb_get_char(unsigned pos) |
429 | { |
449 | { |
430 | return fat_reg.plb_ro[pos % PLB_SIZE]; |
450 | return fat_reg.plb_ro[pos % PLB_SIZE]; |
431 | } |
451 | } |
432 | 452 | ||
433 | static bool fat_is_directory(void *node) |
453 | static bool fat_is_directory(void *node) |
434 | { |
454 | { |
435 | return ((fat_node_t *)node)->type == FAT_DIRECTORY; |
455 | return ((fat_node_t *)node)->type == FAT_DIRECTORY; |
436 | } |
456 | } |
437 | 457 | ||
438 | static bool fat_is_file(void *node) |
458 | static bool fat_is_file(void *node) |
439 | { |
459 | { |
440 | return ((fat_node_t *)node)->type == FAT_FILE; |
460 | return ((fat_node_t *)node)->type == FAT_FILE; |
441 | } |
461 | } |
442 | 462 | ||
443 | /** libfs operations */ |
463 | /** libfs operations */ |
444 | libfs_ops_t fat_libfs_ops = { |
464 | libfs_ops_t fat_libfs_ops = { |
445 | .match = fat_match, |
465 | .match = fat_match, |
446 | .node_get = fat_node_get, |
466 | .node_get = fat_node_get, |
447 | .node_put = fat_node_put, |
467 | .node_put = fat_node_put, |
448 | .create = NULL, |
468 | .create = fat_create, |
449 | .destroy = NULL, |
469 | .destroy = fat_destroy, |
450 | .link = NULL, |
470 | .link = fat_link, |
451 | .unlink = NULL, |
471 | .unlink = fat_unlink, |
452 | .index_get = fat_index_get, |
472 | .index_get = fat_index_get, |
453 | .size_get = fat_size_get, |
473 | .size_get = fat_size_get, |
454 | .lnkcnt_get = fat_lnkcnt_get, |
474 | .lnkcnt_get = fat_lnkcnt_get, |
455 | .has_children = fat_has_children, |
475 | .has_children = fat_has_children, |
456 | .root_get = fat_root_get, |
476 | .root_get = fat_root_get, |
457 | .plb_get_char = fat_plb_get_char, |
477 | .plb_get_char = fat_plb_get_char, |
458 | .is_directory = fat_is_directory, |
478 | .is_directory = fat_is_directory, |
459 | .is_file = fat_is_file |
479 | .is_file = fat_is_file |
460 | }; |
480 | }; |
461 | 481 | ||
462 | void fat_lookup(ipc_callid_t rid, ipc_call_t *request) |
482 | void fat_lookup(ipc_callid_t rid, ipc_call_t *request) |
463 | { |
483 | { |
464 | libfs_lookup(&fat_libfs_ops, fat_reg.fs_handle, rid, request); |
484 | libfs_lookup(&fat_libfs_ops, fat_reg.fs_handle, rid, request); |
465 | } |
485 | } |
466 | 486 | ||
467 | /** |
487 | /** |
468 | * @} |
488 | * @} |
469 | */ |
489 | */ |
470 | 490 |