Searched refs:gBlocks (Results 1 - 3 of 3) sorted by relevance

/haiku/src/tests/system/kernel/cache/
H A Dblock_cache_test.cpp27 if ((block)->type ## _data != NULL && gBlocks[(number)]. type == 0) \
29 if ((block)->type ## _data != NULL && gBlocks[(number)]. type != 0 \
30 && *(int32*)(block)->type ## _data != gBlocks[(number)]. type) { \
33 gBlocks[(number)]. type); \
59 test_block gBlocks[MAX_BLOCKS]; variable
128 gBlocks[index].written = true;
129 if (!gBlocks[index].write)
143 if (!gBlocks[index].read)
153 memset(gBlocks, 0, sizeof(test_block) * MAX_BLOCKS);
156 gBlocks[
[all...]
/haiku/src/tests/add-ons/kernel/file_systems/bfs/btree/
H A Dcache.cpp33 BList gBlocks; variable
46 for (int32 i = 0; i < gBlocks.CountItems(); i++) {
47 void* buffer = gBlocks.ItemAt(i);
62 if (num + numBlocks > gBlocks.CountItems()) {
68 void* buffer = gBlocks.ItemAt(num + i);
82 for (uint32 i = gBlocks.CountItems(); i <= num; i++) {
87 gBlocks.AddItem(buffer);
100 if (num >= gBlocks.CountItems())
103 return gBlocks.ItemAt(num);
H A Dtest.cpp52 extern BList gBlocks;
68 bplustree_header* header = (bplustree_header*)gBlocks.ItemAt(0);
71 for (int32 i = 1; i < gBlocks.CountItems(); i++) {
72 bplustree_node* node = (bplustree_node*)gBlocks.ItemAt(i);

Completed in 79 milliseconds