/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | BlockCache.cpp | 46 requests a certain block and the latter tells the cache, that the caller 47 is done with the block. When a block is unused it is either kept in 49 for another block. 70 for (int32 i = 0; Block *block = fBlocks.ItemAt(i); i++) { 71 if (block->_GetRefCount() > 0) { 72 INFORM(("WARNING: block not put: %p (ref count: %" B_PRId32 ")\n", 73 block, block->_GetRefCount())); 75 delete block; 106 GetBlock(Block *block) argument 132 Block *block = _FindBlock(number); local 152 PutBlock(Block *block) argument 182 Block *block = new(nothrow) Block; local [all...] |
/haiku/src/tools/fs_shell/ |
H A D | block_cache.cpp | 22 // 1) block reading/writing is not at all optimized for speed, it will 24 // 2) the locking could be improved; getting a block should not need to 129 void RemoveBlock(cached_block* block); 130 void DiscardBlock(cached_block* block); 131 void FreeBlock(cached_block* block); 166 static fssh_status_t write_cached_block(block_cache* cache, cached_block* block, 444 const fssh_off_t* block = (const fssh_off_t*)_block; local 446 fssh_off_t diff = cacheEntry->block_number - *block; 459 const fssh_off_t* block = (const fssh_off_t*)_block; local 464 return (uint64_t)*block 535 FreeBlock(cached_block* block) argument 557 cached_block* block = new(nothrow) cached_block; local 624 RemoveBlock(cached_block* block) argument 635 DiscardBlock(cached_block* block) argument 660 put_cached_block(block_cache* cache, cached_block* block) argument 704 cached_block* block = (cached_block*)hash_lookup(cache->hash, &blockNumber); local 729 cached_block* block = (cached_block*)hash_lookup(cache->hash, local 790 cached_block* block; local 889 write_cached_block(block_cache* cache, cached_block* block, bool deleteTransaction) argument 1065 cached_block* block = transaction->first_block; local 1122 cached_block* block = transaction->first_block; local 1189 cached_block* block = transaction->first_block; local 1269 cached_block* block = transaction->first_block; local 1320 cached_block* block = transaction->first_block; local 1387 cached_block* block = (cached_block*)*_cookie; local 1477 cached_block* block = (cached_block*)hash_lookup(cache->hash, &blockNumber); local 1500 cached_block* block; local 1548 cached_block* block; local 1581 cached_block* block = (cached_block*)hash_lookup(cache->hash, local 1606 cached_block* block = (cached_block*)hash_lookup(cache->hash, local 1642 void* block; local 1675 void* block; local 1697 void* block; local 1714 cached_block* block; local 1734 const void* block; local 1757 cached_block* block = (cached_block*)hash_lookup(cache->hash, local [all...] |
/haiku/src/add-ons/kernel/file_systems/ext2/ |
H A D | CachedBlock.h | 8 //! interface for the block cache 19 CachedBlock(Volume* volume, off_t block); 25 const uint8* SetTo(off_t block); 27 off_t block, bool empty = false); 28 uint8* SetToWritableWithoutTransaction(off_t block, 39 uint8* _SetToWritableEtc(int32 transaction, off_t block, 63 CachedBlock::CachedBlock(Volume* volume, off_t block) argument 69 SetTo(block); 98 CachedBlock::SetTo(off_t block) argument 101 fBlockNumber = block; 107 SetToWritable(Transaction& transaction, off_t block, bool empty) argument 114 SetToWritableWithoutTransaction(off_t block, bool empty) argument 120 _SetToWritableEtc(int32 transaction, off_t block, bool empty) argument [all...] |
H A D | HashRevokeManager.cpp | 63 HashRevokeManager::Insert(uint32 block, uint32 commitID) argument 65 RevokeElement* element = fHash->Lookup(block); 79 // We already have a newer version of the block 83 return _ForceInsert(block, commitID); 88 HashRevokeManager::Remove(uint32 block) argument 90 RevokeElement* element = fHash->Lookup(block); 104 HashRevokeManager::Lookup(uint32 block, uint32 commitID) argument 106 RevokeElement* element = fHash->Lookup(block); 119 uint32 block = *(uint32*)_block; local 121 if (revoked->block 144 _ForceInsert(uint32 block, uint32 commitID) argument [all...] |
H A D | RevokeManager.h | 21 virtual status_t Insert(uint32 block, uint32 commitID) = 0; 22 virtual status_t Remove(uint32 block) = 0; 23 virtual bool Lookup(uint32 block, uint32 commitID) = 0;
|
H A D | HashRevokeManager.h | 18 uint32 block; member in struct:RevokeElement 34 return HashKey(value->block); 39 return value->block == key; 59 virtual status_t Insert(uint32 block, uint32 commitID); 60 virtual status_t Remove(uint32 block); 61 virtual bool Lookup(uint32 block, uint32 commitID); 67 status_t _ForceInsert(uint32 block, uint32 commitID);
|
/haiku/src/system/libroot/posix/malloc_hoard2/ |
H A D | block.h | 33 class block { class in namespace:BPrivate 35 block(superblock * sb) function in class:BPrivate::block 44 block & 45 operator=(const block & b) 63 // Mark this block as free. 66 // Mark this block as allocated. 69 // Is this block valid? (i.e., 73 // Return the block's superblock pointer. 104 setNext(block * b) 109 block * [all...] |
H A D | threadheap.h | 79 if (alignment < sizeof(block)) 80 alignment = sizeof(block); 85 // Leave enough room to align the block within the malloced space. 86 newSize = size + sizeof(block) + alignment; 88 // Now malloc the space up with a little extra (we'll put the block 100 // If there's not enough room for the block header, skip to the 101 // next aligned space within the block.. 102 if ((unsigned long)newptr - (unsigned long)ptr < sizeof(block)) 107 // Copy the block from the start of the allocated memory. 108 block * [all...] |
/haiku/src/servers/app/ |
H A D | ClientMemoryAllocator.cpp | 17 // However, this would require a lock whenever a block of memory 48 struct block* block = fFreeBlocks.RemoveHead(); local 49 if (block == NULL) 52 free(block); 67 ClientMemoryAllocator::Allocate(size_t size, block** _address, bool& newArea) 75 // Search best matching free block from the list 78 struct block* block; local 79 struct block* bes 249 struct block* block; local [all...] |
H A D | ClientMemoryAllocator.h | 20 struct block; 28 struct block : DoublyLinkedListLinkImpl<struct block> { struct in inherits:DoublyLinkedListLinkImpl 34 typedef DoublyLinkedList<block> block_list; 43 void* Allocate(size_t size, block** _address, 45 void Free(block* cookie); 52 struct block* _AllocateChunk(size_t size, bool& newArea); 88 block* fBlock;
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | CachedBlock.h | 9 //! interface for the block cache 26 CachedBlock(Volume* volume, off_t block); 32 const uint8* SetTo(off_t block); 33 uint8* SetToWritable(off_t block, int32 transactionId, 68 CachedBlock::CachedBlock(Volume* volume, off_t block) argument 75 SetTo(block); 104 CachedBlock::SetTo(off_t block) argument 107 fBlockNumber = block; 108 return fBlock = (uint8*)block_cache_get(fVolume->BlockCache(), block); 113 CachedBlock::SetToWritable(off_t block, int3 argument [all...] |
/haiku/src/system/kernel/cache/ |
H A D | block_cache.cpp | 31 // block reading/writing is not at all optimized for speed, it will 78 // block in the parent transaction. It may point to current_data if the 80 // block has been changed in the current sub transaction already, to a 81 // new block containing the contents changed in the parent transaction. 82 // If this is NULL, the block has not been changed in the parent 100 // This is the current active transaction, if any, the block is 104 // block. In this case, the block has not yet written back yet, and 106 // latter if the block is already being part of another transaction. 123 static inline void operator delete(void* block); 161 operator delete(void* block) argument 366 Action(block_cache* cache, cached_block* block) argument 404 Get(block_cache* cache, cached_block* block) argument 416 Put(block_cache* cache, cached_block* block) argument 428 Read(block_cache* cache, cached_block* block) argument 440 Write(block_cache* cache, cached_block* block) argument 452 Flush(block_cache* cache, cached_block* block, bool getUnused = false) argument 503 BlockData(block_cache* cache, cached_block* block, const char* message) argument 714 cached_block* block = transaction->first_block; local 1068 cached_block* block = transaction->first_block; local 1120 Add(cached_block* block, cache_transaction* transaction) argument 1255 WriteBlock(block_cache* cache, cached_block* block) argument 1274 _WriteBlock(cached_block* block) argument 1302 _BlockDone(cached_block* block, cache_transaction* transaction) argument 1364 _UnmarkWriting(cached_block* block) argument 1473 void* block = object_cache_alloc(buffer_cache, 0); local 1485 FreeBlock(cached_block* block) argument 1506 cached_block* block = NULL; local 1560 FreeBlockParentData(cached_block* block) argument 1607 RemoveBlock(cached_block* block) argument 1618 DiscardBlock(cached_block* block) argument 1724 mark_block_busy_reading(block_cache* cache, cached_block* block) argument 1734 mark_block_unbusy_reading(block_cache* cache, cached_block* block) argument 1751 wait_for_busy_reading_block(block_cache* cache, cached_block* block) argument 1791 wait_for_busy_writing_block(block_cache* cache, cached_block* block) argument 1834 put_cached_block(block_cache* cache, cached_block* block) argument 1885 cached_block* block = cache->hash->Lookup(blockNumber); local 1918 cached_block* block = cache->hash->Lookup(blockNumber); local 1995 cached_block* block; local 2135 dump_block(cached_block* block) argument 2151 dump_block_long(cached_block* block) argument 2246 cached_block* block = cache->hash->Lookup(blockNumber); local 2308 cached_block* block = iterator.Next(); local 2387 cached_block* block = transaction->first_block; local 2617 cached_block* block = iterator.Next(); local 2964 cached_block* block = transaction->first_block; local 3122 cached_block* block = transaction->first_block; local 3205 cached_block* block = transaction->first_block; local 3300 cached_block* block = (cached_block*)*_cookie; local 3397 cached_block* block = cache->hash->Lookup(blockNumber); local 3427 cached_block* block = cache->hash->Clear(true); local 3481 cached_block* block = iterator.Next(); local 3516 cached_block* block = cache->hash->Lookup(blockNumber); local 3550 cached_block* block = cache->hash->Lookup(blockNumber); local 3562 cached_block* block = cache->hash->Lookup(blockNumber); local 3598 void* block; local 3630 void* block; local 3650 void* block; local 3667 cached_block* block; local 3689 const void* block; local 3712 cached_block* block = cache->hash->Lookup(blockNumber); local [all...] |
/haiku/src/add-ons/kernel/partitioning_systems/gpt/ |
H A D | gpt.h | 32 // the rest of the block is reserved 47 void SetAbsoluteBlock(uint64 block) argument 48 { absolute_block = B_HOST_TO_LENDIAN_INT64(block); } 51 void SetAlternateBlock(uint64 block) argument 52 { alternate_block = B_HOST_TO_LENDIAN_INT64(block); } 55 void SetFirstUsableBlock(uint64 block) argument 56 { first_usable_block = B_HOST_TO_LENDIAN_INT64(block); } 59 void SetLastUsableBlock(uint64 block) argument 60 { last_usable_block = B_HOST_TO_LENDIAN_INT64(block); } 64 void SetEntriesBlock(uint64 block) argument 99 SetStartBlock(uint64 block) argument 103 SetEndBlock(uint64 block) argument [all...] |
/haiku/src/apps/debugger/user_interface/cli/commands/ |
H A D | CliDumpStringCommand.cpp | 66 TeamMemoryBlock* block = NULL; 67 if (context.GetMemoryBlock(address, block) != B_OK) 74 while (block->Contains(offset)) { 75 c = *(block->Data() + offset - block->BaseAddress());
|
/haiku/src/kits/support/ |
H A D | BlockCache.cpp | 43 // memory, do not allow to allocate one large block to be used as pool. 75 // should have at least one block 81 _FreeBlock *block = reinterpret_cast<_FreeBlock *>(fAlloc(blockSize)); local 82 if (!block) 85 block->next = fFreeList; 86 fFreeList = block; 87 DEBUG_ONLY(block->magic1 = MAGIC1); 88 DEBUG_ONLY(block->magic2 = MAGIC2 + (uint32)(addr_t)block->next); 116 // we can take a block fro 141 _FreeBlock *block = reinterpret_cast<_FreeBlock *>(pointer); local [all...] |
/haiku/src/kits/debugger/dwarf/ |
H A D | CfaRule.h | 31 const void* block; member in struct:CfaExpression 51 inline void SetToLocationExpression(const void* block, 53 inline void SetToValueExpression(const void* block, 80 inline void SetToExpression(const void* block, size_t size); 146 CfaRule::SetToLocationExpression(const void* block, size_t size) argument 149 fExpression.block = block; 155 CfaRule::SetToValueExpression(const void* block, size_t size) argument 158 fExpression.block = block; 190 SetToExpression(const void* block, size_t size) argument [all...] |
/haiku/src/kits/debugger/debug_managers/ |
H A D | TeamMemoryBlockManager.cpp | 39 TeamMemoryBlock* block; member in struct:TeamMemoryBlockManager::MemoryBlockEntry 42 MemoryBlockEntry(TeamMemoryBlock* block) argument 44 Key(block->BaseAddress()), 45 block(block) 128 if (entry->block->AcquireReference() != 0) 129 return entry->block; 131 // this block already had its last reference released, 141 TeamMemoryBlock* block = new(std::nothrow) TeamMemoryBlock(address, local 143 if (block 202 TeamMemoryBlock* block = iterator.Next(); local 224 RemoveBlock(TeamMemoryBlock* block) argument [all...] |
/haiku/src/add-ons/kernel/file_systems/exfat/ |
H A D | CachedBlock.h | 8 //! interface for the block cache 18 CachedBlock(Volume* volume, off_t block); 24 const uint8* SetTo(off_t block); 55 CachedBlock::CachedBlock(Volume* volume, off_t block) argument 61 SetTo(block); 90 CachedBlock::SetTo(off_t block) argument 93 fBlockNumber = block; 94 return fBlock = (uint8 *)block_cache_get(fVolume->BlockCache(), block);
|
/haiku/headers/os/drivers/ |
H A D | locked_pool.h | 24 a block offset where the manager can store the list pointers without 39 typedef status_t (*locked_pool_add_hook)(void *block, void *arg); 40 typedef void (*locked_pool_remove_hook)(void *block, void *arg); 45 // allocate block 47 // free block 48 void (*free)(locked_pool_cookie pool, void *block); 51 // block_size - size of one memory block 52 // alignment - set address bits here that must be zero for block addresses 53 // next_ofs - offset in block where internal next-pointer can be stored 59 // alloc_hook - hook to be called when new block i [all...] |
/haiku/src/add-ons/kernel/file_systems/udf/ |
H A D | CachedBlock.h | 38 inline status_t SetTo(off_t block); 39 inline status_t SetTo(off_t block, off_t base, size_t length); 98 CachedBlock::SetTo(off_t block) argument 100 return SetTo(block, block, 1); 105 CachedBlock::SetTo(off_t block, off_t base, size_t length) argument 108 fBlockNumber = block; 109 return block_cache_get_etc(fVolume->BlockCache(), block, base, length, 117 off_t block; local 118 if (fVolume->MapBlock(address, &block) [all...] |
/haiku/src/system/libroot/posix/stdlib/ |
H A D | exit.cpp | 37 AtExitInfoBlock* block; member in struct:AtExitInfo 60 // Handle the likely case -- the block is not fully used yet -- first. 64 info->block = this; 68 // The block was fully used, but there might be infos in the free list. 164 // return the info to the block 165 if (info->block->IsEmpty()) 166 sAtExitInfoBlocks.Add(info->block); 168 info->block->FreeInfo(info); 199 // We need to allocate an info. Get an info block from which to allocate. 200 AtExitInfoBlock* block local [all...] |
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | CachedBlock.h | 9 //! Interface for the block cache 33 inline status_t SetTo(off_t block, off_t base, size_t length); 34 inline status_t SetTo(off_t block); 37 off_t block, off_t base, size_t length, 40 off_t block, bool empty = false); 114 CachedBlock::SetTo(off_t block, off_t base, size_t length) argument 117 fBlockNumber = block; 118 return block_cache_get_etc(fVolume->BlockCache(), block, base, length, 124 CachedBlock::SetTo(off_t block) argument 126 return SetTo(block, bloc 138 SetToWritable(Transaction& transaction, off_t block, off_t base, size_t length, bool empty) argument 156 SetToWritable(Transaction& transaction, off_t block, bool empty) argument [all...] |
/haiku/src/bin/bfs_tools/lib/ |
H A D | Bitmap.h | 27 bool UsedAt(off_t block) const; 28 bool BackupUsedAt(off_t block) const; 29 bool BackupSetAt(off_t block,bool used); 34 bool TrustBlockContaining(off_t block) const;
|
/haiku/src/tests/system/kernel/file_corruption/fs/ |
H A D | SymLink.cpp | 54 // get the block 55 Block block; local 56 if (!block.GetReadable(GetVolume(), BlockIndex())) 59 const char* data = (char*)block.Data() + kSymLinkDataOffset; 83 Block block; local 84 if (!block.GetWritable(GetVolume(), BlockIndex(), transaction)) 87 char* data = (char*)block.Data() + kSymLinkDataOffset;
|
/haiku/src/bin/ |
H A D | badblocks.cpp | 22 off_t block = startBlock; local 23 off_t at = block * blockSize; 46 for (; block <= endBlock; block += group, at += len) { 49 fprintf(stderr, "checking block %lld\x1b[1A\n", block); 55 fprintf(stderr, "block %lld (offset %lld): got %d < %zd\n", 56 block, at, got, len); 60 fprintf(stderr, "block %lld: error: %s\n", block, strerro [all...] |