Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
PojavLauncherTeam
GitHub Repository: PojavLauncherTeam/mesa
Path: blob/21.2-virgl/src/freedreno/ir3/ir3_disk_cache.c
4565 views
1
/*
2
* Copyright © 2020 Google, Inc.
3
*
4
* Permission is hereby granted, free of charge, to any person obtaining a
5
* copy of this software and associated documentation files (the "Software"),
6
* to deal in the Software without restriction, including without limitation
7
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
8
* and/or sell copies of the Software, and to permit persons to whom the
9
* Software is furnished to do so, subject to the following conditions:
10
*
11
* The above copyright notice and this permission notice (including the next
12
* paragraph) shall be included in all copies or substantial portions of the
13
* Software.
14
*
15
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
18
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21
* SOFTWARE.
22
*/
23
24
#include "nir_serialize.h"
25
26
#include "ir3_compiler.h"
27
#include "ir3_nir.h"
28
29
#define debug 0
30
31
/*
32
* Shader disk-cache implementation.
33
*
34
* Note that at least in the EGL_ANDROID_blob_cache, we should never
35
* rely on inter-dependencies between different cache entries:
36
*
37
* No guarantees are made as to whether a given key/value pair is present in
38
* the cache after the set call. If a different value has been associated
39
* with the given key in the past then it is undefined which value, if any,
40
* is associated with the key after the set call. Note that while there are
41
* no guarantees, the cache implementation should attempt to cache the most
42
* recently set value for a given key.
43
*
44
* for this reason, because binning pass variants share const_state with
45
* their draw-pass counterpart, both variants are serialized together.
46
*/
47
48
void
49
ir3_disk_cache_init(struct ir3_compiler *compiler)
50
{
51
if (ir3_shader_debug & IR3_DBG_NOCACHE)
52
return;
53
54
/* array length = print length + nul char + 1 extra to verify it's unused */
55
char renderer[7];
56
ASSERTED int len =
57
snprintf(renderer, sizeof(renderer), "FD%03d", compiler->gpu_id);
58
assert(len == sizeof(renderer) - 2);
59
60
const struct build_id_note *note =
61
build_id_find_nhdr_for_addr(ir3_disk_cache_init);
62
assert(note && build_id_length(note) == 20); /* sha1 */
63
64
const uint8_t *id_sha1 = build_id_data(note);
65
assert(id_sha1);
66
67
char timestamp[41];
68
_mesa_sha1_format(timestamp, id_sha1);
69
70
uint64_t driver_flags = ir3_shader_debug;
71
if (compiler->robust_ubo_access)
72
driver_flags |= IR3_DBG_ROBUST_UBO_ACCESS;
73
compiler->disk_cache = disk_cache_create(renderer, timestamp, driver_flags);
74
}
75
76
void
77
ir3_disk_cache_init_shader_key(struct ir3_compiler *compiler,
78
struct ir3_shader *shader)
79
{
80
if (!compiler->disk_cache)
81
return;
82
83
struct mesa_sha1 ctx;
84
85
_mesa_sha1_init(&ctx);
86
87
/* Serialize the NIR to a binary blob that we can hash for the disk
88
* cache. Drop unnecessary information (like variable names)
89
* so the serialized NIR is smaller, and also to let us detect more
90
* isomorphic shaders when hashing, increasing cache hits.
91
*/
92
struct blob blob;
93
blob_init(&blob);
94
nir_serialize(&blob, shader->nir, true);
95
_mesa_sha1_update(&ctx, blob.data, blob.size);
96
blob_finish(&blob);
97
98
/* Note that on some gens stream-out is lowered in ir3 to stg. For later
99
* gens we maybe don't need to include stream-out in the cache key.
100
*/
101
_mesa_sha1_update(&ctx, &shader->stream_output,
102
sizeof(shader->stream_output));
103
104
_mesa_sha1_final(&ctx, shader->cache_key);
105
}
106
107
static void
108
compute_variant_key(struct ir3_compiler *compiler, struct ir3_shader_variant *v,
109
cache_key cache_key)
110
{
111
struct blob blob;
112
blob_init(&blob);
113
114
blob_write_bytes(&blob, &v->shader->cache_key, sizeof(v->shader->cache_key));
115
blob_write_bytes(&blob, &v->key, sizeof(v->key));
116
blob_write_uint8(&blob, v->binning_pass);
117
118
disk_cache_compute_key(compiler->disk_cache, blob.data, blob.size,
119
cache_key);
120
121
blob_finish(&blob);
122
}
123
124
static void
125
retrieve_variant(struct blob_reader *blob, struct ir3_shader_variant *v)
126
{
127
blob_copy_bytes(blob, VARIANT_CACHE_PTR(v), VARIANT_CACHE_SIZE);
128
129
/*
130
* pointers need special handling:
131
*/
132
133
v->bin = rzalloc_size(v, v->info.size);
134
blob_copy_bytes(blob, v->bin, v->info.size);
135
136
if (!v->binning_pass) {
137
blob_copy_bytes(blob, v->const_state, sizeof(*v->const_state));
138
unsigned immeds_sz = v->const_state->immediates_size *
139
sizeof(v->const_state->immediates[0]);
140
v->const_state->immediates = ralloc_size(v->const_state, immeds_sz);
141
blob_copy_bytes(blob, v->const_state->immediates, immeds_sz);
142
}
143
}
144
145
static void
146
store_variant(struct blob *blob, struct ir3_shader_variant *v)
147
{
148
blob_write_bytes(blob, VARIANT_CACHE_PTR(v), VARIANT_CACHE_SIZE);
149
150
/*
151
* pointers need special handling:
152
*/
153
154
blob_write_bytes(blob, v->bin, v->info.size);
155
156
/* No saving constant_data, it's already baked into bin at this point. */
157
158
if (!v->binning_pass) {
159
blob_write_bytes(blob, v->const_state, sizeof(*v->const_state));
160
unsigned immeds_sz = v->const_state->immediates_size *
161
sizeof(v->const_state->immediates[0]);
162
blob_write_bytes(blob, v->const_state->immediates, immeds_sz);
163
}
164
}
165
166
bool
167
ir3_disk_cache_retrieve(struct ir3_compiler *compiler,
168
struct ir3_shader_variant *v)
169
{
170
if (!compiler->disk_cache)
171
return false;
172
173
cache_key cache_key;
174
175
compute_variant_key(compiler, v, cache_key);
176
177
if (debug) {
178
char sha1[41];
179
_mesa_sha1_format(sha1, cache_key);
180
fprintf(stderr, "[mesa disk cache] retrieving variant %s: ", sha1);
181
}
182
183
size_t size;
184
void *buffer = disk_cache_get(compiler->disk_cache, cache_key, &size);
185
186
if (debug)
187
fprintf(stderr, "%s\n", buffer ? "found" : "missing");
188
189
if (!buffer)
190
return false;
191
192
struct blob_reader blob;
193
blob_reader_init(&blob, buffer, size);
194
195
retrieve_variant(&blob, v);
196
197
if (v->binning)
198
retrieve_variant(&blob, v->binning);
199
200
free(buffer);
201
202
return true;
203
}
204
205
void
206
ir3_disk_cache_store(struct ir3_compiler *compiler,
207
struct ir3_shader_variant *v)
208
{
209
if (!compiler->disk_cache)
210
return;
211
212
cache_key cache_key;
213
214
compute_variant_key(compiler, v, cache_key);
215
216
if (debug) {
217
char sha1[41];
218
_mesa_sha1_format(sha1, cache_key);
219
fprintf(stderr, "[mesa disk cache] storing variant %s\n", sha1);
220
}
221
222
struct blob blob;
223
blob_init(&blob);
224
225
store_variant(&blob, v);
226
227
if (v->binning)
228
store_variant(&blob, v->binning);
229
230
disk_cache_put(compiler->disk_cache, cache_key, blob.data, blob.size, NULL);
231
blob_finish(&blob);
232
}
233
234