Home
last modified time | relevance | path

Searched refs:blocks (Results 1 – 25 of 111) sorted by relevance

12345

/haiku/src/add-ons/kernel/file_systems/ext2/
H A DHTree.cpp243 HTree::_HalfMD4Transform(uint32 buffer[4], uint32 blocks[8]) in _HalfMD4Transform()
255 a += _MD4F(b, c, d) + blocks[i]; in _HalfMD4Transform()
269 a += _MD4G(b, c, d) + blocks[i] + 013240474631UL; in _HalfMD4Transform()
283 a += _MD4H(b, c, d) + blocks[3 - i] + 015666365641UL; in _HalfMD4Transform()
289 a += _MD4H(b, c, d) + blocks[7 - i] + 015666365641UL; in _HalfMD4Transform()
316 uint32 blocks[8]; in _HashHalfMD4() local
318 _PrepareBlocksForHash(name, (uint32)length, blocks, 8); in _HashHalfMD4()
319 _HalfMD4Transform(buffer, blocks); in _HashHalfMD4()
329 HTree::_TEATransform(uint32 buffer[4], uint32 blocks[4]) in _TEATransform()
336 a = blocks[0]; in _TEATransform()
[all …]
H A Dext2.h103 uint64 blocks = B_LENDIAN_TO_HOST_INT32(num_blocks); in NumBlocks() local
105 blocks |= ((uint64)B_LENDIAN_TO_HOST_INT32(num_blocks_high) << 32); in NumBlocks()
106 return blocks; in NumBlocks()
111 uint64 blocks = B_LENDIAN_TO_HOST_INT32(free_blocks); in FreeBlocks() local
113 blocks |= ((uint64)B_LENDIAN_TO_HOST_INT32(free_blocks_high) << 32); in FreeBlocks()
114 return blocks; in FreeBlocks()
118 uint64 blocks = B_LENDIAN_TO_HOST_INT32(reserved_blocks); in ReservedBlocks() local
120 blocks |= ((uint64)B_LENDIAN_TO_HOST_INT32(reserved_blocks_high) << 32); in ReservedBlocks()
121 return blocks; in ReservedBlocks()
281 uint32 blocks = B_LENDIAN_TO_HOST_INT16(free_blocks); in FreeBlocks() local
[all …]
H A DHTree.h139 uint32 blocks[8]);
143 uint32 blocks[4]);
147 uint32 length, uint32* blocks, uint32 numBlocks);
/haiku/docs/user/support/
H A DBlockCache.dox23 \brief Implements a mechanism to store and retrieve memory blocks.
49 \brief A class that creates and maintains a pool of memory blocks.
52 a lot of little blocks of memory that you want to access and dispose of
54 operations, it is better to have a pool of memory blocks at your disposal.
58 The principle is easy. The constructor takes the number of blocks you
59 want to create beforehand, the size of the blocks, and the method of
66 As soon as you have the memory pool, you can Get() blocks. If the
67 pre-allocated memory blocks run out, BBlockCache will allocate new ones, so
70 more blocks will be saved than the initial number you requested when you
75 also means that when you delete your BBlockCache instance, any blocks of
[all …]
/haiku/src/bin/
H A Ddf.cpp68 double blocks = 1. * numBlocks * blockSize; in ByteString() local
71 if (blocks < 1024) in ByteString()
79 blocks /= 1024.0; in ByteString()
81 } while (blocks >= 1024 && units[i + 1]); in ByteString()
83 sprintf(string, "%.1f %s", blocks, units[i]); in ByteString()
91 PrintBlocks(int64 blocks, int64 blockSize, bool showBlocks) in PrintBlocks() argument
96 sprintf(temp, "%" B_PRId64, blocks * (blockSize / 1024)); in PrintBlocks()
98 strcpy(temp, ByteString(blocks, blockSize)); in PrintBlocks()
H A Dmountvolume.cpp102 double blocks = size; in size_string() local
112 blocks /= 1024.0; in size_string()
114 } while (blocks >= 1024 && units[i + 1]); in size_string()
116 snprintf(string, sizeof(string), "%.1f%s", blocks, units[i]); in size_string()
/haiku/src/add-ons/kernel/drivers/graphics/intel_extreme/
H A Dintel_extreme.cpp668 uint32* blocks = info.shared_info->register_blocks; in intel_extreme_init() local
669 blocks[REGISTER_BLOCK(REGS_FLAT)] = 0; in intel_extreme_init()
674 blocks[REGISTER_BLOCK(REGS_NORTH_SHARED)] in intel_extreme_init()
676 blocks[REGISTER_BLOCK(REGS_NORTH_PIPE_AND_PORT)] in intel_extreme_init()
678 blocks[REGISTER_BLOCK(REGS_NORTH_PLANE_CONTROL)] in intel_extreme_init()
680 blocks[REGISTER_BLOCK(REGS_SOUTH_SHARED)] in intel_extreme_init()
682 blocks[REGISTER_BLOCK(REGS_SOUTH_TRANSCODER_PORT)] in intel_extreme_init()
686 blocks[REGISTER_BLOCK(REGS_NORTH_SHARED)] in intel_extreme_init()
688 blocks[REGISTER_BLOCK(REGS_NORTH_PIPE_AND_PORT)] in intel_extreme_init()
690 blocks[REGISTER_BLOCK(REGS_NORTH_PLANE_CONTROL)] in intel_extreme_init()
[all …]
/haiku/src/add-ons/kernel/file_systems/udf/drive_setup_addon/
H A Dudf-ds.cpp29 uint64 blocks; member
53 …status_t error = Udf::udf_recognize(device, (data->offset + sessionOffset), data->blocks, blockSiz… in ds_fs_id()
/haiku/src/system/kernel/disk_device_manager/
H A DKFileDiskDevice.cpp164 off_t blocks = st.st_size / blockSize; in GetGeometry() local
165 uint32 heads = (blocks + ULONG_MAX - 1) / ULONG_MAX; in GetGeometry()
170 geometry->cylinder_count = blocks / heads; in GetGeometry()
/haiku/src/add-ons/translators/psd/
H A DDataArray.cpp28 int32 blocks = ((fDataSize + size) / fBlockSize) + 1; in _ReallocArrayFor() local
29 uint8 *newData = (uint8*)realloc(fData, blocks * fBlockSize); in _ReallocArrayFor()
32 fAllocatedDataSize = blocks * fBlockSize; in _ReallocArrayFor()
/haiku/src/tests/kits/storage/virtualdrive/
H A Dmkvirtualdrive.cpp121 off_t blocks = size / blockSize; in install_file() local
122 uint32 heads = (blocks + ULONG_MAX - 1) / ULONG_MAX; in install_file()
127 info.geometry.cylinder_count = blocks / heads; in install_file()
/haiku/src/system/kernel/device_manager/
H A DFileDevice.cpp322 off_t blocks = fFileSize / kBlockSize; in Control() local
323 uint32 heads = (blocks + 0xfffffffe) / 0xffffffff; in Control()
330 geometry.cylinder_count = blocks / heads; in Control()
/haiku/src/add-ons/kernel/generic/scsi_periph/
H A Dblock.cpp520 unmapList->blocks[descriptorIndex].lba in trim_unmap()
522 unmapList->blocks[descriptorIndex].block_count in trim_unmap()
548 - offsetof(scsi_unmap_parameter_list, blocks)); in trim_unmap()
558 unmapList->blocks[0].lba); in trim_unmap()
579 unmapList->blocks[i].lba), in trim_unmap()
581 unmapList->blocks[i].block_count)); in trim_unmap()
583 unmapList->blocks[i].block_count); in trim_unmap()
/haiku/src/add-ons/kernel/drivers/graphics/et6x00/
H A Dreadme5 - hardware accelerated screen-to-screen blocks copying;
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Ddevice.c588 uint64_t blocks; in ntfs_device_size_get() local
593 DKIOCGETBLOCKCOUNT, &blocks) >= 0) in ntfs_device_size_get()
596 (unsigned long long) blocks, in ntfs_device_size_get()
597 (unsigned long long) blocks); in ntfs_device_size_get()
598 return blocks * sector_size / block_size; in ntfs_device_size_get()
/haiku/src/add-ons/kernel/file_systems/userlandfs/
H A Duserlandfs35 # allocate and zero all free blocks
/haiku/src/system/boot/platform/efi/arch/arm64/
H A Darch_mmu.h195 bool blocks; member
211 return fRegime[level].blocks; in BlocksAllowed()
/haiku/src/tools/fs_shell/
H A Dunistd.cpp177 off_t blocks = size / blockSize; in fssh_ioctl() local
178 uint32_t heads = (blocks + ULONG_MAX - 1) in fssh_ioctl()
184 geometry->cylinder_count = blocks / heads; in fssh_ioctl()
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBlockAllocator.cpp199 void AddFreeRange(int32 start, int32 blocks);
379 AllocationGroup::AddFreeRange(int32 start, int32 blocks) in AddFreeRange() argument
387 if (!fLargestValid || fLargestLength < blocks) { in AddFreeRange()
389 fLargestLength = blocks; in AddFreeRange()
393 fFreeBits += blocks; in AddFreeRange()
648 uint32 blocks = allocator->fBlocksPerGroup; in _Initialize() local
652 uint32* buffer = (uint32*)malloc(blocks << blockShift); in _Initialize()
658 uint32 bitsPerGroup = 8 * (blocks << blockShift); in _Initialize()
663 blocks << blockShift) < B_OK) in _Initialize()
673 groups[i].fNumBitmapBlocks = blocks; in _Initialize()
[all …]
/haiku/src/add-ons/kernel/file_systems/userlandfs/server/beos/
H A Dfs_cache.h46 extern _IMPEXP_KERNEL int beos_set_blocks_info(int dev, off_t *blocks,
/haiku/src/tests/add-ons/kernel/partitioning_systems/
H A DPartitioningSystemsTest.cpp65 off_t blocks = stat.st_size / blockSize; in create_disk_device() local
66 uint32 heads = (blocks + ULONG_MAX - 1) / ULONG_MAX; in create_disk_device()
71 device->geometry.cylinder_count = blocks / heads; in create_disk_device()
/haiku/src/apps/bootmanager/
H A DLegacyBootMenu.cpp631 const size_t blocks = size / kBlockSize; in _ReadBlocks() local
633 for (size_t i = 0; i < blocks; i ++, block += kBlockSize) { in _ReadBlocks()
649 const size_t blocks = size / kBlockSize; in _WriteBlocks() local
651 for (size_t i = 0; i < blocks; i ++, block += kBlockSize) { in _WriteBlocks()
/haiku/src/system/boot/platform/bios_ia32/
H A Dstage1.nasm5 ; partitions. The offset of the partition in 512 byte blocks must be written at
14 ; eax - partition offset in 512 byte blocks and dl - BIOS ID of the boot drive.
358 ; Reads one or more disk blocks from the given offset into the specified buffer.
491 ; ecx - blocks left of the current block run
496 ; bx - remaining indirect blocks
510 ; there are more indirect blocks: read the next one
549 ; we'll read 2 disk blocks: so subtract 2 from blocks_left
585 ; clear the number of indirect blocks, for the case there aren't any
588 ; check whether there are indirect blocks (max_indirect_range != 0)
606 ; get number of indirect blocks
[all …]
/haiku/src/system/kernel/cache/
H A Dblock_cache.cpp279 block_list blocks; member
310 status_t _WriteBlocks(cached_block** blocks, uint32 count);
1217 block_list::Iterator blockIterator = transaction->blocks.GetIterator(); in Add()
1255 uint32 blocks = 1; in Write() local
1256 for (; (i + blocks) < fCount && blocks < IOV_MAX; blocks++) { in Write()
1257 const uint32 j = i + blocks; in Write()
1262 status_t status = _WriteBlocks(fBlocks + i, blocks); in Write()
1268 for (uint32 j = i; j < (i + blocks); j++) { in Write()
1275 i += (blocks - 1); in Write()
1323 BlockWriter::_WriteBlocks(cached_block** blocks, uint32 count) in _WriteBlocks() argument
[all …]
/haiku/headers/private/userlandfs/legacy/
H A Dcache.h110 extern _IMPEXP_KERNEL int set_blocks_info(int dev, off_t *blocks, int nblocks,

12345