lbound (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:lbound (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/fs/reiserfs/
H A D	namei.c	`33 int rbound, lbound, j; in bin_search_in_dir_item() local 35 lbound = 0; in bin_search_in_dir_item() 38 for (j = (rbound + lbound) / 2; lbound <= rbound; in bin_search_in_dir_item() 39 j = (rbound + lbound) / 2) { in bin_search_in_dir_item() 45 lbound = j + 1; in bin_search_in_dir_item() 53 de->de_entry_num = lbound; in bin_search_in_dir_item()`
H A D	stree.c	146 * For those not familiar with binary search: lbound is the leftmost item 148 * the item halfway between lbound and rbound, and that tells us either 149 * that we can increase lbound, or decrease rbound, or that we have found it, 150 * or if lbound <= rbound that there are no possible items, and we have not 169 int rbound, lbound, j; in bin_search() local 171 for (j = ((rbound = num - 1) + (lbound = 0)) / 2; in bin_search() 172 lbound <= rbound; j = (rbound + lbound) / 2) in bin_search() 177 lbound = j + 1; in bin_search() 191 *pos = lbound; in bin_search() [all...]
/kernel/linux/linux-6.6/fs/reiserfs/
H A D	namei.c	`33 int rbound, lbound, j; in bin_search_in_dir_item() local 35 lbound = 0; in bin_search_in_dir_item() 38 for (j = (rbound + lbound) / 2; lbound <= rbound; in bin_search_in_dir_item() 39 j = (rbound + lbound) / 2) { in bin_search_in_dir_item() 45 lbound = j + 1; in bin_search_in_dir_item() 53 de->de_entry_num = lbound; in bin_search_in_dir_item()`
H A D	stree.c	146 * For those not familiar with binary search: lbound is the leftmost item 148 * the item halfway between lbound and rbound, and that tells us either 149 * that we can increase lbound, or decrease rbound, or that we have found it, 150 * or if lbound <= rbound that there are no possible items, and we have not 169 int rbound, lbound, j; in bin_search() local 171 for (j = ((rbound = num - 1) + (lbound = 0)) / 2; in bin_search() 172 lbound <= rbound; j = (rbound + lbound) / 2) in bin_search() 177 lbound = j + 1; in bin_search() 191 *pos = lbound; in bin_search() [all...]

Completed in 7 milliseconds