Searched refs:j (Results 1 – 7 of 7) sorted by relevance
58 for( int j = 0;; ++j ) in ColourSet() local61 if( j == i ) in ColourSet()82 int oldbit = 1 << j; in ColourSet()84 && ( rgba[4*i] == rgba[4*j] ) in ColourSet()85 && ( rgba[4*i + 1] == rgba[4*j + 1] ) in ColourSet()86 && ( rgba[4*i + 2] == rgba[4*j + 2] ) in ColourSet()87 && ( rgba[4*j + 3] >= 128 || !isDxt1 ); in ColourSet()91 int index = m_remap[j]; in ColourSet()113 int j = m_remap[i]; in RemapIndices() local114 if( j == -1 ) in RemapIndices()[all …]
119 for( int j = 0; j < 8; ++j ) in FitCodes() local122 int dist = ( int )value - ( int )codes[j]; in FitCodes()129 index = j; in FitCodes()157 for( int j = 0; j < 8; ++j ) in WriteAlphaBlock() local160 value |= ( index << 3*j ); in WriteAlphaBlock()164 for( int j = 0; j < 3; ++j ) in WriteAlphaBlock() local166 int byte = ( value >> 8*j ) & 0xff; in WriteAlphaBlock()329 for( int j = 0; j < 3; ++j ) in DecompressAlphaDxt5() local332 value |= ( byte << 8*j ); in DecompressAlphaDxt5()336 for( int j = 0; j < 8; ++j ) in DecompressAlphaDxt5() local[all …]
79 for( int j = i; j > 0 && dps[j] < dps[j - 1]; --j ) in ConstructOrdering() local81 std::swap( dps[j], dps[j - 1] ); in ConstructOrdering()82 std::swap( order[j], order[j - 1] ); in ConstructOrdering()109 int j = order[i]; in ConstructOrdering() local110 Vec4 p( unweighted[j].X(), unweighted[j].Y(), unweighted[j].Z(), 1.0f ); in ConstructOrdering()193 bestj = j; in Compress3()199 if( j == count ) in Compress3()202 ++j; in Compress3()286 int kmin = ( j == 0 ) ? 1 : j; in Compress4()329 bestj = j; in Compress4()[all …]
117 for( int j = 0; j < 3; ++j ) in Compress3() local119 float d = LengthSquared( m_metric*( values[i] - codes[j] ) ); in Compress3()123 idx = j; in Compress3()170 for( int j = 0; j < 4; ++j ) in Compress4() local172 float d = LengthSquared( m_metric*( values[i] - codes[j] ) ); in Compress4()176 idx = j; in Compress4()
209 for( int j = 0; j < 4; ++j ) in DecompressColour() local210 rgba[4*i + j] = codes[offset + j]; in DecompressColour()
216 for(int32 j = 0; j < workersCount; j++) in SUITE() local218 lowProcessedTotal += workerState[j].lowProcessed; in SUITE()219 normalProcessedTotal += workerState[j].normalProcessed; in SUITE()220 highProcessedTotal += workerState[j].highProcessed; in SUITE()227 for(int32 j = 0; j < workersCount; j++) in SUITE() local229 printf("worker #%d\n", j); in SUITE()231 CHECK_EQUAL((uint32)2, workerState[j].taskPrio); in SUITE()232 CHECK(workerState[j].lowProcessed >= minTasksExecutedThreshold); in SUITE()236 printf(" low : %d\n", workerState[j].lowProcessed); in SUITE()237 printf(" normal : %d\n", workerState[j].normalProcessed); in SUITE()[all …]
50 int j; in SUITE() local51 for(j = 0; j < 507; j++) in SUITE()53 ringBuffer.Push(3 + j); in SUITE()