函数逻辑报告

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:include\linux\radix-tree.h Create Date:2022-07-27 06:43:53
Last Modify:2020-03-12 14:18:49 Copyright©Brick
首页 函数Tree
注解内核,赢得工具下载SCCTEnglish

函数名称：adix_tree_next_slot - find next slot in chunk*@slot: pointer to current slot*@iter: pointer to interator state*@flags: RADIX_TREE_ITER_*, should be constant* Returns: pointer to next slot, or NULL if there no more left

函数原型：static __always_inline void __rcu **radix_tree_next_slot(void __rcu **slot, struct radix_tree_iter *iter, unsigned flags)

返回类型：void

参数：

类型参数名称
void __rcu **slot
struct radix_tree_iter *iter
unsignedflags
388  如果flags按位与RADIX_TREE_ITER_TAGGED则
389  tags右移等于1位
390  如果此条件成立可能性小(为编译器优化)(!tags)则返回:NULL
392  如果此条件成立可能性大(为编译器优化)(tags & 1ul)则
393  index等于__radix_tree_iter_add(iter, 1)
394  slot自加
395  转到:found
397  如果非flags按位与RADIX_TREE_ITER_CONTIG的值则
398  offset等于在字中找到第一个指定位
400  tags右移等于offset自加位
401  index等于__radix_tree_iter_add(iter, offset)
402  slot加等于offset
403  转到:found
405  否则
406  count等于adix_tree_chunk_size - get current chunk size*@iter: pointer to radix tree iterator* Returns: current chunk size
408  当count先自减大于0循环
409  slot自加
410  index等于__radix_tree_iter_add(iter, 1)
412  如果此条件成立可能性大(为编译器优化)( * slot)则转到:found
414  如果flags按位与RADIX_TREE_ITER_CONTIG则
416  next_index等于0
417  退出
421  返回:NULL
423  found :
424  返回:slot