Joern RENNECKE schrieb:
In http://gcc.gnu.org/ml/gcc/2006-07/msg00156.html, your wrote:
We could use a cheap hash and base start compare / branch trees in
every hash bin.
Say we have a 16 k range, 200 nodes, and want to keep the hash
bin/node ratio between 2 and 4.
Let i be the switch argume
Hi,
while dealing with autogenerated code I found that GCC often outputs compare
trees instead of branch tables for switch statements. I found that GCC uses the
density of case labels within their spanned range as the key criterion. If the
density of labels is smaller than 10% (33% for size op
