radix_tree_is_internal_node
if (likely(!radix_tree_is_internal_node(entry) && entry))
return unlikely(radix_tree_is_internal_node(arg));
while (radix_tree_is_internal_node(node)) {
while (radix_tree_is_internal_node(node)) {
if (!radix_tree_is_internal_node(child)) {
} while (node->shift && radix_tree_is_internal_node(child));
if (radix_tree_is_internal_node(results[ret])) {
if (radix_tree_is_internal_node(results[ret])) {
} else if (!radix_tree_is_internal_node(child))
if (radix_tree_is_internal_node(node))
BUG_ON(radix_tree_is_internal_node(ret));
if (likely(radix_tree_is_internal_node(node))) {
if (radix_tree_is_internal_node(entry)) {
if (!radix_tree_is_internal_node(node))
if (radix_tree_is_internal_node(child))
if (!radix_tree_is_internal_node(child)) {
} else if (!radix_tree_is_internal_node(child))
BUG_ON(radix_tree_is_internal_node(item));
while (radix_tree_is_internal_node(node)) {
while (radix_tree_is_internal_node(node)) {
assert(!radix_tree_is_internal_node(item));
if (!radix_tree_is_internal_node(node))
if (!radix_tree_is_internal_node(node)) {
assert(!radix_tree_is_internal_node(item));