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
|
/*
* Copyright 2011, Blender Foundation.
*
* 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, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef __UTIL_CACHE_H__
#define __UTIL_CACHE_H__
/* Disk Cache based on Hashing
*
* To be used to cache expensive computations. The hash key is created from an
* arbitrary number of bytes, by hashing the bytes using MD5, which then gives
* the file name containing the data. This data then is read from the file
* again into the appropriate data structures.
*
* This way we do not need to accurately track changes, compare dates and
* invalidate cache entries, at the cost of exta computation. If everything
* is stored in a global cache, computations can perhaps even be shared between
* different scenes where it may be hard to detect duplicate work.
*/
#include "util_string.h"
#include "util_vector.h"
CCL_NAMESPACE_BEGIN
class CacheBuffer {
public:
const void *data;
size_t size;
CacheBuffer(const void *data_, size_t size_)
{ data = data_; size = size_; }
};
class CacheData {
public:
vector<CacheBuffer> buffers;
string name;
FILE *f;
CacheData(const string& name = "");
~CacheData();
template<typename T> void add(const vector<T>& data)
{
if(data.size()) {
CacheBuffer buffer(&data[0], data.size()*sizeof(T));
buffers.push_back(buffer);
}
}
template<typename T> void add(const array<T>& data)
{
if(data.size()) {
CacheBuffer buffer(&data[0], data.size()*sizeof(T));
buffers.push_back(buffer);
}
}
void add(void *data, size_t size)
{
if(size) {
CacheBuffer buffer(data, size);
buffers.push_back(buffer);
}
}
void add(int& data)
{
CacheBuffer buffer(&data, sizeof(int));
buffers.push_back(buffer);
}
void add(size_t& data)
{
CacheBuffer buffer(&data, sizeof(size_t));
buffers.push_back(buffer);
}
template<typename T> void read(array<T>& data)
{
size_t size;
if(!fread(&size, sizeof(size), 1, f)) {
fprintf(stderr, "Failed to read vector size from cache.\n");
return;
}
if(!size)
return;
data.resize(size/sizeof(T));
if(!fread(&data[0], size, 1, f)) {
fprintf(stderr, "Failed to read vector data from cache (%ld).\n", size);
return;
}
}
void read(int& data)
{
if(!fread(&data, sizeof(data), 1, f))
fprintf(stderr, "Failed to read int from cache.\n");
}
void read(size_t& data)
{
if(!fread(&data, sizeof(data), 1, f))
fprintf(stderr, "Failed to read size_t from cache.\n");
}
};
class Cache {
public:
static Cache global;
void insert(const CacheData& key, const CacheData& value);
bool lookup(const CacheData& key, CacheData& value);
protected:
string data_filename(const CacheData& key);
};
CCL_NAMESPACE_END
#endif /* __UTIL_CACHE_H__ */
|
