| /TaskScheduler/ThirdParty/UnitTest++/UnitTest++/ |
| H A D | CompositeTestReporter.cpp | 27 for (int index = 0; index < m_reporterCount; ++index) in RemoveReporter() local 29 if (m_reporters[index] == reporter) in RemoveReporter() 31 m_reporters[index] = m_reporters[m_reporterCount - 1]; in RemoveReporter() 42 for (int index = 0; index < m_reporterCount; ++index) in ReportFailure() local 43 m_reporters[index]->ReportFailure(details, failure); in ReportFailure() 48 for (int index = 0; index < m_reporterCount; ++index) in ReportTestStart() local 49 m_reporters[index]->ReportTestStart(test); in ReportTestStart() 54 for (int index = 0; index < m_reporterCount; ++index) in ReportTestFinish() local 55 m_reporters[index]->ReportTestFinish(test, secondsElapsed); in ReportTestFinish() 63 for (int index = 0; index < m_reporterCount; ++index) in ReportSummary() local [all …]
|
| /TaskScheduler/ThirdParty/Squish/ |
| H A D | alpha.cpp | 118 int index = 0; in FitCodes() local 129 index = j; in FitCodes() 159 int index = *src++; in WriteAlphaBlock() local 181 u8 index = indices[i]; in WriteAlphaBlock5() local 182 if( index == 0 ) in WriteAlphaBlock5() 184 else if( index == 1 ) in WriteAlphaBlock5() 186 else if( index <= 5 ) in WriteAlphaBlock5() 189 swapped[i] = index; in WriteAlphaBlock5() 211 u8 index = indices[i]; in WriteAlphaBlock7() local 212 if( index == 0 ) in WriteAlphaBlock7() [all …]
|
| H A D | singlecolourfit.cpp | 135 for( int index = 0; index < 2; ++index ) in ComputeEndPoints() local 147 sources[channel] = lookup[target].sources + index; in ComputeEndPoints() 167 m_index = ( u8 )( 2*index ); in ComputeEndPoints()
|
| H A D | colourset.cpp | 91 int index = m_remap[j]; in ColourSet() local 97 m_weights[index] += ( weightByAlpha ? w : 1.0f ); in ColourSet() 98 m_remap[i] = index; in ColourSet()
|
| H A D | maths.h | 214 float operator[]( int index ) const 216 return m_x[index]; 219 float& operator[]( int index ) 221 return m_x[index];
|
| H A D | Doxyfile | 99 # configuration options related to the alphabetical class index
|
| /TaskScheduler/Scheduler/Include/Scopes/ |
| H A D | MTScopes.h | 138 T* IndexToObject(int32 index) in IndexToObject() argument 153 id = (index + 1); in AllocObject() 233 int32 index = ( id - 1); in Get() local 259 T* IndexToObject(int32 index) in IndexToObject() argument 269 int32 index = top; in AllocObject() local 299 int32 index = (id - 1); in Get() local 312 int32 index = top; in Pop() local 398 int32 index = count; in AllocObject() local 426 int32 index = (id - 1); in Get() local 443 int32 index = top; in Pop() local [all …]
|
| /TaskScheduler/SchedulerTests/Tests/ |
| H A D | DxtTests.cpp | 134 int index = posY * stride + (posX * 3); in SUITE() local 136 …MT_ASSERT(index >= 0 && ((size_t)(index + 2) < MT_ARRAY_SIZE(EmbeddedImage::lenaColor)), "Invalid … in SUITE() 138 uint8 r = srcPixels[index + 0]; in SUITE() 139 uint8 g = srcPixels[index + 1]; in SUITE() 140 uint8 b = srcPixels[index + 2]; in SUITE() 291 int index = posY * stride + (posX * 3); in SUITE() local 295 …MT_ASSERT(index >= 0 && ((size_t)(index + 2) < MT_ARRAY_SIZE(EmbeddedImage::lenaColor)), "Invalid … in SUITE() 297 dstPixels[index + 0] = (pixel & 0xFF); in SUITE() 298 dstPixels[index + 1] = (pixel >> 8 & 0xFF); in SUITE() 299 dstPixels[index + 2] = (pixel >> 16 & 0xFF); in SUITE()
|
| H A D | PriorityTests.cpp | 177 uint32 index = 0; in SUITE() local 180 taskHandles[index] = lowPriorityTasksPool.Alloc(TaskLow(i)); in SUITE() 181 index++; in SUITE() 186 taskHandles[index] = highPriorityTasksPool.Alloc(TaskHigh(i)); in SUITE() 187 index++; in SUITE() 192 taskHandles[index] = normalPriorityTasksPool.Alloc(TaskNormal(i)); in SUITE() 193 index++; in SUITE()
|
| /TaskScheduler/Scheduler/Include/ |
| H A D | MTTaskQueue.h | 163 size_t index = (end & MASK); in Add() local 164 T* pElement = Buffer() + index; in Add() 181 size_t index = (begin & MASK); in TryPopOldest() local 182 T* pElement = Buffer() + index; in TryPopOldest() 199 size_t index = (end & MASK); in TryPopNewest() local 200 T* pElement = Buffer() + index; in TryPopNewest()
|
| H A D | MTScheduler.inl | 76 size_t index = 0; local 78 …for (size_t bucketIndex = 0; (bucketIndex < buckets.Size()) && (index < descriptions.Size()); ++bu… 80 size_t bucketStartIndex = index; 84 descriptions[index] = GetGroupedTask(group, &taskArray[i]); 85 index++; 88 …buckets[bucketIndex] = internal::TaskBucket(&descriptions[bucketStartIndex], index - bucketStartIn… 91 MT_ASSERT(index == descriptions.Size(), "Sanity check"); 92 return index > 0;
|
| H A D | MTStaticVector.h | 41 inline T* IndexToObject(int32 index) in IndexToObject() argument 44 T* pObjectMemory = (T*)(alignedMemory + index * sizeof(T)); in IndexToObject()
|
| H A D | MTConcurrentRingBuffer.h | 69 size_t NextIndex(size_t index) in NextIndex() argument 71 size_t ret = index + 1; in NextIndex()
|
| H A D | MTTaskPool.h | 244 Atomic32<int32> index; variable 262 , index(0) in TaskPool() 299 int idx = index.IncFetch() - 1; in TryAlloc()
|
| /TaskScheduler/Scheduler/Source/ |
| H A D | MTThreadContext.cpp | 36 uint32 GetPrimeNumber(uint32 index) in GetPrimeNumber() argument 38 return primeNumbers[index % MT_ARRAY_SIZE(primeNumbers)]; in GetPrimeNumber()
|
| H A D | MTScheduler.cpp | 349 uint32 index = victimIndex % workersCount; in TryStealTask() local 350 if (index == threadContext.workerIndex) in TryStealTask() 353 index = victimIndex % workersCount; in TryStealTask() 356 internal::ThreadContext& victimContext = threadContext.taskScheduler->threadContext[index]; in TryStealTask()
|
| /TaskScheduler/Scheduler/Doxygen/ |
| H A D | Doxyfile | 1056 # Configuration options related to the alphabetical class index 1059 # If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all 1067 # which the alphabetical index list will be split. 1076 # while generating the index headers. 1229 # If the GENERATE_DOCSET tag is set to YES, additional index files will be 1274 # additional HTML index files: index.hhp, index.hhc, and index.hhk. The 1418 # be necessary to disable the index and replace it with your own. The 1428 # The GENERATE_TREEVIEW tag is used to specify whether a tree-like index 1438 # the same information as the tab index, you could consider setting 1653 # index for LaTeX. [all …]
|
| H A D | style.css | 507 /* these are for tree view when not used as main index */
|