Am 18.10.24 um 21:17 schrieb Friedrich Vock:
[SNIP]
if (tmp) {
- array[count++] = dma_fence_get(tmp);
+ for (j = 0; j < count; ++j) {
+ if (array[count] == tmp)
+ break;
+ }
+ if (j == count)
+
Hi,
On 18.10.24 10:56, Christian König wrote:
Am 18.10.24 um 07:46 schrieb Friedrich Vock:
When dma_fence_unwrap_merge is called on fence chains where the fences
aren't ordered by context, the merging logic breaks down and we end up
inserting fences twice. Doing this repeatedly leads to the num
Am 18.10.24 um 07:46 schrieb Friedrich Vock:
When dma_fence_unwrap_merge is called on fence chains where the fences
aren't ordered by context, the merging logic breaks down and we end up
inserting fences twice. Doing this repeatedly leads to the number of
fences going up exponentially, and in som
