xref: /llvm-project/compiler-rt/lib/builtins/ctzsi2.c (revision 0ee439b705e82a4fe20e266bc8fea96d0e60e1ec)
10ba22f51SPetr Hosek //===-- ctzsi2.c - Implement __ctzsi2 -------------------------------------===//
20ba22f51SPetr Hosek //
30ba22f51SPetr Hosek // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
40ba22f51SPetr Hosek // See https://llvm.org/LICENSE.txt for license information.
50ba22f51SPetr Hosek // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
60ba22f51SPetr Hosek //
70ba22f51SPetr Hosek //===----------------------------------------------------------------------===//
80ba22f51SPetr Hosek //
90ba22f51SPetr Hosek // This file implements __ctzsi2 for the compiler_rt library.
100ba22f51SPetr Hosek //
110ba22f51SPetr Hosek //===----------------------------------------------------------------------===//
12a6b264b5SAlexey Samsonov 
13a6b264b5SAlexey Samsonov #include "int_lib.h"
14a6b264b5SAlexey Samsonov 
150ba22f51SPetr Hosek // Returns: the number of trailing 0-bits
16a6b264b5SAlexey Samsonov 
170ba22f51SPetr Hosek // Precondition: a != 0
18a6b264b5SAlexey Samsonov 
__ctzsi2(si_int a)19*0ee439b7SAnatoly Trosinenko COMPILER_RT_ABI int __ctzsi2(si_int a) {
20a6b264b5SAlexey Samsonov   su_int x = (su_int)a;
21082b89b2SPetr Hosek   si_int t = ((x & 0x0000FFFF) == 0)
220ba22f51SPetr Hosek              << 4; // if (x has no small bits) t = 16 else 0
230ba22f51SPetr Hosek   x >>= t;         // x = [0 - 0xFFFF] + higher garbage bits
240ba22f51SPetr Hosek   su_int r = t;    // r = [0, 16]
250ba22f51SPetr Hosek   // return r + ctz(x)
26a6b264b5SAlexey Samsonov   t = ((x & 0x00FF) == 0) << 3;
270ba22f51SPetr Hosek   x >>= t; // x = [0 - 0xFF] + higher garbage bits
280ba22f51SPetr Hosek   r += t;  // r = [0, 8, 16, 24]
290ba22f51SPetr Hosek   // return r + ctz(x)
30a6b264b5SAlexey Samsonov   t = ((x & 0x0F) == 0) << 2;
310ba22f51SPetr Hosek   x >>= t; // x = [0 - 0xF] + higher garbage bits
320ba22f51SPetr Hosek   r += t;  // r = [0, 4, 8, 12, 16, 20, 24, 28]
330ba22f51SPetr Hosek   // return r + ctz(x)
34a6b264b5SAlexey Samsonov   t = ((x & 0x3) == 0) << 1;
35a6b264b5SAlexey Samsonov   x >>= t;
360ba22f51SPetr Hosek   x &= 3; // x = [0 - 3]
370ba22f51SPetr Hosek   r += t; // r = [0 - 30] and is even
380ba22f51SPetr Hosek   // return r + ctz(x)
39a6b264b5SAlexey Samsonov 
400ba22f51SPetr Hosek   //  The branch-less return statement below is equivalent
410ba22f51SPetr Hosek   //  to the following switch statement:
420ba22f51SPetr Hosek   //     switch (x)
430ba22f51SPetr Hosek   //    {
440ba22f51SPetr Hosek   //     case 0:
450ba22f51SPetr Hosek   //         return r + 2;
460ba22f51SPetr Hosek   //     case 2:
470ba22f51SPetr Hosek   //         return r + 1;
480ba22f51SPetr Hosek   //     case 1:
490ba22f51SPetr Hosek   //     case 3:
500ba22f51SPetr Hosek   //         return r;
510ba22f51SPetr Hosek   //     }
52a6b264b5SAlexey Samsonov   return r + ((2 - (x >> 1)) & -((x & 1) == 0));
53a6b264b5SAlexey Samsonov }
54