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
|
/*
Copyright (C) 2009 Red Hat, Inc.
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of
the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#if defined(CLIENT_CURSOR_CACHE)
#define CACHE_NAME cursor_cache
#define CACHE_HASH_KEY CURSOR_CACHE_HASH_KEY
#define CACHE_HASH_SIZE CURSOR_CACHE_HASH_SIZE
#define CACHE_INVAL_TYPE RED_CURSOR_INVAL_ONE
#define FUNC_NAME(name) red_cursor_cache_##name
#define VAR_NAME(name) cursor_cache_##name
#define CHANNEL CursorChannel
#elif defined(CLIENT_PALETTE_CACHE)
#define CACHE_NAME palette_cache
#define CACHE_HASH_KEY PALETTE_CACHE_HASH_KEY
#define CACHE_HASH_SIZE PALETTE_CACHE_HASH_SIZE
#define CACHE_INVAL_TYPE RED_DISPLAY_INVAL_PALETTE
#define FUNC_NAME(name) red_palette_cache_##name
#define VAR_NAME(name) palette_cache_##name
#define CHANNEL DisplayChannel
#else
#error "no cache type."
#endif
static CacheItem *FUNC_NAME(find)(CHANNEL *channel, uint64_t id)
{
CacheItem *item = channel->CACHE_NAME[CACHE_HASH_KEY(id)];
while (item) {
if (item->id == id) {
ring_remove(&item->u.cache_data.lru_link);
ring_add(&channel->VAR_NAME(lru), &item->u.cache_data.lru_link);
break;
}
item = item->u.cache_data.next;
}
return item;
}
static void FUNC_NAME(remove)(CHANNEL *channel, CacheItem *item)
{
CacheItem **now;
ASSERT(item);
now = &channel->CACHE_NAME[CACHE_HASH_KEY(item->id)];
for (;;) {
ASSERT(*now);
if (*now == item) {
*now = item->u.cache_data.next;
break;
}
now = &(*now)->u.cache_data.next;
}
ring_remove(&item->u.cache_data.lru_link);
channel->VAR_NAME(items)--;
channel->VAR_NAME(available) += item->size;
red_pipe_item_init(&item->u.pipe_data, PIPE_ITEM_TYPE_INVAL_ONE);
red_pipe_add_tail(&channel->base, &item->u.pipe_data); // for now
}
static int FUNC_NAME(add)(CHANNEL *channel, uint64_t id, size_t size)
{
CacheItem *item;
int key;
item = malloc(sizeof(*item));
if (!item) {
return FALSE;
}
channel->VAR_NAME(available) -= size;
while (channel->VAR_NAME(available) < 0) {
CacheItem *tail = (CacheItem *)ring_get_tail(&channel->VAR_NAME(lru));
if (!tail) {
channel->VAR_NAME(available) += size;
free(item);
return FALSE;
}
FUNC_NAME(remove)(channel, tail);
}
++channel->VAR_NAME(items);
item->u.cache_data.next = channel->CACHE_NAME[(key = CACHE_HASH_KEY(id))];
channel->CACHE_NAME[key] = item;
ring_item_init(&item->u.cache_data.lru_link);
ring_add(&channel->VAR_NAME(lru), &item->u.cache_data.lru_link);
item->id = id;
item->size = size;
item->inval_type = CACHE_INVAL_TYPE;
return TRUE;
}
static void FUNC_NAME(reset)(CHANNEL *channel, long size)
{
int i;
for (i = 0; i < CACHE_HASH_SIZE; i++) {
while (channel->CACHE_NAME[i]) {
CacheItem *item = channel->CACHE_NAME[i];
channel->CACHE_NAME[i] = item->u.cache_data.next;
free(item);
}
}
ring_init(&channel->VAR_NAME(lru));
channel->VAR_NAME(available) = size;
channel->VAR_NAME(items) = 0;
}
#undef CACHE_NAME
#undef CACHE_HASH_KEY
#undef CACHE_HASH_SIZE
#undef CACHE_INVAL_TYPE
#undef CACHE_MAX_CLIENT_SIZE
#undef FUNC_NAME
#undef VAR_NAME
#undef CHANNEL
|
