72     const std::size_t factor = 4;  in get_initial_auto_partitioner_divisor()  local
73     return factor * static_cast<std::size_t>(max_concurrency());  in get_initial_auto_partitioner_divisor()
91     void resize(unsigned factor) {  in resize()  argument
94         std::size_t new_size = factor ? factor * max_threads_in_arena : 0;  in resize()
302     static const unsigned factor = 1;  member
303 … adaptive_mode() : my_divisor(get_initial_auto_partitioner_divisor() / 4 * my_partition::factor) {}  in adaptive_mode()
330         std::size_t portion = split_obj.right() * my_partition::factor;  in do_split()
331         portion = (portion + my_partition::factor/2) & (0ul - my_partition::factor);  in do_split()
336         return self().my_divisor > my_partition::factor;  in is_divisible()
346         std::size_t n = self().my_divisor / my_partition::factor;  in get_split()
409 …if( !(self().my_divisor / Mode::my_partition::factor) ) { // if not from the top P tasks of binary…  in check_being_stolen()
532     static const unsigned factor = 1 << factor_power; // number of slots in affinity array per task
535         __TBB_ASSERT( (factor&(factor-1))==0, "factor must be power of two" );  in affinity_partition_type()
536         ap.resize(factor);  in affinity_partition_type()
555                 spawn(t, ctx, slot_id(my_head / factor));  in spawn_task()