Lines Matching defs:size
19 // - find a range of blocks of a certain size nearby a specific position
27 // with a block size of 2048 bytes already has a 800kB bitmap, and the size
86 checksum(const uint8* data, size_t size)
90 while (size >= 4) {
93 size -= 4;
102 size_t size, uint32 start = 0, uint32 length = 0)
110 fSum = checksum(data, size);
959 // (like 4 blocks) - but that would also reduce the maximum file size
977 // Since size > 0, there must be a valid block run in this stream
1013 // against the group size (the last group may have a different length)
1166 BlockAllocator::Trim(uint64 offset, uint64 size, uint64& trimmedSize)
1168 // TODO: Remove this check when offset and size handling is implemented
1171 || size < (uint64)fVolume->NumBlocks() * fVolume->BlockSize()) {
1172 INFORM(("BFS Trim: Ranges smaller than the file system size"
1186 // TODO: take given offset and size into account!
1336 uint64 offset, uint64 size)
1339 if (size == 0)
1343 trimData.ranges[trimData.range_count].size = size;
1352 uint64 offset, uint64 size, bool force, uint64& trimmedSize)
1354 PRINT(("_TrimNext(index %" B_PRIu32 ", offset %" B_PRIu64 ", size %"
1355 B_PRIu64 ")\n", trimData.range_count, offset, size));
1357 const bool rangesFilled = _AddTrim(trimData, maxRanges, offset, size);
1366 trimData.ranges[i].offset, trimData.ranges[i].size);