haproxy/ebtree
Willy Tarreau 319f078d6f MINOR: ebtree: save 8 bytes in struct eb32sc_node
There is a 4-bytes hole in this structure after the eb_node and the
last field is 4-bytes as well, resulting in a total of 64 bytes with
8 bytes holes. Just moving the key after the eb_node (like in eb32_node)
fills the hole and reduces the structure's size by 8 bytes.
2018-10-21 06:56:57 +02:00
..
compiler.h
eb32sctree.c BUG/MAJOR: ebtree/scope: properly tag upper nodes during insertion 2017-11-15 19:43:05 +01:00
eb32sctree.h MINOR: ebtree: save 8 bytes in struct eb32sc_node 2018-10-21 06:56:57 +02:00
eb32tree.c
eb32tree.h MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates 2013-05-07 16:10:02 +02:00
eb64tree.c
eb64tree.h MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates 2013-05-07 16:10:02 +02:00
ebimtree.c
ebimtree.h MINOR: protect ebimtree/ebistree against multiple inclusions 2014-03-15 07:48:25 +01:00
ebistree.c
ebistree.h MINOR: protect ebimtree/ebistree against multiple inclusions 2014-03-15 07:48:25 +01:00
ebmbtree.c
ebmbtree.h DOC: ebtree: indicate that prefix insertion/lookup may be used with strings 2014-05-10 08:36:19 +02:00
ebpttree.c
ebpttree.h MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates 2013-05-07 16:10:02 +02:00
ebsttree.c
ebsttree.h
ebtree.c
ebtree.h OPTIM: ebtree: pack the struct eb_node to avoid holes on 64-bit 2013-12-07 01:36:08 +01:00
LICENSE