/haiku/src/system/boot/loader/file_systems/bfs/ |
H A D | Volume.h | 42 uint32 BlockShift() const { return fSuperBlock.BlockShift(); } function in class:BFS::Volume 48 off_t ToOffset(block_run run) const { return ToBlock(run) << BlockShift(); } 49 off_t ToOffset(off_t block) const { return block << BlockShift(); }
|
H A D | Stream.cpp | 38 uint32 BlockShift() const function in class:CachedBlock 39 { return fVolume.BlockShift(); } 92 if (read_pos(fVolume.Device(), block << BlockShift(), fBlock, BlockSize()) 257 += (uint32)indirect[current].Length() << cached.BlockShift(); 261 - ((uint32)run.Length() << cached.BlockShift()); 280 runBlockEnd += (uint32)data.direct[current].Length() << fVolume.BlockShift(); 283 offset = runBlockEnd - ((uint32)run.Length() << fVolume.BlockShift()); 321 uint32 blockShift = fVolume.BlockShift(); 388 run.Length() << fVolume.BlockShift()) < B_OK) {
|
H A D | bfs.cpp | 96 || (1UL << fSuperBlock.BlockShift()) != fSuperBlock.BlockSize()
|
/haiku/src/system/boot/loader/file_systems/fat/ |
H A D | CachedBlock.h | 40 uint32 BlockShift() const { return fVolume.BlockShift(); } function in class:FATFS::CachedBlock
|
H A D | Volume.h | 39 int32 BlockShift() const { return fBlockShift; } function in class:FATFS::Volume 58 { return block << BlockShift(); } 59 uint32 ToBlock(off_t offset) const { return offset >> BlockShift(); }
|
H A D | CachedBlock.cpp | 75 fBlockNumber << BlockShift(), fBlock, BlockSize()); 97 ssize_t written = write_pos(fVolume.Device(), fBlockNumber << BlockShift(),
|
/haiku/src/tests/add-ons/kernel/file_systems/bfs/btree/ |
H A D | Volume.h | 30 uint32 BlockShift() const { return 10; /* 2^BlockShift == BlockSize */ } function in class:Volume
|
/haiku/src/add-ons/kernel/file_systems/udf/ |
H A D | CachedBlock.h | 33 uint32 BlockShift() const { return fVolume->BlockShift(); } function in class:CachedBlock
|
H A D | Volume.h | 51 uint32 BlockShift() const { return fBlockShift; } function in class:Volume
|
H A D | Icb.cpp | 227 off_t pos = logicalBlock << fVolume->BlockShift(); 429 = pos - off_t((pos >> volume->BlockShift()) << volume->BlockShift()); 537 vecs[index].offset = diskBlock << fVolume->BlockShift();
|
H A D | AllocationDescriptorList.h | 107 off_t startBlock = start >> fVolume->BlockShift();
|
/haiku/src/tests/add-ons/kernel/file_systems/bfs/dump_log/ |
H A D | dump_log.cpp | 32 || (1UL << BlockShift()) != BlockSize() 55 return toBlock(superBlock, run) << superBlock.BlockShift(); 122 if (read_pos(device, blockNumber << superBlock.BlockShift(), 156 if (read_pos(device, blockNumber << superBlock.BlockShift(),
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | CachedBlock.h | 50 uint32 BlockShift() const function in class:CachedBlock 51 { return fVolume->BlockShift(); }
|
H A D | Volume.h | 75 uint32 BlockShift() const { return fBlockShift; } function in class:Volume 85 { return ToBlock(run) << BlockShift(); }
|
H A D | Volume.cpp | 43 || (1UL << BlockShift()) != BlockSize() 197 fBlockShift = fSuperBlock.BlockShift(); 204 if (diskSize < (NumBlocks() << BlockShift())) { 206 B_PRIdOFF " bytes)!\n", diskSize, NumBlocks() << BlockShift())); 573 fBlockShift = fSuperBlock.BlockShift();
|
H A D | Inode.cpp | 1537 << cached.BlockShift(); 1541 << cached.BlockShift()); 1559 << fVolume->BlockShift(); 1563 - ((uint32)run.Length() << fVolume->BlockShift()); 1757 >> fVolume->BlockShift(); 1778 roundTo = 65536 >> fVolume->BlockShift(); 1782 roundTo = (512 * 1024) >> fVolume->BlockShift(); 1786 roundTo = size >> (fVolume->BlockShift() + 4); 1790 roundTo = 65536 >> fVolume->BlockShift(); 1794 roundTo = 4096 >> fVolume->BlockShift(); [all...] |
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | Volume.cpp | 48 || BlockShift() > 16 49 || BlocksPerGroup() != (1UL << BlockShift()) * 8 50 || InodeSize() > (1UL << BlockShift()) 52 || ReservedGDTBlocks() > (1UL << BlockShift()) / 4 180 fBlockShift = fSuperBlock.BlockShift(); 244 if ((diskSize + fBlockSize) <= ((off_t)NumBlocks() << BlockShift())) {
|
H A D | Volume.h | 62 uint32 BlockShift() const { return fBlockShift; } function in class:Volume
|
H A D | ExtentStream.cpp | 41 fNumBlocks = size == 0 ? 0 : ((size - 1) >> fVolume->BlockShift()) + 1; 53 fileblock_t index = offset >> fVolume->BlockShift(); 112 = (fSize + fVolume->BlockSize() - 1) >> fVolume->BlockShift();
|
/haiku/src/add-ons/kernel/file_systems/exfat/ |
H A D | Volume.cpp | 169 fBlockSize = 1 << fSuperBlock.BlockShift(); 180 << fSuperBlock.BlockShift();
|
H A D | exfat.h | 75 uint8 BlockShift() const { return block_shift; } function in struct:exfat_super_block
|
H A D | kernel_interface.cpp | 98 uint32 blockSize = 1 << superBlock.BlockShift(); 120 << superBlock.BlockShift(); 138 << cookie->super_block.BlockShift(); 139 partition->block_size = 1 << cookie->super_block.BlockShift();
|
/haiku/src/bin/bfs_tools/lib/ |
H A D | Disk.h | 48 uint32 BlockShift() const { return fSuperBlock.block_shift; } function in class:Disk
|
H A D | Inode.cpp | 676 ? fRunFileOffset + (fRun.length << fDisk->BlockShift()) : 0LL; 719 int32 indirectRuns = (fInode->data.indirect.length << fDisk->BlockShift()) / sizeof(block_run); 732 fRunBlockEnd += indirect[fCurrent].length << fDisk->BlockShift(); 756 fRunBlockEnd += fInode->data.direct[fCurrent].length << fDisk->BlockShift(); 904 else if ((fInode->data.direct[i].length << fDisk->BlockShift()) >= size) { 909 size -= fInode->data.direct[i].length << fDisk->BlockShift();
|
H A D | Bitmap.cpp | 205 int32 bytes = node->data.indirect.length << fDisk->BlockShift();
|