Lines Matching defs:mask
97 // Take a 64-bit integer, mask it to the subgroup size, and then
99 bitset128 bitsetFromU64(deUint64 mask, deUint32 subgroupSize)
101 mask &= subgroupSizeToMask(subgroupSize);
102 bitset128 result(mask);
105 result = (result << subgroupSize) | bitset128(mask);
110 // Pick out the mask for the subgroup that invocationID is a member of
116 deUint64 mask = copy.to_ullong();
117 mask &= subgroupSizeToMask(subgroupSize);
118 return mask;
209 // if ((1ULL << gl_SubgroupInvocationID) & mask).
210 // Special case if mask = ~0ULL, converted into "if (inputA.a[idx] == idx)"
267 // case statement with a (invocation mask, case mask) pair
269 // case statement used for loop counter switches, with a value and a mask of loop iterations
299 // The value could be a mask for an if test, the index of the loop
324 deUint64 mask = bitsetToU64(value, subgroupSize, i);
325 int lsb = findLSB(mask);
358 // tests need to know that 0xF is really an active mask).
364 deUint64 mask = masks[maskIdx];
366 mask = ~0ULL;
374 ops.push_back({OP_IF_MASK, mask});
1271 bitset128 mask(0);
1273 mask.set(j);
1276 stateStack[nesting].activeMask = stateStack[nesting-1].activeMask & mask;
1285 bitset128 mask(0);
1287 mask.set(j);
1289 stateStack[nesting].activeMask = stateStack[nesting-1].activeMask & mask;
1432 bitset128 mask = stateStack[nesting].activeMask;
1435 stateStack[n].activeMask &= ~mask;
1446 bitset128 mask = stateStack[nesting].activeMask;
1449 stateStack[n].activeMask &= ~mask;
1452 stateStack[n].continueMask |= mask;
1470 bitset128 mask = stateStack[nesting].activeMask;
1473 stateStack[n].activeMask &= ~mask;
1579 css << "bool testBit(uvec2 mask, uint bit) { return (bit < 32) ? ((mask.x >> bit) & 1) != 0 : ((mask.y >> (bit-32)) & 1) != 0; }\n";
1936 // For TT_SUCF_ELECT, when the reference result has a full mask, we expect lane 0 to be elected
1938 // expect a full mask. Search until we find the expected result with a matching store value in