Skip to content

Add ctpop and other bit counting intrinsics #2777

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
eholk opened this issue Jul 2, 2012 · 4 comments
Closed

Add ctpop and other bit counting intrinsics #2777

eholk opened this issue Jul 2, 2012 · 4 comments

Comments

@eholk
Copy link
Contributor

eholk commented Jul 2, 2012

@boggle suggested adding these in a comment on 0a99912#commitcomment-1527123

@eholk
Copy link
Contributor Author

eholk commented Jul 17, 2012

It'd be nice to have specific use cases for these. Are there programs that we cannot write now that we want to write that would use these intrinsics?

@boggle
Copy link
Contributor

boggle commented Aug 22, 2012

I could use them in the sudoku solver we have as a performance test. Other uses: SAT3 solvers, chess engines (or so I've heard), computing the hamming weight, bitfield based index structures may benefit, and there was a hash table algorithm that uses them.

@auroranockert
Copy link
Contributor

I added a pull-request implementing these intrinsics, if someone wants to have a look: #4245

catamorphism added a commit that referenced this issue Dec 23, 2012
Add support for bitcount intrinsics Issue #2777
@graydon
Copy link
Contributor

graydon commented Feb 25, 2013

this landed. Thanks!

@graydon graydon closed this as completed Feb 25, 2013
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

4 participants