source: mainline/uspace/srv/fs/mfs/mfs_ops.c@ df3caec5

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since df3caec5 was df3caec5, checked in by Maurizio Lombardi <m.lombardi85@…>, 14 years ago

Add basic MINIX filesystem sanity check

  • Property mode set to 100644
File size: 25.2 KB
RevLine 
[096c8835]1/*
2 * Copyright (c) 2011 Maurizio Lombardi
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
[9e3dc95]33#include <stdlib.h>
[953a823]34#include <fibril_synch.h>
[bb7e8382]35#include <align.h>
[ee257b2]36#include <adt/hash_table.h>
[7413683]37#include "mfs.h"
[9e3dc95]38
[ee257b2]39#define OPEN_NODES_KEYS 2
[03bc76a]40#define OPEN_NODES_SERVICE_KEY 0
[ee257b2]41#define OPEN_NODES_INODE_KEY 1
42#define OPEN_NODES_BUCKETS 256
43
[8ceba1e]44static bool check_magic_number(uint16_t magic, bool *native,
[6d4d883]45 mfs_version_t *version, bool *longfilenames);
[44c0f5b]46static int mfs_node_core_get(fs_node_t **rfn, struct mfs_instance *inst,
[6d4d883]47 fs_index_t index);
[41202a9]48static int mfs_node_put(fs_node_t *fsnode);
49static int mfs_node_open(fs_node_t *fsnode);
50static fs_index_t mfs_index_get(fs_node_t *fsnode);
51static unsigned mfs_lnkcnt_get(fs_node_t *fsnode);
[ac28650]52static bool mfs_is_directory(fs_node_t *fsnode);
53static bool mfs_is_file(fs_node_t *fsnode);
54static int mfs_has_children(bool *has_children, fs_node_t *fsnode);
[03bc76a]55static int mfs_root_get(fs_node_t **rfn, service_id_t service_id);
[b33870b]56static service_id_t mfs_service_get(fs_node_t *fsnode);
[ac28650]57static aoff64_t mfs_size_get(fs_node_t *node);
[bd64680]58static int mfs_match(fs_node_t **rfn, fs_node_t *pfn, const char *component);
[03bc76a]59static int mfs_create_node(fs_node_t **rfn, service_id_t service_id, int flags);
[88ccd8b8]60static int mfs_link(fs_node_t *pfn, fs_node_t *cfn, const char *name);
[53eb588]61static int mfs_unlink(fs_node_t *, fs_node_t *, const char *name);
[d8af1bd]62static int mfs_destroy_node(fs_node_t *fn);
[ee257b2]63static hash_index_t open_nodes_hash(unsigned long key[]);
64static int open_nodes_compare(unsigned long key[], hash_count_t keys,
[6d4d883]65 link_t *item);
[ee257b2]66static void open_nodes_remove_cb(link_t *link);
[03bc76a]67static int mfs_node_get(fs_node_t **rfn, service_id_t service_id,
[6d4d883]68 fs_index_t index);
69static int mfs_instance_get(service_id_t service_id,
70 struct mfs_instance **instance);
[df3caec5]71static int mfs_check_sanity(struct mfs_sb_info *sbi);
72static bool is_power_of_two(uint32_t n);
[41202a9]73
[ee257b2]74static hash_table_t open_nodes;
75static FIBRIL_MUTEX_INITIALIZE(open_nodes_lock);
[953a823]76
[e54ba607]77libfs_ops_t mfs_libfs_ops = {
[0d6ab10]78 .size_get = mfs_size_get,
[fe4ac35]79 .root_get = mfs_root_get,
[b33870b]80 .service_get = mfs_service_get,
[7d04324]81 .is_directory = mfs_is_directory,
[44c0f5b]82 .is_file = mfs_is_file,
[cfbcd86]83 .node_get = mfs_node_get,
[41202a9]84 .node_put = mfs_node_put,
85 .node_open = mfs_node_open,
86 .index_get = mfs_index_get,
[bd64680]87 .match = mfs_match,
[10eb754]88 .create = mfs_create_node,
[88ccd8b8]89 .link = mfs_link,
[53eb588]90 .unlink = mfs_unlink,
[d8af1bd]91 .destroy = mfs_destroy_node,
[41202a9]92 .has_children = mfs_has_children,
93 .lnkcnt_get = mfs_lnkcnt_get
[e54ba607]94};
[3b08178]95
[ee257b2]96/* Hash table interface for open nodes hash table */
[6d4d883]97static hash_index_t
98open_nodes_hash(unsigned long key[])
[ee257b2]99{
100 /* TODO: This is very simple and probably can be improved */
101 return key[OPEN_NODES_INODE_KEY] % OPEN_NODES_BUCKETS;
102}
103
[6d4d883]104static int
105open_nodes_compare(unsigned long key[], hash_count_t keys,
106 link_t *item)
[ee257b2]107{
108 struct mfs_node *mnode = hash_table_get_instance(item, struct mfs_node, link);
109 assert(keys > 0);
[03bc76a]110 if (mnode->instance->service_id !=
111 ((service_id_t) key[OPEN_NODES_SERVICE_KEY])) {
[ee257b2]112 return false;
113 }
114 if (keys == 1) {
115 return true;
116 }
117 assert(keys == 2);
118 return (mnode->ino_i->index == key[OPEN_NODES_INODE_KEY]);
119}
120
[6d4d883]121static void
122open_nodes_remove_cb(link_t *link)
[ee257b2]123{
124 /* We don't use remove callback for this hash table */
125}
126
127static hash_table_operations_t open_nodes_ops = {
128 .hash = open_nodes_hash,
129 .compare = open_nodes_compare,
130 .remove_callback = open_nodes_remove_cb,
131};
132
[6d4d883]133int
134mfs_global_init(void)
[ee257b2]135{
136 if (!hash_table_create(&open_nodes, OPEN_NODES_BUCKETS,
[6d4d883]137 OPEN_NODES_KEYS, &open_nodes_ops)) {
[ee257b2]138 return ENOMEM;
139 }
140 return EOK;
141}
142
[03bc76a]143static int
144mfs_mounted(service_id_t service_id, const char *opts, fs_index_t *index,
[6d4d883]145 aoff64_t *size, unsigned *linkcnt)
[096c8835]146{
[44c6091f]147 enum cache_mode cmode;
[f456ab2]148 struct mfs_superblock *sb = NULL;
149 struct mfs3_superblock *sb3 = NULL;
150 struct mfs_sb_info *sbi = NULL;
151 struct mfs_instance *instance = NULL;
[8ceba1e]152 bool native, longnames;
[9e3dc95]153 mfs_version_t version;
[245eb02d]154 uint16_t magic;
[03bc76a]155 int rc;
[096c8835]156
157 /* Check for option enabling write through. */
158 if (str_cmp(opts, "wtcache") == 0)
159 cmode = CACHE_MODE_WT;
160 else
161 cmode = CACHE_MODE_WB;
162
163 /* initialize libblock */
[bbd4c72]164 rc = block_init(EXCHANGE_SERIALIZE, service_id, 4096);
[03bc76a]165 if (rc != EOK)
166 return rc;
[096c8835]167
[6d4d883]168 /* Allocate space for generic MFS superblock */
[b438804]169 sbi = malloc(sizeof(*sbi));
[953a823]170 if (!sbi) {
[f456ab2]171 rc = ENOMEM;
172 goto out_error;
[953a823]173 }
174
[6d4d883]175 /* Allocate space for filesystem instance */
[b438804]176 instance = malloc(sizeof(*instance));
[953a823]177 if (!instance) {
[f456ab2]178 rc = ENOMEM;
179 goto out_error;
[953a823]180 }
181
[b438804]182 sb = malloc(MFS_SUPERBLOCK_SIZE);
[953a823]183 if (!sb) {
[f456ab2]184 rc = ENOMEM;
185 goto out_error;
[953a823]186 }
[92dd5c8]187
188 /* Read the superblock */
[e03d545]189 rc = block_read_direct(service_id, MFS_SUPERBLOCK << 1, 2, sb);
[f456ab2]190 if (rc != EOK)
191 goto out_error;
[096c8835]192
[953a823]193 sb3 = (struct mfs3_superblock *) sb;
194
195 if (check_magic_number(sb->s_magic, &native, &version, &longnames)) {
[6d4d883]196 /* This is a V1 or V2 Minix filesystem */
[953a823]197 magic = sb->s_magic;
[5222e746]198 } else if (check_magic_number(sb3->s_magic, &native, &version, &longnames)) {
[6d4d883]199 /* This is a V3 Minix filesystem */
[5222e746]200 magic = sb3->s_magic;
201 } else {
[6d4d883]202 /* Not recognized */
[92dd5c8]203 mfsdebug("magic number not recognized\n");
[f456ab2]204 rc = ENOTSUP;
205 goto out_error;
[9e3dc95]206 }
[92dd5c8]207
[245eb02d]208 mfsdebug("magic number recognized = %04x\n", magic);
[953a823]209
[6d4d883]210 /* Fill superblock info structure */
[953a823]211
212 sbi->fs_version = version;
213 sbi->long_names = longnames;
214 sbi->native = native;
215 sbi->magic = magic;
[ef76d72]216 sbi->isearch = 0;
217 sbi->zsearch = 0;
[953a823]218
219 if (version == MFS_VERSION_V3) {
220 sbi->ninodes = conv32(native, sb3->s_ninodes);
221 sbi->ibmap_blocks = conv16(native, sb3->s_ibmap_blocks);
222 sbi->zbmap_blocks = conv16(native, sb3->s_zbmap_blocks);
223 sbi->firstdatazone = conv16(native, sb3->s_first_data_zone);
224 sbi->log2_zone_size = conv16(native, sb3->s_log2_zone_size);
225 sbi->max_file_size = conv32(native, sb3->s_max_file_size);
226 sbi->nzones = conv32(native, sb3->s_nzones);
227 sbi->block_size = conv16(native, sb3->s_block_size);
[10eb754]228 sbi->ino_per_block = V3_INODES_PER_BLOCK(sbi->block_size);
[a04b62d]229 sbi->dirsize = MFS3_DIRSIZE;
[bd64680]230 sbi->max_name_len = MFS3_MAX_NAME_LEN;
[953a823]231 } else {
232 sbi->ninodes = conv16(native, sb->s_ninodes);
233 sbi->ibmap_blocks = conv16(native, sb->s_ibmap_blocks);
234 sbi->zbmap_blocks = conv16(native, sb->s_zbmap_blocks);
235 sbi->firstdatazone = conv16(native, sb->s_first_data_zone);
236 sbi->log2_zone_size = conv16(native, sb->s_log2_zone_size);
237 sbi->max_file_size = conv32(native, sb->s_max_file_size);
[3b08178]238 sbi->block_size = MFS_BLOCKSIZE;
[5a841a4]239 if (version == MFS_VERSION_V2) {
[953a823]240 sbi->nzones = conv32(native, sb->s_nzones2);
[5a841a4]241 sbi->ino_per_block = V2_INODES_PER_BLOCK;
242 } else {
243 sbi->nzones = conv16(native, sb->s_nzones);
244 sbi->ino_per_block = V1_INODES_PER_BLOCK;
245 }
[a04b62d]246 sbi->dirsize = longnames ? MFSL_DIRSIZE : MFS_DIRSIZE;
[bd64680]247 sbi->max_name_len = longnames ? MFS_L_MAX_NAME_LEN :
[6d4d883]248 MFS_MAX_NAME_LEN;
[953a823]249 }
[85ff862]250
251 if (sbi->log2_zone_size != 0) {
252 /* In MFS, file space is allocated per zones.
253 * Zones are a collection of consecutive blocks on disk.
254 *
255 * The current MFS implementation supports only filesystems
256 * where the size of a zone is equal to the
257 * size of a block.
258 */
259 rc = ENOTSUP;
260 goto out_error;
261 }
262
[10eb754]263 sbi->itable_off = 2 + sbi->ibmap_blocks + sbi->zbmap_blocks;
[df3caec5]264 if ((rc = mfs_check_sanity(sbi)) != EOK) {
265 fprintf(stderr, "Filesystem corrupted, invalid superblock");
266 goto out_error;
267 }
[44c6091f]268
[03bc76a]269 rc = block_cache_init(service_id, sbi->block_size, 0, cmode);
[3b08178]270 if (rc != EOK) {
271 mfsdebug("block cache initialization failed\n");
[f456ab2]272 rc = EINVAL;
273 goto out_error;
[3b08178]274 }
275
[6d4d883]276 /* Initialize the instance structure and remember it */
[03bc76a]277 instance->service_id = service_id;
[953a823]278 instance->sbi = sbi;
[5bf76c1]279 instance->open_nodes_cnt = 0;
280 rc = fs_instance_create(service_id, instance);
281 if (rc != EOK) {
282 block_cache_fini(service_id);
283 mfsdebug("fs instance creation failed\n");
[bf08ff0]284 goto out_error;
[5bf76c1]285 }
[953a823]286
287 mfsdebug("mount successful\n");
288
[99e846f0]289 fs_node_t *fn;
[03bc76a]290 mfs_node_get(&fn, service_id, MFS_ROOT_INO);
[99e846f0]291
[03bc76a]292 struct mfs_node *mroot = fn->data;
[99e846f0]293
[03bc76a]294 *index = mroot->ino_i->index;
295 *size = mroot->ino_i->i_size;
[75e0f15]296 *linkcnt = 1;
[99e846f0]297
[f456ab2]298 free(sb);
299
[03bc76a]300 return mfs_node_put(fn);
[f456ab2]301
302out_error:
303 block_fini(service_id);
304 if (sb)
305 free(sb);
306 if (sbi)
307 free(sbi);
308 if(instance)
309 free(instance);
310 return rc;
[3b08178]311}
312
[03bc76a]313static int
314mfs_unmounted(service_id_t service_id)
[51db5aeb]315{
[7accfac]316 struct mfs_instance *inst;
317
[bbd4c72]318 mfsdebug("%s()\n", __FUNCTION__);
319
[03bc76a]320 int r = mfs_instance_get(service_id, &inst);
321 if (r != EOK)
322 return r;
[51db5aeb]323
[03bc76a]324 if (inst->open_nodes_cnt != 0)
325 return EBUSY;
[ee257b2]326
[03bc76a]327 (void) block_cache_fini(service_id);
328 block_fini(service_id);
[51db5aeb]329
[5bf76c1]330 /* Remove and destroy the instance */
331 (void) fs_instance_destroy(service_id);
[7accfac]332 free(inst->sbi);
333 free(inst);
[03bc76a]334 return EOK;
[51db5aeb]335}
336
[6d4d883]337service_id_t
338mfs_service_get(fs_node_t *fsnode)
[e54ba607]339{
340 struct mfs_node *node = fsnode->data;
[03bc76a]341 return node->instance->service_id;
[e54ba607]342}
343
[6d4d883]344static int
345mfs_create_node(fs_node_t **rfn, service_id_t service_id, int flags)
[10eb754]346{
[88ccd8b8]347 int r;
348 struct mfs_instance *inst;
349 struct mfs_node *mnode;
350 fs_node_t *fsnode;
351 uint32_t inum;
[44c6091f]352
[ee257b2]353 mfsdebug("%s()\n", __FUNCTION__);
354
[03bc76a]355 r = mfs_instance_get(service_id, &inst);
[c699b0c]356 if (r != EOK)
357 return r;
[88ccd8b8]358
[6d4d883]359 /* Alloc a new inode */
[70ac0af]360 r = mfs_alloc_inode(inst, &inum);
[c699b0c]361 if (r != EOK)
362 return r;
[88ccd8b8]363
364 struct mfs_ino_info *ino_i;
365
366 ino_i = malloc(sizeof(*ino_i));
367 if (!ino_i) {
368 r = ENOMEM;
369 goto out_err;
370 }
371
372 mnode = malloc(sizeof(*mnode));
373 if (!mnode) {
374 r = ENOMEM;
375 goto out_err_1;
376 }
[44c6091f]377
[88ccd8b8]378 fsnode = malloc(sizeof(fs_node_t));
379 if (!fsnode) {
380 r = ENOMEM;
381 goto out_err_2;
382 }
383
[bbd4c72]384 if (flags & L_DIRECTORY) {
[13ecdac9]385 ino_i->i_mode = S_IFDIR;
[6d4d883]386 ino_i->i_nlinks = 2; /* This accounts for the '.' dentry */
[bbd4c72]387 } else {
[13ecdac9]388 ino_i->i_mode = S_IFREG;
[bbd4c72]389 ino_i->i_nlinks = 1;
390 }
[13ecdac9]391
[88ccd8b8]392 ino_i->i_uid = 0;
393 ino_i->i_gid = 0;
394 ino_i->i_size = 0;
395 ino_i->i_atime = 0;
396 ino_i->i_mtime = 0;
397 ino_i->i_ctime = 0;
398
399 memset(ino_i->i_dzone, 0, sizeof(uint32_t) * V2_NR_DIRECT_ZONES);
400 memset(ino_i->i_izone, 0, sizeof(uint32_t) * V2_NR_INDIRECT_ZONES);
401
[58c36ac]402 mfsdebug("new node idx = %d\n", (int) inum);
403
[88ccd8b8]404 ino_i->index = inum;
405 ino_i->dirty = true;
406 mnode->ino_i = ino_i;
407 mnode->instance = inst;
[ee257b2]408 mnode->refcnt = 1;
409
410 link_initialize(&mnode->link);
[88ccd8b8]411
[ee257b2]412 unsigned long key[] = {
[03bc76a]413 [OPEN_NODES_SERVICE_KEY] = inst->service_id,
[ee257b2]414 [OPEN_NODES_INODE_KEY] = inum,
415 };
416
417 fibril_mutex_lock(&open_nodes_lock);
418 hash_table_insert(&open_nodes, key, &mnode->link);
419 fibril_mutex_unlock(&open_nodes_lock);
420 inst->open_nodes_cnt++;
421
422 mnode->ino_i->dirty = true;
[88ccd8b8]423
424 fs_node_initialize(fsnode);
425 fsnode->data = mnode;
[ee257b2]426 mnode->fsnode = fsnode;
[88ccd8b8]427 *rfn = fsnode;
428
429 return EOK;
430
431out_err_2:
432 free(mnode);
433out_err_1:
434 free(ino_i);
435out_err:
436 return r;
[10eb754]437}
438
[6d4d883]439static int
440mfs_match(fs_node_t **rfn, fs_node_t *pfn, const char *component)
[bd64680]441{
442 struct mfs_node *mnode = pfn->data;
443 struct mfs_ino_info *ino_i = mnode->ino_i;
[e80c2ff]444 struct mfs_dentry_info d_info;
[488f7ed]445 int r;
[bd64680]446
[ee257b2]447 mfsdebug("%s()\n", __FUNCTION__);
448
[bd64680]449 if (!S_ISDIR(ino_i->i_mode))
450 return ENOTDIR;
451
452 struct mfs_sb_info *sbi = mnode->instance->sbi;
453 const size_t comp_size = str_size(component);
454
[e80c2ff]455 unsigned i;
456 for (i = 0; i < mnode->ino_i->i_size / sbi->dirsize; ++i) {
[3a5ee6c]457 r = mfs_read_dentry(mnode, &d_info, i);
[c699b0c]458 if (r != EOK)
459 return r;
[488f7ed]460
[e80c2ff]461 if (!d_info.d_inum) {
[6d4d883]462 /* This entry is not used */
[bd64680]463 continue;
464 }
465
[367d67fe]466 const size_t dentry_name_size = str_size(d_info.d_name);
467
468 if (comp_size == dentry_name_size &&
[6d4d883]469 !bcmp(component, d_info.d_name, dentry_name_size)) {
470 /* Hit! */
[bd64680]471 mfs_node_core_get(rfn, mnode->instance,
[6d4d883]472 d_info.d_inum);
[bd64680]473 goto found;
474 }
475 }
476 *rfn = NULL;
477found:
478 return EOK;
479}
480
[6d4d883]481static aoff64_t
482mfs_size_get(fs_node_t *node)
[0d6ab10]483{
484 const struct mfs_node *mnode = node->data;
[155f792]485 return mnode->ino_i->i_size;
[0d6ab10]486}
487
[03bc76a]488static int
489mfs_node_get(fs_node_t **rfn, service_id_t service_id,
[6d4d883]490 fs_index_t index)
[44c0f5b]491{
492 int rc;
493 struct mfs_instance *instance;
494
[ee257b2]495 mfsdebug("%s()\n", __FUNCTION__);
496
[03bc76a]497 rc = mfs_instance_get(service_id, &instance);
[c699b0c]498 if (rc != EOK)
499 return rc;
[44c0f5b]500
501 return mfs_node_core_get(rfn, instance, index);
502}
503
[03bc76a]504static int
505mfs_node_put(fs_node_t *fsnode)
[41202a9]506{
[ee257b2]507 int rc = EOK;
[41202a9]508 struct mfs_node *mnode = fsnode->data;
509
[ee257b2]510 mfsdebug("%s()\n", __FUNCTION__);
511
512 fibril_mutex_lock(&open_nodes_lock);
513
514 assert(mnode->refcnt > 0);
515 mnode->refcnt--;
516 if (mnode->refcnt == 0) {
517 unsigned long key[] = {
[03bc76a]518 [OPEN_NODES_SERVICE_KEY] = mnode->instance->service_id,
[ee257b2]519 [OPEN_NODES_INODE_KEY] = mnode->ino_i->index
520 };
521 hash_table_remove(&open_nodes, key, OPEN_NODES_KEYS);
522 assert(mnode->instance->open_nodes_cnt > 0);
523 mnode->instance->open_nodes_cnt--;
[5f509cc]524 rc = mfs_put_inode(mnode);
[ee257b2]525 free(mnode->ino_i);
526 free(mnode);
527 free(fsnode);
528 }
[41202a9]529
[ee257b2]530 fibril_mutex_unlock(&open_nodes_lock);
531 return rc;
[41202a9]532}
533
[6d4d883]534static int
535mfs_node_open(fs_node_t *fsnode)
[41202a9]536{
537 /*
538 * Opening a file is stateless, nothing
539 * to be done here.
540 */
541 return EOK;
542}
543
[6d4d883]544static fs_index_t
545mfs_index_get(fs_node_t *fsnode)
[41202a9]546{
547 struct mfs_node *mnode = fsnode->data;
548 return mnode->ino_i->index;
549}
550
[6d4d883]551static unsigned
552mfs_lnkcnt_get(fs_node_t *fsnode)
[41202a9]553{
554 struct mfs_node *mnode = fsnode->data;
555
[75e0f15]556 mfsdebug("%s() %d\n", __FUNCTION__, mnode->ino_i->i_nlinks);
[ee257b2]557
[bbd4c72]558 if (S_ISDIR(mnode->ino_i->i_mode)) {
559 if (mnode->ino_i->i_nlinks > 1)
560 return 1;
561 else
562 return 0;
[75e0f15]563 } else
564 return mnode->ino_i->i_nlinks;
[41202a9]565}
566
[6d4d883]567static int
568mfs_node_core_get(fs_node_t **rfn, struct mfs_instance *inst,
569 fs_index_t index)
[44c0f5b]570{
571 fs_node_t *node = NULL;
572 struct mfs_node *mnode = NULL;
573 int rc;
574
[ee257b2]575 mfsdebug("%s()\n", __FUNCTION__);
576
577 fibril_mutex_lock(&open_nodes_lock);
578
579 /* Check if the node is not already open */
580 unsigned long key[] = {
[03bc76a]581 [OPEN_NODES_SERVICE_KEY] = inst->service_id,
[ee257b2]582 [OPEN_NODES_INODE_KEY] = index,
583 };
584 link_t *already_open = hash_table_find(&open_nodes, key);
585
586 if (already_open) {
587 mnode = hash_table_get_instance(already_open, struct mfs_node, link);
588 *rfn = mnode->fsnode;
589 mnode->refcnt++;
590
591 fibril_mutex_unlock(&open_nodes_lock);
592 return EOK;
593 }
594
[b438804]595 node = malloc(sizeof(fs_node_t));
[44c0f5b]596 if (!node) {
597 rc = ENOMEM;
598 goto out_err;
599 }
600
601 fs_node_initialize(node);
602
[b438804]603 mnode = malloc(sizeof(*mnode));
[44c0f5b]604 if (!mnode) {
605 rc = ENOMEM;
606 goto out_err;
607 }
608
[155f792]609 struct mfs_ino_info *ino_i;
610
[3a5ee6c]611 rc = mfs_get_inode(inst, &ino_i, index);
[c699b0c]612 if (rc != EOK)
613 goto out_err;
[155f792]614
[41202a9]615 ino_i->index = index;
[155f792]616 mnode->ino_i = ino_i;
[ee257b2]617 mnode->refcnt = 1;
618 link_initialize(&mnode->link);
[155f792]619
[44c0f5b]620 mnode->instance = inst;
621 node->data = mnode;
[ee257b2]622 mnode->fsnode = node;
[44c0f5b]623 *rfn = node;
624
[ee257b2]625 hash_table_insert(&open_nodes, key, &mnode->link);
626 inst->open_nodes_cnt++;
627
628 fibril_mutex_unlock(&open_nodes_lock);
629
[44c0f5b]630 return EOK;
631
632out_err:
633 if (node)
634 free(node);
635 if (mnode)
636 free(mnode);
[ee257b2]637 fibril_mutex_unlock(&open_nodes_lock);
[44c0f5b]638 return rc;
639}
640
[6d4d883]641static bool
642mfs_is_directory(fs_node_t *fsnode)
[5a58ae2]643{
[44c0f5b]644 const struct mfs_node *node = fsnode->data;
[155f792]645 return S_ISDIR(node->ino_i->i_mode);
[5a58ae2]646}
647
[6d4d883]648static bool
649mfs_is_file(fs_node_t *fsnode)
[7d04324]650{
651 struct mfs_node *node = fsnode->data;
[155f792]652 return S_ISREG(node->ino_i->i_mode);
[7d04324]653}
654
[6d4d883]655static int
656mfs_root_get(fs_node_t **rfn, service_id_t service_id)
[fe4ac35]657{
[03bc76a]658 int rc = mfs_node_get(rfn, service_id, MFS_ROOT_INO);
[41202a9]659 return rc;
[fe4ac35]660}
661
[6d4d883]662static int
663mfs_link(fs_node_t *pfn, fs_node_t *cfn, const char *name)
[88ccd8b8]664{
[afd9c3b]665 struct mfs_node *parent = pfn->data;
666 struct mfs_node *child = cfn->data;
[48de019]667 struct mfs_sb_info *sbi = parent->instance->sbi;
668
[ee257b2]669 mfsdebug("%s()\n", __FUNCTION__);
670
[48de019]671 if (str_size(name) > sbi->max_name_len)
672 return ENAMETOOLONG;
[afd9c3b]673
[3a5ee6c]674 int r = mfs_insert_dentry(parent, name, child->ino_i->index);
[c699b0c]675 if (r != EOK)
676 goto exit_error;
[13ecdac9]677
678 if (S_ISDIR(child->ino_i->i_mode)) {
[3a5ee6c]679 r = mfs_insert_dentry(child, ".", child->ino_i->index);
[c699b0c]680 if (r != EOK)
681 goto exit_error;
[bbd4c72]682
[3a5ee6c]683 r = mfs_insert_dentry(child, "..", parent->ino_i->index);
[c699b0c]684 if (r != EOK)
685 goto exit_error;
[bbd4c72]686
687 parent->ino_i->i_nlinks++;
688 parent->ino_i->dirty = true;
[13ecdac9]689 }
[afd9c3b]690
[13ecdac9]691exit_error:
[afd9c3b]692 return r;
[88ccd8b8]693}
694
[53eb588]695static int
696mfs_unlink(fs_node_t *pfn, fs_node_t *cfn, const char *name)
697{
698 struct mfs_node *parent = pfn->data;
699 struct mfs_node *child = cfn->data;
700 bool has_children;
701 int r;
702
[ee257b2]703 mfsdebug("%s()\n", __FUNCTION__);
704
[53eb588]705 if (!parent)
706 return EBUSY;
707
708 r = mfs_has_children(&has_children, cfn);
[c699b0c]709 if (r != EOK)
710 return r;
[3f3e5b5]711
[53eb588]712 if (has_children)
713 return ENOTEMPTY;
714
[3a5ee6c]715 r = mfs_remove_dentry(parent, name);
[c699b0c]716 if (r != EOK)
717 return r;
[53eb588]718
719 struct mfs_ino_info *chino = child->ino_i;
720
721 assert(chino->i_nlinks >= 1);
[bbd4c72]722 chino->i_nlinks--;
723 mfsdebug("Links: %d\n", chino->i_nlinks);
724
725 if (chino->i_nlinks <= 1 && S_ISDIR(chino->i_mode)) {
726 /* The child directory will be destroyed, decrease the
727 * parent hard links counter.
728 */
[ee257b2]729 parent->ino_i->i_nlinks--;
730 parent->ino_i->dirty = true;
731 }
732
[53eb588]733 chino->dirty = true;
734
[ee257b2]735 return r;
[53eb588]736}
737
[6d4d883]738static int
739mfs_has_children(bool *has_children, fs_node_t *fsnode)
[54caa41b]740{
741 struct mfs_node *mnode = fsnode->data;
[e80c2ff]742 struct mfs_sb_info *sbi = mnode->instance->sbi;
[488f7ed]743 int r;
[54caa41b]744
745 *has_children = false;
746
747 if (!S_ISDIR(mnode->ino_i->i_mode))
748 goto out;
749
[e80c2ff]750 struct mfs_dentry_info d_info;
[44c6091f]751
[ac28650]752 /* The first two dentries are always . and .. */
[e80c2ff]753 unsigned i;
[3f3e5b5]754 for (i = 2; i < mnode->ino_i->i_size / sbi->dirsize; ++i) {
[3a5ee6c]755 r = mfs_read_dentry(mnode, &d_info, i);
[c699b0c]756 if (r != EOK)
757 return r;
[54caa41b]758
[e80c2ff]759 if (d_info.d_inum) {
[6d4d883]760 /* A valid entry has been found */
[54caa41b]761 *has_children = true;
762 break;
763 }
764 }
[41202a9]765out:
766
[54caa41b]767 return EOK;
768}
769
[03bc76a]770static int
771mfs_read(service_id_t service_id, fs_index_t index, aoff64_t pos,
[6d4d883]772 size_t *rbytes)
[668f1949]773{
774 int rc;
775 fs_node_t *fn;
776
[03bc76a]777 rc = mfs_node_get(&fn, service_id, index);
778 if (rc != EOK)
779 return rc;
780 if (!fn)
781 return ENOENT;
[668f1949]782
783 struct mfs_node *mnode;
784 struct mfs_ino_info *ino_i;
785 size_t len, bytes = 0;
786 ipc_callid_t callid;
787
788 mnode = fn->data;
789 ino_i = mnode->ino_i;
790
791 if (!async_data_read_receive(&callid, &len)) {
[230229de]792 rc = EINVAL;
793 goto out_error;
[668f1949]794 }
795
796 if (S_ISDIR(ino_i->i_mode)) {
797 aoff64_t spos = pos;
[e80c2ff]798 struct mfs_dentry_info d_info;
799 struct mfs_sb_info *sbi = mnode->instance->sbi;
[668f1949]800
[e8b6b6a]801 if (pos < 2) {
[6d4d883]802 /* Skip the first two dentries ('.' and '..') */
[e8b6b6a]803 pos = 2;
804 }
805
[3f3e5b5]806 for (; pos < mnode->ino_i->i_size / sbi->dirsize; ++pos) {
[3a5ee6c]807 rc = mfs_read_dentry(mnode, &d_info, pos);
[c699b0c]808 if (rc != EOK)
809 goto out_error;
[488f7ed]810
[e80c2ff]811 if (d_info.d_inum) {
[6d4d883]812 /* Dentry found! */
[668f1949]813 goto found;
814 }
815 }
816
817 rc = mfs_node_put(fn);
818 async_answer_0(callid, rc != EOK ? rc : ENOENT);
[03bc76a]819 return rc;
[668f1949]820found:
[e80c2ff]821 async_data_read_finalize(callid, d_info.d_name,
822 str_size(d_info.d_name) + 1);
[668f1949]823 bytes = ((pos - spos) + 1);
[230229de]824 } else {
825 struct mfs_sb_info *sbi = mnode->instance->sbi;
826
827 if (pos >= (size_t) ino_i->i_size) {
[6d4d883]828 /* Trying to read beyond the end of file */
[230229de]829 bytes = 0;
830 (void) async_data_read_finalize(callid, NULL, 0);
831 goto out_success;
832 }
833
834 bytes = min(len, sbi->block_size - pos % sbi->block_size);
835 bytes = min(bytes, ino_i->i_size - pos);
836
837 uint32_t zone;
838 block_t *b;
[668f1949]839
[3a5ee6c]840 rc = mfs_read_map(&zone, mnode, pos);
[c699b0c]841 if (rc != EOK)
842 goto out_error;
[230229de]843
844 if (zone == 0) {
[6d4d883]845 /* sparse file */
[230229de]846 uint8_t *buf = malloc(sbi->block_size);
847 if (!buf) {
848 rc = ENOMEM;
849 goto out_error;
850 }
[6fc5262]851 memset(buf, 0, sizeof(sbi->block_size));
[230229de]852 async_data_read_finalize(callid,
[6d4d883]853 buf + pos % sbi->block_size, bytes);
[230229de]854 free(buf);
855 goto out_success;
856 }
857
[03bc76a]858 rc = block_get(&b, service_id, zone, BLOCK_FLAGS_NONE);
[c699b0c]859 if (rc != EOK)
860 goto out_error;
[230229de]861
862 async_data_read_finalize(callid, b->data +
[6d4d883]863 pos % sbi->block_size, bytes);
[230229de]864
865 rc = block_put(b);
866 if (rc != EOK) {
867 mfs_node_put(fn);
[03bc76a]868 return rc;
[230229de]869 }
870 }
871out_success:
[668f1949]872 rc = mfs_node_put(fn);
[03bc76a]873 *rbytes = bytes;
874 return rc;
[44c6091f]875out_error:
876 ;
[230229de]877 int tmp = mfs_node_put(fn);
878 async_answer_0(callid, tmp != EOK ? tmp : rc);
[03bc76a]879 return tmp != EOK ? tmp : rc;
[668f1949]880}
881
[03bc76a]882static int
883mfs_write(service_id_t service_id, fs_index_t index, aoff64_t pos,
[6d4d883]884 size_t *wbytes, aoff64_t *nsize)
[bb7e8382]885{
886 fs_node_t *fn;
887 int r;
888 int flags = BLOCK_FLAGS_NONE;
889
[03bc76a]890 r = mfs_node_get(&fn, service_id, index);
891 if (r != EOK)
892 return r;
893 if (!fn)
894 return ENOENT;
[bb7e8382]895
896 ipc_callid_t callid;
897 size_t len;
898
899 if (!async_data_write_receive(&callid, &len)) {
900 r = EINVAL;
901 goto out_err;
902 }
903
904 struct mfs_node *mnode = fn->data;
905 struct mfs_sb_info *sbi = mnode->instance->sbi;
906 struct mfs_ino_info *ino_i = mnode->ino_i;
907 const size_t bs = sbi->block_size;
[36cb22f]908 size_t bytes = min(len, bs - (pos % bs));
[bb7e8382]909 uint32_t block;
910
911 if (bytes == bs)
912 flags = BLOCK_FLAGS_NOREAD;
913
[36cb22f]914 r = mfs_read_map(&block, mnode, pos);
915 if (r != EOK)
916 goto out_err;
[bb7e8382]917
[36cb22f]918 if (block == 0) {
[bb7e8382]919 uint32_t dummy;
920
[70ac0af]921 r = mfs_alloc_zone(mnode->instance, &block);
[c699b0c]922 if (r != EOK)
923 goto out_err;
[36cb22f]924
[3a5ee6c]925 r = mfs_write_map(mnode, pos, block, &dummy);
[c699b0c]926 if (r != EOK)
927 goto out_err;
[36cb22f]928
929 flags = BLOCK_FLAGS_NOREAD;
[bb7e8382]930 }
931
932 block_t *b;
[03bc76a]933 r = block_get(&b, service_id, block, flags);
[c699b0c]934 if (r != EOK)
935 goto out_err;
[bb7e8382]936
[36cb22f]937 if (flags == BLOCK_FLAGS_NOREAD)
938 memset(b->data, 0, sbi->block_size);
939
940 async_data_write_finalize(callid, b->data + (pos % bs), bytes);
[bb7e8382]941 b->dirty = true;
942
943 r = block_put(b);
944 if (r != EOK) {
945 mfs_node_put(fn);
[03bc76a]946 return r;
[bb7e8382]947 }
948
[36cb22f]949 if (pos + bytes > ino_i->i_size) {
950 ino_i->i_size = pos + bytes;
951 ino_i->dirty = true;
952 }
[bb7e8382]953 r = mfs_node_put(fn);
[36cb22f]954 *nsize = ino_i->i_size;
[03bc76a]955 *wbytes = bytes;
956 return r;
[bb7e8382]957
958out_err:
959 mfs_node_put(fn);
960 async_answer_0(callid, r);
[03bc76a]961 return r;
[bb7e8382]962}
963
[03bc76a]964static int
965mfs_destroy(service_id_t service_id, fs_index_t index)
[d8af1bd]966{
967 fs_node_t *fn;
968 int r;
969
[03bc76a]970 r = mfs_node_get(&fn, service_id, index);
971 if (r != EOK)
972 return r;
973 if (!fn)
974 return ENOENT;
[d8af1bd]975
[6d4d883]976 /* Destroy the inode */
[e03d545]977 return mfs_destroy_node(fn);
[d8af1bd]978}
979
980static int
981mfs_destroy_node(fs_node_t *fn)
982{
983 struct mfs_node *mnode = fn->data;
984 bool has_children;
985 int r;
986
[a5bad72]987 mfsdebug("mfs_destroy_node %d\n", mnode->ino_i->index);
988
[d8af1bd]989 r = mfs_has_children(&has_children, fn);
[c699b0c]990 if (r != EOK)
991 goto out;
[d8af1bd]992
993 assert(!has_children);
994
[6d4d883]995 /* Free the entire inode content */
[3a5ee6c]996 r = mfs_inode_shrink(mnode, mnode->ino_i->i_size);
[c699b0c]997 if (r != EOK)
998 goto out;
[e03d545]999
[6d4d883]1000 /* Mark the inode as free in the bitmap */
[70ac0af]1001 r = mfs_free_inode(mnode->instance, mnode->ino_i->index);
[d8af1bd]1002
[51db5aeb]1003out:
[eefb653]1004 mfs_node_put(fn);
[d8af1bd]1005 return r;
1006}
1007
[03bc76a]1008static int
1009mfs_truncate(service_id_t service_id, fs_index_t index, aoff64_t size)
[8a49fed]1010{
1011 fs_node_t *fn;
1012 int r;
1013
[03bc76a]1014 r = mfs_node_get(&fn, service_id, index);
1015 if (r != EOK)
1016 return r;
1017 if (!fn)
1018 return r;
[8a49fed]1019
1020 struct mfs_node *mnode = fn->data;
1021 struct mfs_ino_info *ino_i = mnode->ino_i;
1022
1023 if (ino_i->i_size == size)
1024 r = EOK;
1025 else
[3a5ee6c]1026 r = mfs_inode_shrink(mnode, ino_i->i_size - size);
[8a49fed]1027
1028 mfs_node_put(fn);
[03bc76a]1029 return r;
[8a49fed]1030}
1031
[03bc76a]1032static int
1033mfs_instance_get(service_id_t service_id, struct mfs_instance **instance)
[3b08178]1034{
[5bf76c1]1035 void *data;
1036 int rc;
[44c6091f]1037
[5bf76c1]1038 rc = fs_instance_get(service_id, &data);
[6d4d883]1039 if (rc == EOK)
[5bf76c1]1040 *instance = (struct mfs_instance *) data;
[6d4d883]1041 else {
[5bf76c1]1042 mfsdebug("instance not found\n");
[3b08178]1043 }
1044
[5bf76c1]1045 return rc;
[3b08178]1046}
1047
[6d4d883]1048static bool
1049check_magic_number(uint16_t magic, bool *native,
1050 mfs_version_t *version, bool *longfilenames)
[9e3dc95]1051{
[cfac897]1052 bool rc = true;
[8ceba1e]1053 *longfilenames = false;
1054
[57640e7]1055 if (magic == MFS_MAGIC_V1 || magic == MFS_MAGIC_V1R) {
1056 *native = magic == MFS_MAGIC_V1;
[9e3dc95]1057 *version = MFS_VERSION_V1;
[8ceba1e]1058 } else if (magic == MFS_MAGIC_V1L || magic == MFS_MAGIC_V1LR) {
1059 *native = magic == MFS_MAGIC_V1L;
1060 *version = MFS_VERSION_V1;
1061 *longfilenames = true;
[57640e7]1062 } else if (magic == MFS_MAGIC_V2 || magic == MFS_MAGIC_V2R) {
1063 *native = magic == MFS_MAGIC_V2;
[9e3dc95]1064 *version = MFS_VERSION_V2;
[8ceba1e]1065 } else if (magic == MFS_MAGIC_V2L || magic == MFS_MAGIC_V2LR) {
1066 *native = magic == MFS_MAGIC_V2L;
1067 *version = MFS_VERSION_V2;
1068 *longfilenames = true;
[57640e7]1069 } else if (magic == MFS_MAGIC_V3 || magic == MFS_MAGIC_V3R) {
1070 *native = magic == MFS_MAGIC_V3;
[9e3dc95]1071 *version = MFS_VERSION_V3;
[cfac897]1072 } else
1073 rc = false;
[9e3dc95]1074
[7a96476]1075 return rc;
[096c8835]1076}
1077
[df3caec5]1078/** Filesystem sanity check
1079 *
1080 * @param Pointer to the MFS superblock.
1081 *
1082 * @return EOK on success, ENOTSUP otherwise.
1083 */
1084static int
1085mfs_check_sanity(struct mfs_sb_info *sbi)
1086{
1087 if (!is_power_of_two(sbi->block_size) ||
1088 sbi->block_size < MFS_MIN_BLOCKSIZE ||
1089 sbi->block_size > MFS_MAX_BLOCKSIZE)
1090 return ENOTSUP;
1091 else if (sbi->ibmap_blocks == 0 || sbi->zbmap_blocks == 0)
1092 return ENOTSUP;
1093 else if (sbi->ninodes == 0 || sbi->nzones == 0)
1094 return ENOTSUP;
1095 else if (sbi->firstdatazone == 0)
1096 return ENOTSUP;
1097
1098 return EOK;
1099}
1100
[03bc76a]1101static int
1102mfs_close(service_id_t service_id, fs_index_t index)
[e700970]1103{
[03bc76a]1104 return 0;
[e700970]1105}
1106
[03bc76a]1107static int
1108mfs_sync(service_id_t service_id, fs_index_t index)
[51db5aeb]1109{
1110 fs_node_t *fn;
[03bc76a]1111 int rc = mfs_node_get(&fn, service_id, index);
1112 if (rc != EOK)
1113 return rc;
1114 if (!fn)
1115 return ENOENT;
[51db5aeb]1116
1117 struct mfs_node *mnode = fn->data;
1118 mnode->ino_i->dirty = true;
1119
[03bc76a]1120 return mfs_node_put(fn);
[51db5aeb]1121}
1122
[df3caec5]1123/** Check if a given number is a power of two.
1124 *
1125 * @param n The number to check.
1126 *
1127 * @return true if it is a power of two, false otherwise.
1128 */
1129static bool
1130is_power_of_two(uint32_t n)
1131{
1132 if (n == 0)
1133 return false;
1134
1135 return (n & (n - 1)) == 0;
1136}
1137
[03bc76a]1138vfs_out_ops_t mfs_ops = {
1139 .mounted = mfs_mounted,
1140 .unmounted = mfs_unmounted,
1141 .read = mfs_read,
1142 .write = mfs_write,
1143 .truncate = mfs_truncate,
1144 .close = mfs_close,
1145 .destroy = mfs_destroy,
1146 .sync = mfs_sync,
1147};
1148
[096c8835]1149/**
1150 * @}
[44c6091f]1151 */
[096c8835]1152
Note: See TracBrowser for help on using the repository browser.