449     d_bits = 0;  in Netmask()
460     d_bits = value;  in setBits()
462     if (d_bits < 32) {  in setBits()
463       d_mask = ~(0xFFFFFFFF >> d_bits);  in setBits()
474       uint8_t bytes = d_bits/8;  in setBits()
476       uint8_t bits = d_bits % 8;  in setBits()
521       uint8_t bytes=d_bits/8, n;  in match()
531       uint8_t bits= d_bits % 8;  in match()
554     return d_network.toStringNoInterface()+"/"+std::to_string((unsigned int)d_bits);  in toString()
574     return d_bits;  in getBits()
595     if (d_bits > rhs.d_bits)  in operator <()
597     if (d_bits < rhs.d_bits)  in operator <()
610     return tie(d_network, d_bits) == tie(rhs.d_network, rhs.d_bits);  in operator ==()
620     return Netmask(getMaskedNetwork(), d_bits);  in getNormalized()
624     return Netmask(d_network, std::min(d_bits, bits));  in getSuper()
640     if (bit < -d_bits)  in getBit()
644         if (bit >= 32 || bit < (32 - d_bits))  in getBit()
648         if (bit >= 128 || bit < (128 - d_bits))  in getBit()
657   uint8_t d_bits;  member in Netmask
698       parent(nullptr), node(), assigned(false), d_bits(0) {  in TreeNode()
702       assigned(false), d_bits(key.getAddressBits()) {
707       d_bits = node.first.getBits();  in make_left()
715       d_bits = node.first.getBits();  in make_right()
739       new_node->d_bits = bits;  in split()
776       branch_node->d_bits = bits;  in fork()
860     int d_bits; //<! How many bits have been used so far  member in NetmaskTree::TreeNode
1032       if (bits >= node->d_bits) {  in insert()
1146       if (bits >= node->d_bits) {  in lookup()
1197       if (bits >= node->d_bits) {  in erase()