| /haiku/src/add-ons/kernel/file_systems/udf/ |
| H A D | MemoryChunk.h | 30 MemoryChunk(uint32 blockSize, void *blockData) argument
32 , fData(blockData)
|
| /haiku/src/tests/system/kernel/file_corruption/fs/ |
| H A D | File.cpp | 46 uint8 blockData[B_PAGE_SIZE]; member in struct:__anon5940::WriteTempData
58 uint64* blockData; member in struct:File::LevelInfo
347 info.blockData = (uint64*)((uint8*)info.block.Data()
350 info.blockData = (uint64*)info.block.Data();
355 blockIndex = info.blockData[info.index];
379 blockIndex = info.blockData[info.index];
391 infos[level].blockData = (uint64*)infos[level].block.Data();
501 infos[0].blockData = (uint64*)((uint8*)infos[0].block.Data()
529 uint64 blockIndex = infos[level].blockData[infos[level].childCount - 1];
536 info.blockData
580 const uint64* blockData = (uint64*)infos[i].block.Data(); local
[all...] |
| /haiku/src/add-ons/kernel/file_systems/fat/ |
| H A D | iter.cpp | 177 char *blockData = (char *)block_cache_get(csi->vol->fBlockCache, i); local
178 memcpy(buf, blockData, csi->vol->bytes_per_sector);
219 char *blockData; local
221 i, 0, 1, -1, (void**)&blockData);
225 memcpy(blockData, buf, csi->vol->bytes_per_sector);
244 char *blockData; local
253 -1, (void**)&blockData);
257 memcpy(blockData, buffer, csi->vol->bytes_per_sector);
|
| H A D | fat.cpp | 34 char *blockData; local
41 (void**)&blockData);
45 memcpy(blockData, buffer, vol->bytes_per_sector);
|
| /haiku/src/add-ons/kernel/file_systems/ext2/ |
| H A D | HTreeEntryIterator.cpp | 287 const uint8* blockData = cached.SetTo(fBlockNum); local
288 const HTreeEntry* entries = (const HTreeEntry*)blockData;
323 uint8* blockData = cached.SetToWritable(transaction, fBlockNum); local
324 if (blockData == NULL)
327 HTreeEntry* entries = (HTreeEntry*)blockData;
383 _SetHTreeEntryChecksum(blockData);
|
| H A D | Journal.cpp | 372 const JournalHeader* blockData = (JournalHeader*)data.SetTo( local
374 if (blockData == NULL) {
382 if (blockData->CheckMagic()) {
404 memcpy(escapedData + 4, blockData->data, fBlockSize - 4);
407 finalData = (void*)blockData;
|
| /haiku/src/add-ons/kernel/file_systems/xfs/ |
| H A D | BPlusTree.cpp | 41 fPathForLeaves[i].blockData = NULL;
42 fPathForData[i].blockData = NULL;
170 = GetKeyFromNode(i + 1, (void*)fPathForLeaves[pathIndex].blockData);
173 fPathForLeaves[pathIndex].blockData);
237 delete path[i].blockData;
239 path[i].blockData = new(std::nothrow) char[len];
240 if (path[i].blockData == NULL)
245 if (read_pos(volume->Device(), readPos, path[i].blockData, len)
256 delete path[i].blockData;
258 path[i].blockData
[all...] |
| H A D | BPlusTree.h | 94 * 0, if its an unused node, 1 if blockData size is a single block,
95 * 2 if blockData size is directory block size.
99 char* blockData; member in struct:PathNode
|
| /haiku/src/add-ons/kernel/file_systems/iso9660/ |
| H A D | kernel_interface.cpp | 281 char* blockData = (char*)block_cache_get(volume->fBlockCache, block); local
282 if (blockData == NULL)
291 "%p.\n", block, blockData));
298 && blockData[0] != 0
300 initResult = InitNode(volume, &node, blockData, &bytesRead);
327 blockData += bytesRead;
|
| H A D | iso9660.cpp | 763 char *blockData; local
765 blockData
767 if (blockData != NULL && *(blockData + cookie->pos) == 0) {
770 blockData = NULL;
784 if (blockData != NULL && totalRead < cookie->totalSize) {
787 result = InitNode(volume, &node, blockData + cookie->pos,
833 if (blockData != NULL)
|
| /haiku/src/system/kernel/cache/ |
| H A D | block_cache.cpp | 2499 BlockData* blockData = dynamic_cast<BlockData*>(entry); local
2500 if (blockData == NULL)
2519 blockData->DumpBlocks(which, offset, size);
|