source: mainline/uspace/srv/fs/fat/fat_directory.c

Last change on this file was b1834a01, checked in by Jakub Jermar <jakub@…>, 7 years ago

Categorize the remaining orphan doxygroups

  • Property mode set to 100644
File size: 12.5 KB
RevLine 
[da2f8d10]1/*
[c4bbca8]2 * Copyright (c) 2011 Oleg Romanenko
[da2f8d10]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
[b1834a01]29/** @addtogroup fat
[da2f8d10]30 * @{
[1b20da0]31 */
[da2f8d10]32
33/**
34 * @file fat_directory.c
35 * @brief Functions that work with FAT directory.
36 */
37
38#include "fat_directory.h"
[5dfb1948]39#include "fat_fat.h"
[f73b291]40#include <block.h>
[da2f8d10]41#include <errno.h>
42#include <byteorder.h>
[c6aca755]43#include <mem.h>
[4372b49]44#include <str.h>
[521550d]45#include <align.h>
[c065743]46#include <stdio.h>
[c6aca755]47
[b7fd2a0]48errno_t fat_directory_open(fat_node_t *nodep, fat_directory_t *di)
[da2f8d10]49{
[c6aca755]50 di->b = NULL;
[1b20da0]51 di->nodep = nodep;
[da2f8d10]52 if (di->nodep->type != FAT_DIRECTORY)
53 return EINVAL;
54
[375ab5e]55 di->bs = block_bb_get(di->nodep->idx->service_id);
[5d95f02]56 di->blocks = ROUND_UP(nodep->size, BPS(di->bs)) / BPS(di->bs);
[da2f8d10]57 di->pos = 0;
58 di->bnum = 0;
59 di->last = false;
[5d95f02]60
[da2f8d10]61 return EOK;
62}
63
[b7fd2a0]64errno_t fat_directory_close(fat_directory_t *di)
[da2f8d10]65{
[b7fd2a0]66 errno_t rc = EOK;
[a35b458]67
[da2f8d10]68 if (di->b)
69 rc = block_put(di->b);
[a35b458]70
[da2f8d10]71 return rc;
72}
73
[b7fd2a0]74static errno_t fat_directory_block_load(fat_directory_t *di)
[da2f8d10]75{
76 uint32_t i;
[b7fd2a0]77 errno_t rc;
[c6aca755]78
[da2f8d10]79 i = (di->pos * sizeof(fat_dentry_t)) / BPS(di->bs);
80 if (i < di->blocks) {
81 if (di->b && di->bnum != i) {
82 block_put(di->b);
83 di->b = NULL;
84 }
85 if (!di->b) {
[5d95f02]86 rc = fat_block_get(&di->b, di->bs, di->nodep, i,
87 BLOCK_FLAGS_NONE);
[52ee8b7a]88 if (rc != EOK) {
[7a819535]89 di->b = NULL;
[da2f8d10]90 return rc;
[52ee8b7a]91 }
92 di->bnum = i;
[da2f8d10]93 }
94 return EOK;
95 }
[5d95f02]96
[da2f8d10]97 return ENOENT;
98}
99
[b7fd2a0]100errno_t fat_directory_next(fat_directory_t *di)
[c6aca755]101{
[b7fd2a0]102 errno_t rc;
[c6aca755]103
104 di->pos += 1;
105 rc = fat_directory_block_load(di);
[5d95f02]106 if (rc != EOK)
[c6aca755]107 di->pos -= 1;
[a35b458]108
[c6aca755]109 return rc;
110}
111
[b7fd2a0]112errno_t fat_directory_prev(fat_directory_t *di)
[c6aca755]113{
[b7fd2a0]114 errno_t rc = EOK;
[a35b458]115
[c6aca755]116 if (di->pos > 0) {
117 di->pos -= 1;
[5d95f02]118 rc = fat_directory_block_load(di);
119 } else
[c6aca755]120 return ENOENT;
[a35b458]121
[5d95f02]122 if (rc != EOK)
[c6aca755]123 di->pos += 1;
[a35b458]124
[c6aca755]125 return rc;
126}
127
[b7fd2a0]128errno_t fat_directory_seek(fat_directory_t *di, aoff64_t pos)
[c6aca755]129{
130 aoff64_t _pos = di->pos;
[b7fd2a0]131 errno_t rc;
[5dfb1948]132
[c6aca755]133 di->pos = pos;
134 rc = fat_directory_block_load(di);
[5d95f02]135 if (rc != EOK)
[c6aca755]136 di->pos = _pos;
[a35b458]137
[c6aca755]138 return rc;
139}
140
[b7fd2a0]141errno_t fat_directory_get(fat_directory_t *di, fat_dentry_t **d)
[c6aca755]142{
[b7fd2a0]143 errno_t rc;
[a35b458]144
[c6aca755]145 rc = fat_directory_block_load(di);
146 if (rc == EOK) {
147 aoff64_t o = di->pos % (BPS(di->bs) / sizeof(fat_dentry_t));
148 *d = ((fat_dentry_t *)di->b->data) + o;
149 }
[a35b458]150
[c6aca755]151 return rc;
152}
153
[b7fd2a0]154errno_t fat_directory_read(fat_directory_t *di, char *name, fat_dentry_t **de)
[da2f8d10]155{
156 fat_dentry_t *d = NULL;
[b06414f]157 uint16_t wname[FAT_LFN_NAME_LEN];
[298a6ce]158 size_t lfn_offset, lfn_size;
159 bool long_entry = false;
160 int long_entry_count = 0;
161 uint8_t checksum = 0;
[b7fd2a0]162 errno_t rc;
[da2f8d10]163
[b6913b7]164 void *data;
165 fat_instance_t *instance;
166
167 rc = fs_instance_get(di->nodep->idx->service_id, &data);
168 assert(rc == EOK);
169 instance = (fat_instance_t *) data;
[a35b458]170
[c6aca755]171 do {
[5d95f02]172 rc = fat_directory_get(di, &d);
173 if (rc != EOK)
174 return rc;
175
176 switch (fat_classify_dentry(d)) {
177 case FAT_DENTRY_LAST:
178 long_entry_count = 0;
179 long_entry = false;
180 return ENOENT;
181 case FAT_DENTRY_LFN:
182 if (long_entry) {
183 /* We found long entry */
184 long_entry_count--;
[1b20da0]185 if ((FAT_LFN_ORDER(d) == long_entry_count) &&
[b6913b7]186 (checksum == FAT_LFN_CHKSUM(d))) {
[5d95f02]187 /* Right order! */
188 fat_lfn_get_entry(d, wname,
189 &lfn_offset);
[c6aca755]190 } else {
[5d95f02]191 /*
192 * Something wrong with order.
193 * Skip this long entries set.
194 */
195 long_entry_count = 0;
196 long_entry = false;
[da2f8d10]197 }
[b6913b7]198 } else if (FAT_IS_LFN(d) && instance->lfn_enabled) {
[5d95f02]199 /* We found Last long entry! */
200 if (FAT_LFN_COUNT(d) <= FAT_LFN_MAX_COUNT) {
201 long_entry = true;
202 long_entry_count = FAT_LFN_COUNT(d);
[1b20da0]203 lfn_size = (FAT_LFN_ENTRY_SIZE *
[5d95f02]204 (FAT_LFN_COUNT(d) - 1)) +
205 fat_lfn_size(d);
206 lfn_offset = lfn_size;
207 fat_lfn_get_entry(d, wname,
208 &lfn_offset);
209 checksum = FAT_LFN_CHKSUM(d);
[c6aca755]210 }
[5d95f02]211 }
212 break;
213 case FAT_DENTRY_VALID:
[1b20da0]214 if (long_entry &&
[5d95f02]215 (checksum == fat_dentry_chksum(d->name))) {
216 wname[lfn_size] = '\0';
217 if (utf16_to_str(name, FAT_LFN_NAME_SIZE,
218 wname) != EOK)
[da2f8d10]219 fat_dentry_name_get(d, name);
[5d95f02]220 } else
221 fat_dentry_name_get(d, name);
[a35b458]222
[5d95f02]223 *de = d;
224 return EOK;
225 case FAT_DENTRY_SKIP:
226 case FAT_DENTRY_FREE:
[39b0a51]227 case FAT_DENTRY_VOLLABEL:
228 default:
[5d95f02]229 long_entry_count = 0;
230 long_entry = false;
231 break;
[da2f8d10]232 }
[c6aca755]233 } while (fat_directory_next(di) == EOK);
[a35b458]234
[da2f8d10]235 return ENOENT;
236}
237
[b7fd2a0]238errno_t fat_directory_erase(fat_directory_t *di)
[c6aca755]239{
[b7fd2a0]240 errno_t rc;
[c6aca755]241 fat_dentry_t *d;
242 bool flag = false;
[298a6ce]243 uint8_t checksum;
[c6aca755]244
245 rc = fat_directory_get(di, &d);
246 if (rc != EOK)
247 return rc;
[298a6ce]248 checksum = fat_dentry_chksum(d->name);
[c6aca755]249
250 d->name[0] = FAT_DENTRY_ERASED;
251 di->b->dirty = true;
[a35b458]252
[c6aca755]253 while (!flag && fat_directory_prev(di) == EOK) {
254 if (fat_directory_get(di, &d) == EOK &&
[1b20da0]255 fat_classify_dentry(d) == FAT_DENTRY_LFN &&
[5d95f02]256 checksum == FAT_LFN_CHKSUM(d)) {
257 if (FAT_IS_LFN(d))
258 flag = true;
259 memset(d, 0, sizeof(fat_dentry_t));
260 d->name[0] = FAT_DENTRY_ERASED;
261 di->b->dirty = true;
262 } else
[c6aca755]263 break;
264 }
265
266 return EOK;
267}
268
[b7fd2a0]269errno_t fat_directory_write(fat_directory_t *di, const char *name, fat_dentry_t *de)
[5dfb1948]270{
[b7fd2a0]271 errno_t rc;
[32f623d9]272 void *data;
273 fat_instance_t *instance;
274
275 rc = fs_instance_get(di->nodep->idx->service_id, &data);
276 assert(rc == EOK);
277 instance = (fat_instance_t *) data;
[a35b458]278
[3e018e45]279 if (fat_valid_short_name(name)) {
[5d95f02]280 /*
281 * NAME could be directly stored in dentry without creating
282 * LFN.
283 */
[5dfb1948]284 fat_dentry_name_set(de, name);
285 if (fat_directory_is_sfn_exist(di, de))
286 return EEXIST;
287 rc = fat_directory_lookup_free(di, 1);
288 if (rc != EOK)
289 return rc;
290 rc = fat_directory_write_dentry(di, de);
[3e018e45]291 return rc;
[32f623d9]292 } else if (instance->lfn_enabled && fat_valid_name(name)) {
[3e018e45]293 /* We should create long entries to store name */
294 int long_entry_count;
295 uint8_t checksum;
[b06414f]296 uint16_t wname[FAT_LFN_NAME_LEN];
[3e018e45]297 size_t lfn_size, lfn_offset;
[a35b458]298
[b06414f]299 rc = str_to_utf16(wname, FAT_LFN_NAME_LEN, name);
[5dfb1948]300 if (rc != EOK)
301 return rc;
[a35b458]302
[b2906c0]303 lfn_size = utf16_wsize(wname);
[298a6ce]304 long_entry_count = lfn_size / FAT_LFN_ENTRY_SIZE;
305 if (lfn_size % FAT_LFN_ENTRY_SIZE)
306 long_entry_count++;
[32f623d9]307 rc = fat_directory_lookup_free(di, long_entry_count + 1);
[5dfb1948]308 if (rc != EOK)
309 return rc;
310 aoff64_t start_pos = di->pos;
311
312 /* Write Short entry */
[3e018e45]313 rc = fat_directory_create_sfn(di, de, name);
[5dfb1948]314 if (rc != EOK)
315 return rc;
[298a6ce]316 checksum = fat_dentry_chksum(de->name);
[5dfb1948]317
[b6913b7]318 rc = fat_directory_seek(di, start_pos + long_entry_count);
[5dfb1948]319 if (rc != EOK)
320 return rc;
321 rc = fat_directory_write_dentry(di, de);
322 if (rc != EOK)
323 return rc;
324
325 /* Write Long entry by parts */
[298a6ce]326 lfn_offset = 0;
[5dfb1948]327 fat_dentry_t *d;
328 size_t idx = 0;
329 do {
330 rc = fat_directory_prev(di);
331 if (rc != EOK)
332 return rc;
333 rc = fat_directory_get(di, &d);
334 if (rc != EOK)
335 return rc;
[5d95f02]336 fat_lfn_set_entry(wname, &lfn_offset, lfn_size + 1, d);
[298a6ce]337 FAT_LFN_CHKSUM(d) = checksum;
[5dfb1948]338 FAT_LFN_ORDER(d) = ++idx;
339 di->b->dirty = true;
[298a6ce]340 } while (lfn_offset < lfn_size);
[5dfb1948]341 FAT_LFN_ORDER(d) |= FAT_LFN_LAST;
342
[32f623d9]343 rc = fat_directory_seek(di, start_pos + long_entry_count);
[3e018e45]344 return rc;
[5dfb1948]345 }
[3e018e45]346
347 return ENOTSUP;
[5dfb1948]348}
349
[b7fd2a0]350errno_t fat_directory_create_sfn(fat_directory_t *di, fat_dentry_t *de,
[5d95f02]351 const char *lname)
[5dfb1948]352{
[5d95f02]353 char name[FAT_NAME_LEN + 1];
354 char ext[FAT_EXT_LEN + 1];
355 char number[FAT_NAME_LEN + 1];
[5dfb1948]356 memset(name, FAT_PAD, FAT_NAME_LEN);
357 memset(ext, FAT_PAD, FAT_EXT_LEN);
358 memset(number, FAT_PAD, FAT_NAME_LEN);
359
[3e018e45]360 size_t name_len = str_size(lname);
361 char *pdot = str_rchr(lname, '.');
[5dfb1948]362 ext[FAT_EXT_LEN] = '\0';
363 if (pdot) {
364 pdot++;
[3e018e45]365 str_to_ascii(ext, pdot, FAT_EXT_LEN, FAT_SFN_CHAR);
366 name_len = (pdot - lname - 1);
[5dfb1948]367 }
368 if (name_len > FAT_NAME_LEN)
369 name_len = FAT_NAME_LEN;
[3e018e45]370 str_to_ascii(name, lname, name_len, FAT_SFN_CHAR);
[5dfb1948]371
[c065743]372 unsigned idx;
[5d95f02]373 for (idx = 1; idx <= FAT_MAX_SFN; idx++) {
[c065743]374 snprintf(number, sizeof(number), "%u", idx);
[5dfb1948]375
376 /* Fill de->name with FAT_PAD */
[5d95f02]377 memset(de->name, FAT_PAD, FAT_NAME_LEN + FAT_EXT_LEN);
[5dfb1948]378 /* Copy ext */
379 memcpy(de->ext, ext, str_size(ext));
380 /* Copy name */
381 memcpy(de->name, name, str_size(name));
382
383 /* Copy number */
384 size_t offset;
[1433ecda]385 if (str_size(name) + str_size(number) + 1 > FAT_NAME_LEN)
[5d95f02]386 offset = FAT_NAME_LEN - str_size(number) - 1;
[5dfb1948]387 else
388 offset = str_size(name);
389 de->name[offset] = '~';
390 offset++;
[5d95f02]391 memcpy(de->name + offset, number, str_size(number));
[5dfb1948]392
393 if (!fat_directory_is_sfn_exist(di, de))
394 return EOK;
395 }
[5d95f02]396
[5dfb1948]397 return ERANGE;
398}
399
[b7fd2a0]400errno_t fat_directory_write_dentry(fat_directory_t *di, fat_dentry_t *de)
[2d0d637]401{
[5dfb1948]402 fat_dentry_t *d;
[b7fd2a0]403 errno_t rc;
[5dfb1948]404
405 rc = fat_directory_get(di, &d);
[5d95f02]406 if (rc != EOK)
[5dfb1948]407 return rc;
408 memcpy(d, de, sizeof(fat_dentry_t));
409 di->b->dirty = true;
[5d95f02]410
[2d0d637]411 return EOK;
412}
413
[b7fd2a0]414errno_t fat_directory_expand(fat_directory_t *di)
[5dfb1948]415{
[b7fd2a0]416 errno_t rc;
[5dfb1948]417 fat_cluster_t mcl, lcl;
[2d0d637]418
[5dfb1948]419 if (!FAT_IS_FAT32(di->bs) && di->nodep->firstc == FAT_CLST_ROOT) {
420 /* Can't grow the root directory on FAT12/16. */
421 return ENOSPC;
422 }
[5d95f02]423 rc = fat_alloc_clusters(di->bs, di->nodep->idx->service_id, 1, &mcl,
424 &lcl);
[5dfb1948]425 if (rc != EOK)
426 return rc;
[375ab5e]427 rc = fat_zero_cluster(di->bs, di->nodep->idx->service_id, mcl);
[5dfb1948]428 if (rc != EOK) {
[5d95f02]429 (void) fat_free_clusters(di->bs, di->nodep->idx->service_id,
430 mcl);
[5dfb1948]431 return rc;
432 }
433 rc = fat_append_clusters(di->bs, di->nodep, mcl, lcl);
434 if (rc != EOK) {
[5d95f02]435 (void) fat_free_clusters(di->bs, di->nodep->idx->service_id,
436 mcl);
[5dfb1948]437 return rc;
438 }
439 di->nodep->size += BPS(di->bs) * SPC(di->bs);
440 di->nodep->dirty = true; /* need to sync node */
441 di->blocks = di->nodep->size / BPS(di->bs);
[a35b458]442
[5dfb1948]443 return EOK;
444}
445
[b7fd2a0]446errno_t fat_directory_lookup_free(fat_directory_t *di, size_t count)
[5dfb1948]447{
448 fat_dentry_t *d;
449 size_t found;
450 aoff64_t pos;
[b7fd2a0]451 errno_t rc;
[a35b458]452
[5dfb1948]453 do {
454 found = 0;
[5d95f02]455 pos = 0;
[5dfb1948]456 fat_directory_seek(di, 0);
457 do {
[5d95f02]458 rc = fat_directory_get(di, &d);
459 if (rc != EOK)
460 return rc;
461
462 switch (fat_classify_dentry(d)) {
463 case FAT_DENTRY_LAST:
464 case FAT_DENTRY_FREE:
465 if (found == 0)
466 pos = di->pos;
467 found++;
468 if (found == count) {
469 fat_directory_seek(di, pos);
470 return EOK;
[5dfb1948]471 }
[5d95f02]472 break;
473 case FAT_DENTRY_VALID:
474 case FAT_DENTRY_LFN:
475 case FAT_DENTRY_SKIP:
[39b0a51]476 case FAT_DENTRY_VOLLABEL:
[5d95f02]477 default:
478 found = 0;
479 break;
[5dfb1948]480 }
[1b20da0]481 } while (fat_directory_next(di) == EOK);
[5dfb1948]482 } while (fat_directory_expand(di) == EOK);
[5d95f02]483
[5dfb1948]484 return ENOSPC;
485}
486
[b7fd2a0]487errno_t fat_directory_lookup_name(fat_directory_t *di, const char *name,
[5d95f02]488 fat_dentry_t **de)
[5dfb1948]489{
490 char entry[FAT_LFN_NAME_SIZE];
[5d95f02]491
[5dfb1948]492 fat_directory_seek(di, 0);
493 while (fat_directory_read(di, entry, de) == EOK) {
494 if (fat_dentry_namecmp(entry, name) == 0) {
495 return EOK;
496 } else {
497 if (fat_directory_next(di) != EOK)
498 break;
499 }
500 }
[5d95f02]501
[5dfb1948]502 return ENOENT;
503}
504
505bool fat_directory_is_sfn_exist(fat_directory_t *di, fat_dentry_t *de)
506{
507 fat_dentry_t *d;
[b7fd2a0]508 errno_t rc;
[5d95f02]509
[5dfb1948]510 fat_directory_seek(di, 0);
511 do {
[5d95f02]512 rc = fat_directory_get(di, &d);
513 if (rc != EOK)
514 return false;
515
516 switch (fat_classify_dentry(d)) {
517 case FAT_DENTRY_LAST:
518 return false;
519 case FAT_DENTRY_VALID:
[44ecf89]520 if (memcmp(de->name, d->name,
521 FAT_NAME_LEN + FAT_EXT_LEN) == 0)
[5d95f02]522 return true;
523 break;
524 default:
525 case FAT_DENTRY_LFN:
526 case FAT_DENTRY_SKIP:
[39b0a51]527 case FAT_DENTRY_VOLLABEL:
[5d95f02]528 case FAT_DENTRY_FREE:
529 break;
[5dfb1948]530 }
[39b0a51]531 } while (fat_directory_next(di) == EOK);
[5d95f02]532
[5dfb1948]533 return false;
534}
[da2f8d10]535
[39b0a51]536/** Find volume label entry in a directory.
537 *
538 * @return EOK on success, ENOENT if not found, EIO on I/O error
539 */
[b7fd2a0]540errno_t fat_directory_vollabel_get(fat_directory_t *di, char *label)
[39b0a51]541{
542 fat_dentry_t *d;
[b7fd2a0]543 errno_t rc;
[39b0a51]544
545 fat_directory_seek(di, 0);
546 do {
547 rc = fat_directory_get(di, &d);
548 if (rc != EOK)
549 return EIO;
550
551 switch (fat_classify_dentry(d)) {
552 case FAT_DENTRY_VOLLABEL:
553 fat_dentry_vollabel_get(d, label);
554 return EOK;
555 default:
556 break;
557 }
558 } while (fat_directory_next(di) == EOK);
559
560 /* Not found */
561 return ENOENT;
562}
563
[da2f8d10]564/**
565 * @}
[1b20da0]566 */
Note: See TracBrowser for help on using the repository browser.