Searched refs:max_depth (Results 1 – 2 of 2) sorted by relevance
211 void split_to_fill(depth_t max_depth) { in split_to_fill() argument212 while( my_size < MaxCapacity && is_divisible(max_depth) ) { in split_to_fill()251 bool is_divisible(depth_t max_depth) { in is_divisible() argument252 return back_depth() < max_depth && back().is_divisible(); in is_divisible()427 depth_t max_depth() { return my_max_depth; } in max_depth() function434 if( !range.is_divisible() || !self().max_depth() ) { in work_balance()440 range_pool.split_to_fill(self().max_depth()); // fill range pool in work_balance()447 … if( range_pool.is_divisible(self().max_depth()) ) // was not enough depth to fork a task in work_balance()
53 size_t FindNumOfTasks(size_t max_depth) { in FindNumOfTasks() argument54 if( max_depth == 0 ) in FindNumOfTasks()56 return max_depth * FindNumOfTasks( max_depth - 1 ) + 1; in FindNumOfTasks()