search for: d5786

All, About two months ago I posted a patch that hoisted the hottest case statement from a switch statement during ISelLowering. See: http://reviews.llvm.org/D5786 Sean was rather adamant about using a Huffman tree (and I agree this is a more complete solution), so I'd like to put a patch together. That being said, I have a few questions. The current switch lowering code sorts based on case values and is lowered with a combination of binary trees, look...

> On Mon, Dec 15, 2014 at 9:57 AM, Chad Rosier <mcrosier at codeaurora.org> > wrote: >> All, >> About two months ago I posted a patch that hoisted the hottest case >> statement from a switch statement during ISelLowering. >> >> See: http://reviews.llvm.org/D5786 >> >> Sean was rather adamant about using a Huffman tree (and I agree this is >> a >> more complete solution), so I'd like to put a patch together. > > I think this sounds really cool! > >> That being >> said, I have a few questions. >> >&gt...

...;mcrosier at codeaurora.org> >> > wrote: >> >> All, >> >> About two months ago I posted a patch that hoisted the hottest case >> >> statement from a switch statement during ISelLowering. >> >> >> >> See: http://reviews.llvm.org/D5786 >> >> >> >> Sean was rather adamant about using a Huffman tree (and I agree this >> is >> >> a >> >> more complete solution), so I'd like to put a patch together. >> > >> > I think this sounds really cool! >> > &gt...

...wrote: >> >> >> All, >> >> >> About two months ago I posted a patch that hoisted the hottest case >> >> >> statement from a switch statement during ISelLowering. >> >> >> >> >> >> See: http://reviews.llvm.org/D5786 >> >> >> >> >> >> Sean was rather adamant about using a Huffman tree (and I agree this >> >> is >> >> >> a >> >> >> more complete solution), so I'd like to put a patch together. >> >> > >> &...