Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

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

Name:Find the next set bit in a memory region.

Proto:unsigned long find_next_bit(const unsigned long *addr, unsigned long size, unsigned long offset)

Type:unsigned long

Parameter:

TypeParameterName
const unsigned long *addr
unsigned longsize
unsigned longoffset
70  Return This is a common helper function for find_next_bit, find_next_zero_bit, and* find_next_and_bit. The differences are:* - The "invert" argument, which is XORed with each fetched word before* searching it for one bits.
Caller
NameDescribe
xas_squash_marksxas_squash_marks() - Merge all marks to the first entry*@xas: Array operation state.* Set a mark on the first entry if any entry has it set. Clear marks on* all sibling entries.
cpumask_nextpumask_next - get the next cpu in a cpumask*@n: the cpu prior to the place to search (ie. return will be > @n)*@srcp: the cpumask pointer* Returns >= nr_cpu_ids if no further cpus set.
bitmap_find_next_zero_area_offmap_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
bitmap_ord_to_posmap_ord_to_pos - find position of n-th set bit in bitmap*@buf: pointer to bitmap*@ord: ordinal bit position (n-th set bit, n >= 0)*@nbits: number of valid bit positions in @buf* Map the ordinal offset of bit @ord in @buf to its position in @buf.
find_next_clump8
test_find_next_bit
test_bitmap_arr32
expand_to_next_prime
next_prime_numberxt_prime_number - return the next prime number*@x: the starting point for searching to test* A prime number is an integer greater than 1 that is only divisible by* itself and 1
gen_pool_destroygen_pool_destroy - destroy a special memory pool*@pool: pool to destroy* Destroy the specified special memory pool. Verifies that there are no* outstanding allocations.
gen_pool_best_fitgen_pool_best_fit - find the best fitting region of memory* macthing the size requirement (no 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 of
cbm_validate_intelCheck whether a cache bit mask is valid. The SDM says:* Please note that all (and only) contiguous '1' combinations* are allowed (e.g. FFFFH, 0FF0H, 003CH, etc.).* Additionally Haswell requires at least two bits set.
memory_bm_next_pfnmemory_bm_rtree_next_pfn - Find the next set bit in a memory bitmap.*@bm: Memory bitmap.* Starting from the last returned position this function searches for the next* set bit in @bm and returns the PFN represented by it. If no more bits are
irq_get_next_irqq_get_next_irq - get next allocated irq number*@offset: where to start the search* Returns next irq number after offset or nr_irqs if none is found.
irq_sim_handle_irq
cgroup_calc_subtree_ss_maskgroup_calc_subtree_ss_mask - calculate subtree_ss_mask*@subtree_control: the new subtree_control mask to consider*@this_ss_mask: available subsystems* On the default hierarchy, a subsystem may request other subsystems to be
rebind_subsystems
cgroup_migrate_executegroup_taskset_migrate - migrate a taskset*@mgctx: migration context* Migrate tasks in @mgctx as setup by migration preparation functions.* This function fails iff one of the ->can_attach callbacks fails and
cgroup_print_ss_mask
cgroup_subtree_control_writehange the enabled child controllers for a cgroup in the default hierarchy
cgroup_can_forkgroup_can_fork - called on a new task before the process is exposed*@child: the task in question.* This calls the subsystem can_fork() callbacks. If the can_fork() callback* returns an error, the fork aborts with that error code. This allows for
cgroup_post_forkgroup_post_fork - called on a new task after adding it to the task list*@child: the task in question* Adds the task to the list running through its css_set if necessary and* call the subsystem fork() callbacks
cgroup_exitgroup_exit - detach cgroup from exiting task*@tsk: pointer to task_struct of exiting process* Description: Detach cgroup from @tsk.
cgroup_release
trace_pid_nextrace_pid_next - Used for seq_file to get to the next pid of a pid_list*@pid_list: The pid list to show*@v: The last pid that was shown (+1 the actual pid to let zero be displayed)*@pos: The position of the file* This is used by the seq_file "next"
pcpu_next_pop
pcpu_block_update_hint_freepcpu_block_update_hint_free - updates the block hints on the free path*@chunk: chunk of interest*@bit_off: chunk offset*@bits: size of request* Updates metadata for the allocation path. This avoids a blind block
pcpu_find_zero_areapcpu_find_zero_area - modified from bitmap_find_next_zero_area_off()*@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
pcpu_free_areapcpu_free_area - frees the corresponding offset*@chunk: chunk of interest*@off: addr offset into chunk* This function determines the size of an allocation to free using* the boundary bitmap and clears the allocation map.
cma_maxchunk_get
chunk_map_statsPrints out chunk state. Fragmentation is considered between* the beginning of the chunk to the last allocation.* All statistics are in bytes unless stated otherwise.