find_next

Type	Parameter	Name
const unsigned long *	addr
unsigned long	size
unsigned long	offset

**Caller**
Name	Describe
xas_squash_marks	xas_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_next	pumask_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_off	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
bitmap_ord_to_pos	map_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_number	xt_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_destroy	gen_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_fit	gen_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_intel	Check 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_pfn	memory_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_irq	q_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_mask	group_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_execute	group_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_write	hange the enabled child controllers for a cgroup in the default hierarchy
cgroup_can_fork	group_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_fork	group_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_exit	group_exit - detach cgroup from exiting task@tsk: pointer to task_struct of exiting process Description: Detach cgroup from @tsk.
cgroup_release
trace_pid_next	race_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_free	pcpu_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_area	pcpu_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_area	pcpu_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_stats	Prints out chunk state. Fragmentation is considered between* the beginning of the chunk to the last allocation.* All statistics are in bytes unless stated otherwise.

Function report