File: ffs.h

package info (click to toggle)
linux-2.6 2.6.26-29
  • links: PTS
  • area: main
  • in suites: lenny
  • size: 354,000 kB
  • ctags: 1,042,991
  • sloc: ansic: 5,706,178; asm: 218,136; makefile: 15,275; perl: 8,298; cpp: 3,242; yacc: 2,919; sh: 2,757; python: 2,550; lex: 1,825; lisp: 218; pascal: 116; awk: 96
file content (41 lines) | stat: -rw-r--r-- 615 bytes parent folder | download | duplicates (61) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
 
#ifndef _ASM_GENERIC_BITOPS_FFS_H_
#define _ASM_GENERIC_BITOPS_FFS_H_

/**
 * ffs - find first bit set
 * @x: the word to search
 *
 * This is defined the same way as
 * the libc and compiler builtin ffs routines, therefore
 * differs in spirit from the above ffz (man ffs).
 */
static inline int ffs(int x)
{
	int r = 1;

	if (!x)
		return 0;
	if (!(x & 0xffff)) {
		x >>= 16;
		r += 16;
	}
	if (!(x & 0xff)) {
		x >>= 8;
		r += 8;
	}
	if (!(x & 0xf)) {
		x >>= 4;
		r += 4;
	}
	if (!(x & 3)) {
		x >>= 2;
		r += 2;
	}
	if (!(x & 1)) {
		x >>= 1;
		r += 1;
	}
	return r;
}

#endif /* _ASM_GENERIC_BITOPS_FFS_H_ */