Lines Matching refs:fn_bit
133 static __be32 addr_bit_set(const void *token, int fn_bit) in addr_bit_set() argument
143 return (__force __be32)(1 << ((~fn_bit ^ BITOP_BE32_SWIZZLE) & 0x1f)) & in addr_bit_set()
144 addr[fn_bit >> 5]; in addr_bit_set()
788 if (plen < fn->fn_bit || in fib6_add_1()
789 !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) { in fib6_add_1()
806 if (plen == fn->fn_bit) { in fib6_add_1()
826 dir = addr_bit_set(addr, fn->fn_bit); in fib6_add_1()
862 ln->fn_bit = plen; in fib6_add_1()
918 in->fn_bit = bit; in fib6_add_1()
931 ln->fn_bit = plen; in fib6_add_1()
956 ln->fn_bit = plen; in fib6_add_1()
1636 dir = addr_bit_set(args->addr, fn->fn_bit); in fib6_node_lookup_1()
1740 if (plen <= fn->fn_bit) in fib6_locate_1()
1751 if (plen < fn->fn_bit || in fib6_locate_1()
1752 !ipv6_prefix_equal(&key->addr, addr, fn->fn_bit)) in fib6_locate_1()
1755 if (plen == fn->fn_bit) in fib6_locate_1()
1765 if (addr_bit_set(addr, fn->fn_bit)) in fib6_locate_1()
1880 pr_debug("fixing tree: plen=%d iter=%d\n", fn->fn_bit, iter); in fib6_repair_tree()