2005-01-28 Martin Schwidefsky <schwidefsky@de.ibm.com>
[glibc.git] / sysdeps / x86_64 / ffsll.c
blob7213c0363b7348c8a76c98b0894cd73cf3e0cbf8
1 /* ffsll -- find first set bit in a word, counted from least significant end.
2 For AMD x86-64.
3 This file is part of the GNU C Library.
4 Copyright (C) 1991,92,93,94,97,98,2001 Free Software Foundation, Inc.
5 Contributed by Ulrich Drepper <drepper@cygnus.com>.
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, write to the Free
19 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
20 02111-1307 USA. */
22 #define ffsl __something_else
23 #include <string.h>
25 #undef ffsll
27 int
28 ffsll (long long int x)
30 long long int cnt;
31 long long int tmp;
33 asm ("bsfq %2,%0\n" /* Count low bits in X and store in %1. */
34 "cmoveq %1,%0\n" /* If number was zero, use -1 as result. */
35 : "=&r" (cnt), "=r" (tmp) : "rm" (x), "1" (-1));
37 return cnt + 1;
40 #undef ffsl
41 weak_alias (ffsll, ffsl)