3 exFAT file system implementation library.
5 Free exFAT implementation.
6 Copyright (C) 2010-2023 Andrew Nayenko
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation, either version 2 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License along
19 with this program; if not, write to the Free Software Foundation, Inc.,
20 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
28 #define EXFAT_ENTRY_NONE (-1)
30 struct exfat_node* exfat_get_node(struct exfat_node* node)
32 /* if we switch to multi-threaded mode we will need atomic
33 increment here and atomic decrement in exfat_put_node() */
38 void exfat_put_node(struct exfat* ef, struct exfat_node* node)
40 char buffer[EXFAT_UTF8_NAME_BUFFER_MAX];
43 if (node->references < 0)
45 exfat_get_name(node, buffer);
46 exfat_bug("reference counter of '%s' is below zero", buffer);
48 else if (node->references == 0 && node != ef->root)
52 exfat_get_name(node, buffer);
53 exfat_warn("dirty node '%s' with zero references", buffer);
59 * This function must be called on rmdir and unlink (after the last
60 * exfat_put_node()) to free clusters.
62 int exfat_cleanup_node(struct exfat* ef, struct exfat_node* node)
66 if (node->references != 0)
67 exfat_bug("unable to cleanup a node with %d references",
70 if (node->is_unlinked)
72 /* free all clusters and node structure itself */
73 rc = exfat_truncate(ef, node, 0, true);
74 /* free the node even in case of error or its memory will be lost */
80 static int read_entries(struct exfat* ef, struct exfat_node* dir,
81 struct exfat_entry* entries, int n, off_t offset)
85 if (!(dir->attrib & EXFAT_ATTRIB_DIR))
86 exfat_bug("attempted to read entries from a file");
88 size = exfat_generic_pread(ef, dir, entries,
89 sizeof(struct exfat_entry[n]), offset);
90 if (size == (ssize_t) sizeof(struct exfat_entry) * n)
91 return 0; /* success */
96 exfat_error("read %zd bytes instead of %zu bytes", size,
97 sizeof(struct exfat_entry[n]));
101 static int write_entries(struct exfat* ef, struct exfat_node* dir,
102 const struct exfat_entry* entries, int n, off_t offset)
106 if (!(dir->attrib & EXFAT_ATTRIB_DIR))
107 exfat_bug("attempted to write entries into a file");
109 size = exfat_generic_pwrite(ef, dir, entries,
110 sizeof(struct exfat_entry[n]), offset);
111 if (size == (ssize_t) sizeof(struct exfat_entry) * n)
112 return 0; /* success */
115 exfat_error("wrote %zd bytes instead of %zu bytes", size,
116 sizeof(struct exfat_entry[n]));
120 static struct exfat_node* allocate_node(void)
122 struct exfat_node* node = malloc(sizeof(struct exfat_node));
125 exfat_error("failed to allocate node");
128 memset(node, 0, sizeof(struct exfat_node));
132 static void init_node_meta1(struct exfat_node* node,
133 const struct exfat_entry_meta1* meta1)
135 node->attrib = le16_to_cpu(meta1->attrib);
136 node->continuations = meta1->continuations;
137 node->mtime = exfat_exfat2unix(meta1->mdate, meta1->mtime,
138 meta1->mtime_cs, meta1->mtime_tzo);
139 /* there is no centiseconds field for atime */
140 node->atime = exfat_exfat2unix(meta1->adate, meta1->atime,
141 0, meta1->atime_tzo);
144 static void init_node_meta2(struct exfat_node* node,
145 const struct exfat_entry_meta2* meta2)
147 node->valid_size = le64_to_cpu(meta2->valid_size);
148 node->size = le64_to_cpu(meta2->size);
149 node->start_cluster = le32_to_cpu(meta2->start_cluster);
150 node->fptr_cluster = node->start_cluster;
151 node->is_contiguous = ((meta2->flags & EXFAT_FLAG_CONTIGUOUS) != 0);
154 static void init_node_name(struct exfat_node* node,
155 const struct exfat_entry* entries, int n)
159 for (i = 0; i < n; i++)
160 memcpy(node->name + i * EXFAT_ENAME_MAX,
161 ((const struct exfat_entry_name*) &entries[i])->name,
162 EXFAT_ENAME_MAX * sizeof(le16_t));
165 static bool check_entries(const struct exfat_entry* entry, int n)
167 int previous = EXFAT_ENTRY_NONE;
171 /* check transitions between entries types */
172 for (i = 0; i < n + 1; previous = current, i++)
176 current = (i < n) ? entry[i].type : EXFAT_ENTRY_NONE;
179 case EXFAT_ENTRY_NONE:
180 valid = (current == EXFAT_ENTRY_FILE);
182 case EXFAT_ENTRY_FILE:
183 valid = (current == EXFAT_ENTRY_FILE_INFO);
185 case EXFAT_ENTRY_FILE_INFO:
186 valid = (current == EXFAT_ENTRY_FILE_NAME);
188 case EXFAT_ENTRY_FILE_NAME:
189 valid = (current == EXFAT_ENTRY_FILE_NAME ||
190 current == EXFAT_ENTRY_NONE ||
191 current >= EXFAT_ENTRY_FILE_TAIL);
193 case EXFAT_ENTRY_FILE_TAIL ... 0xff:
194 valid = (current >= EXFAT_ENTRY_FILE_TAIL ||
195 current == EXFAT_ENTRY_NONE);
201 exfat_error("unexpected entry type %#x after %#x at %d/%d",
202 current, previous, i, n);
209 static bool check_node(const struct exfat* ef, struct exfat_node* node,
210 le16_t actual_checksum, const struct exfat_entry_meta1* meta1)
212 int cluster_size = CLUSTER_SIZE(*ef->sb);
213 uint64_t clusters_heap_size =
214 (uint64_t) le32_to_cpu(ef->sb->cluster_count) * cluster_size;
215 char buffer[EXFAT_UTF8_NAME_BUFFER_MAX];
219 Validate checksum first. If it's invalid all other fields probably
220 contain just garbage.
222 if (le16_to_cpu(actual_checksum) != le16_to_cpu(meta1->checksum))
224 exfat_get_name(node, buffer);
225 exfat_error("'%s' has invalid checksum (%#hx != %#hx)", buffer,
226 le16_to_cpu(actual_checksum), le16_to_cpu(meta1->checksum));
227 if (!EXFAT_REPAIR(invalid_node_checksum, ef, node))
232 exFAT does not support sparse files but allows files with uninitialized
233 clusters. For such files valid_size means initialized data size and
234 cannot be greater than file size. See SetFileValidData() function
237 if (node->valid_size > node->size)
239 exfat_get_name(node, buffer);
240 exfat_error("'%s' has valid size (%"PRIu64") greater than size "
241 "(%"PRIu64")", buffer, node->valid_size, node->size);
246 Empty file must have zero start cluster. Non-empty file must start
247 with a valid cluster. Directories cannot be empty (i.e. must always
248 have a valid start cluster), but we will check this later while
249 reading that directory to give user a chance to read this directory.
251 if (node->size == 0 && node->start_cluster != EXFAT_CLUSTER_FREE)
253 exfat_get_name(node, buffer);
254 exfat_error("'%s' is empty but start cluster is %#x", buffer,
255 node->start_cluster);
258 if (node->size > 0 && CLUSTER_INVALID(*ef->sb, node->start_cluster))
260 exfat_get_name(node, buffer);
261 exfat_error("'%s' points to invalid cluster %#x", buffer,
262 node->start_cluster);
266 /* File or directory cannot be larger than clusters heap. */
267 if (node->size > clusters_heap_size)
269 exfat_get_name(node, buffer);
270 exfat_error("'%s' is larger than clusters heap: %"PRIu64" > %"PRIu64,
271 buffer, node->size, clusters_heap_size);
275 /* Empty file or directory must be marked as non-contiguous. */
276 if (node->size == 0 && node->is_contiguous)
278 exfat_get_name(node, buffer);
279 exfat_error("'%s' is empty but marked as contiguous (%#hx)", buffer,
284 /* Directory size must be aligned on at cluster boundary. */
285 if ((node->attrib & EXFAT_ATTRIB_DIR) && node->size % cluster_size != 0)
287 exfat_get_name(node, buffer);
288 exfat_error("'%s' directory size %"PRIu64" is not divisible by %d", buffer,
289 node->size, cluster_size);
296 static int parse_file_entries(struct exfat* ef, struct exfat_node* node,
297 const struct exfat_entry* entries, int n)
299 const struct exfat_entry_meta1* meta1;
300 const struct exfat_entry_meta2* meta2;
301 int mandatory_entries;
303 if (!check_entries(entries, n))
306 meta1 = (const struct exfat_entry_meta1*) &entries[0];
307 if (meta1->continuations < 2)
309 exfat_error("too few continuations (%hhu)", meta1->continuations);
312 meta2 = (const struct exfat_entry_meta2*) &entries[1];
313 if (meta2->flags & ~(EXFAT_FLAG_ALWAYS1 | EXFAT_FLAG_CONTIGUOUS))
315 exfat_error("unknown flags in meta2 (%#hhx)", meta2->flags);
318 mandatory_entries = 2 + DIV_ROUND_UP(meta2->name_length, EXFAT_ENAME_MAX);
319 if (meta1->continuations < mandatory_entries - 1)
321 exfat_error("too few continuations (%hhu < %d)",
322 meta1->continuations, mandatory_entries - 1);
326 init_node_meta1(node, meta1);
327 init_node_meta2(node, meta2);
328 init_node_name(node, entries + 2, mandatory_entries - 2);
330 if (!check_node(ef, node, exfat_calc_checksum(entries, n), meta1))
336 static int parse_file_entry(struct exfat* ef, struct exfat_node* parent,
337 struct exfat_node** node, off_t* offset, int n)
339 struct exfat_entry entries[n];
342 rc = read_entries(ef, parent, entries, n, *offset);
346 /* a new node has zero references */
347 *node = allocate_node();
350 (*node)->entry_offset = *offset;
352 rc = parse_file_entries(ef, *node, entries, n);
359 *offset += sizeof(struct exfat_entry[n]);
363 static void decompress_upcase(uint16_t* output, const le16_t* source,
369 for (oi = 0; oi < EXFAT_UPCASE_CHARS; oi++)
372 for (si = 0, oi = 0; si < size && oi < EXFAT_UPCASE_CHARS; si++)
374 uint16_t ch = le16_to_cpu(source[si]);
376 if (ch == 0xffff && si + 1 < size) /* indicates a run */
377 oi += le16_to_cpu(source[++si]);
384 * Read one entry in a directory at offset position and build a new node
387 static int readdir(struct exfat* ef, struct exfat_node* parent,
388 struct exfat_node** node, off_t* offset)
391 struct exfat_entry entry;
392 const struct exfat_entry_meta1* meta1;
393 const struct exfat_entry_upcase* upcase;
394 const struct exfat_entry_bitmap* bitmap;
395 const struct exfat_entry_label* label;
396 uint64_t upcase_size = 0;
397 le16_t* upcase_comp = NULL;
398 le16_t label_name[EXFAT_ENAME_MAX];
402 rc = read_entries(ef, parent, &entry, 1, *offset);
408 case EXFAT_ENTRY_FILE:
409 meta1 = (const struct exfat_entry_meta1*) &entry;
410 return parse_file_entry(ef, parent, node, offset,
411 1 + meta1->continuations);
413 case EXFAT_ENTRY_UPCASE:
414 if (ef->upcase != NULL)
416 upcase = (const struct exfat_entry_upcase*) &entry;
417 if (CLUSTER_INVALID(*ef->sb, le32_to_cpu(upcase->start_cluster)))
419 exfat_error("invalid cluster 0x%x in upcase table",
420 le32_to_cpu(upcase->start_cluster));
423 upcase_size = le64_to_cpu(upcase->size);
424 if (upcase_size == 0 ||
425 upcase_size > EXFAT_UPCASE_CHARS * sizeof(uint16_t) ||
426 upcase_size % sizeof(uint16_t) != 0)
428 exfat_error("bad upcase table size (%"PRIu64" bytes)",
432 upcase_comp = malloc(upcase_size);
433 if (upcase_comp == NULL)
435 exfat_error("failed to allocate upcase table (%"PRIu64" bytes)",
440 /* read compressed upcase table */
441 if (exfat_pread(ef->dev, upcase_comp, upcase_size,
442 exfat_c2o(ef, le32_to_cpu(upcase->start_cluster))) < 0)
445 exfat_error("failed to read upper case table "
446 "(%"PRIu64" bytes starting at cluster %#x)",
448 le32_to_cpu(upcase->start_cluster));
452 /* decompress upcase table */
453 ef->upcase = calloc(EXFAT_UPCASE_CHARS, sizeof(uint16_t));
454 if (ef->upcase == NULL)
457 exfat_error("failed to allocate decompressed upcase table");
460 decompress_upcase(ef->upcase, upcase_comp,
461 upcase_size / sizeof(uint16_t));
465 case EXFAT_ENTRY_BITMAP:
466 bitmap = (const struct exfat_entry_bitmap*) &entry;
467 ef->cmap.start_cluster = le32_to_cpu(bitmap->start_cluster);
468 if (CLUSTER_INVALID(*ef->sb, ef->cmap.start_cluster))
470 exfat_error("invalid cluster 0x%x in clusters bitmap",
471 ef->cmap.start_cluster);
474 ef->cmap.size = le32_to_cpu(ef->sb->cluster_count);
475 if (le64_to_cpu(bitmap->size) < DIV_ROUND_UP(ef->cmap.size, 8))
477 exfat_error("invalid clusters bitmap size: %"PRIu64
478 " (expected at least %u)",
479 le64_to_cpu(bitmap->size),
480 DIV_ROUND_UP(ef->cmap.size, 8));
483 /* FIXME bitmap can be rather big, up to 512 MB */
484 ef->cmap.chunk_size = ef->cmap.size;
485 ef->cmap.chunk = malloc(BMAP_SIZE(ef->cmap.chunk_size));
486 if (ef->cmap.chunk == NULL)
488 exfat_error("failed to allocate clusters bitmap chunk "
489 "(%"PRIu64" bytes)", le64_to_cpu(bitmap->size));
493 if (exfat_pread(ef->dev, ef->cmap.chunk,
494 BMAP_SIZE(ef->cmap.chunk_size),
495 exfat_c2o(ef, ef->cmap.start_cluster)) < 0)
497 exfat_error("failed to read clusters bitmap "
498 "(%"PRIu64" bytes starting at cluster %#x)",
499 le64_to_cpu(bitmap->size), ef->cmap.start_cluster);
504 case EXFAT_ENTRY_LABEL:
505 label = (const struct exfat_entry_label*) &entry;
506 if (label->length > EXFAT_ENAME_MAX)
508 exfat_error("too long label (%hhu chars)", label->length);
511 /* copy to a temporary buffer to avoid unaligned access to a
513 memcpy(label_name, label->name, sizeof(label_name));
514 if (exfat_utf16_to_utf8(ef->label, label_name,
515 sizeof(ef->label), EXFAT_ENAME_MAX) != 0)
520 if (!(entry.type & EXFAT_ENTRY_VALID))
521 break; /* deleted entry, ignore it */
523 exfat_error("unknown entry type %#hhx", entry.type);
524 if (!EXFAT_REPAIR(unknown_entry, ef, parent, &entry, *offset))
527 *offset += sizeof(entry);
529 /* we never reach here */
532 int exfat_cache_directory(struct exfat* ef, struct exfat_node* dir)
536 struct exfat_node* node;
537 struct exfat_node* current = NULL;
540 return 0; /* already cached */
542 while ((rc = readdir(ef, dir, &node, &offset)) == 0)
547 current->next = node;
548 node->prev = current;
559 for (current = dir->child; current; current = node)
561 node = current->next;
568 dir->is_cached = true;
572 static void tree_attach(struct exfat_node* dir, struct exfat_node* node)
577 dir->child->prev = node;
578 node->next = dir->child;
583 static void tree_detach(struct exfat_node* node)
586 node->prev->next = node->next;
587 else /* this is the first node in the list */
588 node->parent->child = node->next;
590 node->next->prev = node->prev;
596 static void reset_cache(struct exfat* ef, struct exfat_node* node)
598 char buffer[EXFAT_UTF8_NAME_BUFFER_MAX];
602 struct exfat_node* p = node->child;
607 node->is_cached = false;
608 if (node->references != 0)
610 exfat_get_name(node, buffer);
611 exfat_warn("non-zero reference counter (%d) for '%s'",
612 node->references, buffer);
614 if (node != ef->root && node->is_dirty)
616 exfat_get_name(node, buffer);
617 exfat_bug("node '%s' is dirty", buffer);
619 while (node->references)
620 exfat_put_node(ef, node);
623 void exfat_reset_cache(struct exfat* ef)
625 reset_cache(ef, ef->root);
628 int exfat_flush_node(struct exfat* ef, struct exfat_node* node)
630 struct exfat_entry entries[1 + node->continuations];
631 struct exfat_entry_meta1* meta1 = (struct exfat_entry_meta1*) &entries[0];
632 struct exfat_entry_meta2* meta2 = (struct exfat_entry_meta2*) &entries[1];
637 return 0; /* no need to flush */
640 exfat_bug("unable to flush node to read-only FS");
642 if (node->parent == NULL)
643 return 0; /* do not flush unlinked node */
645 rc = read_entries(ef, node->parent, entries, 1 + node->continuations,
649 if (!check_entries(entries, 1 + node->continuations))
652 meta1->attrib = cpu_to_le16(node->attrib);
653 exfat_unix2exfat(node->mtime, &edate, &etime,
654 &meta1->mtime_cs, &meta1->mtime_tzo);
655 meta1->mdate = edate;
656 meta1->mtime = etime;
657 exfat_unix2exfat(node->atime, &edate, &etime,
658 NULL, &meta1->atime_tzo);
659 meta1->adate = edate;
660 meta1->atime = etime;
661 meta2->valid_size = cpu_to_le64(node->valid_size);
662 meta2->size = cpu_to_le64(node->size);
663 meta2->start_cluster = cpu_to_le32(node->start_cluster);
664 meta2->flags = EXFAT_FLAG_ALWAYS1;
665 /* empty files must not be marked as contiguous */
666 if (node->size != 0 && node->is_contiguous)
667 meta2->flags |= EXFAT_FLAG_CONTIGUOUS;
668 /* name hash remains unchanged, no need to recalculate it */
670 meta1->checksum = exfat_calc_checksum(entries, 1 + node->continuations);
671 rc = write_entries(ef, node->parent, entries, 1 + node->continuations,
676 node->is_dirty = false;
677 return exfat_flush(ef);
680 static int erase_entries(struct exfat* ef, struct exfat_node* dir, int n,
683 struct exfat_entry entries[n];
687 rc = read_entries(ef, dir, entries, n, offset);
690 for (i = 0; i < n; i++)
691 entries[i].type &= ~EXFAT_ENTRY_VALID;
692 return write_entries(ef, dir, entries, n, offset);
695 static int erase_node(struct exfat* ef, struct exfat_node* node)
699 exfat_get_node(node->parent);
700 rc = erase_entries(ef, node->parent, 1 + node->continuations,
704 exfat_put_node(ef, node->parent);
707 rc = exfat_flush_node(ef, node->parent);
708 exfat_put_node(ef, node->parent);
712 static int shrink_directory(struct exfat* ef, struct exfat_node* dir,
713 off_t deleted_offset)
715 const struct exfat_node* node;
716 const struct exfat_node* last_node;
717 uint64_t entries = 0;
720 if (!(dir->attrib & EXFAT_ATTRIB_DIR))
721 exfat_bug("attempted to shrink a file");
723 exfat_bug("attempted to shrink uncached directory");
725 for (last_node = node = dir->child; node; node = node->next)
727 if (deleted_offset < node->entry_offset)
729 /* there are other entries after the removed one, no way to shrink
733 if (last_node->entry_offset < node->entry_offset)
739 /* offset of the last entry */
740 entries += last_node->entry_offset / sizeof(struct exfat_entry);
741 /* two subentries with meta info */
743 /* subentries with file name */
744 entries += DIV_ROUND_UP(exfat_utf16_length(last_node->name),
748 new_size = DIV_ROUND_UP(entries * sizeof(struct exfat_entry),
749 CLUSTER_SIZE(*ef->sb)) * CLUSTER_SIZE(*ef->sb);
750 if (new_size == 0) /* directory always has at least 1 cluster */
751 new_size = CLUSTER_SIZE(*ef->sb);
752 if (new_size == dir->size)
754 return exfat_truncate(ef, dir, new_size, true);
757 static int delete(struct exfat* ef, struct exfat_node* node)
759 struct exfat_node* parent = node->parent;
760 off_t deleted_offset = node->entry_offset;
763 exfat_get_node(parent);
764 rc = erase_node(ef, node);
767 exfat_put_node(ef, parent);
771 rc = shrink_directory(ef, parent, deleted_offset);
772 node->is_unlinked = true;
775 exfat_flush_node(ef, parent);
776 exfat_put_node(ef, parent);
779 exfat_update_mtime(parent);
780 rc = exfat_flush_node(ef, parent);
781 exfat_put_node(ef, parent);
785 int exfat_unlink(struct exfat* ef, struct exfat_node* node)
787 if (node->attrib & EXFAT_ATTRIB_DIR)
789 return delete(ef, node);
792 int exfat_rmdir(struct exfat* ef, struct exfat_node* node)
796 if (!(node->attrib & EXFAT_ATTRIB_DIR))
798 /* check that directory is empty */
799 rc = exfat_cache_directory(ef, node);
804 return delete(ef, node);
807 static int check_slot(struct exfat* ef, struct exfat_node* dir, off_t offset,
810 struct exfat_entry entries[n];
814 /* Root directory contains entries, that don't have any nodes associated
815 with them (clusters bitmap, upper case table, label). We need to be
816 careful not to overwrite them. */
820 rc = read_entries(ef, dir, entries, n, offset);
823 for (i = 0; i < n; i++)
824 if (entries[i].type & EXFAT_ENTRY_VALID)
829 static int find_slot(struct exfat* ef, struct exfat_node* dir,
830 off_t* offset, int n)
833 struct exfat_node* p;
838 exfat_bug("directory is not cached");
840 /* build a bitmap of valid entries in the directory */
841 dmap = calloc(BMAP_SIZE(dir->size / sizeof(struct exfat_entry)),
845 exfat_error("failed to allocate directory bitmap (%"PRIu64")",
846 dir->size / sizeof(struct exfat_entry));
849 for (p = dir->child; p != NULL; p = p->next)
850 for (i = 0; i < 1u + p->continuations; i++)
851 BMAP_SET(dmap, p->entry_offset / sizeof(struct exfat_entry) + i);
853 /* find a slot in the directory entries bitmap */
854 for (i = 0; i < dir->size / sizeof(struct exfat_entry); i++)
856 if (BMAP_GET(dmap, i) == 0)
858 if (contiguous++ == 0)
859 *offset = (off_t) i * sizeof(struct exfat_entry);
864 /* suitable slot is found, check that it's not occupied */
865 rc = check_slot(ef, dir, *offset, n);
868 /* slot at (i-n) is occupied, go back and check (i-n+1) */
874 /* slot is free or an error occurred */
885 /* no suitable slots found, extend the directory */
888 return exfat_truncate(ef, dir,
889 ROUND_UP(dir->size + sizeof(struct exfat_entry[n - contiguous]),
890 CLUSTER_SIZE(*ef->sb)),
894 static int commit_entry(struct exfat* ef, struct exfat_node* dir,
895 const le16_t* name, off_t offset, uint16_t attrib)
897 struct exfat_node* node;
898 const size_t name_length = exfat_utf16_length(name);
899 const int name_entries = DIV_ROUND_UP(name_length, EXFAT_ENAME_MAX);
900 struct exfat_entry entries[2 + name_entries];
901 struct exfat_entry_meta1* meta1 = (struct exfat_entry_meta1*) &entries[0];
902 struct exfat_entry_meta2* meta2 = (struct exfat_entry_meta2*) &entries[1];
907 memset(entries, 0, sizeof(struct exfat_entry[2]));
909 meta1->type = EXFAT_ENTRY_FILE;
910 meta1->continuations = 1 + name_entries;
911 meta1->attrib = cpu_to_le16(attrib);
912 exfat_unix2exfat(time(NULL), &edate, &etime,
913 &meta1->crtime_cs, &meta1->crtime_tzo);
914 meta1->adate = meta1->mdate = meta1->crdate = edate;
915 meta1->atime = meta1->mtime = meta1->crtime = etime;
916 meta1->mtime_cs = meta1->crtime_cs; /* there is no atime_cs */
917 meta1->atime_tzo = meta1->mtime_tzo = meta1->crtime_tzo;
919 meta2->type = EXFAT_ENTRY_FILE_INFO;
920 meta2->flags = EXFAT_FLAG_ALWAYS1;
921 meta2->name_length = name_length;
922 meta2->name_hash = exfat_calc_name_hash(ef, name, name_length);
923 meta2->start_cluster = cpu_to_le32(EXFAT_CLUSTER_FREE);
925 for (i = 0; i < name_entries; i++)
927 struct exfat_entry_name* name_entry;
929 name_entry = (struct exfat_entry_name*) &entries[2 + i];
930 name_entry->type = EXFAT_ENTRY_FILE_NAME;
931 name_entry->__unknown = 0;
932 memcpy(name_entry->name, name + i * EXFAT_ENAME_MAX,
933 EXFAT_ENAME_MAX * sizeof(le16_t));
936 meta1->checksum = exfat_calc_checksum(entries, 2 + name_entries);
937 rc = write_entries(ef, dir, entries, 2 + name_entries, offset);
941 node = allocate_node();
944 node->entry_offset = offset;
945 memcpy(node->name, name, name_length * sizeof(le16_t));
946 init_node_meta1(node, meta1);
947 init_node_meta2(node, meta2);
949 tree_attach(dir, node);
953 static int create(struct exfat* ef, const char* path, uint16_t attrib)
955 struct exfat_node* dir;
956 struct exfat_node* existing;
958 le16_t name[EXFAT_NAME_MAX + 1];
961 rc = exfat_split(ef, &dir, &existing, name, path);
964 if (existing != NULL)
966 exfat_put_node(ef, existing);
967 exfat_put_node(ef, dir);
971 rc = find_slot(ef, dir, &offset,
972 2 + DIV_ROUND_UP(exfat_utf16_length(name), EXFAT_ENAME_MAX));
975 exfat_put_node(ef, dir);
978 rc = commit_entry(ef, dir, name, offset, attrib);
981 exfat_put_node(ef, dir);
984 exfat_update_mtime(dir);
985 rc = exfat_flush_node(ef, dir);
986 exfat_put_node(ef, dir);
990 int exfat_mknod(struct exfat* ef, const char* path)
992 return create(ef, path, EXFAT_ATTRIB_ARCH);
995 int exfat_mkdir(struct exfat* ef, const char* path)
998 struct exfat_node* node;
1000 rc = create(ef, path, EXFAT_ATTRIB_DIR);
1003 rc = exfat_lookup(ef, &node, path);
1006 /* directories always have at least one cluster */
1007 rc = exfat_truncate(ef, node, CLUSTER_SIZE(*ef->sb), true);
1011 exfat_put_node(ef, node);
1014 rc = exfat_flush_node(ef, node);
1018 exfat_put_node(ef, node);
1021 exfat_put_node(ef, node);
1025 static int rename_entry(struct exfat* ef, struct exfat_node* dir,
1026 struct exfat_node* node, const le16_t* name, off_t new_offset)
1028 const size_t name_length = exfat_utf16_length(name);
1029 const int name_entries = DIV_ROUND_UP(name_length, EXFAT_ENAME_MAX);
1030 struct exfat_entry entries[2 + name_entries];
1031 struct exfat_entry_meta1* meta1 = (struct exfat_entry_meta1*) &entries[0];
1032 struct exfat_entry_meta2* meta2 = (struct exfat_entry_meta2*) &entries[1];
1036 rc = read_entries(ef, node->parent, entries, 2, node->entry_offset);
1040 meta1->continuations = 1 + name_entries;
1041 meta2->name_length = name_length;
1042 meta2->name_hash = exfat_calc_name_hash(ef, name, name_length);
1044 rc = erase_node(ef, node);
1048 node->entry_offset = new_offset;
1049 node->continuations = 1 + name_entries;
1051 for (i = 0; i < name_entries; i++)
1053 struct exfat_entry_name* name_entry;
1055 name_entry = (struct exfat_entry_name*) &entries[2 + i];
1056 name_entry->type = EXFAT_ENTRY_FILE_NAME;
1057 name_entry->__unknown = 0;
1058 memcpy(name_entry->name, name + i * EXFAT_ENAME_MAX,
1059 EXFAT_ENAME_MAX * sizeof(le16_t));
1062 meta1->checksum = exfat_calc_checksum(entries, 2 + name_entries);
1063 rc = write_entries(ef, dir, entries, 2 + name_entries, new_offset);
1067 memcpy(node->name, name, (EXFAT_NAME_MAX + 1) * sizeof(le16_t));
1069 tree_attach(dir, node);
1073 int exfat_rename(struct exfat* ef, const char* old_path, const char* new_path)
1075 struct exfat_node* node;
1076 struct exfat_node* existing;
1077 struct exfat_node* dir;
1079 le16_t name[EXFAT_NAME_MAX + 1];
1082 rc = exfat_lookup(ef, &node, old_path);
1086 rc = exfat_split(ef, &dir, &existing, name, new_path);
1089 exfat_put_node(ef, node);
1093 /* check that target is not a subdirectory of the source */
1094 if (node->attrib & EXFAT_ATTRIB_DIR)
1096 struct exfat_node* p;
1098 for (p = dir; p; p = p->parent)
1101 if (existing != NULL)
1102 exfat_put_node(ef, existing);
1103 exfat_put_node(ef, dir);
1104 exfat_put_node(ef, node);
1109 if (existing != NULL)
1111 /* remove target if it's not the same node as source */
1112 if (existing != node)
1114 if (existing->attrib & EXFAT_ATTRIB_DIR)
1116 if (node->attrib & EXFAT_ATTRIB_DIR)
1117 rc = exfat_rmdir(ef, existing);
1123 if (!(node->attrib & EXFAT_ATTRIB_DIR))
1124 rc = exfat_unlink(ef, existing);
1128 exfat_put_node(ef, existing);
1131 /* free clusters even if something went wrong; otherwise they
1132 will be just lost */
1133 exfat_cleanup_node(ef, existing);
1134 exfat_put_node(ef, dir);
1135 exfat_put_node(ef, node);
1138 rc = exfat_cleanup_node(ef, existing);
1141 exfat_put_node(ef, dir);
1142 exfat_put_node(ef, node);
1147 exfat_put_node(ef, existing);
1150 rc = find_slot(ef, dir, &offset,
1151 2 + DIV_ROUND_UP(exfat_utf16_length(name), EXFAT_ENAME_MAX));
1154 exfat_put_node(ef, dir);
1155 exfat_put_node(ef, node);
1158 rc = rename_entry(ef, dir, node, name, offset);
1161 exfat_put_node(ef, dir);
1162 exfat_put_node(ef, node);
1165 rc = exfat_flush_node(ef, dir);
1166 exfat_put_node(ef, dir);
1167 exfat_put_node(ef, node);
1168 /* node itself is not marked as dirty, no need to flush it */
1172 void exfat_utimes(struct exfat_node* node, const struct timespec tv[2])
1174 node->atime = tv[0].tv_sec;
1175 node->mtime = tv[1].tv_sec;
1176 node->is_dirty = true;
1179 void exfat_update_atime(struct exfat_node* node)
1181 node->atime = time(NULL);
1182 node->is_dirty = true;
1185 void exfat_update_mtime(struct exfat_node* node)
1187 node->mtime = time(NULL);
1188 node->is_dirty = true;
1191 const char* exfat_get_label(struct exfat* ef)
1196 static int find_label(struct exfat* ef, off_t* offset)
1198 struct exfat_entry entry;
1201 for (*offset = 0; ; *offset += sizeof(entry))
1203 rc = read_entries(ef, ef->root, &entry, 1, *offset);
1207 if (entry.type == EXFAT_ENTRY_LABEL)
1212 int exfat_set_label(struct exfat* ef, const char* label)
1214 le16_t label_utf16[EXFAT_ENAME_MAX + 1];
1217 struct exfat_entry_label entry;
1219 memset(label_utf16, 0, sizeof(label_utf16));
1220 rc = exfat_utf8_to_utf16(label_utf16, label, EXFAT_ENAME_MAX + 1,
1225 rc = find_label(ef, &offset);
1227 rc = find_slot(ef, ef->root, &offset, 1);
1231 entry.type = EXFAT_ENTRY_LABEL;
1232 entry.length = exfat_utf16_length(label_utf16);
1233 memcpy(entry.name, label_utf16, sizeof(entry.name));
1234 if (entry.length == 0)
1235 entry.type ^= EXFAT_ENTRY_VALID;
1237 rc = write_entries(ef, ef->root, (struct exfat_entry*) &entry, 1, offset);
1241 strcpy(ef->label, label);