haproxy/ebtree
Willy Tarreau f82eb02830 OPTIM: ebtree: pack the struct eb_node to avoid holes on 64-bit
struct eb_node is 36 bytes on a 64-bit machine. It's thus rounded
up to 40 bytes, and when forming a struct eb32_node, another 4 bytes
are added, rounded up to 48 bytes. We waste 8 bytes of space on 48
bytes because of alignments. It's basically the same with memory
blocks and immediate strings.

By packing the structure, eb32_node is down to 40 bytes. This saves
16 bytes per struct task and 20 bytes per struct stksess, used to
store each stick-table key.
2013-12-07 01:36:08 +01:00
..
compiler.h
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
ebistree.c
ebistree.h
ebmbtree.c
ebmbtree.h MINOR: ebtree: add new eb_next_dup/eb_prev_dup() functions to visit duplicates 2013-05-07 16:10:02 +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