2 * Copyright © 2015 Intel Corporation
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:
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
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
20 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
24 #include "util/mesa-sha1.h"
25 #include "util/debug.h"
26 #include "util/disk_cache.h"
27 #include "util/u_atomic.h"
28 #include "radv_debug.h"
29 #include "radv_private.h"
30 #include "radv_shader.h"
32 #include "ac_nir_to_llvm.h"
34 struct cache_entry_variant_info
{
35 struct ac_shader_variant_info variant_info
;
36 struct ac_shader_config config
;
37 uint32_t rsrc1
, rsrc2
;
42 unsigned char sha1
[20];
45 uint32_t code_sizes
[MESA_SHADER_STAGES
];
46 struct radv_shader_variant
*variants
[MESA_SHADER_STAGES
];
51 radv_pipeline_cache_init(struct radv_pipeline_cache
*cache
,
52 struct radv_device
*device
)
54 cache
->device
= device
;
55 pthread_mutex_init(&cache
->mutex
, NULL
);
57 cache
->modified
= false;
58 cache
->kernel_count
= 0;
59 cache
->total_size
= 0;
60 cache
->table_size
= 1024;
61 const size_t byte_size
= cache
->table_size
* sizeof(cache
->hash_table
[0]);
62 cache
->hash_table
= malloc(byte_size
);
64 /* We don't consider allocation failure fatal, we just start with a 0-sized
65 * cache. Disable caching when we want to keep shader debug info, since
66 * we don't get the debug info on cached shaders. */
67 if (cache
->hash_table
== NULL
||
68 (device
->instance
->debug_flags
& RADV_DEBUG_NO_CACHE
) ||
69 device
->keep_shader_info
)
70 cache
->table_size
= 0;
72 memset(cache
->hash_table
, 0, byte_size
);
76 radv_pipeline_cache_finish(struct radv_pipeline_cache
*cache
)
78 for (unsigned i
= 0; i
< cache
->table_size
; ++i
)
79 if (cache
->hash_table
[i
]) {
80 for(int j
= 0; j
< MESA_SHADER_STAGES
; ++j
) {
81 if (cache
->hash_table
[i
]->variants
[j
])
82 radv_shader_variant_destroy(cache
->device
,
83 cache
->hash_table
[i
]->variants
[j
]);
85 vk_free(&cache
->alloc
, cache
->hash_table
[i
]);
87 pthread_mutex_destroy(&cache
->mutex
);
88 free(cache
->hash_table
);
92 entry_size(struct cache_entry
*entry
)
94 size_t ret
= sizeof(*entry
);
95 for (int i
= 0; i
< MESA_SHADER_STAGES
; ++i
)
96 if (entry
->code_sizes
[i
])
97 ret
+= sizeof(struct cache_entry_variant_info
) + entry
->code_sizes
[i
];
102 radv_hash_shaders(unsigned char *hash
,
103 const VkPipelineShaderStageCreateInfo
**stages
,
104 const struct radv_pipeline_layout
*layout
,
105 const struct radv_pipeline_key
*key
,
108 struct mesa_sha1 ctx
;
110 _mesa_sha1_init(&ctx
);
112 _mesa_sha1_update(&ctx
, key
, sizeof(*key
));
114 _mesa_sha1_update(&ctx
, layout
->sha1
, sizeof(layout
->sha1
));
116 for (int i
= 0; i
< MESA_SHADER_STAGES
; ++i
) {
118 RADV_FROM_HANDLE(radv_shader_module
, module
, stages
[i
]->module
);
119 const VkSpecializationInfo
*spec_info
= stages
[i
]->pSpecializationInfo
;
121 _mesa_sha1_update(&ctx
, module
->sha1
, sizeof(module
->sha1
));
122 _mesa_sha1_update(&ctx
, stages
[i
]->pName
, strlen(stages
[i
]->pName
));
124 _mesa_sha1_update(&ctx
, spec_info
->pMapEntries
,
125 spec_info
->mapEntryCount
* sizeof spec_info
->pMapEntries
[0]);
126 _mesa_sha1_update(&ctx
, spec_info
->pData
, spec_info
->dataSize
);
130 _mesa_sha1_update(&ctx
, &flags
, 4);
131 _mesa_sha1_final(&ctx
, hash
);
135 static struct cache_entry
*
136 radv_pipeline_cache_search_unlocked(struct radv_pipeline_cache
*cache
,
137 const unsigned char *sha1
)
139 const uint32_t mask
= cache
->table_size
- 1;
140 const uint32_t start
= (*(uint32_t *) sha1
);
142 if (cache
->table_size
== 0)
145 for (uint32_t i
= 0; i
< cache
->table_size
; i
++) {
146 const uint32_t index
= (start
+ i
) & mask
;
147 struct cache_entry
*entry
= cache
->hash_table
[index
];
152 if (memcmp(entry
->sha1
, sha1
, sizeof(entry
->sha1
)) == 0) {
157 unreachable("hash table should never be full");
160 static struct cache_entry
*
161 radv_pipeline_cache_search(struct radv_pipeline_cache
*cache
,
162 const unsigned char *sha1
)
164 struct cache_entry
*entry
;
166 pthread_mutex_lock(&cache
->mutex
);
168 entry
= radv_pipeline_cache_search_unlocked(cache
, sha1
);
170 pthread_mutex_unlock(&cache
->mutex
);
176 radv_pipeline_cache_set_entry(struct radv_pipeline_cache
*cache
,
177 struct cache_entry
*entry
)
179 const uint32_t mask
= cache
->table_size
- 1;
180 const uint32_t start
= entry
->sha1_dw
[0];
182 /* We'll always be able to insert when we get here. */
183 assert(cache
->kernel_count
< cache
->table_size
/ 2);
185 for (uint32_t i
= 0; i
< cache
->table_size
; i
++) {
186 const uint32_t index
= (start
+ i
) & mask
;
187 if (!cache
->hash_table
[index
]) {
188 cache
->hash_table
[index
] = entry
;
193 cache
->total_size
+= entry_size(entry
);
194 cache
->kernel_count
++;
199 radv_pipeline_cache_grow(struct radv_pipeline_cache
*cache
)
201 const uint32_t table_size
= cache
->table_size
* 2;
202 const uint32_t old_table_size
= cache
->table_size
;
203 const size_t byte_size
= table_size
* sizeof(cache
->hash_table
[0]);
204 struct cache_entry
**table
;
205 struct cache_entry
**old_table
= cache
->hash_table
;
207 table
= malloc(byte_size
);
209 return vk_error(VK_ERROR_OUT_OF_HOST_MEMORY
);
211 cache
->hash_table
= table
;
212 cache
->table_size
= table_size
;
213 cache
->kernel_count
= 0;
214 cache
->total_size
= 0;
216 memset(cache
->hash_table
, 0, byte_size
);
217 for (uint32_t i
= 0; i
< old_table_size
; i
++) {
218 struct cache_entry
*entry
= old_table
[i
];
222 radv_pipeline_cache_set_entry(cache
, entry
);
231 radv_pipeline_cache_add_entry(struct radv_pipeline_cache
*cache
,
232 struct cache_entry
*entry
)
234 if (cache
->kernel_count
== cache
->table_size
/ 2)
235 radv_pipeline_cache_grow(cache
);
237 /* Failing to grow that hash table isn't fatal, but may mean we don't
238 * have enough space to add this new kernel. Only add it if there's room.
240 if (cache
->kernel_count
< cache
->table_size
/ 2)
241 radv_pipeline_cache_set_entry(cache
, entry
);
245 radv_create_shader_variants_from_pipeline_cache(struct radv_device
*device
,
246 struct radv_pipeline_cache
*cache
,
247 const unsigned char *sha1
,
248 struct radv_shader_variant
**variants
)
250 struct cache_entry
*entry
;
253 cache
= device
->mem_cache
;
255 pthread_mutex_lock(&cache
->mutex
);
257 entry
= radv_pipeline_cache_search_unlocked(cache
, sha1
);
260 /* Again, don't cache when we want debug info, since this isn't
261 * present in the cache. */
262 if (!device
->physical_device
->disk_cache
||
263 (device
->instance
->debug_flags
& RADV_DEBUG_NO_CACHE
) ||
264 device
->keep_shader_info
) {
265 pthread_mutex_unlock(&cache
->mutex
);
269 uint8_t disk_sha1
[20];
270 disk_cache_compute_key(device
->physical_device
->disk_cache
,
271 sha1
, 20, disk_sha1
);
272 entry
= (struct cache_entry
*)
273 disk_cache_get(device
->physical_device
->disk_cache
,
276 pthread_mutex_unlock(&cache
->mutex
);
279 size_t size
= entry_size(entry
);
280 struct cache_entry
*new_entry
= vk_alloc(&cache
->alloc
, size
, 8,
281 VK_SYSTEM_ALLOCATION_SCOPE_CACHE
);
284 pthread_mutex_unlock(&cache
->mutex
);
288 memcpy(new_entry
, entry
, entry_size(entry
));
292 radv_pipeline_cache_add_entry(cache
, new_entry
);
296 char *p
= entry
->code
;
297 for(int i
= 0; i
< MESA_SHADER_STAGES
; ++i
) {
298 if (!entry
->variants
[i
] && entry
->code_sizes
[i
]) {
299 struct radv_shader_variant
*variant
;
300 struct cache_entry_variant_info info
;
302 variant
= calloc(1, sizeof(struct radv_shader_variant
));
304 pthread_mutex_unlock(&cache
->mutex
);
308 memcpy(&info
, p
, sizeof(struct cache_entry_variant_info
));
309 p
+= sizeof(struct cache_entry_variant_info
);
311 variant
->config
= info
.config
;
312 variant
->info
= info
.variant_info
;
313 variant
->rsrc1
= info
.rsrc1
;
314 variant
->rsrc2
= info
.rsrc2
;
315 variant
->code_size
= entry
->code_sizes
[i
];
316 variant
->ref_count
= 1;
318 void *ptr
= radv_alloc_shader_memory(device
, variant
);
319 memcpy(ptr
, p
, entry
->code_sizes
[i
]);
320 p
+= entry
->code_sizes
[i
];
322 entry
->variants
[i
] = variant
;
323 } else if (entry
->code_sizes
[i
]) {
324 p
+= sizeof(struct cache_entry_variant_info
) + entry
->code_sizes
[i
];
329 for (int i
= 0; i
< MESA_SHADER_STAGES
; ++i
)
330 if (entry
->variants
[i
])
331 p_atomic_inc(&entry
->variants
[i
]->ref_count
);
333 memcpy(variants
, entry
->variants
, sizeof(entry
->variants
));
334 pthread_mutex_unlock(&cache
->mutex
);
339 radv_pipeline_cache_insert_shaders(struct radv_device
*device
,
340 struct radv_pipeline_cache
*cache
,
341 const unsigned char *sha1
,
342 struct radv_shader_variant
**variants
,
343 const void *const *codes
,
344 const unsigned *code_sizes
)
347 cache
= device
->mem_cache
;
349 pthread_mutex_lock(&cache
->mutex
);
350 struct cache_entry
*entry
= radv_pipeline_cache_search_unlocked(cache
, sha1
);
352 for (int i
= 0; i
< MESA_SHADER_STAGES
; ++i
) {
353 if (entry
->variants
[i
]) {
354 radv_shader_variant_destroy(cache
->device
, variants
[i
]);
355 variants
[i
] = entry
->variants
[i
];
357 entry
->variants
[i
] = variants
[i
];
360 p_atomic_inc(&variants
[i
]->ref_count
);
362 pthread_mutex_unlock(&cache
->mutex
);
365 size_t size
= sizeof(*entry
);
366 for (int i
= 0; i
< MESA_SHADER_STAGES
; ++i
)
368 size
+= sizeof(struct cache_entry_variant_info
) + code_sizes
[i
];
371 entry
= vk_alloc(&cache
->alloc
, size
, 8,
372 VK_SYSTEM_ALLOCATION_SCOPE_CACHE
);
374 pthread_mutex_unlock(&cache
->mutex
);
378 memset(entry
, 0, sizeof(*entry
));
379 memcpy(entry
->sha1
, sha1
, 20);
381 char* p
= entry
->code
;
382 struct cache_entry_variant_info info
;
384 for (int i
= 0; i
< MESA_SHADER_STAGES
; ++i
) {
388 entry
->code_sizes
[i
] = code_sizes
[i
];
390 info
.config
= variants
[i
]->config
;
391 info
.variant_info
= variants
[i
]->info
;
392 info
.rsrc1
= variants
[i
]->rsrc1
;
393 info
.rsrc2
= variants
[i
]->rsrc2
;
394 memcpy(p
, &info
, sizeof(struct cache_entry_variant_info
));
395 p
+= sizeof(struct cache_entry_variant_info
);
397 memcpy(p
, codes
[i
], code_sizes
[i
]);
401 /* Always add cache items to disk. This will allow collection of
402 * compiled shaders by third parties such as steam, even if the app
403 * implements its own pipeline cache.
405 if (device
->physical_device
->disk_cache
) {
406 uint8_t disk_sha1
[20];
407 disk_cache_compute_key(device
->physical_device
->disk_cache
, sha1
, 20,
409 disk_cache_put(device
->physical_device
->disk_cache
,
410 disk_sha1
, entry
, entry_size(entry
), NULL
);
413 /* We delay setting the variant so we have reproducible disk cache
416 for (int i
= 0; i
< MESA_SHADER_STAGES
; ++i
) {
420 entry
->variants
[i
] = variants
[i
];
421 p_atomic_inc(&variants
[i
]->ref_count
);
424 radv_pipeline_cache_add_entry(cache
, entry
);
426 cache
->modified
= true;
427 pthread_mutex_unlock(&cache
->mutex
);
431 struct cache_header
{
432 uint32_t header_size
;
433 uint32_t header_version
;
436 uint8_t uuid
[VK_UUID_SIZE
];
440 radv_pipeline_cache_load(struct radv_pipeline_cache
*cache
,
441 const void *data
, size_t size
)
443 struct radv_device
*device
= cache
->device
;
444 struct cache_header header
;
446 if (size
< sizeof(header
))
448 memcpy(&header
, data
, sizeof(header
));
449 if (header
.header_size
< sizeof(header
))
451 if (header
.header_version
!= VK_PIPELINE_CACHE_HEADER_VERSION_ONE
)
453 if (header
.vendor_id
!= ATI_VENDOR_ID
)
455 if (header
.device_id
!= device
->physical_device
->rad_info
.pci_id
)
457 if (memcmp(header
.uuid
, device
->physical_device
->cache_uuid
, VK_UUID_SIZE
) != 0)
460 char *end
= (void *) data
+ size
;
461 char *p
= (void *) data
+ header
.header_size
;
463 while (end
- p
>= sizeof(struct cache_entry
)) {
464 struct cache_entry
*entry
= (struct cache_entry
*)p
;
465 struct cache_entry
*dest_entry
;
466 size_t size
= entry_size(entry
);
470 dest_entry
= vk_alloc(&cache
->alloc
, size
,
471 8, VK_SYSTEM_ALLOCATION_SCOPE_CACHE
);
473 memcpy(dest_entry
, entry
, size
);
474 for (int i
= 0; i
< MESA_SHADER_STAGES
; ++i
)
475 dest_entry
->variants
[i
] = NULL
;
476 radv_pipeline_cache_add_entry(cache
, dest_entry
);
482 VkResult
radv_CreatePipelineCache(
484 const VkPipelineCacheCreateInfo
* pCreateInfo
,
485 const VkAllocationCallbacks
* pAllocator
,
486 VkPipelineCache
* pPipelineCache
)
488 RADV_FROM_HANDLE(radv_device
, device
, _device
);
489 struct radv_pipeline_cache
*cache
;
491 assert(pCreateInfo
->sType
== VK_STRUCTURE_TYPE_PIPELINE_CACHE_CREATE_INFO
);
492 assert(pCreateInfo
->flags
== 0);
494 cache
= vk_alloc2(&device
->alloc
, pAllocator
,
496 VK_SYSTEM_ALLOCATION_SCOPE_OBJECT
);
498 return vk_error(VK_ERROR_OUT_OF_HOST_MEMORY
);
501 cache
->alloc
= *pAllocator
;
503 cache
->alloc
= device
->alloc
;
505 radv_pipeline_cache_init(cache
, device
);
507 if (pCreateInfo
->initialDataSize
> 0) {
508 radv_pipeline_cache_load(cache
,
509 pCreateInfo
->pInitialData
,
510 pCreateInfo
->initialDataSize
);
513 *pPipelineCache
= radv_pipeline_cache_to_handle(cache
);
518 void radv_DestroyPipelineCache(
520 VkPipelineCache _cache
,
521 const VkAllocationCallbacks
* pAllocator
)
523 RADV_FROM_HANDLE(radv_device
, device
, _device
);
524 RADV_FROM_HANDLE(radv_pipeline_cache
, cache
, _cache
);
528 radv_pipeline_cache_finish(cache
);
530 vk_free2(&device
->alloc
, pAllocator
, cache
);
533 VkResult
radv_GetPipelineCacheData(
535 VkPipelineCache _cache
,
539 RADV_FROM_HANDLE(radv_device
, device
, _device
);
540 RADV_FROM_HANDLE(radv_pipeline_cache
, cache
, _cache
);
541 struct cache_header
*header
;
542 VkResult result
= VK_SUCCESS
;
544 pthread_mutex_lock(&cache
->mutex
);
546 const size_t size
= sizeof(*header
) + cache
->total_size
;
548 pthread_mutex_unlock(&cache
->mutex
);
552 if (*pDataSize
< sizeof(*header
)) {
553 pthread_mutex_unlock(&cache
->mutex
);
555 return VK_INCOMPLETE
;
557 void *p
= pData
, *end
= pData
+ *pDataSize
;
559 header
->header_size
= sizeof(*header
);
560 header
->header_version
= VK_PIPELINE_CACHE_HEADER_VERSION_ONE
;
561 header
->vendor_id
= ATI_VENDOR_ID
;
562 header
->device_id
= device
->physical_device
->rad_info
.pci_id
;
563 memcpy(header
->uuid
, device
->physical_device
->cache_uuid
, VK_UUID_SIZE
);
564 p
+= header
->header_size
;
566 struct cache_entry
*entry
;
567 for (uint32_t i
= 0; i
< cache
->table_size
; i
++) {
568 if (!cache
->hash_table
[i
])
570 entry
= cache
->hash_table
[i
];
571 const uint32_t size
= entry_size(entry
);
572 if (end
< p
+ size
) {
573 result
= VK_INCOMPLETE
;
577 memcpy(p
, entry
, size
);
578 for(int j
= 0; j
< MESA_SHADER_STAGES
; ++j
)
579 ((struct cache_entry
*)p
)->variants
[j
] = NULL
;
582 *pDataSize
= p
- pData
;
584 pthread_mutex_unlock(&cache
->mutex
);
589 radv_pipeline_cache_merge(struct radv_pipeline_cache
*dst
,
590 struct radv_pipeline_cache
*src
)
592 for (uint32_t i
= 0; i
< src
->table_size
; i
++) {
593 struct cache_entry
*entry
= src
->hash_table
[i
];
594 if (!entry
|| radv_pipeline_cache_search(dst
, entry
->sha1
))
597 radv_pipeline_cache_add_entry(dst
, entry
);
599 src
->hash_table
[i
] = NULL
;
603 VkResult
radv_MergePipelineCaches(
605 VkPipelineCache destCache
,
606 uint32_t srcCacheCount
,
607 const VkPipelineCache
* pSrcCaches
)
609 RADV_FROM_HANDLE(radv_pipeline_cache
, dst
, destCache
);
611 for (uint32_t i
= 0; i
< srcCacheCount
; i
++) {
612 RADV_FROM_HANDLE(radv_pipeline_cache
, src
, pSrcCaches
[i
]);
614 radv_pipeline_cache_merge(dst
, src
);