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

Improved output. Particularly when the allocation is filled, it is nice

Browse Source 
to know whether there's still progress.


git-svn-id: file:///srv/svn/repos/haiku/haiku/trunk@27124 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Ingo Weinhold
2008-08-22 01:16:48 +00:00
parent 5540989032
commit d74af3b17f
1 changed files with 10 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/tests/system/kernel/swap/swap_test_heap.cpp
+10 -2
View File
@@ -32,6 +32,7 @@ main(int argc, const char* const* argv)
allocationSize *= 1024 * 1024;
size_t elementCount = allocationSize / 4;
size_t pageCount = elementCount / PAGE_ELEMENT_COUNT;
// allocate memory
uint32_t* allocation = (uint32_t*)malloc(allocationSize);
@@ -44,10 +45,17 @@ main(int argc, const char* const* argv)
(unsigned long)allocationSize / 1024 / 1024, allocation);
// fill the pages
for (size_t i = 0; i < elementCount; i++)
for (size_t i = 0; i < elementCount; i++) {
allocation[i] = i;
if ((i + 1) % (PAGE_ELEMENT_COUNT * 32) == 0) {
printf("\rfilled %9lu/%9lu pages",
(unsigned long)(i + 1) / PAGE_ELEMENT_COUNT,
(unsigned long)pageCount);
fflush(stdout);
}
}
printf("Done filled the allocation. Starting test iterations...\n");
printf("\rDone filling the allocation. Starting test iterations...\n");
for (int testIteration = 0; testIteration < 5; testIteration++) {
sleep(1);