Searched refs:round_up (Results 1 - 8 of 8) sorted by relevance
/haiku/src/add-ons/disk_systems/gpt/ |
H A D | Utility.h | 20 round_up(off_t a, uint32 b) function
|
H A D | GPTDiskAddOn.cpp | 96 return partition->Size() >= round_up(partition->BlockSize()
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | Utility.h | 33 round_up(const IntType& value, const RoundType& to) function
|
H A D | Inode.cpp | 1808 blocksRequested = round_up(blocksRequested, minimum); 1948 blocksRequested = round_up(blocksNeeded, minimum); 2326 off_t roundedSize = round_up(Size(), fVolume->BlockSize());
|
H A D | kernel_interface.cpp | 561 vecs[index].length = round_up(inode->Size() - offset,
|
/haiku/src/bin/bfs_tools/lib/ |
H A D | BPlusTree.h | 266 return (uint16 *)(((char *)this) + round_up(sizeof(bplustree_node) + all_key_length)); 281 return round_up(sizeof(bplustree_node) + all_key_length) + all_key_count * (sizeof(uint16) + sizeof(off_t));
|
H A D | bfs.h | 187 round_up(uint32 data) function
|
H A D | BPlusTree.cpp | 765 if (round_up(sizeof(bplustree_node) + bytesBefore + bytesAfter + bytes) + 858 //printf("-> out = %ld, keylen = %ld, %ld bytes total\n",out,bytesBefore,round_up(sizeof(bplustree_node) + bytesBefore + bytesAfter + bytes) + 991 if (int32(round_up(sizeof(bplustree_node) + node->all_key_length + keyLength)
|
Completed in 162 milliseconds