Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 36) sorted by relevance

12

/TaskScheduler/ThirdParty/Squish/
H A Dcolourblock.cpp68 for( int i = 0; i < 4; ++i ) in WriteColourBlock() local
86 for( int i = 0; i < 16; ++i ) in WriteColourBlock3() local
87 remapped[i] = indices[i]; in WriteColourBlock3()
93 for( int i = 0; i < 16; ++i ) in WriteColourBlock3() local
120 for( int i = 0; i < 16; ++i ) in WriteColourBlock4() local
126 for( int i = 0; i < 16; ++i ) in WriteColourBlock4() local
132 for( int i = 0; i < 16; ++i ) in WriteColourBlock4() local
133 remapped[i] = indices[i]; in WriteColourBlock4()
171 for( int i = 0; i < 3; ++i ) in DecompressColour() local
194 for( int i = 0; i < 4; ++i ) in DecompressColour() local
[all …]
H A Dalpha.cpp51 for( int i = 0; i < 8; ++i ) in CompressAlphaDxt3() local
77 for( int i = 0; i < 8; ++i ) in DecompressAlphaDxt3() local
104 for( int i = 0; i < 16; ++i ) in FitCodes() local
153 for( int i = 0; i < 2; ++i ) in WriteAlphaBlock() local
179 for( int i = 0; i < 16; ++i ) in WriteAlphaBlock5() local
209 for( int i = 0; i < 16; ++i ) in WriteAlphaBlock7() local
237 for( int i = 0; i < 16; ++i ) in CompressAlphaDxt5() local
270 for( int i = 1; i < 5; ++i ) in CompressAlphaDxt5() local
279 for( int i = 1; i < 7; ++i ) in CompressAlphaDxt5() local
309 for( int i = 1; i < 5; ++i ) in DecompressAlphaDxt5() local
[all …]
H A Dcolourset.cpp39 for( int i = 0; i < 16; ++i ) in ColourSet() local
42 int bit = 1 << i; in ColourSet()
45 m_remap[i] = -1; in ColourSet()
52 m_remap[i] = -1; in ColourSet()
61 if( j == i ) in ColourSet()
98 m_remap[i] = index; in ColourSet()
105 for( int i = 0; i < m_count; ++i ) in ColourSet() local
106 m_weights[i] = std::sqrt( m_weights[i] ); in ColourSet()
111 for( int i = 0; i < 16; ++i ) in RemapIndices() local
113 int j = m_remap[i]; in RemapIndices()
[all …]
H A Drangefit.cpp67 for( int i = 1; i < count; ++i ) in RangeFit() local
69 float val = Dot( values[i], principle ); in RangeFit()
72 start = values[i]; in RangeFit()
77 end = values[i]; in RangeFit()
112 for( int i = 0; i < count; ++i ) in Compress3() local
119 float d = LengthSquared( m_metric*( values[i] - codes[j] ) ); in Compress3()
128 closest[i] = ( u8 )idx; in Compress3()
165 for( int i = 0; i < count; ++i ) in Compress4() local
172 float d = LengthSquared( m_metric*( values[i] - codes[j] ) ); in Compress4()
181 closest[i] = ( u8 )idx; in Compress4()
H A Dmaths.cpp42 for( int i = 0; i < n; ++i ) in ComputeWeightedCovariance() local
44 total += weights[i]; in ComputeWeightedCovariance()
45 centroid += weights[i]*points[i]; in ComputeWeightedCovariance()
51 for( int i = 0; i < n; ++i ) in ComputeWeightedCovariance() local
54 Vec3 b = weights[i]*a; in ComputeWeightedCovariance()
91 for( int i = 1; i < 6; ++i ) in GetMultiplicity1Evector() local
93 float c = std::fabs( u[i] ); in GetMultiplicity1Evector()
97 mi = i; in GetMultiplicity1Evector()
130 for( int i = 1; i < 6; ++i ) in GetMultiplicity2Evector() local
132 float c = std::fabs( m[i] ); in GetMultiplicity2Evector()
[all …]
H A Dclusterfit.cpp70 for( int i = 0; i < count; ++i ) in ConstructOrdering() local
72 dps[i] = Dot( values[i], axis ); in ConstructOrdering()
73 order[i] = ( u8 )i; in ConstructOrdering()
77 for( int i = 0; i < count; ++i ) in ConstructOrdering() local
91 for( int i = 0; i < count; ++i ) in ConstructOrdering() local
93 if( order[i] != prev[i] ) in ConstructOrdering()
107 for( int i = 0; i < count; ++i ) in ConstructOrdering() local
147 for( int i = 0; i < count; ++i ) in Compress3() local
151 int jmin = ( i == 0 ) ? 1 : i; in Compress3()
192 besti = i; in Compress3()
[all …]
H A Dsinglecolourfit.cpp50 int i = ( int )( a + 0.5f ); in FloatToInt() local
53 if( i < 0 ) in FloatToInt()
54 i = 0; in FloatToInt()
55 else if( i > limit ) in FloatToInt()
56 i = limit; in FloatToInt()
59 return i; in FloatToInt()
/TaskScheduler/SchedulerTests/Tests/
H A DFoundationTests.cpp60 for(i = 0; i < elementsCount; i++) in SUITE()
62 CHECK_EQUAL(tempData[i], (int)((507+3-32) + i)); in SUITE()
79 for(int i = 1; i < elementsCount; i++) in SUITE() local
87 for(int i = 0; i < elementsCount; i++) in SUITE() local
89 CHECK_EQUAL(stackArray[i], (200 + i)); in SUITE()
100 for(int i = 0; i < 64; i++) in SUITE() local
112 for(int i = 0; i < 64; i++) in SUITE() local
171 for (int i = 0; i < elementsCount; i++) in SUITE() local
173 arrayView[i] = (100 + i); in SUITE()
177 for (int i = 0; i < elementsCount; i++) in SUITE() local
[all …]
H A DStackSizeTests.cpp40 for (uint32 i = 0; i < MT_ARRAY_SIZE(stackData); i++) in SUITE() local
42 stackData[i] = 0x0D; in SUITE()
55 for (uint32 i = 0; i < MT_ARRAY_SIZE(stackData); i++) in SUITE() local
57 stackData[i] = 0x0D; in SUITE()
93 for (size_t i = 0; i < MT_ARRAY_SIZE(taskHandles); ++i) in SUITE() local
97 if (i & 1) in SUITE()
104 taskHandles[i] = handle; in SUITE()
H A DPlatformTests.cpp164 for(uint32 i = 0; i < MT_ARRAY_SIZE(signalThreads); i++) in SUITE() local
166 signalThreads[i].Start(32768, EventStressTestSignalThreadFunc, nullptr); in SUITE()
169 for(uint32 i = 0; i < MT_ARRAY_SIZE(waitThreads); i++) in SUITE() local
171 waitThreads[i].Start(32768, EventStressTestWaitThreadFunc, nullptr); in SUITE()
201 for(int i = 0; i < iterationsCount; i++) in SUITE() local
212 for(int i = 0; i < iterationsCount; i++) in SUITE() local
244 for(uint32 i = 0; i < MT_ARRAY_SIZE(waitThreads); i++) in SUITE() local
246 waitThreads[i].Join(); in SUITE()
252 for(uint32 i = 0; i < MT_ARRAY_SIZE(signalThreads); i++) in SUITE() local
254 signalThreads[i].Join(); in SUITE()
H A DGroupTests.cpp46 for (size_t i = 0; i < MT_ARRAY_SIZE(tempData); i++) in SUITE() local
48 tempData[i] = cos((float)rand() / RAND_MAX) + sin((float)rand() / RAND_MAX); in SUITE()
64 for (size_t i = 0; i < MT_ARRAY_SIZE(tempData); i++) in SUITE() local
66 tempData[i] = cos((float)rand() / RAND_MAX); in SUITE()
85 for (size_t i = 0; i < MT_ARRAY_SIZE(tempData); i++) in SUITE() local
87 tempData[i] = sin((float)rand() / RAND_MAX); in SUITE()
H A DSimpleTests.cpp89 for (size_t i = 0; i < MT_ARRAY_SIZE(tasks); ++i) in SUITE() local
90 tasks[i].counter = &counter; in SUITE()
189 for(int32 i = 0; i < taskCount; i++) in SUITE() local
194 for(int32 i = 0; i < workersCount; i++) in SUITE() local
196 WorkerThreadState& state = workerStates[i]; in SUITE()
205 for(int32 i = 0; i < workersCount; i++) in SUITE() local
207 WorkerThreadState& state = workerStates[i]; in SUITE()
H A DPriorityTests.cpp178 for(uint32 i = 0; i < TASK_COUNT; i++) in SUITE() local
180 taskHandles[index] = lowPriorityTasksPool.Alloc(TaskLow(i)); in SUITE()
184 for(uint32 i = 0; i < TASK_COUNT; i++) in SUITE() local
186 taskHandles[index] = highPriorityTasksPool.Alloc(TaskHigh(i)); in SUITE()
190 for(uint32 i = 0; i < TASK_COUNT; i++) in SUITE() local
192 taskHandles[index] = normalPriorityTasksPool.Alloc(TaskNormal(i)); in SUITE()
199 for(uint32 i = 0; i < MT_ARRAY_SIZE(workerState); i++) in SUITE() local
201 workerState[i].Reset(); in SUITE()
H A DAtomicTests.cpp175 for(uint32 i = 0; i < randDelay; i++) in SUITE() local
177 res += sin((float)i); in SUITE()
217 for(uint32 i = 0; i < threadsCount; i++) in SUITE() local
219 threads[i].Start(16384, ThreadFunc, nullptr); in SUITE()
224 for(uint32 i = 0; i < threadsCount; i++) in SUITE() local
226 threads[i].Join(); in SUITE()
H A DSubtasksTests.cpp135 for (int i = 0; i < 2; ++i) in SUITE() local
184 for (int i = 0; i < MT_ITERATIONS_COUNT; ++i) in SUITE() local
191 printf("Timeout: Failed iteration %d\n", i); in SUITE()
263 for (int i = 0; i < 16; ++i) in SUITE() local
265 task[i].data = &sum; in SUITE()
266 scheduler.RunAsync(MT::TaskGroup::Default(), &task[i], 1); in SUITE()
H A DFireAndForget.cpp158 for (int i = 0; i < 20000; i++) in SUITE() local
180 for (size_t i = 0; i < MT_ARRAY_SIZE(tasks); ++i) in SUITE() local
182 tasks[i].taskPool = &taskPool; in SUITE()
209 for (size_t i = 0; i < MT_ARRAY_SIZE(taskHandles); ++i) in SUITE() local
211 taskHandles[i] = taskPool.Alloc(SimpleTask(&doCounter, &dtorCounter, &taskPool)); in SUITE()
212 CHECK_EQUAL(true, taskHandles[i].IsValid()); in SUITE()
/TaskScheduler/Scheduler/Include/
H A DMTStaticVector.h77 for (uint32 i = 0; i < count; i++) in count() local
79 CopyCtor(Begin() + i, defaultElement); in count()
85 for (uint32 i = 0; i < count; i++) in ~StaticVector() local
87 Dtor(Begin() + i); in ~StaticVector()
91 inline const T &operator[]( uint32 i ) const
93 MT_ASSERT( i < Size(), "bad index" );
94 return *IndexToObject(i);
97 inline T &operator[]( uint32 i )
99 MT_ASSERT( i < Size(), "bad index" );
100 return *IndexToObject(i);
H A DMTTaskQueue.h108 for (size_t i = 0; i < queueSize; i++) in Clear() local
110 T* pElement = Buffer() + ((begin + i) & MASK); in Clear()
222 for(uint32 i = 0; i < MT_ARRAY_SIZE(queues); i++) in TaskQueue() local
224 queues[i].Create(); in TaskQueue()
243 for(size_t i = 0; i < MT_ARRAY_SIZE(queues); i++) in Add() local
245 Queue& queue = queues[i]; in Add()
253 for(size_t i = 0; i < count; i++) in Add() local
255 const T& item = itemArray[i]; in Add()
261 bool res = queue.Add(itemArray[i]); in Add()
H A DMTArrayView.h59 const T &operator[]( size_t i ) const
61 MT_ASSERT( i < Size(), "bad index" );
62 return data[i];
65 T &operator[]( size_t i )
67 MT_ASSERT( i < Size(), "bad index" );
68 return data[i];
H A DMTQueueMPMC.h82 for (uint32 i = 0; i < CAPACITY; i++) in LockFreeQueueMPMC() local
84 buffer[i].sequence.StoreRelaxed(i); in LockFreeQueueMPMC()
/TaskScheduler/ThirdParty/UnitTest++/UnitTest++/
H A DChecks.h63 for (int i = 0; i < count; ++i) in CheckArrayEqual() local
64 equal &= (expected[i] == actual[i]); in CheckArrayEqual()
90 for (int i = 0; i < count; ++i) in ArrayAreClose() local
91 equal &= AreClose(expected[i], actual[i], tolerance); in ArrayAreClose()
123 for (int i = 0; i < rows; ++i) in CheckArray2DClose() local
124 equal &= ArrayAreClose(expected[i], actual[i], columns, tolerance); in CheckArray2DClose()
H A DXmlTestReporter.cpp59 for (DeferredTestResultList::const_iterator i = results.begin(); i != results.end(); ++i) in ReportSummary() local
61 BeginTest(m_ostream, *i); in ReportSummary()
63 if (i->failed) in ReportSummary()
64 AddFailure(m_ostream, *i); in ReportSummary()
66 EndTest(m_ostream, *i); in ReportSummary()
/TaskScheduler/Scheduler/Source/
H A DMTScheduler.cpp61 for (uint32 i = 0; i < MT_MAX_STANDART_FIBERS_COUNT; i++) in TaskScheduler() local
73 for (uint32 i = 0; i < MT_MAX_EXTENDED_FIBERS_COUNT; i++) in TaskScheduler() local
88 for (int16 i = 0; i < TaskGroup::MT_MAX_GROUPS_COUNT; i++) in TaskScheduler() local
109 for (int32 i = 0; i < totalThreadsCount; i++) in TaskScheduler() local
131 for (int32 i = 0; i < totalThreadsCount; i++) in JoinWorkerThreads() local
137 for (int32 i = 0; i < totalThreadsCount; i++) in JoinWorkerThreads() local
634 for (size_t i = 0; i < buckets.Size(); ++i) in RunTasksImpl() local
653 for (size_t i = 0; i < buckets.Size(); ++i) in RunTasksImpl() local
696 for (size_t i = 0; i < buckets.Size(); ++i) in RunTasksImpl() local
827 for (int32 i = 0; i < threadsCount; i++) in IsWorkerThread() local
[all …]
/TaskScheduler/SchedulerTests/
H A Dmain.cpp72 for ( size_t i = 0; i < size; i++ ) in PosixSignalHandler() local
74 printf("[%zu, %lu] %s\n", i, (unsigned long int)currentThread, symbollist[i]); in PosixSignalHandler()
/TaskScheduler/Scheduler/Include/Platform/Common/
H A DMTSpinWait.h70 for (int32 i = 0; i < 50; i++) in SpinOnce() local

12