- u16 depth; /* (V) The number of levels in this B-tree */
- u32 root; /* (V) The node number of the root node */
- u32 leaf_count; /* (V) The number of leaf records */
- u32 leaf_head; /* (V) The number of the first leaf node */
- u32 leaf_tail; /* (V) The number of the last leaf node */
- u16 node_size; /* (F) The number of bytes in a node (=512) */
- u16 max_key_len; /* (F) The length of a key in an index node */
- u32 node_count; /* (V) The total number of nodes */
- u32 free_nodes; /* (V) The number of unused nodes */
+ __be16 depth; /* (V) The number of levels in this B-tree */
+ __be32 root; /* (V) The node number of the root node */
+ __be32 leaf_count; /* (V) The number of leaf records */
+ __be32 leaf_head; /* (V) The number of the first leaf node */
+ __be32 leaf_tail; /* (V) The number of the last leaf node */
+ __be16 node_size; /* (F) The number of bytes in a node (=512) */
+ __be16 max_key_len; /* (F) The length of a key in an index node */
+ __be32 node_count; /* (V) The total number of nodes */
+ __be32 free_nodes; /* (V) The number of unused nodes */