i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Forget to remove debug output.

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@15563 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Axel Dörfler
2005-12-16 14:33:10 +00:00
parent 37bd67edb8
commit 005108a262
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/system/kernel/cache/block_cache.cpp
Vendored
+4 -4
View File
@@ -316,7 +316,7 @@ block_cache::NewBlock(off_t blockNumber)
void void
block_cache::RemoveUnusedBlocks(int32 maxAccessed, int32 count) block_cache::RemoveUnusedBlocks(int32 maxAccessed, int32 count)
{ {
dprintf("block_cache: remove up to %ld unused blocks\n", count); TRACE(("block_cache: remove up to %ld unused blocks\n", count));
cached_block *next = NULL; cached_block *next = NULL;
for (cached_block *block = unused_blocks.First(); block != NULL; block = next) { for (cached_block *block = unused_blocks.First(); block != NULL; block = next) {
@@ -327,8 +327,8 @@ block_cache::RemoveUnusedBlocks(int32 maxAccessed, int32 count)
if (maxAccessed < block->accessed) if (maxAccessed < block->accessed)
continue; continue;
dprintf(" remove block %Ld, accessed %ld times\n", TRACE((" remove block %Ld, accessed %ld times\n",
block->block_number, block->accessed); block->block_number, block->accessed));
// this can only happen if no transactions are used // this can only happen if no transactions are used
if (block->is_dirty) if (block->is_dirty)
@@ -352,7 +352,7 @@ block_cache::LowMemoryHandler(void *data, int32 level)
block_cache *cache = (block_cache *)data; block_cache *cache = (block_cache *)data;
BenaphoreLocker locker(&cache->lock); BenaphoreLocker locker(&cache->lock);
dprintf("block_cache: low memory handler called with level %ld\n", level); TRACE(("block_cache: low memory handler called with level %ld\n", level));
// free some blocks according to the low memory state // free some blocks according to the low memory state
// (if there is enough memory left, we don't free any) // (if there is enough memory left, we don't free any)