Searched refs:is_power_of_two (Results 1 – 5 of 5) sorted by relevance
29 is_power_of_two(unsigned long n) in is_power_of_two() function37 assert(is_power_of_two(npow2) && npow2 > n); in test_next_pow2_val()43 assert(!is_power_of_two(0)); in test_next_pow2()44 assert(is_power_of_two(1)); in test_next_pow2()45 assert(is_power_of_two(2)); in test_next_pow2()46 assert(!is_power_of_two(3)); in test_next_pow2()
221 const bool is_power_of_two = isPowerOfTwo(line_len);222 const Index good_composite = is_power_of_two ? 0 : findGoodComposite(line_len);223 const Index log_len = is_power_of_two ? getLog2(line_len) : getLog2(good_composite);225 …ComplexScalar* a = is_power_of_two ? NULL : (ComplexScalar*)m_device.allocate(sizeof(ComplexScalar…226 …ComplexScalar* b = is_power_of_two ? NULL : (ComplexScalar*)m_device.allocate(sizeof(ComplexScalar…227 …ComplexScalar* pos_j_base_powered = is_power_of_two ? NULL : (ComplexScalar*)m_device.allocate(siz…228 if (!is_power_of_two) {265 if (is_power_of_two) {284 if (!is_power_of_two) {
472 bool is_power_of_two = base::bits::IsPowerOfTwo(radix()); in HandleSpecialCases() local473 if (!is_power_of_two && radix() != 10) return; in HandleSpecialCases()478 result_ = is_power_of_two ? HandlePowerOfTwoCase(vector.start()) in HandleSpecialCases()483 result_ = is_power_of_two ? HandlePowerOfTwoCase(vector.start()) in HandleSpecialCases()
501 is_power_of_two (unsigned long word) in is_power_of_two() function
337 if (is_power_of_two (INFO->journal_block_count)) in reiserfs_mount()