Lines Matching defs:divisor
982 * Do a two-level split. If chunk_size is bigger than divisor
983 * (pool->block_size), we return as many divisor sized blocks as we can, from
995 uint32_t divisor = pool->block_size;
996 uint32_t nblocks = chunk_size / divisor;
997 uint32_t rest = chunk_size - nblocks * divisor;
1000 /* First return divisor aligned and sized chunks. We start returning
1002 * aligned to divisor. Also anv_state_pool_return_blocks() only accepts
1006 anv_state_pool_return_blocks(pool, offset, nblocks, divisor);
1010 divisor /= 2;
1012 if (small_size > 0 && small_size < divisor)
1013 divisor = small_size;
1017 /* Just as before, return larger divisor aligned blocks from the end of the
1020 while (chunk_size > 0 && divisor >= min_size) {
1021 nblocks = chunk_size / divisor;
1022 rest = chunk_size - nblocks * divisor;
1025 nblocks, divisor);
1028 divisor /= 2;