Home | History | Annotate | Download | only in Unit 
      1 //===-- clzti2_test.c - Test __clzti2 -------------------------------------===//
      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 __clzti2 for the compiler_rt library.
     11 //
     12 //===----------------------------------------------------------------------===//
     13 
     14 #if __x86_64
     15 
     16 #include "int_lib.h"
     17 #include <stdio.h>
     18 
     19 // Returns: the number of leading 0-bits
     20 
     21 // Precondition: a != 0
     22 
     23 si_int __clzti2(ti_int a);
     24 
     25 int test__clzti2(ti_int a, si_int expected)
     26 {
     27     si_int x = __clzti2(a);
     28     if (x != expected)
     29     {
     30         twords at;
     31         at.all = a;
     32         printf("error in __clzti2(0x%llX%.16llX) = %d, expected %d\n",
     33                at.s.high, at.s.low, x, expected);
     34     }
     35     return x != expected;
     36 }
     37 
     38 char assumption_1[sizeof(ti_int) == 2*sizeof(di_int)] = {0};
     39 
     40 #endif
     41 
     42 int main()
     43 {
     44 #if __x86_64
     45     const int N = (int)(sizeof(ti_int) * CHAR_BIT);
     46 
     47     if (test__clzti2(0x00000001, N-1))
     48         return 1;
     49     if (test__clzti2(0x00000002, N-2))
     50         return 1;
     51     if (test__clzti2(0x00000003, N-2))
     52         return 1;
     53     if (test__clzti2(0x00000004, N-3))
     54         return 1;
     55     if (test__clzti2(0x00000005, N-3))
     56         return 1;
     57     if (test__clzti2(0x0000000A, N-4))
     58         return 1;
     59     if (test__clzti2(0x1000000A, N*3/4+3))
     60         return 1;
     61     if (test__clzti2(0x2000000A, N*3/4+2))
     62         return 1;
     63     if (test__clzti2(0x6000000A, N*3/4+1))
     64         return 1;
     65     if (test__clzti2(0x8000000AuLL, N*3/4))
     66         return 1;
     67     if (test__clzti2(0x000005008000000AuLL, 85))
     68         return 1;
     69     if (test__clzti2(0x020005008000000AuLL, 70))
     70         return 1;
     71     if (test__clzti2(0x720005008000000AuLL, 65))
     72         return 1;
     73     if (test__clzti2(0x820005008000000AuLL, 64))
     74         return 1;
     75 
     76     if (test__clzti2(make_ti(0x0000000080000000LL, 0x8000000800000000LL), 32))
     77         return 1;
     78     if (test__clzti2(make_ti(0x0000000100000000LL, 0x8000000800000000LL), 31))
     79         return 1;
     80     if (test__clzti2(make_ti(0x1000000100000000LL, 0x8000000800000000LL), 3))
     81         return 1;
     82     if (test__clzti2(make_ti(0x7000000100000000LL, 0x8000000800000000LL), 1))
     83         return 1;
     84     if (test__clzti2(make_ti(0x8000000100000000LL, 0x8000000800000000LL), 0))
     85         return 1;
     86 #endif
     87    return 0;
     88 }
     89