Searched refs:block (Results 1 - 25 of 209) sorted by relevance

123456789

/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A DBlockCache.cpp46 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.
69 for (int32 i = 0; Block *block = fBlocks.ItemAt(i); i++) {
70 if (block->_GetRefCount() > 0) {
71 INFORM(("WARNING: block not put: %p (ref count: %" B_PRId32 ")\n",
72 block, block->_GetRefCount()));
74 delete block;
105 GetBlock(Block *block) argument
131 Block *block = _FindBlock(number); local
151 PutBlock(Block *block) argument
181 Block *block = new(nothrow) Block; local
[all...]
/haiku/src/tools/fs_shell/
H A Dblock_cache.cpp22 // 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
788 cached_block* block = get_cached_block(cache, blockNumber, &allocated, local
884 write_cached_block(block_cache* cache, cached_block* block, bool deleteTransaction) argument
1060 cached_block* block = transaction->first_block; local
1117 cached_block* block = transaction->first_block; local
1184 cached_block* block = transaction->first_block; local
1264 cached_block* block = transaction->first_block; local
1315 cached_block* block = transaction->first_block; local
1382 cached_block* block = (cached_block*)*_cookie; local
1472 cached_block* block = (cached_block*)hash_lookup(cache->hash, &blockNumber); local
1495 cached_block* block; local
1543 cached_block* block; local
1576 cached_block* block = (cached_block*)hash_lookup(cache->hash, local
1601 cached_block* block = (cached_block*)hash_lookup(cache->hash, local
1637 void* block = get_writable_cached_block(cache, blockNumber, local
1699 cached_block* block = get_cached_block(cache, blockNumber, &allocated); local
1734 cached_block* block = (cached_block*)hash_lookup(cache->hash, local
[all...]
/haiku/src/add-ons/kernel/file_systems/ext2/
H A DCachedBlock.h8 //! 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 DHashRevokeManager.cpp63 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 DRevokeManager.h21 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 DHashRevokeManager.h18 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/servers/app/
H A DClientMemoryAllocator.cpp17 // 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 DClientMemoryAllocator.h20 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);
87 block* fBlock;
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DCachedBlock.h9 //! 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/add-ons/kernel/file_systems/udf/
H A DCachedBlock.h26 CachedBlock(Volume *volume, off_t block);
38 inline uint8 *SetTo(off_t block);
39 inline uint8 *SetTo(off_t block, off_t base, size_t length);
62 CachedBlock::CachedBlock(Volume *volume, off_t block) argument
68 SetTo(block);
108 CachedBlock::SetTo(off_t block) argument
110 return SetTo(block, block, 1);
115 CachedBlock::SetTo(off_t block, off_t base, size_t length) argument
118 fBlockNumber = block;
127 off_t block; local
[all...]
/haiku/src/system/kernel/cache/
H A Dblock_cache.cpp31 // block reading/writing is not at all optimized for speed, it will
73 // block in the parent transaction. It may point to current_data if the
75 // block has been changed in the current sub transaction already, to a
76 // new block containing the contents changed in the parent transaction.
77 // If this is NULL, the block has not been changed in the parent
95 // This is the current active transaction, if any, the block is
99 // block. In this case, the block has not yet written back yet, and
101 // latter if the block is already being part of another transaction.
118 static inline void operator delete(void* block);
156 operator delete(void* block) argument
361 Action(block_cache* cache, cached_block* block) argument
399 Get(block_cache* cache, cached_block* block) argument
411 Put(block_cache* cache, cached_block* block) argument
423 Read(block_cache* cache, cached_block* block) argument
435 Write(block_cache* cache, cached_block* block) argument
447 Flush(block_cache* cache, cached_block* block, bool getUnused = false) argument
498 BlockData(block_cache* cache, cached_block* block, const char* message) argument
709 cached_block* block = transaction->first_block; local
1063 cached_block* block = transaction->first_block; local
1115 Add(cached_block* block, cache_transaction* transaction) argument
1250 WriteBlock(block_cache* cache, cached_block* block) argument
1269 _WriteBlock(cached_block* block) argument
1297 _BlockDone(cached_block* block, cache_transaction* transaction) argument
1359 _UnmarkWriting(cached_block* block) argument
1468 void* block = object_cache_alloc(buffer_cache, 0); local
1480 FreeBlock(cached_block* block) argument
1501 cached_block* block = NULL; local
1555 FreeBlockParentData(cached_block* block) argument
1602 RemoveBlock(cached_block* block) argument
1613 DiscardBlock(cached_block* block) argument
1719 mark_block_busy_reading(block_cache* cache, cached_block* block) argument
1729 mark_block_unbusy_reading(block_cache* cache, cached_block* block) argument
1746 wait_for_busy_reading_block(block_cache* cache, cached_block* block) argument
1786 wait_for_busy_writing_block(block_cache* cache, cached_block* block) argument
1829 put_cached_block(block_cache* cache, cached_block* block) argument
1880 cached_block* block = cache->hash->Lookup(blockNumber); local
1913 cached_block* block = cache->hash->Lookup(blockNumber); local
1988 cached_block* block = get_cached_block(cache, blockNumber, &allocated, local
2125 dump_block(cached_block* block) argument
2141 dump_block_long(cached_block* block) argument
2236 cached_block* block = cache->hash->Lookup(blockNumber); local
2298 cached_block* block = iterator.Next(); local
2377 cached_block* block = transaction->first_block; local
2607 cached_block* block = iterator.Next(); local
2954 cached_block* block = transaction->first_block; local
3112 cached_block* block = transaction->first_block; local
3195 cached_block* block = transaction->first_block; local
3288 cached_block* block = (cached_block*)*_cookie; local
3385 cached_block* block = cache->hash->Lookup(blockNumber); local
3415 cached_block* block = cache->hash->Clear(true); local
3469 cached_block* block = iterator.Next(); local
3504 cached_block* block = cache->hash->Lookup(blockNumber); local
3538 cached_block* block = cache->hash->Lookup(blockNumber); local
3550 cached_block* block = cache->hash->Lookup(blockNumber); local
3586 void* block = get_writable_cached_block(cache, blockNumber, local
3645 cached_block* block = get_cached_block(cache, blockNumber, &allocated); local
3682 cached_block* block = cache->hash->Lookup(blockNumber); local
[all...]
/haiku/src/add-ons/kernel/partitioning_systems/gpt/
H A Defi_gpt.h32 // 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/add-ons/kernel/file_systems/bfs/
H A DCachedBlock.h9 //! Interface for the block cache
27 CachedBlock(Volume* volume, off_t block);
35 inline const uint8* SetTo(off_t block, off_t base, size_t length);
36 inline const uint8* SetTo(off_t block);
39 off_t block, off_t base, size_t length,
42 off_t block, bool empty = false);
80 CachedBlock::CachedBlock(Volume* volume, off_t block) argument
86 SetTo(block);
137 CachedBlock::SetTo(off_t block, off_t base, size_t length) argument
140 fBlockNumber = block;
147 SetTo(off_t block) argument
161 SetToWritable(Transaction& transaction, off_t block, off_t base, size_t length, bool empty) argument
180 SetToWritable(Transaction& transaction, off_t block, bool empty) argument
[all...]
/haiku/src/kits/support/
H A DBlockCache.cpp43 // 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 DCfaRule.h31 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 DTeamMemoryBlockManager.cpp39 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 DCachedBlock.h8 //! 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 Dlocked_pool.h24 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/system/libroot/posix/stdlib/
H A Dexit.cpp37 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/bin/bfs_tools/lib/
H A DBitmap.h27 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;
H A DBitmap.cpp6 //! handles the BFS block bitmap
66 // set root block, block bitmap, log as used
68 for (off_t block = 0; block < end; block++) {
69 if (!BackupSetAt(block, true))
116 Bitmap::UsedAt(off_t block) const
118 uint32 index = block / 32; // 32bit resolution, (beginning with block
138 BackupSetAt(off_t block, bool used) argument
[all...]
/haiku/src/apps/haikudepot/tar/
H A DTarArchiveHeader.cpp97 TarArchiveHeader::_CalculateChecksum(const unsigned char* block) argument
105 result += block[i];
112 TarArchiveHeader::CreateFromBlock(const unsigned char* block) argument
114 uint32 actualChecksum = _CalculateChecksum(block);
115 uint32 expectedChecksum = _ReadNumeric(&block[OFFSET_CHECKSUM],
124 _ReadString(&block[OFFSET_FILENAME], LENGTH_FILENAME),
125 _ReadNumeric(&block[OFFSET_LENGTH], LENGTH_LENGTH),
126 _ReadFileType(block[OFFSET_FILETYPE]));
/haiku/src/tests/system/kernel/file_corruption/fs/
H A DSymLink.cpp54 // 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 Dbadblocks.cpp22 off_t block = startBlock; local
23 off_t at = block * blockSize;
46 for (; block <= endBlock; block += group, at += len) {
49 fprintf(stderr, "checking block %Ld\x1b[1A\n", block);
55 fprintf(stderr, "block %Ld (offset %Ld): got %d < %zd\n",
56 block, at, got, len);
60 fprintf(stderr, "block %Ld: error: %s\n", block, strerro
[all...]
/haiku/headers/os/interface/
H A DFont.h111 inline bool Includes(const unicode_block& block) const;
112 inline unicode_block operator&(const unicode_block& block) const;
113 inline unicode_block operator|(const unicode_block& block) const;
114 inline unicode_block& operator=(const unicode_block& block);
115 inline bool operator==(const unicode_block& block) const;
116 inline bool operator!=(const unicode_block& block) const;
126 const unicode_block& block; member in struct:unicode_block_range
350 unicode_block::Includes(const unicode_block& block) const
352 return (fData[0] & block.fData[0]) == block
380 operator =(const unicode_block& block) argument
[all...]

Completed in 192 milliseconds

123456789