HomeSort by relevance Sort by last modified time
    Searched refs:wordNdx (Results 1 - 4 of 4) sorted by null

  /external/deqp/modules/gles31/functional/
es31fMultisampleTests.cpp 62 for (int wordNdx = 0; wordNdx < (int)bitfield.size(); ++wordNdx)
66 const int targetCharNdx = numBits - (wordNdx*32+bit) - 1;
72 if ((bitfield[wordNdx] >> bit) & 0x01)
504 for (int wordNdx = 0; wordNdx < wordCount; ++wordNdx)
506 const GLbitfield rawMask = (GLbitfield)deUint32Hash(wordNdx * 32 + triNdx);
508 const bool isFinalWord = (wordNdx + 1) == wordCount
    [all...]
es31fTextureMultisampleTests.cpp 62 for (int wordNdx = 0; wordNdx < (int)bitfield.size(); ++wordNdx)
66 const int targetCharNdx = numBits - (wordNdx*32+bit) - 1;
72 if ((bitfield[wordNdx] >> bit) & 0x01)
855 for (int wordNdx = 0; wordNdx < (int)effectiveMask.size(); ++wordNdx)
857 const deUint32 randomMask = (deUint32)deUint32Hash(wordNdx << 2 ^ sample);
858 const deUint32 sampleMask = (wordNdx < (int)bitmask.size()) ? (bitmask[wordNdx]) : (0)
    [all...]
  /external/deqp/modules/gles3/functional/
es3fASTCDecompressionCases.cpp 152 for (int wordNdx = 0; wordNdx < NUM_WORDS; wordNdx++)
153 m_words[wordNdx] = 0;
160 const int wordNdx = ndx / WORD_BITS;
162 m_words[wordNdx] = (m_words[wordNdx] & ~((Word)1 << bitNdx)) | ((Word)val << bitNdx);
196 for (int wordNdx = 0; wordNdx < NUM_WORDS; wordNdx++
    [all...]
  /external/deqp/framework/common/
tcuCompressedTexture.cpp     [all...]

Completed in 176 milliseconds