mirrors
/
dxvk
mirror of https://github.com/doitsujin/dxvk
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

[dxvk] Don't try to merge buffer ranges in barrier list 

Too slow, doesn't work most of the time anyway.
This commit is contained in:
Philip Rebohle 2022-08-11 00:38:49 +02:00
parent 4c7da80c14
commit 85c278f515
No known key found for this signature in database
GPG Key ID: C8CC613427A31C99
1 changed files with 20 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
src/dxvk/dxvk_barrier.h
View File

@ -321,23 +321,29 @@ namespace dxvk {
if (hashEntry) {
ListEntry* listEntry = getListEntry(hashEntry->next);
// Only create the linear list if absolutely necessary
if (!listEntry && !hashEntry->data.canMerge(slice))
listEntry = insertListEntry(hashEntry->data, hashEntry);
if (listEntry) {
while (listEntry) {
// Avoid adding new list entries if possible
if (listEntry->data.canMerge(slice)) {
listEntry->data.merge(slice);
break;
}
if (std::is_same_v<T, DxvkBarrierImageSlice>) {
// For images, try to merge the slice with existing
// entries if possible to keep the list small
do {
if (listEntry->data.canMerge(slice)) {
listEntry->data.merge(slice);
break;
}
} while ((listEntry = getListEntry(listEntry->next)));
listEntry = getListEntry(listEntry->next);
}
if (!listEntry)
if (!listEntry)
insertListEntry(slice, hashEntry);
} else {
// For buffers it's not even worth trying. Most of the
// time we won't be able to merge, and traversing the
// entire list every time is slow.
insertListEntry(slice, hashEntry);
}
} else if (!hashEntry->data.canMerge(slice)) {
// Only create the linear list if absolutely necessary
insertListEntry(hashEntry->data, hashEntry);
insertListEntry(slice, hashEntry);
}
// Merge hash entry data so that it stores