nr_center (reference) in projects: kernel - OpenGrok search results

Repository(s)

Full Search		Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition		Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol		Only finds symbol(e.g. methods classes,function,variables).
File Path		Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History		History log comments.
Type		Type of analyzer used to filter file types include with selected(e.g. just C sources).

Help

Searched refs:nr_center (Results 1 - 3 of 3) sorted by relevance

/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A D	dm-btree-remove.c	272 uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) in delete_center_node() 275 unsigned shift = min(max_entries - nr_left, nr_center); in delete_center_node() 281 if (shift != nr_center) { in delete_center_node() 282 shift = nr_center - shift; in delete_center_node() 303 uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) in redistribute3() 307 unsigned total = nr_left + nr_center + nr_right; in redistribute3() 318 if (s < 0 && nr_center < -s) { in redistribute3() 320 shift(left, center, -nr_center); in redistribute3() 321 s += nr_center; in redistribute3() 331 if (s > 0 && nr_center < in redistribute3() 269 delete_center_node(struct dm_btree_info info, struct btree_node parent, struct child l, struct child c, struct child r, struct btree_node left, struct btree_node center, struct btree_node right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) delete_center_node() argument 300 redistribute3(struct dm_btree_info info, struct btree_node parent, struct child l, struct child c, struct child r, struct btree_node left, struct btree_node center, struct btree_node right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) redistribute3() argument 355 uint32_t nr_center = le32_to_cpu(center->header.nr_entries); __rebalance3() local [all...]
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A D	dm-btree-remove.c	314 uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) in delete_center_node() 317 unsigned int shift = min(max_entries - nr_left, nr_center); in delete_center_node() 327 if (shift != nr_center) { in delete_center_node() 328 shift = nr_center - shift; in delete_center_node() 354 uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) in redistribute3() 358 unsigned int total = nr_left + nr_center + nr_right; in redistribute3() 369 if (s < 0 && nr_center < -s) { in redistribute3() 371 ret = shift(left, center, -nr_center); in redistribute3() 375 s += nr_center; in redistribute3() 392 if (s > 0 && nr_center < in redistribute3() 311 delete_center_node(struct dm_btree_info info, struct btree_node parent, struct child l, struct child c, struct child r, struct btree_node left, struct btree_node center, struct btree_node right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) delete_center_node() argument 351 redistribute3(struct dm_btree_info info, struct btree_node parent, struct child l, struct child c, struct child r, struct btree_node left, struct btree_node center, struct btree_node right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) redistribute3() argument 426 uint32_t nr_center = le32_to_cpu(center->header.nr_entries); __rebalance3() local [all...]
H A D	dm-btree.c	`586 unsigned int nr_center = le32_to_cpu(center->header.nr_entries); in redistribute3() local 590 BUG_ON(nr_center); in redistribute3()`

Completed in 4 milliseconds