Searched refs:N (Results 1 – 8 of 8) sorted by relevance
72 template< size_t N, size_t C = 1 >77 result = IsPow2Recurse< N / 2, C * 2 >::result91 template< size_t N >96 result = IsPow2Recurse< N - 1 >::result == N ? 1 : 0
31 template<int N>34 enum {value = N && !(N & (N - 1))};
232 template<typename T, size_t N>240 static const size_t MASK = (N - 1);264 static_assert( MT::StaticIsPow2<N>::result, "Task pool capacity must be power of 2"); in TaskPool()266 size_t bytesCount = sizeof(PoolItem) * N; in TaskPool()269 for(size_t idx = 0; idx < N; idx++) in TaskPool()281 for(size_t idx = 0; idx < N; idx++) in ~TaskPool()
32 #define OFF(N) (4*(N)) argument
32 #define OFF(N) (8*(N)) argument
43 template<size_t N> in SUITE()46 …MT_DECLARE_TASK(DeepSubtaskQueue<N>, MT::StackRequirements::STANDARD, MT::TaskPriority::NORMAL, MT… in SUITE()54 DeepSubtaskQueue<N - 1> taskNm1; in SUITE()55 DeepSubtaskQueue<N - 2> taskNm2; in SUITE()