Searched refs:queueNdx (Results 1 – 11 of 11) sorted by relevance
52 for (deUint32 queueNdx = startIndex; queueNdx < queueFamilyProperties.size(); ++queueNdx) in findMatchingQueueFamilyIndex() local54 if ((queueFamilyProperties[queueNdx].queueFlags & queueFlags) == queueFlags) in findMatchingQueueFamilyIndex()55 return queueNdx; in findMatchingQueueFamilyIndex()107 for (deUint32 queueNdx = 0; queueNdx < queuesPerFamilyCount; ++queueNdx) in createDeviceSupportingQueues() local111 queue.queueIndex = queueNdx; in createDeviceSupportingQueues()126 for (deUint32 queueNdx = 0; queueNdx < queueFamilyIter->second.queueCount; ++queueNdx) in createDeviceSupportingQueues() local163 for (deUint32 queueNdx = 0u; queueNdx < queuesIter->second.size(); ++queueNdx) in createDeviceSupportingQueues() local165 Queue& queue = queuesIter->second[queueNdx]; in createDeviceSupportingQueues()
176 for (deUint32 queueNdx = 0u; queueNdx < m_params.numQueues; ++queueNdx) in iterate() local178 const Queue* queue = &getQueue((VkQueueFlags)0, queueNdx); in iterate()
142 for (deUint32 queueNdx = 0; queueNdx < queueFamilyProperties.size(); ++queueNdx) in basicMultiQueueCase() local145 queues[FIRST].queueFamilyIndex = queueNdx; in basicMultiQueueCase()147 if (queues[FIRST].queueFamilyIndex != queueNdx || queueFamilyProperties[queueNdx].queueCount > 1u) in basicMultiQueueCase()149 queues[SECOND].queueFamilyIndex = queueNdx; in basicMultiQueueCase()157 for (int queueNdx = 0; queueNdx < COUNT; ++queueNdx) in basicMultiQueueCase() local165 queueInfo.queueFamilyIndex = queues[queueNdx].queueFamilyIndex; in basicMultiQueueCase()169 queueInfos[queueNdx] = queueInfo; in basicMultiQueueCase()
146 for (int queueNdx = 0; queueNdx < static_cast<int>(it->second.queue.size()); ++queueNdx) in MultiQueues() local147 …m_deviceDriver->getDeviceQueue(*m_logicalDevice, it->first, queueNdx, &it->second.queue[queueNdx]); in MultiQueues()
118 for (int queueNdx = 0; queueNdx < static_cast<int>(queue.queues.size()); ++queueNdx) in getFreeQueue() local121 if (queue.available[queueNdx]) in getFreeQueue()123 queue.available[queueNdx] = false; in getFreeQueue()125 returnQueues = queue.queues[queueNdx]; in getFreeQueue()126 returnQueueIndex = queueNdx; in getFreeQueue()
92 size_t queueNdx; in createTestDevice() local99 for (queueNdx = 0; queueNdx < queueProps.size(); queueNdx++) in createTestDevice()101 …if ((queueProps[queueNdx].queueFlags & VK_QUEUE_GRAPHICS_BIT) == VK_QUEUE_GRAPHICS_BIT && (queuePr… in createTestDevice()105 if (queueNdx >= queueProps.size()) in createTestDevice()121 queueInfo.queueFamilyIndex = (deUint32)queueNdx; in createTestDevice()
136 for (size_t queueNdx = 0; queueNdx < queueProps.size(); queueNdx++) in findQueueFamilyIndexWithCaps() local138 if ((queueProps[queueNdx].queueFlags & requiredCaps) == requiredCaps) in findQueueFamilyIndexWithCaps()139 return (deUint32)queueNdx; in findQueueFamilyIndexWithCaps()
166 for (size_t queueNdx = 0; queueNdx < queueProps.size(); queueNdx++) in findQueueFamilyIndexWithCaps() local168 if ((queueProps[queueNdx].queueFlags & requiredCaps) == requiredCaps) in findQueueFamilyIndexWithCaps()170 return (deUint32)queueNdx; in findQueueFamilyIndexWithCaps()
1139 for (size_t queueNdx = 0; queueNdx < queueProperties.size(); queueNdx++) in deviceQueueFamilyProperties() local1140 log << TestLog::Message << queueNdx << ": " << queueProperties[queueNdx] << TestLog::EndMessage; in deviceQueueFamilyProperties()
604 for (size_t queueNdx = 0; queueNdx < queueProps.size(); queueNdx++) in findQueueFamilyIndexWithCaps() local606 if ((queueProps[queueNdx].queueFlags & requiredCaps) == requiredCaps) in findQueueFamilyIndexWithCaps()607 return (deUint32)queueNdx; in findQueueFamilyIndexWithCaps()
1006 for (size_t queueNdx = 0; queueNdx < m_queues.size(); queueNdx++) in Context() local1007 m_queueFamilies.push_back(m_queues[queueNdx].first); in Context()