mirror of
https://github.com/opnsense/src.git
synced 2026-05-20 17:09:30 -04:00
ef8821e5db
It seems there have only been a small amount to the compiler-rt source code in the mean time. I'd rather have the code in sync as much as possible by the time we release 9.0. Changes: - The libcompiler_rt library is now dual licensed under both the University of Illinois "BSD-Like" license and the MIT license. - Our local modifications for using .hidden instead of .private_extern have been upstreamed, meaning our changes to lib/assembly.h can now be reverted. - A possible endless recursion in __modsi3() has been fixed. - Support for ARM EABI has been added, but it has no effect on FreeBSD (yet). - The functions __udivmodsi4 and __divmodsi4 have been added. Requested by: many, including bf@ and Pedro Giffuni
37 lines
1.4 KiB
C
37 lines
1.4 KiB
C
/* ===-- popcountdi2.c - Implement __popcountdi2 ----------------------------===
|
|
*
|
|
* The LLVM Compiler Infrastructure
|
|
*
|
|
* This file is dual licensed under the MIT and the University of Illinois Open
|
|
* Source Licenses. See LICENSE.TXT for details.
|
|
*
|
|
* ===----------------------------------------------------------------------===
|
|
*
|
|
* This file implements __popcountdi2 for the compiler_rt library.
|
|
*
|
|
* ===----------------------------------------------------------------------===
|
|
*/
|
|
#include "abi.h"
|
|
|
|
#include "int_lib.h"
|
|
|
|
/* Returns: count of 1 bits */
|
|
|
|
COMPILER_RT_ABI si_int
|
|
__popcountdi2(di_int a)
|
|
{
|
|
du_int x2 = (du_int)a;
|
|
x2 = x2 - ((x2 >> 1) & 0x5555555555555555uLL);
|
|
/* Every 2 bits holds the sum of every pair of bits (32) */
|
|
x2 = ((x2 >> 2) & 0x3333333333333333uLL) + (x2 & 0x3333333333333333uLL);
|
|
/* Every 4 bits holds the sum of every 4-set of bits (3 significant bits) (16) */
|
|
x2 = (x2 + (x2 >> 4)) & 0x0F0F0F0F0F0F0F0FuLL;
|
|
/* Every 8 bits holds the sum of every 8-set of bits (4 significant bits) (8) */
|
|
su_int x = (su_int)(x2 + (x2 >> 32));
|
|
/* The lower 32 bits hold four 16 bit sums (5 significant bits). */
|
|
/* Upper 32 bits are garbage */
|
|
x = x + (x >> 16);
|
|
/* The lower 16 bits hold two 32 bit sums (6 significant bits). */
|
|
/* Upper 16 bits are garbage */
|
|
return (x + (x >> 8)) & 0x0000007F; /* (7 significant bits) */
|
|
}
|