Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:map_find_next_zero_area_off - find a contiguous aligned zero area*@map: The address to base the search on*@size: The bitmap size in bits*@start: The bitnumber to start searching at*@nr: The number of zeroed bits we're looking for*@align_mask: Alignment

Proto:unsigned long bitmap_find_next_zero_area_off(unsigned long *map, unsigned long size, unsigned long start, unsigned int nr, unsigned long align_mask, unsigned long align_offset)

Type:unsigned long

Parameter:

TypeParameterName
unsigned long *map
unsigned longsize
unsigned longstart
unsigned intnr
unsigned longalign_mask
unsigned longalign_offset
345  again :
346  index = d_next_zero_bit - find the next cleared bit in a memory region*@addr: The address to base the search on*@offset: The bitnumber to start searching at*@size: The bitmap size in bits* Returns the bit number of the next zero bit
349  index = __ALIGN_MASK(index + align_offset, align_mask) - align_offset
351  end = index + nr
352  If end > size Then Return end
354  i = d_next_bit - find the next set bit in a memory region*@addr: The address to base the search on*@offset: The bitnumber to start searching at*@size: The bitmap size in bits* Returns the bit number for the next set bit* If no bits are set, returns @size.
355  If i < end Then
356  start = i + 1
357  Go to again
359  Return index
Caller
NameDescribe
gen_pool_first_fit_aligngen_pool_first_fit_align - find the first available region* of memory matching the size requirement (alignment constraint)*@map: The address to base the search on*@size: The bitmap size in bits*@start: The bitnumber to start searching at*@nr: The number