tree: https://git.kernel.org/pub/scm/linux/kernel/git/next/linux-next.git master head: 4c9ca5b1597e3222177ba2a94658f78fa5ef4f58 commit: caa49bdb937d60c059fc8cba02241ed0b10b073a [6333/7934] btrfs: temporarily export and move core extent_io_tree tree functions config: alpha-randconfig-r026-20220919 (https://download.01.org/0day-ci/archive/20220920/202209200314.tChS7q2Y-lkp@xxxxxxxxx/config) compiler: alpha-linux-gcc (GCC) 12.1.0 reproduce (this is a W=1 build): wget https://raw.githubusercontent.com/intel/lkp-tests/master/sbin/make.cross -O ~/bin/make.cross chmod +x ~/bin/make.cross # https://git.kernel.org/pub/scm/linux/kernel/git/next/linux-next.git/commit/?id=caa49bdb937d60c059fc8cba02241ed0b10b073a git remote add linux-next https://git.kernel.org/pub/scm/linux/kernel/git/next/linux-next.git git fetch --no-tags linux-next master git checkout caa49bdb937d60c059fc8cba02241ed0b10b073a # save the config file mkdir build_dir && cp config build_dir/.config COMPILER_INSTALL_PATH=$HOME/0day COMPILER=gcc-12.1.0 make.cross W=1 O=build_dir ARCH=alpha SHELL=/bin/bash fs/btrfs/ If you fix the issue, kindly add following tag where applicable Reported-by: kernel test robot <lkp@xxxxxxxxx> All warnings (new ones prefixed by >>): >> fs/btrfs/extent-io-tree.c:165: warning: This comment starts with '/**', but isn't a kernel-doc comment. Refer Documentation/doc-guide/kernel-doc.rst * Search @tree for an entry that contains @offset. Such entry would have fs/btrfs/extent-io-tree.c:217: warning: This comment starts with '/**', but isn't a kernel-doc comment. Refer Documentation/doc-guide/kernel-doc.rst * Search offset in the tree or fill neighbor rbtree node pointers. vim +165 fs/btrfs/extent-io-tree.c 163 164 /** > 165 * Search @tree for an entry that contains @offset. Such entry would have 166 * entry->start <= offset && entry->end >= offset. 167 * 168 * @tree: the tree to search 169 * @offset: offset that should fall within an entry in @tree 170 * @node_ret: pointer where new node should be anchored (used when inserting an 171 * entry in the tree) 172 * @parent_ret: points to entry which would have been the parent of the entry, 173 * containing @offset 174 * 175 * Return a pointer to the entry that contains @offset byte address and don't change 176 * @node_ret and @parent_ret. 177 * 178 * If no such entry exists, return pointer to entry that ends before @offset 179 * and fill parameters @node_ret and @parent_ret, ie. does not return NULL. 180 */ 181 struct rb_node *tree_search_for_insert(struct extent_io_tree *tree, u64 offset, 182 struct rb_node ***node_ret, 183 struct rb_node **parent_ret) 184 { 185 struct rb_root *root = &tree->state; 186 struct rb_node **node = &root->rb_node; 187 struct rb_node *prev = NULL; 188 struct tree_entry *entry; 189 190 while (*node) { 191 prev = *node; 192 entry = rb_entry(prev, struct tree_entry, rb_node); 193 194 if (offset < entry->start) 195 node = &(*node)->rb_left; 196 else if (offset > entry->end) 197 node = &(*node)->rb_right; 198 else 199 return *node; 200 } 201 202 if (node_ret) 203 *node_ret = node; 204 if (parent_ret) 205 *parent_ret = prev; 206 207 /* Search neighbors until we find the first one past the end */ 208 while (prev && offset > entry->end) { 209 prev = rb_next(prev); 210 entry = rb_entry(prev, struct tree_entry, rb_node); 211 } 212 213 return prev; 214 } 215 -- 0-DAY CI Kernel Test Service https://01.org/lkp
