Lines Matching refs:mask
192 unsigned long r_index, h_index, index, mask; in prio_tree_insert() local
202 mask = 1UL << (root->index_bits - 1); in prio_tree_insert()
204 while (mask) { in prio_tree_insert()
229 if (index & mask) { in prio_tree_insert()
247 mask >>= 1; in prio_tree_insert()
249 if (!mask) { in prio_tree_insert()
250 mask = 1UL << (BITS_PER_LONG - 1); in prio_tree_insert()
326 iter->mask >>= 1; in prio_tree_left()
327 if (iter->mask) { in prio_tree_left()
335 iter->mask = ULONG_MAX; in prio_tree_left()
338 iter->mask = 1UL << (BITS_PER_LONG - 1); in prio_tree_left()
358 value = iter->value | iter->mask; in prio_tree_right()
367 iter->mask >>= 1; in prio_tree_right()
369 if (iter->mask) { in prio_tree_right()
377 iter->mask = ULONG_MAX; in prio_tree_right()
380 iter->mask = 1UL << (BITS_PER_LONG - 1); in prio_tree_right()
392 if (iter->mask == ULONG_MAX) in prio_tree_parent()
393 iter->mask = 1UL; in prio_tree_parent()
395 iter->mask = 1UL; in prio_tree_parent()
397 iter->mask <<= 1; in prio_tree_parent()
400 if (!iter->size_level && (iter->value & iter->mask)) in prio_tree_parent()
401 iter->value ^= iter->mask; in prio_tree_parent()
434 iter->mask = 1UL << (root->index_bits - 1); in prio_tree_first()