source: mainline/uspace/srv/fs/tmpfs/tmpfs_ops.c@ d2c8533

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since d2c8533 was d2c8533, checked in by Jiri Svoboda <jiri@…>, 8 years ago

File system probing groundwork. Only MFS can do it for now.

  • Property mode set to 100644
File size: 15.2 KB
Line 
1/*
2 * Copyright (c) 2008 Jakub Jermar
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 *
9 * - Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
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
15 * derived from this software without specific prior written permission.
16 *
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
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
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
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
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29/** @addtogroup fs
30 * @{
31 */
32
33/**
34 * @file tmpfs_ops.c
35 * @brief Implementation of VFS operations for the TMPFS file system
36 * server.
37 */
38
39#include "tmpfs.h"
40#include "../../vfs/vfs.h"
41#include <macros.h>
42#include <stdint.h>
43#include <async.h>
44#include <errno.h>
45#include <atomic.h>
46#include <stdlib.h>
47#include <str.h>
48#include <stdio.h>
49#include <assert.h>
50#include <sys/types.h>
51#include <adt/hash_table.h>
52#include <adt/hash.h>
53#include <as.h>
54#include <libfs.h>
55
56/** All root nodes have index 0. */
57#define TMPFS_SOME_ROOT 0
58/** Global counter for assigning node indices. Shared by all instances. */
59fs_index_t tmpfs_next_index = 1;
60
61/*
62 * Implementation of the libfs interface.
63 */
64
65/* Forward declarations of static functions. */
66static int tmpfs_match(fs_node_t **, fs_node_t *, const char *);
67static int tmpfs_node_get(fs_node_t **, service_id_t, fs_index_t);
68static int tmpfs_node_open(fs_node_t *);
69static int tmpfs_node_put(fs_node_t *);
70static int tmpfs_create_node(fs_node_t **, service_id_t, int);
71static int tmpfs_destroy_node(fs_node_t *);
72static int tmpfs_link_node(fs_node_t *, fs_node_t *, const char *);
73static int tmpfs_unlink_node(fs_node_t *, fs_node_t *, const char *);
74
75/* Implementation of helper functions. */
76static int tmpfs_root_get(fs_node_t **rfn, service_id_t service_id)
77{
78 return tmpfs_node_get(rfn, service_id, TMPFS_SOME_ROOT);
79}
80
81static int tmpfs_has_children(bool *has_children, fs_node_t *fn)
82{
83 *has_children = !list_empty(&TMPFS_NODE(fn)->cs_list);
84 return EOK;
85}
86
87static fs_index_t tmpfs_index_get(fs_node_t *fn)
88{
89 return TMPFS_NODE(fn)->index;
90}
91
92static aoff64_t tmpfs_size_get(fs_node_t *fn)
93{
94 return TMPFS_NODE(fn)->size;
95}
96
97static unsigned tmpfs_lnkcnt_get(fs_node_t *fn)
98{
99 return TMPFS_NODE(fn)->lnkcnt;
100}
101
102static bool tmpfs_is_directory(fs_node_t *fn)
103{
104 return TMPFS_NODE(fn)->type == TMPFS_DIRECTORY;
105}
106
107static bool tmpfs_is_file(fs_node_t *fn)
108{
109 return TMPFS_NODE(fn)->type == TMPFS_FILE;
110}
111
112static service_id_t tmpfs_service_get(fs_node_t *fn)
113{
114 return 0;
115}
116
117/** libfs operations */
118libfs_ops_t tmpfs_libfs_ops = {
119 .root_get = tmpfs_root_get,
120 .match = tmpfs_match,
121 .node_get = tmpfs_node_get,
122 .node_open = tmpfs_node_open,
123 .node_put = tmpfs_node_put,
124 .create = tmpfs_create_node,
125 .destroy = tmpfs_destroy_node,
126 .link = tmpfs_link_node,
127 .unlink = tmpfs_unlink_node,
128 .has_children = tmpfs_has_children,
129 .index_get = tmpfs_index_get,
130 .size_get = tmpfs_size_get,
131 .lnkcnt_get = tmpfs_lnkcnt_get,
132 .is_directory = tmpfs_is_directory,
133 .is_file = tmpfs_is_file,
134 .service_get = tmpfs_service_get
135};
136
137/** Hash table of all TMPFS nodes. */
138hash_table_t nodes;
139
140/*
141 * Implementation of hash table interface for the nodes hash table.
142 */
143
144typedef struct {
145 service_id_t service_id;
146 fs_index_t index;
147} node_key_t;
148
149static size_t nodes_key_hash(void *k)
150{
151 node_key_t *key = (node_key_t *)k;
152 return hash_combine(key->service_id, key->index);
153}
154
155static size_t nodes_hash(const ht_link_t *item)
156{
157 tmpfs_node_t *nodep = hash_table_get_inst(item, tmpfs_node_t, nh_link);
158 return hash_combine(nodep->service_id, nodep->index);
159}
160
161static bool nodes_key_equal(void *key_arg, const ht_link_t *item)
162{
163 tmpfs_node_t *node = hash_table_get_inst(item, tmpfs_node_t, nh_link);
164 node_key_t *key = (node_key_t *)key_arg;
165
166 return key->service_id == node->service_id && key->index == node->index;
167}
168
169static void nodes_remove_callback(ht_link_t *item)
170{
171 tmpfs_node_t *nodep = hash_table_get_inst(item, tmpfs_node_t, nh_link);
172
173 while (!list_empty(&nodep->cs_list)) {
174 tmpfs_dentry_t *dentryp = list_get_instance(
175 list_first(&nodep->cs_list), tmpfs_dentry_t, link);
176
177 assert(nodep->type == TMPFS_DIRECTORY);
178 list_remove(&dentryp->link);
179 free(dentryp);
180 }
181
182 if (nodep->data) {
183 assert(nodep->type == TMPFS_FILE);
184 free(nodep->data);
185 }
186 free(nodep->bp);
187 free(nodep);
188}
189
190/** TMPFS nodes hash table operations. */
191hash_table_ops_t nodes_ops = {
192 .hash = nodes_hash,
193 .key_hash = nodes_key_hash,
194 .key_equal = nodes_key_equal,
195 .equal = NULL,
196 .remove_callback = nodes_remove_callback
197};
198
199static void tmpfs_node_initialize(tmpfs_node_t *nodep)
200{
201 nodep->bp = NULL;
202 nodep->index = 0;
203 nodep->service_id = 0;
204 nodep->type = TMPFS_NONE;
205 nodep->lnkcnt = 0;
206 nodep->size = 0;
207 nodep->data = NULL;
208 list_initialize(&nodep->cs_list);
209}
210
211static void tmpfs_dentry_initialize(tmpfs_dentry_t *dentryp)
212{
213 link_initialize(&dentryp->link);
214 dentryp->name = NULL;
215 dentryp->node = NULL;
216}
217
218bool tmpfs_init(void)
219{
220 if (!hash_table_create(&nodes, 0, 0, &nodes_ops))
221 return false;
222
223 return true;
224}
225
226static bool tmpfs_instance_init(service_id_t service_id)
227{
228 fs_node_t *rfn;
229 int rc;
230
231 rc = tmpfs_create_node(&rfn, service_id, L_DIRECTORY);
232 if (rc != EOK || !rfn)
233 return false;
234 TMPFS_NODE(rfn)->lnkcnt = 0; /* FS root is not linked */
235 return true;
236}
237
238static bool rm_service_id_nodes(ht_link_t *item, void *arg)
239{
240 service_id_t sid = *(service_id_t*)arg;
241 tmpfs_node_t *node = hash_table_get_inst(item, tmpfs_node_t, nh_link);
242
243 if (node->service_id == sid) {
244 hash_table_remove_item(&nodes, &node->nh_link);
245 }
246 return true;
247}
248
249static void tmpfs_instance_done(service_id_t service_id)
250{
251 hash_table_apply(&nodes, rm_service_id_nodes, &service_id);
252}
253
254int tmpfs_match(fs_node_t **rfn, fs_node_t *pfn, const char *component)
255{
256 tmpfs_node_t *parentp = TMPFS_NODE(pfn);
257
258 list_foreach(parentp->cs_list, link, tmpfs_dentry_t, dentryp) {
259 if (!str_cmp(dentryp->name, component)) {
260 *rfn = FS_NODE(dentryp->node);
261 return EOK;
262 }
263 }
264
265 *rfn = NULL;
266 return EOK;
267}
268
269int tmpfs_node_get(fs_node_t **rfn, service_id_t service_id, fs_index_t index)
270{
271 node_key_t key = {
272 .service_id = service_id,
273 .index = index
274 };
275
276 ht_link_t *lnk = hash_table_find(&nodes, &key);
277
278 if (lnk) {
279 tmpfs_node_t *nodep;
280 nodep = hash_table_get_inst(lnk, tmpfs_node_t, nh_link);
281 *rfn = FS_NODE(nodep);
282 } else {
283 *rfn = NULL;
284 }
285 return EOK;
286}
287
288int tmpfs_node_open(fs_node_t *fn)
289{
290 /* nothing to do */
291 return EOK;
292}
293
294int tmpfs_node_put(fs_node_t *fn)
295{
296 /* nothing to do */
297 return EOK;
298}
299
300int tmpfs_create_node(fs_node_t **rfn, service_id_t service_id, int lflag)
301{
302 fs_node_t *rootfn;
303 int rc;
304
305 assert((lflag & L_FILE) ^ (lflag & L_DIRECTORY));
306
307 tmpfs_node_t *nodep = malloc(sizeof(tmpfs_node_t));
308 if (!nodep)
309 return ENOMEM;
310 tmpfs_node_initialize(nodep);
311 nodep->bp = malloc(sizeof(fs_node_t));
312 if (!nodep->bp) {
313 free(nodep);
314 return ENOMEM;
315 }
316 fs_node_initialize(nodep->bp);
317 nodep->bp->data = nodep; /* link the FS and TMPFS nodes */
318
319 rc = tmpfs_root_get(&rootfn, service_id);
320 assert(rc == EOK);
321 if (!rootfn)
322 nodep->index = TMPFS_SOME_ROOT;
323 else
324 nodep->index = tmpfs_next_index++;
325 nodep->service_id = service_id;
326 if (lflag & L_DIRECTORY)
327 nodep->type = TMPFS_DIRECTORY;
328 else
329 nodep->type = TMPFS_FILE;
330
331 /* Insert the new node into the nodes hash table. */
332 hash_table_insert(&nodes, &nodep->nh_link);
333 *rfn = FS_NODE(nodep);
334 return EOK;
335}
336
337int tmpfs_destroy_node(fs_node_t *fn)
338{
339 tmpfs_node_t *nodep = TMPFS_NODE(fn);
340
341 assert(!nodep->lnkcnt);
342 assert(list_empty(&nodep->cs_list));
343
344 hash_table_remove_item(&nodes, &nodep->nh_link);
345
346 /*
347 * The nodes_remove_callback() function takes care of the actual
348 * resource deallocation.
349 */
350 return EOK;
351}
352
353int tmpfs_link_node(fs_node_t *pfn, fs_node_t *cfn, const char *nm)
354{
355 tmpfs_node_t *parentp = TMPFS_NODE(pfn);
356 tmpfs_node_t *childp = TMPFS_NODE(cfn);
357 tmpfs_dentry_t *dentryp;
358
359 assert(parentp->type == TMPFS_DIRECTORY);
360
361 /* Check for duplicit entries. */
362 list_foreach(parentp->cs_list, link, tmpfs_dentry_t, dp) {
363 if (!str_cmp(dp->name, nm))
364 return EEXIST;
365 }
366
367 /* Allocate and initialize the dentry. */
368 dentryp = malloc(sizeof(tmpfs_dentry_t));
369 if (!dentryp)
370 return ENOMEM;
371 tmpfs_dentry_initialize(dentryp);
372
373 /* Populate and link the new dentry. */
374 size_t size = str_size(nm);
375 dentryp->name = malloc(size + 1);
376 if (!dentryp->name) {
377 free(dentryp);
378 return ENOMEM;
379 }
380 str_cpy(dentryp->name, size + 1, nm);
381 dentryp->node = childp;
382 childp->lnkcnt++;
383 list_append(&dentryp->link, &parentp->cs_list);
384
385 return EOK;
386}
387
388int tmpfs_unlink_node(fs_node_t *pfn, fs_node_t *cfn, const char *nm)
389{
390 tmpfs_node_t *parentp = TMPFS_NODE(pfn);
391 tmpfs_node_t *childp = NULL;
392 tmpfs_dentry_t *dentryp;
393
394 if (!parentp)
395 return EBUSY;
396
397 list_foreach(parentp->cs_list, link, tmpfs_dentry_t, dp) {
398 if (!str_cmp(dp->name, nm)) {
399 dentryp = dp;
400 childp = dentryp->node;
401 assert(FS_NODE(childp) == cfn);
402 break;
403 }
404 }
405
406 if (!childp)
407 return ENOENT;
408
409 if ((childp->lnkcnt == 1) && !list_empty(&childp->cs_list))
410 return ENOTEMPTY;
411
412 list_remove(&dentryp->link);
413 free(dentryp);
414 childp->lnkcnt--;
415
416 return EOK;
417}
418
419/*
420 * Implementation of the VFS_OUT interface.
421 */
422
423static int tmpfs_fsprobe(service_id_t service_id, vfs_fs_probe_info_t *info)
424{
425 return ENOTSUP;
426}
427
428static int
429tmpfs_mounted(service_id_t service_id, const char *opts,
430 fs_index_t *index, aoff64_t *size, unsigned *lnkcnt)
431{
432 fs_node_t *rootfn;
433 int rc;
434
435 /* Check if this device is not already mounted. */
436 rc = tmpfs_root_get(&rootfn, service_id);
437 if ((rc == EOK) && (rootfn)) {
438 (void) tmpfs_node_put(rootfn);
439 return EEXIST;
440 }
441
442 /* Initialize TMPFS instance. */
443 if (!tmpfs_instance_init(service_id))
444 return ENOMEM;
445
446 rc = tmpfs_root_get(&rootfn, service_id);
447 assert(rc == EOK);
448 tmpfs_node_t *rootp = TMPFS_NODE(rootfn);
449 if (str_cmp(opts, "restore") == 0) {
450 if (!tmpfs_restore(service_id))
451 return ELIMIT;
452 }
453
454 *index = rootp->index;
455 *size = rootp->size;
456 *lnkcnt = rootp->lnkcnt;
457
458 return EOK;
459}
460
461static int tmpfs_unmounted(service_id_t service_id)
462{
463 tmpfs_instance_done(service_id);
464 return EOK;
465}
466
467static int tmpfs_read(service_id_t service_id, fs_index_t index, aoff64_t pos,
468 size_t *rbytes)
469{
470 /*
471 * Lookup the respective TMPFS node.
472 */
473 node_key_t key = {
474 .service_id = service_id,
475 .index = index
476 };
477
478 ht_link_t *hlp = hash_table_find(&nodes, &key);
479 if (!hlp)
480 return ENOENT;
481
482 tmpfs_node_t *nodep = hash_table_get_inst(hlp, tmpfs_node_t, nh_link);
483
484 /*
485 * Receive the read request.
486 */
487 ipc_callid_t callid;
488 size_t size;
489 if (!async_data_read_receive(&callid, &size)) {
490 async_answer_0(callid, EINVAL);
491 return EINVAL;
492 }
493
494 size_t bytes;
495 if (nodep->type == TMPFS_FILE) {
496 bytes = min(nodep->size - pos, size);
497 (void) async_data_read_finalize(callid, nodep->data + pos,
498 bytes);
499 } else {
500 tmpfs_dentry_t *dentryp;
501 link_t *lnk;
502
503 assert(nodep->type == TMPFS_DIRECTORY);
504
505 /*
506 * Yes, we really use O(n) algorithm here.
507 * If it bothers someone, it could be fixed by introducing a
508 * hash table.
509 */
510 lnk = list_nth(&nodep->cs_list, pos);
511
512 if (lnk == NULL) {
513 async_answer_0(callid, ENOENT);
514 return ENOENT;
515 }
516
517 dentryp = list_get_instance(lnk, tmpfs_dentry_t, link);
518
519 (void) async_data_read_finalize(callid, dentryp->name,
520 str_size(dentryp->name) + 1);
521 bytes = 1;
522 }
523
524 *rbytes = bytes;
525 return EOK;
526}
527
528static int
529tmpfs_write(service_id_t service_id, fs_index_t index, aoff64_t pos,
530 size_t *wbytes, aoff64_t *nsize)
531{
532 /*
533 * Lookup the respective TMPFS node.
534 */
535 node_key_t key = {
536 .service_id = service_id,
537 .index = index
538 };
539
540 ht_link_t *hlp = hash_table_find(&nodes, &key);
541
542 if (!hlp)
543 return ENOENT;
544
545 tmpfs_node_t *nodep = hash_table_get_inst(hlp, tmpfs_node_t, nh_link);
546
547 /*
548 * Receive the write request.
549 */
550 ipc_callid_t callid;
551 size_t size;
552 if (!async_data_write_receive(&callid, &size)) {
553 async_answer_0(callid, EINVAL);
554 return EINVAL;
555 }
556
557 /*
558 * Check whether the file needs to grow.
559 */
560 if (pos + size <= nodep->size) {
561 /* The file size is not changing. */
562 (void) async_data_write_finalize(callid, nodep->data + pos,
563 size);
564 goto out;
565 }
566 size_t delta = (pos + size) - nodep->size;
567 /*
568 * At this point, we are deliberately extremely straightforward and
569 * simply realloc the contents of the file on every write that grows the
570 * file. In the end, the situation might not be as bad as it may look:
571 * our heap allocator can save us and just grow the block whenever
572 * possible.
573 */
574 void *newdata = realloc(nodep->data, nodep->size + delta);
575 if (!newdata) {
576 async_answer_0(callid, ENOMEM);
577 size = 0;
578 goto out;
579 }
580 /* Clear any newly allocated memory in order to emulate gaps. */
581 memset(newdata + nodep->size, 0, delta);
582 nodep->size += delta;
583 nodep->data = newdata;
584 (void) async_data_write_finalize(callid, nodep->data + pos, size);
585
586out:
587 *wbytes = size;
588 *nsize = nodep->size;
589 return EOK;
590}
591
592static int tmpfs_truncate(service_id_t service_id, fs_index_t index,
593 aoff64_t size)
594{
595 /*
596 * Lookup the respective TMPFS node.
597 */
598 node_key_t key = {
599 .service_id = service_id,
600 .index = index
601 };
602
603 ht_link_t *hlp = hash_table_find(&nodes, &key);
604
605 if (!hlp)
606 return ENOENT;
607 tmpfs_node_t *nodep = hash_table_get_inst(hlp, tmpfs_node_t, nh_link);
608
609 if (size == nodep->size)
610 return EOK;
611
612 if (size > SIZE_MAX)
613 return ENOMEM;
614
615 void *newdata = realloc(nodep->data, size);
616 if (!newdata)
617 return ENOMEM;
618
619 if (size > nodep->size) {
620 size_t delta = size - nodep->size;
621 memset(newdata + nodep->size, 0, delta);
622 }
623
624 nodep->size = size;
625 nodep->data = newdata;
626 return EOK;
627}
628
629static int tmpfs_close(service_id_t service_id, fs_index_t index)
630{
631 return EOK;
632}
633
634static int tmpfs_destroy(service_id_t service_id, fs_index_t index)
635{
636 node_key_t key = {
637 .service_id = service_id,
638 .index = index
639 };
640
641 ht_link_t *hlp = hash_table_find(&nodes, &key);
642 if (!hlp)
643 return ENOENT;
644 tmpfs_node_t *nodep = hash_table_get_inst(hlp, tmpfs_node_t,
645 nh_link);
646 return tmpfs_destroy_node(FS_NODE(nodep));
647}
648
649static int tmpfs_sync(service_id_t service_id, fs_index_t index)
650{
651 /*
652 * TMPFS keeps its data structures always consistent,
653 * thus the sync operation is a no-op.
654 */
655 return EOK;
656}
657
658vfs_out_ops_t tmpfs_ops = {
659 .fsprobe = tmpfs_fsprobe,
660 .mounted = tmpfs_mounted,
661 .unmounted = tmpfs_unmounted,
662 .read = tmpfs_read,
663 .write = tmpfs_write,
664 .truncate = tmpfs_truncate,
665 .close = tmpfs_close,
666 .destroy = tmpfs_destroy,
667 .sync = tmpfs_sync,
668};
669
670/**
671 * @}
672 */
673
Note: See TracBrowser for help on using the repository browser.