Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\bitmap.c Create Date:2022-07-28 06:20:30
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:map_remap - Apply map defined by a pair of bitmaps to another bitmap*@dst: remapped result*@src: subset to be remapped*@old: defines domain of map*@new: defines range of map*@nbits: number of bits in each of these bitmaps* Let @old and @new define a

Proto:void bitmap_remap(unsigned long *dst, const unsigned long *src, const unsigned long *old, const unsigned long *new, unsigned int nbits)

Type:void

Parameter:

TypeParameterName
unsigned long *dst
const unsigned long *src
const unsigned long *old
const unsigned long *new
unsigned intnbits
809  If dst == src Then Return
811  bitmap_zero(dst, nbits)
813  w = bitmap_weight(new, nbits)
815  n = map_pos_to_ord - find ordinal of set bit at given position in bitmap*@buf: pointer to a bitmap*@pos: a bit position in @buf (0 <= @pos < @nbits)*@nbits: number of valid bit positions in @buf* Map the bit at position @pos in @buf (of length @nbits) to the
817  If n < 0 || w == 0 Then set_bit - Atomically set a bit in memory*@nr: the bit to set*@addr: the address to start counting from* This is a relaxed atomic operation (no implied memory barriers).* Note that @nr may be almost arbitrarily large; this function is not
819  Else set_bit - Atomically set a bit in memory*@nr: the bit to set*@addr: the address to start counting from* This is a relaxed atomic operation (no implied memory barriers).* Note that @nr may be almost arbitrarily large; this function is not
Caller
NameDescribe
__nodes_remap