Lines Matching refs:entries
96 Create one or more directory entries -- a short name entry (like make_dirent)
97 and preceding long name entries (if any are needed). This routine handles
128 # "entries" is a list of raw directory entry structures
129 entries = []
176 # Generate the long name entries
181 entries.insert(0, make_ldir(name[:13], order, checksum))
186 entries.append(make_dirent(basis, attr, head, length, ntres,
202 entries = [make_dirent(base+ext, attr, head, length, ntres,
206 return "".join(entries)
418 "A File Allocation Table with 32-bit entries."
427 self.entries = None # Array of entries from cached sector
440 self.entries = list(struct.unpack("<%dI" % self.entriesPerSector, self.bytes))
458 value = self.entries[key % self.entriesPerSector] & 0x0FFFFFFF
487 old = self.entries[key % self.entriesPerSector]
489 self.entries[key % self.entriesPerSector] = value
498 if len(self.entries) != self.entriesPerSector:
499 raise RuntimeError("FAT entries corrupt!")
504 bytes = struct.pack("<%dI" % self.entriesPerSector, *self.entries)
513 "A File Allocation Table with 16-bit entries."
522 self.entries = None # Array of entries from cached sector
535 self.entries = list(struct.unpack("<%dH" % self.entriesPerSector, self.bytes))
553 value = self.entries[key % self.entriesPerSector]
581 self.entries[key % self.entriesPerSector] = value
590 if len(self.entries) != self.entriesPerSector:
591 raise RuntimeError("FAT entries corrupt!")
596 bytes = struct.pack("<%dH" % self.entriesPerSector, *self.entries)
605 "A File Allocation Table with 12-bit entries."
613 # Read in the entire FAT, converting it to the self.entries array.
617 # We always unpack a multiple of two entries, for convenience.
618 self.entries = [0] * (self.maxcluster + 2)
621 self.entries[i] = struct.unpack("<H", bytes[index:index+2])[0] & 0x0FFF
622 self.entries[i+1] = struct.unpack("<H", bytes[index+1:index+3])[0] >> 4
635 value = self.entries[key]
658 self.entries[key] = value
667 if len(self.entries) != self.maxcluster + 2:
668 raise RuntimeError("FAT entries corrupt!")
676 # Update the bytes with values from self.entries
679 pair = struct.pack("<I", self.entries[i] + (self.entries[i+1] << 12))
883 """Mark all never-used directory entries at index less than "slot"
952 # Construct the raw directory entry (entries if long name)
985 # Write the raw entry/entries to the free slots
1003 By default, it also creates the "." and ".." entries in the first
1016 avoid initializing the "." and ".." entries, respectively.
1045 # create the "." and ".." entries
1237 # NOTE: This examines all FAT entries/chains, including those that