1*7c3d14c8STreehugger Robot //===-- popcountsi2_test.c - Test __popcountsi2 ---------------------------===// 2*7c3d14c8STreehugger Robot // 3*7c3d14c8STreehugger Robot // The LLVM Compiler Infrastructure 4*7c3d14c8STreehugger Robot // 5*7c3d14c8STreehugger Robot // This file is dual licensed under the MIT and the University of Illinois Open 6*7c3d14c8STreehugger Robot // Source Licenses. See LICENSE.TXT for details. 7*7c3d14c8STreehugger Robot // 8*7c3d14c8STreehugger Robot //===----------------------------------------------------------------------===// 9*7c3d14c8STreehugger Robot // 10*7c3d14c8STreehugger Robot // This file tests __popcountsi2 for the compiler_rt library. 11*7c3d14c8STreehugger Robot // 12*7c3d14c8STreehugger Robot //===----------------------------------------------------------------------===// 13*7c3d14c8STreehugger Robot 14*7c3d14c8STreehugger Robot #include "int_lib.h" 15*7c3d14c8STreehugger Robot #include <stdio.h> 16*7c3d14c8STreehugger Robot #include <stdlib.h> 17*7c3d14c8STreehugger Robot 18*7c3d14c8STreehugger Robot // Returns: count of 1 bits 19*7c3d14c8STreehugger Robot 20*7c3d14c8STreehugger Robot COMPILER_RT_ABI si_int __popcountsi2(si_int a); 21*7c3d14c8STreehugger Robot naive_popcount(si_int a)22*7c3d14c8STreehugger Robotint naive_popcount(si_int a) 23*7c3d14c8STreehugger Robot { 24*7c3d14c8STreehugger Robot int r = 0; 25*7c3d14c8STreehugger Robot for (; a; a = (su_int)a >> 1) 26*7c3d14c8STreehugger Robot r += a & 1; 27*7c3d14c8STreehugger Robot return r; 28*7c3d14c8STreehugger Robot } 29*7c3d14c8STreehugger Robot test__popcountsi2(si_int a)30*7c3d14c8STreehugger Robotint test__popcountsi2(si_int a) 31*7c3d14c8STreehugger Robot { 32*7c3d14c8STreehugger Robot si_int x = __popcountsi2(a); 33*7c3d14c8STreehugger Robot si_int expected = naive_popcount(a); 34*7c3d14c8STreehugger Robot if (x != expected) 35*7c3d14c8STreehugger Robot printf("error in __popcountsi2(0x%X) = %d, expected %d\n", 36*7c3d14c8STreehugger Robot a, x, expected); 37*7c3d14c8STreehugger Robot return x != expected; 38*7c3d14c8STreehugger Robot } 39*7c3d14c8STreehugger Robot 40*7c3d14c8STreehugger Robot char assumption_2[sizeof(si_int)*CHAR_BIT == 32] = {0}; 41*7c3d14c8STreehugger Robot main()42*7c3d14c8STreehugger Robotint main() 43*7c3d14c8STreehugger Robot { 44*7c3d14c8STreehugger Robot if (test__popcountsi2(0)) 45*7c3d14c8STreehugger Robot return 1; 46*7c3d14c8STreehugger Robot if (test__popcountsi2(1)) 47*7c3d14c8STreehugger Robot return 1; 48*7c3d14c8STreehugger Robot if (test__popcountsi2(2)) 49*7c3d14c8STreehugger Robot return 1; 50*7c3d14c8STreehugger Robot if (test__popcountsi2(0xFFFFFFFD)) 51*7c3d14c8STreehugger Robot return 1; 52*7c3d14c8STreehugger Robot if (test__popcountsi2(0xFFFFFFFE)) 53*7c3d14c8STreehugger Robot return 1; 54*7c3d14c8STreehugger Robot if (test__popcountsi2(0xFFFFFFFF)) 55*7c3d14c8STreehugger Robot return 1; 56*7c3d14c8STreehugger Robot int i; 57*7c3d14c8STreehugger Robot for (i = 0; i < 10000; ++i) 58*7c3d14c8STreehugger Robot if (test__popcountsi2(rand())) 59*7c3d14c8STreehugger Robot return 1; 60*7c3d14c8STreehugger Robot 61*7c3d14c8STreehugger Robot return 0; 62*7c3d14c8STreehugger Robot } 63