You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
// Work out how big the memory block in pData is.
const VkDescriptorUpdateTemplateEntry* pEntry =
_descUpdateTemplate->getEntry(_descUpdateTemplate->getNumberOfEntries()-1);
size_t size = pEntry->offset;
// If we were given a stride, use that; otherwise, assume only one info
// struct of the appropriate type.
if (pEntry->stride)
size += pEntry->stride * pEntry->descriptorCount;
This assumes that the last element in the template update maps to the highest address. This is a flawed assumption, and breaks Granite. Granite sorts the updates by descriptor type, and push descriptors segfaults.
Also, there's a worrying malloc every push, which seems very suboptimal.
The text was updated successfully, but these errors were encountered:
This assumes that the last element in the template update maps to the highest address. This is a flawed assumption, and breaks Granite. Granite sorts the updates by descriptor type, and push descriptors segfaults.
Also, there's a worrying malloc every push, which seems very suboptimal.
The text was updated successfully, but these errors were encountered: