]>
git.proxmox.com Git - ceph.git/blob - ceph/src/test/common/test_lru.cc
1 // -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
2 // vim: ts=8 sw=2 smarttab
4 * Ceph - scalable distributed file system
6 * Copyright (C) 2014 Cloudwatt <libre.licensing@cloudwatt.com>
8 * Author: Sahid Orentino Ferdjaoui <sahid.ferdjaoui@cloudwatt.com>
10 * This library is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU Lesser General Public
12 * License as published by the Free Software Foundation; either
13 * version 2.1 of the License, or (at your option) any later version.
18 #include <gtest/gtest.h>
20 #include "include/lru.h"
23 class Item
: public LRUObject
{
27 explicit Item(int i
) : id(i
) {}
28 void set(int i
) {id
= i
;}
32 TEST(lru
, InsertTop
) {
34 static const int n
= 100;
37 lru
.lru_set_midpoint(.5); // 50% of elements.
38 for (int i
=0; i
<n
; i
++) {
40 lru
.lru_insert_top(&items
[i
]);
42 ASSERT_EQ(50U, lru
.lru_get_top());
43 ASSERT_EQ(50U, lru
.lru_get_bot());
44 ASSERT_EQ(100U, lru
.lru_get_size());
46 ASSERT_EQ(0, (static_cast<Item
*>(lru
.lru_expire()))->id
);
49 TEST(lru
, InsertMid
) {
51 static const int n
= 102;
54 lru
.lru_set_midpoint(.7); // 70% of elements.
55 for (int i
=0; i
<n
; i
++) {
57 lru
.lru_insert_mid(&items
[i
]);
59 ASSERT_EQ(71U, lru
.lru_get_top());
60 ASSERT_EQ(31U, lru
.lru_get_bot());
61 ASSERT_EQ(102U, lru
.lru_get_size());
63 ASSERT_EQ(0, (static_cast<Item
*>(lru
.lru_expire()))->id
);
66 TEST(lru
, InsertBot
) {
68 static const int n
= 100;
71 lru
.lru_set_midpoint(.7); // 70% of elements.
72 for (int i
=0; i
<n
; i
++) {
74 lru
.lru_insert_bot(&items
[i
]);
76 ASSERT_EQ(70U, lru
.lru_get_top());
77 ASSERT_EQ(30U, lru
.lru_get_bot());
78 ASSERT_EQ(100U, lru
.lru_get_size());
80 ASSERT_EQ(99, (static_cast<Item
*>(lru
.lru_expire()))->id
);
85 static const int n
= 100;
88 lru
.lru_set_midpoint(.6); // 60% of elements.
89 for (int i
=0; i
<n
; i
++) {
91 lru
.lru_insert_top(&items
[i
]);
95 ASSERT_EQ(48U, lru
.lru_get_top()); /* 60% of unpinned */
96 ASSERT_EQ(52U, lru
.lru_get_bot());
97 ASSERT_EQ(100U, lru
.lru_get_size());
99 ASSERT_EQ(1, (static_cast<Item
*>(lru
.lru_expire()))->id
);
100 ASSERT_EQ(1U, lru
.lru_get_pintail());
101 ASSERT_EQ(47U, lru
.lru_get_top()); /* 60% of unpinned */
102 ASSERT_EQ(51U, lru
.lru_get_bot());
103 ASSERT_EQ(99U, lru
.lru_get_size());
104 ASSERT_EQ(2, (static_cast<Item
*>(lru
.lru_expire()))->id
);
105 ASSERT_EQ(1U, lru
.lru_get_pintail());
106 ASSERT_EQ(46U, lru
.lru_get_top()); /* 60% of unpinned */
107 ASSERT_EQ(51U, lru
.lru_get_bot());
108 ASSERT_EQ(98U, lru
.lru_get_size());
109 ASSERT_EQ(3, (static_cast<Item
*>(lru
.lru_expire()))->id
);
110 ASSERT_EQ(4, (static_cast<Item
*>(lru
.lru_expire()))->id
);
111 ASSERT_EQ(6, (static_cast<Item
*>(lru
.lru_expire()))->id
);
112 ASSERT_EQ(2U, lru
.lru_get_pintail());
113 ASSERT_EQ(45U, lru
.lru_get_top()); /* 60% of unpinned */
114 ASSERT_EQ(48U, lru
.lru_get_bot());
115 ASSERT_EQ(95U, lru
.lru_get_size());
123 // test before ob1 are in a LRU
125 ASSERT_FALSE(ob1
.lru_is_expireable());
128 ASSERT_TRUE(ob1
.lru_is_expireable());
130 // test when ob1 are in a LRU
131 lru
.lru_insert_top(&ob0
);
132 lru
.lru_insert_top(&ob1
);
135 ob1
.lru_pin(); // Verify that, one incr.
136 ASSERT_EQ(1U, lru
.lru_get_num_pinned());
137 ASSERT_FALSE(ob1
.lru_is_expireable());
140 ob1
.lru_unpin(); // Verify that, one decr.
141 ASSERT_EQ(0U, lru
.lru_get_num_pinned());
142 ASSERT_TRUE(ob1
.lru_is_expireable());
144 ASSERT_EQ(0, (static_cast<Item
*>(lru
.lru_expire()))->id
);
146 ASSERT_EQ(1, (static_cast<Item
*>(lru
.lru_expire()))->id
);
152 * compile-command: "cd ../.. ; make -j4 &&
153 * make unittest_lru &&
154 * valgrind --tool=memcheck --leak-check=full \