blob: c69486ea445f05a8396fc2cf4b12276abb208722 [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 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000014
15#include "int_lib.h"
16
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000017/* Returns: the number of trailing 0-bits */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000018
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000019/* Precondition: a != 0 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000020
Anton Korobeynikov1c5f89b2011-04-19 17:52:09 +000021COMPILER_RT_ABI si_int
Daniel Dunbarb3a69012009-06-26 16:47:03 +000022__ctzsi2(si_int a)
23{
24 su_int x = (su_int)a;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000025 si_int t = ((x & 0x0000FFFF) == 0) << 4; /* if (x has no small bits) t = 16 else 0 */
26 x >>= t; /* x = [0 - 0xFFFF] + higher garbage bits */
27 su_int r = t; /* r = [0, 16] */
28 /* return r + ctz(x) */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000029 t = ((x & 0x00FF) == 0) << 3;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000030 x >>= t; /* x = [0 - 0xFF] + higher garbage bits */
31 r += t; /* r = [0, 8, 16, 24] */
32 /* return r + ctz(x) */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000033 t = ((x & 0x0F) == 0) << 2;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000034 x >>= t; /* x = [0 - 0xF] + higher garbage bits */
35 r += t; /* r = [0, 4, 8, 12, 16, 20, 24, 28] */
36 /* return r + ctz(x) */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000037 t = ((x & 0x3) == 0) << 1;
38 x >>= t;
Edward O'Callaghan37a6a452009-08-07 20:30:09 +000039 x &= 3; /* x = [0 - 3] */
40 r += t; /* r = [0 - 30] and is even */
41 /* return r + ctz(x) */
42
43/* The branch-less return statement below is equivalent
44 * to the following switch statement:
45 * switch (x)
46 * {
47 * case 0:
48 * return r + 2;
49 * case 2:
50 * return r + 1;
51 * case 1:
52 * case 3:
53 * return r;
54 * }
55 */
Daniel Dunbarb3a69012009-06-26 16:47:03 +000056 return r + ((2 - (x >> 1)) & -((x & 1) == 0));
57}