Benjamin Kramer b6516aeef1 Reimplement CTPOP legalization with the "best" algorithm from ...

http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel

In a silly microbenchmark on a 65 nm core2 this is 1.5x faster than the old
code in 32 bit mode and about 2x faster in 64 bit mode. It's also a lot shorter,
especially when counting 64 bit population on a 32 bit target.

I hope this is fast enough to replace Kernighan-style counting loops even when
the input is rather sparse.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@123547 91177308-0d34-0410-b5e6-96231b3b80d8

2011-01-15 20:30:30 +00:00

..

Analysis

Teach LazyValueInfo that allocas aren't NULL. Over all of llvm-test, this saves

2011-01-15 09:16:12 +00:00

Archive

…

AsmParser

Allow unnamed_addr on declarations.

2011-01-15 08:15:00 +00:00

Bitcode

…

CodeGen

Reimplement CTPOP legalization with the "best" algorithm from

2011-01-15 20:30:30 +00:00

CompilerDriver

…

ExecutionEngine

…

Linker

Allow unnamed_addr on declarations.

2011-01-15 08:15:00 +00:00

MC

Use common style for .cfi directives

2011-01-14 21:57:39 +00:00

Object

…

Support

Support/PathV2: Implement has_magic in terms of get_magic.

2011-01-15 18:52:41 +00:00

Target

80-col.

2011-01-15 00:25:09 +00:00

Transforms

Add missing whitespace.

2011-01-15 18:42:52 +00:00

VMCore

Allow unnamed_addr on declarations.

2011-01-15 08:15:00 +00:00

Makefile

…