Searched refs:cached (Results 1 - 25 of 66) sorted by relevance

123

/haiku-fatelf/src/add-ons/kernel/file_systems/udf/
H A DCachedBlock.h27 CachedBlock(CachedBlock *cached);
73 CachedBlock::CachedBlock(CachedBlock *cached) argument
75 fBlock(cached->fBlock),
76 fBlockNumber(cached->BlockNumber()),
77 fVolume(cached->fVolume)
79 cached->Keep();
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/udf/r5/
H A DCachedBlock.h47 CachedBlock(CachedBlock *cached);
91 CachedBlock::CachedBlock(CachedBlock *cached) argument
92 : fVolume(cached->fVolume)
93 , fBlockNumber(cached->BlockNumber())
94 , fBlock(cached->fBlock)
96 cached->Keep();
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/
H A DCachedBlock.h28 CachedBlock(CachedBlock* cached);
98 CachedBlock::CachedBlock(CachedBlock* cached) argument
100 fVolume(cached->fVolume),
101 fBlockNumber(cached->BlockNumber()),
102 fBlock(cached->fBlock)
104 cached->Keep();
H A DBPlusTree.cpp444 CachedNode cached(fTree);
445 bplustree_header* header = cached.SetToWritableHeader(transaction);
488 CachedNode cached(fTree);
489 header = cached.SetToWritableHeader(transaction);
507 CachedNode cached(fTree);
508 header = cached.SetToWritableHeader(transaction);
518 cached.Unset();
593 CachedNode cached(this);
594 bplustree_header* header = cached.SetToWritableHeader(transaction);
601 header = cached
1092 _FindFreeDuplicateFragment(Transaction& transaction, const bplustree_node* node, CachedNode& cached, off_t* _offset, bplustree_node** _fragment, uint32* _index) argument
1134 _InsertDuplicate(Transaction& transaction, CachedNode& cached, const bplustree_node* node, uint16 index, off_t value) argument
1765 _RemoveDuplicate(Transaction& transaction, const bplustree_node* node, CachedNode& cached, uint16 index, off_t value) argument
2453 _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 DBlockAllocator.cpp450 AllocationBlock cached(volume);
453 if (cached.SetToWritable(transaction, *this, block) < B_OK) {
459 if (start + numBlocks > cached.NumBlockBits())
460 numBlocks = cached.NumBlockBits() - start;
462 cached.Allocate(start, numBlocks);
511 AllocationBlock cached(volume);
514 if (cached.SetToWritable(transaction, *this, block) < B_OK)
517 T(Block("free-1", block, cached.Block(), volume->BlockSize()));
519 if (uint32(start + length) > cached.NumBlockBits())
520 freeLength = cached
[all...]
/haiku-fatelf/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 Dsecurity.c1343 static int compare(const struct CACHED_SECURID *cached, argument
1351 csize = (cached->variable ?
1353 + (((struct POSIX_SECURITY*)cached->variable)->acccnt
1354 + ((struct POSIX_SECURITY*)cached->variable)->defcnt)
1363 return ((cached->uid != item->uid)
1364 || (cached->gid != item->gid)
1365 || (cached->dmode != item->dmode)
1369 && memcmp(&((struct POSIX_SECURITY*)cached->variable)->acl,
1372 return ((cached->uid != item->uid)
1373 || (cached
1378 leg_compare(const struct CACHED_PERMISSIONS_LEGACY *cached, const struct CACHED_PERMISSIONS_LEGACY *item) argument
1919 const struct CACHED_PERMISSIONS *cached; local
2021 const struct CACHED_PERMISSIONS *cached; local
2152 const struct CACHED_PERMISSIONS *cached; local
2292 const struct CACHED_PERMISSIONS *cached; local
2392 const struct CACHED_PERMISSIONS *cached; local
2476 const struct CACHED_SECURID *cached; local
2620 const struct CACHED_SECURID *cached; local
2703 const struct CACHED_SECURID *cached; local
2825 const struct CACHED_PERMISSIONS *cached; local
2896 const struct CACHED_PERMISSIONS *cached; local
3073 const struct CACHED_PERMISSIONS *cached; local
3400 const struct CACHED_PERMISSIONS *cached; local
3521 const struct CACHED_PERMISSIONS *cached; local
3766 struct CACHED_PERMISSIONS *cached; local
[all...]
H A Ddir.h128 extern int ntfs_dir_inode_hash(const struct CACHED_GENERIC *cached);
129 extern int ntfs_dir_lookup_hash(const struct CACHED_GENERIC *cached);
H A Ddir.c97 int ntfs_dir_inode_hash(const struct CACHED_GENERIC *cached) argument
102 path = (const char*)cached->variable;
118 static int inode_cache_compare(const struct CACHED_GENERIC *cached, argument
121 return (!cached->variable
122 || strcmp(cached->variable, wanted->variable));
136 static int inode_cache_inv_compare(const struct CACHED_GENERIC *cached, argument
145 c = (const struct CACHED_INODE*)cached;
148 different = !cached->variable
167 static int lookup_cache_compare(const struct CACHED_GENERIC *cached, argument
170 const struct CACHED_LOOKUP *c = (const struct CACHED_LOOKUP*) cached;
186 lookup_cache_inv_compare(const struct CACHED_GENERIC *cached, const struct CACHED_GENERIC *wanted) argument
202 ntfs_dir_lookup_hash(const struct CACHED_GENERIC *cached) argument
568 struct CACHED_LOOKUP *cached; local
623 struct CACHED_LOOKUP *cached; local
676 struct CACHED_INODE *cached; local
[all...]
/haiku-fatelf/headers/private/package/hpkg/
H A DCachedBuffer.h38 void SetCached(bool cached) { fCached = cached; } argument
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/
H A DStream.h248 // means either uncached, cached, or logged (see above).
278 Cache cached(fVolume);
281 int32 indirectSize = (1L << (INDIRECT_BLOCKS_SHIFT + cached.BlockShift()))
283 int32 directSize = NUM_ARRAY_BLOCKS << cached.BlockShift();
285 int32 runsPerBlock = cached.BlockSize() / sizeof(block_run);
287 block_run *indirect = (block_run *)cached.SetTo(
297 indirect = (block_run *)cached.SetTo(
311 Cache cached(fVolume);
315 block_run *indirect = (block_run *)cached.SetTo(block + i);
324 runBlockEnd += indirect[current].Length() << cached
[all...]
H A DBPlusTree.cpp334 CachedNode cached(this, fHeader->RootNode(), false);
335 if (cached.Node() == NULL)
338 cached.Node()->Initialize();
339 return fStatus = cached.WriteBack(transaction);
391 CachedNode cached(this, fHeader->RootNode());
392 RETURN_ERROR(fStatus = cached.Node() ? B_OK : B_BAD_DATA);
596 CachedNode cached(this);
598 while ((node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
625 BPlusTree::FindFreeDuplicateFragment(bplustree_node *node, CachedNode *cached, off_t *_offset, argument
636 bplustree_node *fragment = cached
660 InsertDuplicate(Transaction *transaction, CachedNode *cached, bplustree_node *node, uint16 index, off_t value) argument
1202 RemoveDuplicate(Transaction *transaction, bplustree_node *node, CachedNode *cached, uint16 index, off_t value) argument
[all...]
H A DBlockAllocator.cpp236 AllocationBlock cached(volume);
239 if (cached.SetTo(*this, block) < B_OK)
243 if (start + numBlocks > cached.NumBlockBits())
244 numBlocks = cached.NumBlockBits() - start;
246 cached.Allocate(start, numBlocks);
248 if (cached.WriteBack(transaction) < B_OK)
288 AllocationBlock cached(volume);
291 if (cached.SetTo(*this, block) < B_OK)
295 if (uint32(start + length) > cached.NumBlockBits())
296 freeLength = cached
[all...]
H A DInode.cpp193 Inode::Inode(CachedBlock *cached) argument
194 : CachedBlock(cached),
198 PRINT(("Inode::Inode(%p) @ %p\n", cached, this));
1043 // standard cached access only from here
1116 CachedBlock cached(fVolume,run);
1117 if ((block = cached.Block()) == NULL)
1125 if (fVolume->WriteBlocks(cached.BlockNumber(), block, 1) < B_OK)
1143 CachedBlock cached(fVolume);
1146 if ((block = cached.SetTo(blockNumber + i, true)) == NULL)
1149 if (fVolume->WriteBlocks(cached
[all...]
H A DInode.h54 CachedBlock(CachedBlock *cached);
84 Inode(CachedBlock *cached);
326 CachedBlock::CachedBlock(CachedBlock *cached) argument
328 fVolume(cached->fVolume),
329 fBlockNumber(cached->BlockNumber()),
330 fBlock(cached->fBlock)
332 cached->Keep();
/haiku-fatelf/src/add-ons/kernel/file_systems/ext2/
H A DHTreeEntryIterator.cpp80 CachedBlock cached(fVolume);
81 const uint8* block = cached.SetTo(fBlockNum);
134 CachedBlock cached(fVolume);
135 const uint8* block = cached.SetTo(fBlockNum);
250 CachedBlock cached(fVolume);
251 const uint8* block = cached.SetTo(fBlockNum);
274 CachedBlock cached(fVolume);
276 const uint8* blockData = cached.SetTo(fBlockNum);
309 CachedBlock cached(fVolume);
311 uint8* blockData = cached
[all...]
H A DExtentStream.cpp63 CachedBlock cached(fVolume);
74 stream = (ext2_extent_stream *)cached.SetTo(
168 CachedBlock cached(fVolume);
178 stream = (ext2_extent_stream *)cached.SetTo(path[level]);
192 stream = (ext2_extent_stream *)cached.SetToWritable(
193 transaction, cached.BlockNumber());
212 stream = (ext2_extent_stream *)cached.SetTo(path[level]);
236 stream = (ext2_extent_stream *)cached.SetToWritable(
282 stream = (ext2_extent_stream *)cached.SetToWritable(
324 stream = (ext2_extent_stream *)cached
[all...]
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);
458 CachedBlock cached(fVolum
[all...]
H A DDirectoryIterator.cpp92 CachedBlock cached(fVolume);
93 const uint8* block = cached.SetTo(fPhysicalBlock);
151 TRACE("DirectoryIterator::Next(): Creating cached block\n");
153 CachedBlock cached(fVolume);
156 TRACE("DirectoryIterator::Next(): Loading cached block\n");
157 const uint8* block = cached.SetTo(fPhysicalBlock);
195 block = cached.SetTo(fPhysicalBlock);
338 CachedBlock cached(fVolume);
340 uint8* block = cached.SetToWritable(transaction, fPhysicalBlock);
401 CachedBlock cached(fVolum
[all...]
H A DVolume.cpp603 CachedBlock cached(this);
604 const uint8* block = cached.SetTo(_GroupDescriptorBlock(blockIndex));
654 CachedBlock cached(this);
655 uint8* block = cached.SetToWritable(transaction,
715 CachedBlock cached(this);
722 uint8* block = cached.SetToWritable(transaction, blockNum);
748 block = cached.SetToWritable(transaction, blockNum);
857 CachedBlock cached(this);
858 const uint8* block = cached.SetTo(fFirstDataBlock);
886 CachedBlock cached(thi
[all...]
/haiku-fatelf/src/system/boot/loader/file_systems/bfs/
H A DBPlusTree.cpp195 CachedNode cached(this, fHeader->RootNode());
197 return fStatus = cached.Node() ? B_OK : B_BAD_DATA;
357 CachedNode cached(this);
359 while ((node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
386 BPlusTree::FindFreeDuplicateFragment(bplustree_node *node, CachedNode *cached, off_t *_offset, argument
395 bplustree_node *fragment = cached->SetTo(bplustree_node::FragmentOffset(
445 CachedNode cached(this);
448 while ((node = cached.SetTo(nodeOffset)) != NULL) {
490 CachedNode cached(fTree);
493 while ((node = cached
[all...]
H A DStream.cpp208 CachedBlock cached(fVolume);
214 cached.BlockSize(), runsPerBlock, directSize, indirectSize);
219 block_run* indirect = (block_run*)cached.SetTo(
229 indirect = (block_run*)cached.SetTo(fVolume.ToBlock(indirect[
244 CachedBlock cached(fVolume);
248 block_run* indirect = (block_run *)cached.SetTo(block + i);
258 += indirect[current].Length() << cached.BlockShift();
262 - (run.Length() << cached.BlockShift());
335 CachedBlock cached(fVolume, run);
336 if ((block = cached
[all...]
/haiku-fatelf/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-fatelf/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-fatelf/src/add-ons/kernel/file_systems/btrfs/
H A DBPlusTree.cpp95 CachedBlock cached(fVolume);
102 stream = (btrfs_stream *)cached.SetTo(physical);
126 stream = (btrfs_stream *)cached.SetTo(physical);

Completed in 241 milliseconds

123