1 //===-- popcountti2_test.c - Test __popcountti2 ----------------------------===// 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 tests __popcountti2 for the compiler_rt library. 11 // 12 //===----------------------------------------------------------------------===// 13 14 #if __x86_64 15 16 #include "int_lib.h" 17 #include <stdio.h> 18 #include <stdlib.h> 19 20 // Returns: count of 1 bits 21 22 si_int __popcountti2(ti_int a); 23 24 int naive_popcount(ti_int a) 25 { 26 int r = 0; 27 for (; a; a = (tu_int)a >> 1) 28 r += a & 1; 29 return r; 30 } 31 32 int test__popcountti2(ti_int a) 33 { 34 si_int x = __popcountti2(a); 35 si_int expected = naive_popcount(a); 36 if (x != expected) 37 { 38 twords at; 39 at.all = a; 40 printf("error in __popcountti2(0x%.16llX%.16llX) = %d, expected %d\n", 41 at.s.high, at.s.low, x, expected); 42 } 43 return x != expected; 44 } 45 46 char assumption_1[sizeof(ti_int) == 2*sizeof(di_int)] = {0}; 47 char assumption_2[sizeof(di_int)*CHAR_BIT == 64] = {0}; 48 49 #endif 50 51 int main() 52 { 53 #if __x86_64 54 if (test__popcountti2(0)) 55 return 1; 56 if (test__popcountti2(1)) 57 return 1; 58 if (test__popcountti2(2)) 59 return 1; 60 if (test__popcountti2(0xFFFFFFFFFFFFFFFDLL)) 61 return 1; 62 if (test__popcountti2(0xFFFFFFFFFFFFFFFELL)) 63 return 1; 64 if (test__popcountti2(0xFFFFFFFFFFFFFFFFLL)) 65 return 1; 66 if (test__popcountti2(make_ti(0xFFFFFFFFFFFFFFFFLL, 0xFFFFFFFFFFFFFFFDLL))) 67 return 1; 68 if (test__popcountti2(make_ti(0xFFFFFFFFFFFFFFFFLL, 0xFFFFFFFFFFFFFFFELL))) 69 return 1; 70 if (test__popcountti2(make_ti(0xFFFFFFFFFFFFFFFFLL, 0xFFFFFFFFFFFFFFFFLL))) 71 return 1; 72 int i; 73 for (i = 0; i < 10000; ++i) 74 if (test__popcountti2(((ti_int)rand() << 96) | ((ti_int)rand() << 64) | 75 ((ti_int)rand() << 32) | rand())) 76 return 1; 77 78 #endif 79 return 0; 80 } 81