"Fossies" - the Fresh Open Source Software Archive  

Source code changes of the file "ebtree/ebtree.h" between
haproxy-2.0.13.tar.gz and haproxy-2.0.14.tar.gz

About: HAProxy is a TCP/HTTP reverse proxy which is particularly suited for high availability environments. LTS (Long-Term Support) release.

ebtree.h  (haproxy-2.0.13):ebtree.h  (haproxy-2.0.14)
skipping to change at line 370 skipping to change at line 370
* too, which always has its right branch NULL (+/1 low-order bits). * too, which always has its right branch NULL (+/1 low-order bits).
*/ */
struct eb_root { struct eb_root {
eb_troot_t *b[EB_NODE_BRANCHES]; /* left and right branches */ eb_troot_t *b[EB_NODE_BRANCHES]; /* left and right branches */
}; };
/* The eb_node contains the two parts, one for the leaf, which always exists, /* The eb_node contains the two parts, one for the leaf, which always exists,
* and one for the node, which remains unused in the very first node inserted * and one for the node, which remains unused in the very first node inserted
* into the tree. This structure is 20 bytes per node on 32-bit machines. Do * into the tree. This structure is 20 bytes per node on 32-bit machines. Do
* not change the order, benchmarks have shown that it's optimal this way. * not change the order, benchmarks have shown that it's optimal this way.
* Note: be careful about this struct's alignment if it gets included into
* another struct and some atomic ops are expected on the keys or the node.
*/ */
struct eb_node { struct eb_node {
struct eb_root branches; /* branches, must be at the beginning */ struct eb_root branches; /* branches, must be at the beginning */
eb_troot_t *node_p; /* link node's parent */ eb_troot_t *node_p; /* link node's parent */
eb_troot_t *leaf_p; /* leaf node's parent */ eb_troot_t *leaf_p; /* leaf node's parent */
short int bit; /* link's bit position. */ short int bit; /* link's bit position. */
short unsigned int pfx; /* data prefix length, always related to leaf */ short unsigned int pfx; /* data prefix length, always related to leaf */
} __attribute__((packed)); } __attribute__((packed));
/* Return the structure of type <type> whose member <member> points to <ptr> */ /* Return the structure of type <type> whose member <member> points to <ptr> */
 End of changes. 1 change blocks. 
0 lines changed or deleted 2 lines changed or added

Home  |  About  |  Features  |  All  |  Newest  |  Dox  |  Diffs  |  RSS Feeds  |  Screenshots  |  Comments  |  Imprint  |  Privacy  |  HTTP(S)