Daniel Dunbar | fd08999 | 2009-06-26 16:47:03 +0000 | [diff] [blame] | 1 | //===-- popcountdi2.c - Implement __popcountdi2 ----------------------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file implements __popcountdi2 for the compiler_rt library. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
| 14 | #include "int_lib.h" |
| 15 | |
| 16 | // Returns: count of 1 bits |
| 17 | |
| 18 | si_int |
| 19 | __popcountdi2(di_int a) |
| 20 | { |
| 21 | du_int x2 = (du_int)a; |
| 22 | x2 = x2 - ((x2 >> 1) & 0x5555555555555555uLL); |
| 23 | // Every 2 bits holds the sum of every pair of bits (32) |
| 24 | x2 = ((x2 >> 2) & 0x3333333333333333uLL) + (x2 & 0x3333333333333333uLL); |
| 25 | // Every 4 bits holds the sum of every 4-set of bits (3 significant bits) (16) |
| 26 | x2 = (x2 + (x2 >> 4)) & 0x0F0F0F0F0F0F0F0FuLL; |
| 27 | // Every 8 bits holds the sum of every 8-set of bits (4 significant bits) (8) |
| 28 | su_int x = (su_int)(x2 + (x2 >> 32)); |
| 29 | // The lower 32 bits hold four 16 bit sums (5 significant bits). |
| 30 | // Upper 32 bits are garbage |
| 31 | x = x + (x >> 16); |
| 32 | // The lower 16 bits hold two 32 bit sums (6 significant bits). |
| 33 | // Upper 16 bits are garbage |
| 34 | return (x + (x >> 8)) & 0x0000007F; // (7 significant bits) |
| 35 | } |