1*7c3d14c8STreehugger Robot //===-- paritydi2_test.c - Test __paritydi2 -------------------------------===// 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 __paritydi2 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: 1 if number of bits is odd else returns 0 19*7c3d14c8STreehugger Robot 20*7c3d14c8STreehugger Robot COMPILER_RT_ABI si_int __paritydi2(di_int a); 21*7c3d14c8STreehugger Robot naive_parity(di_int a)22*7c3d14c8STreehugger Robotint naive_parity(di_int a) 23*7c3d14c8STreehugger Robot { 24*7c3d14c8STreehugger Robot int r = 0; 25*7c3d14c8STreehugger Robot for (; a; a = a & (a - 1)) 26*7c3d14c8STreehugger Robot r = ~r; 27*7c3d14c8STreehugger Robot return r & 1; 28*7c3d14c8STreehugger Robot } 29*7c3d14c8STreehugger Robot test__paritydi2(di_int a)30*7c3d14c8STreehugger Robotint test__paritydi2(di_int a) 31*7c3d14c8STreehugger Robot { 32*7c3d14c8STreehugger Robot si_int x = __paritydi2(a); 33*7c3d14c8STreehugger Robot si_int expected = naive_parity(a); 34*7c3d14c8STreehugger Robot if (x != expected) 35*7c3d14c8STreehugger Robot printf("error in __paritydi2(0x%llX) = %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_1[sizeof(di_int) == 2*sizeof(si_int)] = {0}; 41*7c3d14c8STreehugger Robot char assumption_2[sizeof(si_int)*CHAR_BIT == 32] = {0}; 42*7c3d14c8STreehugger Robot main()43*7c3d14c8STreehugger Robotint main() 44*7c3d14c8STreehugger Robot { 45*7c3d14c8STreehugger Robot int i; 46*7c3d14c8STreehugger Robot for (i = 0; i < 10000; ++i) 47*7c3d14c8STreehugger Robot if (test__paritydi2(((di_int)rand() << 32) + rand())) 48*7c3d14c8STreehugger Robot return 1; 49*7c3d14c8STreehugger Robot 50*7c3d14c8STreehugger Robot return 0; 51*7c3d14c8STreehugger Robot } 52