Home
last modified time | relevance | path

Searched refs:numChoices (Results 1 - 3 of 3) sorted by relevance

/third_party/vk-gl-cts/external/vulkancts/modules/vulkan/tessellation/
H A DvktTessellationPrimitiveDiscardTests.cpp109 const int numChoices = 1 + DE_LENGTH_OF_ARRAY(invalidTessLevelChoices); in genAttributes() local
110 float choices[6][numChoices]; in genAttributes()
114 for (int choiceNdx = 0; choiceNdx < numChoices; choiceNdx++) in genAttributes()
118 const int numCols = intPow(numChoices, 6/2); // sqrt(numChoices**6) == sqrt(number of primitives) in genAttributes()
123 for (i[2] = 0; i[2] < numChoices; i[2]++) // First outer in genAttributes()
124 for (i[3] = 0; i[3] < numChoices; i[3]++) // Second outer in genAttributes()
125 for (i[4] = 0; i[4] < numChoices; i[4]++) // Third outer in genAttributes()
126 for (i[5] = 0; i[5] < numChoices; i[5]++) // Fourth outer in genAttributes()
127 for (i[0] = 0; i[0] < numChoices; in genAttributes()
[all...]
/third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/tessellation/
H A DvktTessellationPrimitiveDiscardTests.cpp109 const int numChoices = 1 + DE_LENGTH_OF_ARRAY(invalidTessLevelChoices); in genAttributes() local
110 float choices[6][numChoices]; in genAttributes()
114 for (int choiceNdx = 0; choiceNdx < numChoices; choiceNdx++) in genAttributes()
118 const int numCols = intPow(numChoices, 6/2); // sqrt(numChoices**6) == sqrt(number of primitives) in genAttributes()
123 for (i[2] = 0; i[2] < numChoices; i[2]++) // First outer in genAttributes()
124 for (i[3] = 0; i[3] < numChoices; i[3]++) // Second outer in genAttributes()
125 for (i[4] = 0; i[4] < numChoices; i[4]++) // Third outer in genAttributes()
126 for (i[5] = 0; i[5] < numChoices; i[5]++) // Fourth outer in genAttributes()
127 for (i[0] = 0; i[0] < numChoices; in genAttributes()
[all...]
/third_party/vk-gl-cts/modules/gles31/functional/
H A Des31fTessellationTests.cpp5432 const int numChoices = 1 + DE_LENGTH_OF_ARRAY(invalidTessLevelChoices);
5433 float choices[6][numChoices];
5437 for (int choiceNdx = 0; choiceNdx < numChoices; choiceNdx++)
5441 const int numCols = intPow(numChoices, 6/2); // sqrt(numChoices**6) == sqrt(number of primitives)
5446 for (i[2] = 0; i[2] < numChoices; i[2]++) // First outer
5447 for (i[3] = 0; i[3] < numChoices; i[3]++) // Second outer
5448 for (i[4] = 0; i[4] < numChoices; i[4]++) // Third outer
5449 for (i[5] = 0; i[5] < numChoices; i[5]++) // Fourth outer
5450 for (i[0] = 0; i[0] < numChoices;
[all...]

Completed in 7 milliseconds