Searched refs:cached (Results 1 - 25 of 40) sorted by path

12

/haiku/headers/private/package/hpkg/
H A DPoolBuffer.h38 void SetCached(bool cached) { fCached = cached; } argument
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dcache.h72 typedef int (*cache_compare)(const struct CACHED_GENERIC *cached,
74 typedef void (*cache_free)(const struct CACHED_GENERIC *cached);
75 typedef int (*cache_hash)(const struct CACHED_GENERIC *cached);
H A Dinode.h193 extern void ntfs_inode_nidata_free(const struct CACHED_GENERIC *cached);
/haiku/src/add-ons/media/media-add-ons/usb_webcam/
H A DCamDevice.h101 virtual ssize_t ReadReg(uint16 address, uint8 *data, size_t count=1, bool cached=false);
H A DCamSensor.h54 virtual status_t ReadReg(uint16 address, uint8 *data, size_t count=1, bool cached=false);
/haiku/src/add-ons/media/media-add-ons/usb_webcam/addons/
H A DNW80xCamDevice.h40 virtual ssize_t ReadReg(uint16 address, uint8 *data, size_t count=1, bool cached=false);
/haiku/src/add-ons/media/media-add-ons/usb_webcam/addons/quickcam/
H A DQuickCamDevice.h40 virtual ssize_t ReadReg(uint16 address, uint8 *data, size_t count=1, bool cached=false);
/haiku/src/add-ons/media/media-add-ons/usb_webcam/addons/sonix/
H A DSonixCamDevice.h71 virtual ssize_t ReadReg(uint16 address, uint8 *data, size_t count=1, bool cached=false);
/haiku/src/add-ons/kernel/file_systems/bfs/
H A DBPlusTree.cpp491 CachedNode cached(fTree);
492 bplustree_header* header = cached.SetToWritableHeader(transaction);
535 CachedNode cached(fTree);
536 header = cached.SetToWritableHeader(transaction);
554 CachedNode cached(fTree);
555 header = cached.SetToWritableHeader(transaction);
565 cached.Unset();
649 CachedNode cached(this);
650 bplustree_header* header = cached.SetToWritableHeader(transaction);
657 header = cached
1156 _FindFreeDuplicateFragment(Transaction& transaction, const bplustree_node* node, CachedNode& cached, off_t* _offset, bplustree_node** _fragment, uint32* _index) argument
1198 _InsertDuplicate(Transaction& transaction, CachedNode& cached, const bplustree_node* node, uint16 index, off_t value) argument
1828 _RemoveDuplicate(Transaction& transaction, const bplustree_node* node, CachedNode& cached, uint16 index, off_t value) argument
2521 _ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level, off_t offset, off_t lastOffset, off_t nextOffset, const uint8* key, uint16 keyLength) argument
[all...]
H A DBPlusTree.h336 CachedNode& cached, off_t* _offset,
339 CachedNode& cached,
352 CachedNode& cached, uint16 keyIndex,
367 CachedNode& cached, uint32 level,
H A DBlockAllocator.cpp418 AllocationBlock cached(volume);
421 if (cached.SetToWritable(transaction, *this, block) < B_OK) {
427 if (start + numBlocks > cached.NumBlockBits())
428 numBlocks = cached.NumBlockBits() - start;
430 cached.Allocate(start, numBlocks);
479 AllocationBlock cached(volume);
482 if (cached.SetToWritable(transaction, *this, block) < B_OK)
485 T(Block("free-1", block, cached.Block(), volume->BlockSize()));
487 if (uint32(start + length) > cached.NumBlockBits())
488 freeLength = cached
[all...]
H A DCachedBlock.h27 CachedBlock(CachedBlock* cached);
79 CachedBlock::CachedBlock(CachedBlock* cached) argument
81 fVolume(cached->fVolume),
82 fBlockNumber(cached->BlockNumber()),
83 fBlock(cached->fBlock)
85 cached->Keep();
H A DCheckVisitor.cpp121 AllocationBlock cached(fVolume);
123 cached.SetTo(fGroups[i], j);
124 for (uint32 k = 0; k < cached.NumBlockBits(); k++) {
125 if (cached.IsUsed(k) != _CheckBitmapIsUsedAt(block)) {
501 CachedBlock cached(GetVolume());
513 status = cached.SetTo(block + i);
517 block_run* runs = (block_run*)cached.Block();
554 status = cached.SetTo(GetVolume()->ToBlock(data->double_indirect)
559 block_run* array = (block_run*)cached.Block();
H A DInode.cpp1426 could be cached in the inode structure or Inode object, though).
1483 CachedBlock cached(fVolume);
1496 status_t status = cached.SetTo(fVolume->ToBlock(
1501 block_run* indirect = (block_run*)cached.Block();
1504 status = cached.SetTo(fVolume->ToBlock(indirect[
1509 indirect = (block_run*)cached.Block();
1522 CachedBlock cached(fVolume);
1526 status_t status = cached.SetTo(block + i);
1530 block_run* indirect = (block_run*)cached.Block();
1537 << cached
[all...]
H A DJournal.cpp497 CachedBlock cached(fVolume);
508 status = cached.SetTo(logOffset + blockNumber);
517 if (Volume::CheckSuperBlock(cached.Block()) != B_OK) {
540 status = cached.SetTo(logOffset + blockNumber);
545 cached.Block(), blockSize);
H A Dkernel_interface.cpp297 CachedBlock cached(volume);
298 status_t status = cached.SetTo(id);
304 bfs_inode* node = (bfs_inode*)cached.Block();
806 CachedBlock cached(volume);
815 status_t status = cached.SetToWritable(transaction, run);
817 memset(cached.WritableBlock(), 0, volume->BlockSize());
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DVolume.cpp445 CachedBlock cached(this);
446 const uint8* block = cached.SetTo(BTRFS_SUPER_BLOCK_OFFSET / fBlockSize);
/haiku/src/add-ons/kernel/file_systems/exfat/
H A DVolume.cpp240 CachedBlock cached(this);
241 const uint8* block = cached.SetTo(EXFAT_SUPER_BLOCK_OFFSET / fBlockSize);
310 TRACE("Volume::GetIno() cached cluster %" B_PRIu32 " offset %" B_PRIu32
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DBlockAllocator.cpp766 CachedBlock cached(fVolume);
771 indirectData = (uint32*)cached.SetTo(EXT2_DIRECT_BLOCKS + 2);
782 indirectData = (uint32*)cached.SetTo(doubleIndirectBlock);
790 indirectData = (uint32*)cached.SetTo(indirectBlock);
H A DDataStream.cpp81 CachedBlock cached(fVolume);
82 uint32* indirectBlocks = (uint32*)cached.SetTo(B_LENDIAN_TO_HOST_INT32(
98 CachedBlock cached(fVolume);
99 uint32* indirectBlocks = (uint32*)cached.SetTo(B_LENDIAN_TO_HOST_INT32(
110 indirectBlocks = (uint32*)cached.SetTo(indirectIndex);
128 CachedBlock cached(fVolume);
129 uint32* indirectBlocks = (uint32*)cached.SetTo(B_LENDIAN_TO_HOST_INT32(
140 indirectBlocks = (uint32*)cached.SetTo(indirectIndex);
150 indirectBlocks = (uint32*)cached.SetTo(indirectIndex);
462 CachedBlock cached(fVolum
[all...]
H A DDirectoryIterator.cpp97 CachedBlock cached(fVolume);
98 const uint8* block = cached.SetTo(fPhysicalBlock);
161 TRACE("DirectoryIterator::Next(): Creating cached block\n");
163 CachedBlock cached(fVolume);
166 TRACE("DirectoryIterator::Next(): Loading cached block\n");
167 const uint8* block = cached.SetTo(fPhysicalBlock);
208 block = cached.SetTo(fPhysicalBlock);
355 CachedBlock cached(fVolume);
357 uint8* block = cached.SetToWritable(transaction, fPhysicalBlock);
428 CachedBlock cached(fVolum
[all...]
H A DExtentStream.cpp65 CachedBlock cached(fVolume);
76 stream = (ext2_extent_stream *)cached.SetTo(
185 CachedBlock cached(fVolume);
195 stream = (ext2_extent_stream *)cached.SetTo(path[level]);
209 stream = (ext2_extent_stream *)cached.SetToWritable(
210 transaction, cached.BlockNumber());
230 stream = (ext2_extent_stream *)cached.SetTo(path[level]);
255 stream = (ext2_extent_stream *)cached.SetToWritable(
303 stream = (ext2_extent_stream *)cached.SetToWritable(
347 stream = (ext2_extent_stream *)cached
[all...]
H A DHTree.cpp92 CachedBlock cached(fDirectory->GetVolume());
93 HTreeRoot* root = (HTreeRoot*)cached.SetTo(blockNum);
120 CachedBlock cached(fDirectory->GetVolume());
121 HTreeRoot* root = (HTreeRoot*)cached.SetTo(blockNum);
H A DHTreeEntryIterator.cpp85 CachedBlock cached(fVolume);
86 const uint8* block = cached.SetTo(fBlockNum);
143 CachedBlock cached(fVolume);
144 const uint8* block = cached.SetTo(fBlockNum);
261 CachedBlock cached(fVolume);
262 const uint8* block = cached.SetTo(fBlockNum);
285 CachedBlock cached(fVolume);
287 const uint8* blockData = cached.SetTo(fBlockNum);
321 CachedBlock cached(fVolume);
323 uint8* blockData = cached
[all...]
H A DInode.cpp137 CachedBlock cached(fVolume);
138 uint8* inodeBlockData = cached.SetToWritable(transaction, blockNum);
176 CachedBlock cached(fVolume);
177 const uint8* inodeBlock = cached.SetTo(blockNum);
417 CachedBlock cached(fVolume);
418 uint8* block = cached.SetToWritable(transaction, blockNum, true);
672 CachedBlock cached(volume);
673 cached.SetToWritable(transaction, blockNum, true);

Completed in 228 milliseconds

12