xref: /TaskScheduler/Scheduler/Include/MTTools.h (revision c7362320)
1f25ce65dSSergey Makeev // The MIT License (MIT)
2f25ce65dSSergey Makeev //
3f25ce65dSSergey Makeev // 	Copyright (c) 2015 Sergey Makeev, Vadim Slyusarev
4f25ce65dSSergey Makeev //
5f25ce65dSSergey Makeev // 	Permission is hereby granted, free of charge, to any person obtaining a copy
6f25ce65dSSergey Makeev // 	of this software and associated documentation files (the "Software"), to deal
7f25ce65dSSergey Makeev // 	in the Software without restriction, including without limitation the rights
8f25ce65dSSergey Makeev // 	to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9f25ce65dSSergey Makeev // 	copies of the Software, and to permit persons to whom the Software is
10f25ce65dSSergey Makeev // 	furnished to do so, subject to the following conditions:
11f25ce65dSSergey Makeev //
12f25ce65dSSergey Makeev //  The above copyright notice and this permission notice shall be included in
13f25ce65dSSergey Makeev // 	all copies or substantial portions of the Software.
14f25ce65dSSergey Makeev //
15f25ce65dSSergey Makeev // 	THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16f25ce65dSSergey Makeev // 	IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17f25ce65dSSergey Makeev // 	FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18f25ce65dSSergey Makeev // 	AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19f25ce65dSSergey Makeev // 	LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20f25ce65dSSergey Makeev // 	OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
21f25ce65dSSergey Makeev // 	THE SOFTWARE.
22f25ce65dSSergey Makeev 
2347d53e4dSSergey Makeev #pragma once
2447d53e4dSSergey Makeev #include <MTTypes.h>
2547d53e4dSSergey Makeev #include <MTPlatform.h>
2647d53e4dSSergey Makeev 
271e8563ffSSergey Makeev namespace MT
281e8563ffSSergey Makeev {
2947d53e4dSSergey Makeev 	template<class T>
Min(T a,T b)3047d53e4dSSergey Makeev 	T Min(T a, T b)
3147d53e4dSSergey Makeev 	{
3247d53e4dSSergey Makeev 		return a < b ? a : b;
3347d53e4dSSergey Makeev 	}
3447d53e4dSSergey Makeev 
3547d53e4dSSergey Makeev 	template<class T>
Max(T a,T b)3647d53e4dSSergey Makeev 	T Max(T a, T b)
3747d53e4dSSergey Makeev 	{
3847d53e4dSSergey Makeev 		return a < b ? b : a;
3947d53e4dSSergey Makeev 	}
4047d53e4dSSergey Makeev 
4147d53e4dSSergey Makeev 	template<class T>
Clamp(T val,T min,T max)4247d53e4dSSergey Makeev 	T Clamp(T val, T min, T max)
4347d53e4dSSergey Makeev 	{
4447d53e4dSSergey Makeev 		return Min(max, Max(min, val));
4547d53e4dSSergey Makeev 	}
4647d53e4dSSergey Makeev 
471e8563ffSSergey Makeev 
48*b7f5a220SSergey Makeev 	//////////////////////////////////////////////////////////////////////////
4947d53e4dSSergey Makeev 	class Timer
5047d53e4dSSergey Makeev 	{
5147d53e4dSSergey Makeev 		uint64 startMicroSeconds;
5247d53e4dSSergey Makeev 	public:
Timer()5347d53e4dSSergey Makeev 		Timer() : startMicroSeconds(MT::GetTimeMicroSeconds())
5447d53e4dSSergey Makeev 		{
5547d53e4dSSergey Makeev 		}
5647d53e4dSSergey Makeev 
GetPastMicroSeconds()5747d53e4dSSergey Makeev 		uint32 GetPastMicroSeconds() const
5847d53e4dSSergey Makeev 		{
5947d53e4dSSergey Makeev 			return (uint32)(MT::GetTimeMicroSeconds() - startMicroSeconds);
6047d53e4dSSergey Makeev 		}
6147d53e4dSSergey Makeev 
GetPastMilliSeconds()6247d53e4dSSergey Makeev 		uint32 GetPastMilliSeconds() const
6347d53e4dSSergey Makeev 		{
6447d53e4dSSergey Makeev 			return (uint32)((MT::GetTimeMicroSeconds() - startMicroSeconds) / 1000);
6547d53e4dSSergey Makeev 		}
6647d53e4dSSergey Makeev 	};
67*b7f5a220SSergey Makeev 
68*b7f5a220SSergey Makeev 
69*b7f5a220SSergey Makeev 
70*b7f5a220SSergey Makeev 	//Compile time pow2 check
71*b7f5a220SSergey Makeev 	//////////////////////////////////////////////////////////////////////////
72*b7f5a220SSergey Makeev 	template< size_t N, size_t C = 1 >
73*b7f5a220SSergey Makeev 	struct IsPow2Recurse
74*b7f5a220SSergey Makeev 	{
75*b7f5a220SSergey Makeev 		enum
76*b7f5a220SSergey Makeev 		{
77*b7f5a220SSergey Makeev 			result = IsPow2Recurse< N / 2, C * 2 >::result
78*b7f5a220SSergey Makeev 		};
79*b7f5a220SSergey Makeev 	};
80*b7f5a220SSergey Makeev 
81*b7f5a220SSergey Makeev 	template< size_t C >
82*b7f5a220SSergey Makeev 	struct IsPow2Recurse< 0, C >
83*b7f5a220SSergey Makeev 	{
84*b7f5a220SSergey Makeev 		enum
85*b7f5a220SSergey Makeev 		{
86*b7f5a220SSergey Makeev 			result = C
87*b7f5a220SSergey Makeev 		};
88*b7f5a220SSergey Makeev 	};
89*b7f5a220SSergey Makeev 
90*b7f5a220SSergey Makeev 
91*b7f5a220SSergey Makeev 	template< size_t N >
92*b7f5a220SSergey Makeev 	struct StaticIsPow2
93*b7f5a220SSergey Makeev 	{
94*b7f5a220SSergey Makeev 		enum
95*b7f5a220SSergey Makeev 		{
96*b7f5a220SSergey Makeev 			result = IsPow2Recurse< N - 1 >::result == N ? 1 : 0
97*b7f5a220SSergey Makeev 		};
98*b7f5a220SSergey Makeev 	};
99*b7f5a220SSergey Makeev 
100*b7f5a220SSergey Makeev 
101*b7f5a220SSergey Makeev 
10247d53e4dSSergey Makeev }
10347d53e4dSSergey Makeev 
104