1 1.1 joerg /* ===-- ctzsi2.c - Implement __ctzsi2 -------------------------------------=== 2 1.1 joerg * 3 1.1 joerg * The LLVM Compiler Infrastructure 4 1.1 joerg * 5 1.1 joerg * This file is dual licensed under the MIT and the University of Illinois Open 6 1.1 joerg * Source Licenses. See LICENSE.TXT for details. 7 1.1 joerg * 8 1.1 joerg * ===----------------------------------------------------------------------=== 9 1.1 joerg * 10 1.1 joerg * This file implements __ctzsi2 for the compiler_rt library. 11 1.1 joerg * 12 1.1 joerg * ===----------------------------------------------------------------------=== 13 1.1 joerg */ 14 1.1 joerg 15 1.1 joerg #include "int_lib.h" 16 1.1 joerg 17 1.1 joerg /* Returns: the number of trailing 0-bits */ 18 1.1 joerg 19 1.1 joerg /* Precondition: a != 0 */ 20 1.1 joerg 21 1.1 joerg COMPILER_RT_ABI si_int 22 1.1 joerg __ctzsi2(si_int a) 23 1.1 joerg { 24 1.1 joerg su_int x = (su_int)a; 25 1.1 joerg si_int t = ((x & 0x0000FFFF) == 0) << 4; /* if (x has no small bits) t = 16 else 0 */ 26 1.1 joerg x >>= t; /* x = [0 - 0xFFFF] + higher garbage bits */ 27 1.1 joerg su_int r = t; /* r = [0, 16] */ 28 1.1 joerg /* return r + ctz(x) */ 29 1.1 joerg t = ((x & 0x00FF) == 0) << 3; 30 1.1 joerg x >>= t; /* x = [0 - 0xFF] + higher garbage bits */ 31 1.1 joerg r += t; /* r = [0, 8, 16, 24] */ 32 1.1 joerg /* return r + ctz(x) */ 33 1.1 joerg t = ((x & 0x0F) == 0) << 2; 34 1.1 joerg x >>= t; /* x = [0 - 0xF] + higher garbage bits */ 35 1.1 joerg r += t; /* r = [0, 4, 8, 12, 16, 20, 24, 28] */ 36 1.1 joerg /* return r + ctz(x) */ 37 1.1 joerg t = ((x & 0x3) == 0) << 1; 38 1.1 joerg x >>= t; 39 1.1 joerg x &= 3; /* x = [0 - 3] */ 40 1.1 joerg r += t; /* r = [0 - 30] and is even */ 41 1.1 joerg /* return r + ctz(x) */ 42 1.1 joerg 43 1.1 joerg /* The branch-less return statement below is equivalent 44 1.1 joerg * to the following switch statement: 45 1.1 joerg * switch (x) 46 1.1 joerg * { 47 1.1 joerg * case 0: 48 1.1 joerg * return r + 2; 49 1.1 joerg * case 2: 50 1.1 joerg * return r + 1; 51 1.1 joerg * case 1: 52 1.1 joerg * case 3: 53 1.1 joerg * return r; 54 1.1 joerg * } 55 1.1 joerg */ 56 1.1 joerg return r + ((2 - (x >> 1)) & -((x & 1) == 0)); 57 1.1 joerg } 58