blob: 2ff0e5d7655fa8433c45aa4b3363f781a7ffd0d2 [file] [log] [blame]
Edward O'Callaghan37a6a452009-08-07 20:30:09 +00001/* ===-- ctzsi2.c - Implement __ctzsi2 -------------------------------------===
2 *
3 * The LLVM Compiler Infrastructure
4 *
Howard Hinnant9ad441f2010-11-16 22:13:33 +00005 * This file is dual licensed under the MIT and the University of Illinois Open
6 * Source Licenses. See LICENSE.TXT for details.
Edward O'Callaghan37a6a452009-08-07 20:30:09 +00007 *
8 * ===----------------------------------------------------------------------===
9 *
10 * This file implements __ctzsi2 for the compiler_rt library.
11 *
12 * ===----------------------------------------------------------------------===
13 */
Anton Korobeynikov1c5f89b2011-04-19 17:52:09 +000014#include "abi.h"
Daniel Dunbarb3a69012009-06-26 16:47:03 +000015
16#include "int_lib.h"
17
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000018/* Returns: the number of trailing 0-bits */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000019
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000020/* Precondition: a != 0 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000021
Anton Korobeynikov1c5f89b2011-04-19 17:52:09 +000022COMPILER_RT_ABI si_int
Daniel Dunbarb3a69012009-06-26 16:47:03 +000023__ctzsi2(si_int a)
24{
25 su_int x = (su_int)a;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000026 si_int t = ((x & 0x0000FFFF) == 0) << 4; /* if (x has no small bits) t = 16 else 0 */
27 x >>= t; /* x = [0 - 0xFFFF] + higher garbage bits */
28 su_int r = t; /* r = [0, 16] */
29 /* return r + ctz(x) */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000030 t = ((x & 0x00FF) == 0) << 3;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000031 x >>= t; /* x = [0 - 0xFF] + higher garbage bits */
32 r += t; /* r = [0, 8, 16, 24] */
33 /* return r + ctz(x) */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000034 t = ((x & 0x0F) == 0) << 2;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000035 x >>= t; /* x = [0 - 0xF] + higher garbage bits */
36 r += t; /* r = [0, 4, 8, 12, 16, 20, 24, 28] */
37 /* return r + ctz(x) */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000038 t = ((x & 0x3) == 0) << 1;
39 x >>= t;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000040 x &= 3; /* x = [0 - 3] */
41 r += t; /* r = [0 - 30] and is even */
42 /* return r + ctz(x) */
43
44/* The branch-less return statement below is equivalent
45 * to the following switch statement:
46 * switch (x)
47 * {
48 * case 0:
49 * return r + 2;
50 * case 2:
51 * return r + 1;
52 * case 1:
53 * case 3:
54 * return r;
55 * }
56 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000057 return r + ((2 - (x >> 1)) & -((x & 1) == 0));
58}