The rbtnode->rpz flag was left behind when rbt and rpz were disentangled
by CHANGES #4576. Removing it makes the comment above correct again.
This reduces the flags so they fit in a 32 bit word again. On 64
bit systems there is still padding so it doesn't change the size
of an rbtnode. On 32 bit systems it reduces an rbtnode by 4 bytes.
unsigned int namelen : 8; /*%< range is 1..255 */
unsigned int offsetlen : 8; /*%< range is 1..128 */
unsigned int oldnamelen : 8; /*%< range is 1..255 */
+ unsigned int : 0; /* end of bitfields c/o tree lock */
/*@}*/
- /* node needs to be cleaned from rpz */
- unsigned int rpz : 1;
- unsigned int : 0; /* end of bitfields c/o tree lock */
-
/*%
* These are needed for hashing. The 'uppernode' points to the
* node's superdomain node in the parent subtree, so that it can
node->left = NULL;
node->down = NULL;
node->data = NULL;
- node->rpz = 0;
node->hashnext = NULL;
node->hashval = 0;