[Bug tree-optimization/83171] std::bitset::count not inlining __popcountdi2

2017-11-26 Thread pinskia at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=83171 Andrew Pinski changed: What|Removed |Added Severity|normal |enhancement

[Bug tree-optimization/83171] std::bitset::count not inlining __popcountdi2

2017-11-26 Thread pinskia at gcc dot gnu.org
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=83171 Andrew Pinski changed: What|Removed |Added Target|x86_64-linux-gnu| Status|UNCONFIRMED

[Bug c++/83171] New: std::bitset::count not inlining __popcountdi2

2017-11-26 Thread lectem at gmail dot com
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=83171 Bug ID: 83171 Summary: std::bitset::count not inlining __popcountdi2 Product: gcc Version: 7.2.0 Status: UNCONFIRMED Severity: normal Priority: P3 Component: c

bitset::count

2009-07-01 Thread Andreas Klein
Dear gcc developers, Im am not sure if this is the right email address. Please give me the right email address if necessary. I checked the implementation of std::bitset::count in gcc and find that it uses a table look up. This is not optimal. First on 64-bit machines divide-and-conquer