/haiku/src/system/boot/loader/file_systems/bfs/ |
H A D | Volume.h | 30 block_run Root() const { return fSuperBlock.root_dir; } 32 block_run Indices() const { return fSuperBlock.indices; } 48 off_t ToOffset(block_run run) const { return ToBlock(run) << BlockShift(); } 50 off_t ToBlock(block_run run) const { return ((off_t)run.AllocationGroup() << AllocationGroupShift()) | (uint32)run.Start(); } 51 block_run ToBlockRun(off_t block) const; 52 status_t ValidateBlockRun(block_run run); 54 off_t ToVnode(block_run run) const { return ToBlock(run); }
|
H A D | Link.h | 18 Link(Volume &volume, block_run run);
|
H A D | Stream.h | 21 Stream(Volume &volume, block_run run); 28 status_t FindBlockRun(off_t pos, block_run &run, off_t &offset);
|
H A D | Stream.cpp | 27 CachedBlock(Volume& volume, block_run run); 30 uint8* SetTo(block_run run); 57 CachedBlock::CachedBlock(Volume &volume, block_run run) 101 CachedBlock::SetTo(block_run run) 110 Stream::Stream(Volume& volume, block_run run) 198 Stream::FindBlockRun(off_t pos, block_run& run, off_t& offset) 218 block_run* indirect = (block_run*)cached.SetTo( 228 indirect = (block_run*)cached.SetTo(fVolume.ToBlock(indirect[ 240 int32 runsPerBlock = fVolume.BlockSize() / sizeof(block_run); [all...] |
H A D | bfs.cpp | 109 Volume::ValidateBlockRun(block_run run) 123 block_run 126 block_run run;
|
H A D | Link.cpp | 13 Link::Link(Volume &volume, block_run run)
|
H A D | Directory.h | 20 Directory(Volume &volume, block_run run);
|
H A D | File.h | 19 File(Volume &volume, block_run run);
|
/haiku/src/tests/add-ons/kernel/file_systems/bfs/btree/ |
H A D | Volume.h | 32 off_t ToBlock(block_run run) const { return run.start; } 33 block_run ToBlockRun(off_t block) const 35 return block_run::Run(0, 0, block);
|
H A D | Inode.h | 32 status_t FindBlockRun(off_t pos, block_run& run, off_t& offset); 40 block_run BlockRun() const { return block_run::Run(0, 0, 0); } 41 block_run Parent() const { return block_run::Run(0, 0, 0); }
|
H A D | Inode.cpp | 31 Inode::FindBlockRun(off_t pos, block_run &run, off_t &offset) 33 // the whole file data is covered by this one block_run structure...
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | BlockAllocator.h | 17 struct block_run; 35 const block_run* parent, mode_t type, 36 block_run& run); 38 off_t numBlocks, block_run& run, 40 status_t Free(Transaction& transaction, block_run run); 44 uint16 minimum, block_run& run); 52 status_t CheckBlockRun(block_run run, 55 bool IsValidBlockRun(block_run run,
|
H A D | Volume.h | 50 block_run Root() const { return fSuperBlock.root_dir; } 52 block_run Indices() const { return fSuperBlock.indices; } 54 block_run Log() const { return fSuperBlock.log_blocks; } 84 off_t ToOffset(block_run run) const 86 off_t ToBlock(block_run run) const 90 block_run ToBlockRun(off_t block) const; 91 status_t ValidateBlockRun(block_run run); 93 off_t ToVnode(block_run run) const 109 block_run& run); 111 const block_run* paren [all...] |
H A D | bfs.h | 27 struct block_run { struct in namespace:BFS 37 inline bool operator==(const block_run &run) const; 38 inline bool operator!=(const block_run &run) const; 40 inline bool MergeableWith(block_run run) const; 43 inline static block_run Run(int32 group, uint16 start, uint16 length = 1); 47 typedef block_run inode_addr; 49 // Since the block_run::length field spans 16 bits, the largest number of 50 // blocks covered by a block_run is 65535 (as long as we don't want to 73 block_run log_blocks; 120 block_run direc [all...] |
H A D | FileSystemVisitor.h | 56 block_run fCurrent; 58 Stack<block_run> fStack;
|
H A D | CachedBlock.h | 35 inline status_t SetTo(block_run run); 42 block_run run, bool empty = false); 131 CachedBlock::SetTo(block_run run) 163 CachedBlock::SetToWritable(Transaction& transaction, block_run run, bool empty)
|
H A D | Inode.h | 36 ino_t id, mode_t mode, block_run& run); 99 const block_run& BlockRun() const 101 block_run& Parent() { return fNode.parent; } 102 const block_run& Parent() const { return fNode.parent; } 105 block_run& Attributes() { return fNode.attributes; } 145 status_t FindBlockRun(off_t pos, block_run& run, 244 int32 level, block_run run, off_t size, 247 block_run* array, uint32 arrayLength, 250 block_run& run, size_t length, 380 Vnode(Volume* volume, block_run ru [all...] |
H A D | Debug.h | 83 struct block_run; 93 extern void dump_block_run(const char *prefix, const block_run &run);
|
/haiku/src/bin/bfs_tools/lib/ |
H A D | bfs.h | 20 struct __attribute__((packed)) block_run { struct 25 inline bool operator==(const block_run &run) const; 26 inline bool operator!=(const block_run &run) const; 30 inline static block_run Run(int32 group, uint16 start, uint16 length = 1); 33 typedef block_run inode_addr; 55 block_run log_blocks; 79 block_run direct[NUM_DIRECT_BLOCKS]; 81 block_run indirect; 83 block_run double_indirect; 193 /************************ block_run inlin [all...] |
H A D | Disk.h | 23 class BlockRunCache : public Cache<block_run> 29 virtual Cacheable *NewCacheable(block_run run); 55 block_run Root() const { return fSuperBlock.root_dir; } 56 block_run Indices() const { return fSuperBlock.indices; } 57 block_run Log() const { return fSuperBlock.log_blocks; } 63 off_t ToOffset(block_run run) const { return ToBlock(run) << fSuperBlock.block_shift; } 64 off_t ToBlock(block_run run) const { return ((((off_t)run.allocation_group) << fSuperBlock.ag_shift) | (off_t)run.start); } 65 block_run ToBlockRun(off_t start,int16 length = 1) const; 67 uint8 *ReadBlockRun(block_run run); 105 block_run fValidBlockRu [all...] |
H A D | Inode.h | 43 const block_run& BlockRun() const { return fBlockRun; } 44 block_run Parent() const { return fInode->parent; } 45 block_run Attributes() const { return fInode->attributes; } 54 void SetParent(const block_run& run); 55 void SetBlockRun(const block_run& run); 74 static Inode* Factory(Disk* disk, block_run run); 82 virtual Inode *InodeAt(block_run run) = 0; 94 block_run fBlockRun; 122 block_run fRun; 166 virtual status_t GetNextEntry(char *name, block_run *ru [all...] |
H A D | dump.h | 17 extern void dump_block_run(const char* prefix, const block_run& run,
|
/haiku/src/bin/bfs_tools/ |
H A D | bfswhich.cpp | 27 const block_run& checkForRun); 35 checkForBlockRunIntersection(const block_run& check, const block_run& against) 47 checkNode(Disk &disk, Inode *inode, block_run checkForRun) 86 block_run* indirect = (block_run*)malloc(bytes); 92 int32 runs = bytes / sizeof(block_run); 118 const block_run& checkForRun) 142 const block_run& checkForRun) 151 block_run ru [all...] |
H A D | chkindex.cpp | 44 bool Contains(block_run *run) 49 bool Put(block_run &run) 51 block_run *value = (block_run *)malloc(sizeof(block_run)); 55 memcpy(value,&run,sizeof(block_run)); 64 static uint32 BlockRunHash(const block_run *run) 69 static bool BlockRunCompare(const block_run *runA, const block_run *runB) 80 compareBlockRuns(const block_run * [all...] |
H A D | bfsinfo.cpp | 69 int32 count = bytes / sizeof(block_run); 70 block_run runs[count]; 110 int32 count = bytes / sizeof(block_run); 111 block_run runs[count]; 134 int32 indirectCount = indirectBytes / sizeof(block_run); 135 block_run indirectRuns[indirectCount]; 173 block_run run; 191 block_run run; 199 block_run 205 return block_run [all...] |