HomeSort by relevance Sort by last modified time
    Searched refs:fat (Results 1 - 25 of 113) sorted by null

1 2 3 4 5

  /tools/external/fat32lib/src/main/java/de/waldheinz/fs/fat/
package-info.java 20 * Contains the classes implementing the FAT(12/16/32) file system.
22 package de.waldheinz.fs.fat;
ClusterChain.java 19 package de.waldheinz.fs.fat;
28 * A chain of clusters as stored in a {@link Fat}.
33 protected final Fat fat; field in class:ClusterChain
43 * @param fat the {@code Fat} that holds the new chain
46 public ClusterChain(Fat fat, boolean readOnly) {
47 this(fat, 0, readOnly);
50 public ClusterChain(Fat fat, long startCluster, boolean readOnly)
    [all...]
FatFileSystem.java 20 package de.waldheinz.fs.fat;
29 * Implements the {@code FileSystem} interface for the FAT family of file
33 * For creating (aka "formatting") FAT file systems please refer to the
42 private final Fat fat; field in class:FatFileSystem
76 this.fat = Fat.read(bs, 0);
80 final Fat tmpFat = Fat.read(bs, i);
81 if (!fat.equals(tmpFat))
    [all...]
DirectoryFullException.java 19 package de.waldheinz.fs.fat;
ClusterChainDirectory.java 20 package de.waldheinz.fs.fat;
34 * According to the FAT specification, this is the maximum size a FAT
66 public static ClusterChainDirectory createRoot(Fat fat) throws IOException {
68 if (fat.getFatType() != FatType.FAT32) {
73 final Fat32BootSector bs = (Fat32BootSector) fat.getBootSector();
74 final ClusterChain cc = new ClusterChain(fat, false);
FatLfnDirectory.java 20 package de.waldheinz.fs.fat;
35 * The {@link FsDirectory} implementation for FAT file systems. This
36 * implementation aims to fully comply to the FAT specification, including
51 * directory. The FAT specification says that file names must be unique
56 private final Fat fat; field in class:FatLfnDirectory
65 FatLfnDirectory(AbstractDirectory dir, Fat fat, boolean readOnly)
70 if ((dir == null) || (fat == null)) throw new NullPointerException();
72 this.fat = fat
    [all...]
FatFile.java 19 package de.waldheinz.fs.fat;
30 * FAT file system.
46 static FatFile get(Fat fat, FatDirectoryEntry entry)
53 fat, entry.getStartCluster(), entry.isReadonlyFlag());
SuperFloppyFormatter.java 19 package de.waldheinz.fs.fat;
27 * Allows to create FAT file systems on {@link BlockDevice}s which follow the
30 * a single FAT file system.
236 final Fat fat = Fat.create(bs, 0); local
240 rootDirStore = ClusterChainDirectory.createRoot(fat);
241 fsi.setFreeClusterCount(fat.getFreeClusterCount());
242 fsi.setLastAllocatedCluster(fat.getLastAllocatedCluster());
249 new FatLfnDirectory(rootDirStore, fat, false)
    [all...]
FatUtils.java 20 package de.waldheinz.fs.fat;
34 * Gets the offset (in bytes) of the fat with the given index
  /external/fsck_msdos/
fat.c 36 __RCSID("$NetBSD: fat.c,v 1.12 2000/10/10 20:24:52 is Exp $");
38 "$FreeBSD: src/sbin/fsck_msdosfs/fat.c,v 1.9 2008/01/31 13:22:13 yar Exp $";
56 * The first 2 FAT entries contain pseudo-cluster numbers with the following
88 perror("No space for FAT");
93 perror("Unable to read FAT");
98 perror("Unable to read FAT");
103 * If we don't understand the FAT, then the file system must be
138 checkclnum(struct bootblock *boot, int fat, cl_t cl, cl_t *next)
152 pwarn("Cluster %u in FAT %d continues with %s cluster number %u\n",
153 cl, fat,
209 struct fatEntry *fat; local
    [all...]
check.c 52 * If the FAT > this size then skip comparing, lest we risk
63 struct fatEntry *fat = NULL; local
108 printf("** Phase 1 - Read FAT (compare skipped)\n");
112 printf("** Phase 1 - Read FAT\n");
115 mod |= readfat(dosfs, &boot, boot.ValidFat >= 0 ? boot.ValidFat : 0, &fat);
133 mod |= comparefat(&boot, fat, currentFat, i);
136 printf("Fatal error during FAT comparison\n");
144 mod |= checkfat(&boot, fat);
146 printf("Fatal error during FAT check\n");
154 mod |= resetDosDirSection(&boot, fat);
    [all...]
dir.c 224 resetDosDirSection(struct bootblock *boot, struct fatEntry *fat)
246 cl = fat[boot->RootCl].next;
249 || fat[boot->RootCl].head != boot->RootCl) {
260 fat[boot->RootCl].next = CLUST_FREE;
266 fat[boot->RootCl].flags |= FAT_USED;
307 delete(int f, struct bootblock *boot, struct fatEntry *fat, cl_t startcl,
348 startcl = fat[startcl].next;
355 removede(int f, struct bootblock *boot, struct fatEntry *fat, u_char *start,
371 if (delete(f, boot, fat,
390 checksize(struct bootblock *boot, struct fatEntry *fat, u_char *p
    [all...]
Android.mk 5 LOCAL_SRC_FILES := boot.c check.c dir.c fat.c main.c
  /tools/external/fat32lib/src/main/java/de/waldheinz/fs/
FileSystemFactory.java 21 import de.waldheinz.fs.fat.FatFileSystem;
  /prebuilts/devtools/tools/lib/
fat32lib.jar 
  /prebuilts/gradle-plugin/com/android/tools/build/fat32lib/unspecified/
fat32lib-unspecified.jar 
  /external/syslinux/libfat/
fatchain.c 16 * Follow a FAT chain
41 * Get the next sector of either the root directory or a FAT chain.
78 fatsect = fs->fat + (fatoffset >> LIBFAT_SECTOR_SHIFT);
86 fatsect = fs->fat + (fatoffset >> LIBFAT_SECTOR_SHIFT);
92 /* Extract the FAT entry */
104 fatsect = fs->fat + (fatoffset >> LIBFAT_SECTOR_SHIFT);
117 fatsect = fs->fat + (fatoffset >> LIBFAT_SECTOR_SHIFT);
libfatint.h 23 #include "fat.h"
47 libfat_sector_t fat; /* Start of FAT */ member in struct:libfat_filesystem
open.c 16 * Open a FAT filesystem and compute some initial values; return NULL
64 fs->fat = read16(&bs->bsResSectors);
69 fs->rootdir = fs->fat + fatsize * read8(&bs->bsFATs);
  /system/core/toolbox/
newfs_msdos.c 72 #define RESFTE 2 /* reserved FAT entries */
80 #define mincls(fat) ((fat) == 12 ? MINCLS12 : \
81 (fat) == 16 ? MINCLS16 : \
84 #define maxcls(fat) ((fat) == 12 ? MAXCLS12 : \
85 (fat) == 16 ? MAXCLS16 : \
119 u_int8_t spf[2]; /* sectors per FAT */
127 u_int8_t bspf[4]; /* big sectors per FAT */
128 u_int8_t xflg[2]; /* FAT control flags *
263 u_int fat, bss, rds, cls, dir, lsn, x, x1, x2; local
    [all...]
  /device/linaro/hikey/build/tasks/
boot_fat.mk 7 mkfs.fat -n "boot" $@
  /external/syslinux/core/fs/fat/
fat.c 25 * Check for a particular sector in the FAT cache
29 return get_cache(fs->fs_dev, FAT_SB(fs)->fat + sector);
48 * we got the end of the one fat sector,
50 * so store the low part, then read the next fat
181 * The FAT is a single-linked list. We remember the last place we
574 * follow the entire FAT chain to the end... which seems pointless.
725 struct fat_bpb fat; local
736 disk->rdwr_sectors(disk, &fat, 0, 1, 0);
739 if (!fat.bxResSectors || !fat.bxFATs
795 struct fat_bpb fat; local
    [all...]
fat_fs.h 32 * The fat file system structures
84 * The fat file system info in memory
87 sector_t fat; /* The FAT region */ member in struct:fat_sb_info
142 static inline int root_dir_size(struct fs_info *fs, struct fat_bpb *fat)
144 return (fat->bxRootDirEnts + SECTOR_SIZE(fs)/32 - 1)
149 * FAT private inode information
  /build/kati/
ninja_test.go 80 in: `g++ -c fat.cc -o fat.o`,
83 in: `g++ -c fat.cc -MD`,
87 in: `g++ -c fat.cc -MD -o fat.o -o fat.o`,
91 in: `g++ -c fat.cc -MD -o fat.o`,
92 cmd: `g++ -c fat.cc -MD -o fat.o && cp fat.d fat.d.tmp`
    [all...]
  /external/google-breakpad/src/common/mac/
macho_walker.cc 152 // If we don't have a fat header, check if the cpu type matches the single
170 // Read the fat header and find an appropriate architecture
172 struct fat_header fat; local
173 if (!ReadBytes(&fat, sizeof(fat), offset))
177 swap_fat_header(&fat, NXHostByteOrder());
179 offset += sizeof(fat);
183 for (uint32_t i = 0; i < fat.nfat_arch; ++i) {

Completed in 796 milliseconds

1 2 3 4 5