1 /* ffs -- find first set bit in a word, counted from least significant end.
3 Copyright (C) 2000-2014 Free Software Foundation, Inc.
4 Contributed by Martin Schwidefsky (schwidefsky@de.ibm.com).
5 This file is part of the GNU C Library.
7 The GNU C Library is free software; you can redistribute it and/or
8 modify it under the terms of the GNU Lesser General Public
9 License as published by the Free Software Foundation; either
10 version 2.1 of the License, or (at your option) any later version.
12 The GNU C Library is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 Lesser General Public License for more details.
17 You should have received a copy of the GNU Lesser General Public
18 License along with the GNU C Library; if not, see
19 <http://www.gnu.org/licenses/>. */
22 #define ffsl __something_else
27 /* ffs: find first bit set. This is defined the same way as
28 the libc and compiler builtin ffs routines, therefore
29 differs in spirit from the above ffz (man ffs). */
39 __asm__(" lr %%r1,%1\n"
45 "0: tml %%r1,0x00FF\n"
49 "1: tml %%r1,0x000F\n"
53 "2: tml %%r1,0x0003\n"
57 "3: tml %%r1,0x0001\n"
61 : "=&d" (r
) : "d" (x
) : "cc", "1" );
65 weak_alias (__ffs
, ffs
)
66 libc_hidden_def (__ffs
)
67 libc_hidden_builtin_def (ffs
)
68 #if ULONG_MAX == UINT_MAX
70 weak_alias (__ffs
, ffsl
)