1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
|
/*
Copyright (c) 2005-2022 Intel Corporation
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#define TBB_PREVIEW_CONCURRENT_LRU_CACHE 1
#if __INTEL_COMPILER && _MSC_VER
#pragma warning(disable : 2586) // decorated name length exceeded, name was truncated
#endif
#include "common/test.h"
#include "common/utils.h"
#include <tbb/concurrent_lru_cache.h>
#include <common/concurrent_lru_cache_common.h>
//! \file test_concurrent_lru_cache.cpp
//! \brief Test for [preview] functionality
//-----------------------------------------------------------------------------
// Concurrent LRU Cache Tests: Cache Test Cases
//-----------------------------------------------------------------------------
//! \brief \ref error_guessing
TEST_CASE("basic test for return value") {
using preset = concurrent_lru_cache_presets::preset_default<int, int>;
auto dummy_f = [](int /*key*/) -> int { return 0xDEADBEEF; };
std::size_t number_of_lru_history_items = 8;
preset preset_object{dummy_f, number_of_lru_history_items};
preset::cache_type& cache = preset_object.cache;
int dummy_key = 1;
REQUIRE_MESSAGE(
dummy_f(dummy_key) == cache[dummy_key].value(),
"cache operator() must return only values obtained from value function");
}
//! \brief \ref error_guessing
TEST_CASE("basic test for unused objects") {
using preset = concurrent_lru_cache_presets::preset_instance_count;
preset preset_object{};
for (std::size_t i = 0; i < preset_object.number_of_lru_history_items; ++i)
preset_object.cache[i];
REQUIRE_MESSAGE(
preset_object.source.instances_count() > 1,
"cache should store some unused objects");
}
//! \brief \ref error_guessing
TEST_CASE("basic test for unused object limit") {
using preset = concurrent_lru_cache_presets::preset_instance_count;
preset preset_object{};
for (std::size_t i = 0; i < preset_object.number_of_lru_history_items + 1; ++i)
preset_object.cache[i];
REQUIRE_MESSAGE(
preset_object.source.instances_count() == preset_object.number_of_lru_history_items + 1,
"cache should respect number of stored unused objects to number passed in constructor");
}
//! \brief \ref error_guessing
TEST_CASE("basic test for eviction order") {
using preset = concurrent_lru_cache_presets::preset_map_instance_count;
preset preset_object{};
REQUIRE_MESSAGE(
preset_object.number_of_lru_history_items > 2,
"incorrect test setup");
preset_object.fill_up_cache(0, preset_object.number_of_lru_history_items);
// heat up first element
preset_object.cache[0];
// cause eviction;
preset_object.cache[preset_object.number_of_lru_history_items];
bool is_correct = preset_object.is_evicted(1) && !preset_object.is_evicted(0);
REQUIRE_MESSAGE(is_correct, "cache should evict items in lru order");
}
//! \brief \ref error_guessing
TEST_CASE("basic test for eviction of only unused items") {
using preset = concurrent_lru_cache_presets::preset_map_instance_count;
preset preset_object{};
preset::handle_type h = preset_object.cache[0];
//cause eviction
preset_object.fill_up_cache(1, preset_object.number_of_lru_history_items+2);
bool is_correct = preset_object.is_evicted(1) && !preset_object.is_evicted(0);
REQUIRE_MESSAGE(is_correct, "cache should not evict items in use");
}
//! \brief \ref error_guessing
TEST_CASE("basic test for eviction of only unused items 2") {
using preset = concurrent_lru_cache_presets::preset_map_instance_count;
preset preset_object{};
preset::handle_type h = preset_object.cache[0];
{
preset::handle_type h1 = preset_object.cache[0];
}
//cause eviction
preset_object.fill_up_cache(1,preset_object.number_of_lru_history_items+2);
bool is_correct = preset_object.is_evicted(1) && !preset_object.is_evicted(0);
REQUIRE_MESSAGE(is_correct, "cache should not evict items in use");
}
//! \brief \ref error_guessing
TEST_CASE("basic test for handling case when number_of_lru_history_items is zero") {
auto foo = [] (int) {
return utils::LifeTrackableObject{};
};
using cache_type = tbb::concurrent_lru_cache<int, utils::LifeTrackableObject, decltype(foo)>;
cache_type cache{foo, 0};
for(int i = 0; i < 10; ++i) {
// Check that no history is stored when my_history_list_capacity is 0.
// In this case, when trying to fill the cache, the items will be deleted if reference was not taken.
const utils::LifeTrackableObject* obj_addr = &cache[1].value();
REQUIRE_MESSAGE(utils::LifeTrackableObject::is_alive(obj_addr) == false, "when number_of_lru_history_items is zero, element must be erased after use");
}
cache_type::handle h = cache[1];
const utils::LifeTrackableObject* obj_addr = &h.value();
auto& object_set = utils::LifeTrackableObject::set();
for(int i = 0; i < 10; ++i) {
// Verify that item will still be alive if there is a handle holding that item.
cache[1];
REQUIRE_MESSAGE(utils::LifeTrackableObject::is_alive(obj_addr), "the object with the key=1 was destroyed but should not");
REQUIRE_MESSAGE(object_set.size() == 1, "no other values should be added");
}
}
|
