fls

Name:ls - find last set bit in word*@x: the word to search* This is defined in a similar way as the libc and compiler builtin* ffs, but returns the position of the most significant set bit.* fls(value) returns 0 if value is 0 or the position of the last

Proto:static __always_inline int fls(unsigned int x)

Type:int

Parameter:

Type	Parameter	Name
unsigned int	x

**Caller**
Name	Describe
__clzsi2
__clzdi2
full_fit_alloc_test
div64_u64_rem	div64_u64_rem - unsigned 64bit divide with 64bit divisor and remainder@dividend: 64bit dividend@divisor: 64bit divisor@remainder: 64bit remainder This implementation is a comparable to algorithm used by div64_u64
div64_u64	div64_u64 - unsigned 64bit divide with 64bit divisor@dividend: 64bit dividend@divisor: 64bit divisor* This implementation is a modified version of the algorithm proposed* by the book 'Hacker's Delight'. The original source and full proof
reciprocal_value	For a description of the algorithm please have a look at* include/linux/reciprocal_div.h
reciprocal_value_adv
deg
tk_debug_account_sleep_time
tracing_map_array_alloc
longest_prefix_match	longest_prefix_match() - determine the longest prefix@trie: The trie to get internal sizes from@node: The node to operate on@key: The key to compare to @node Determine the longest prefix of @node that matches the bits in @key.
__pcpu_size_to_slot
lazy_max_pages
calculate_order
get_bitmask_order
fls_long
get_count_order
__ilog2_u32	-constant log of base 2 calculators* - the arch may override these in asm/bitops.h if they can be implemented* more efficiently than using fls() and fls64()* - the arch is not required to handle n==0 if implementing the fallback
get_order	get_order - Determine the allocation order of a memory size@size: The size for which to get the order Determine the allocation order of a particular sized block of memory

Function report