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