Searched refs:rbound (Results 1 - 2 of 2) sorted by relevance

/linux-4.1.27/fs/reiserfs/
H A Dstree.c146 * that it could be, rbound the rightmost item that it could be. We examine
147 * the item halfway between lbound and rbound, and that tells us either
148 * that we can increase lbound, or decrease rbound, or that we have found it,
149 * or if lbound <= rbound that there are no possible items, and we have not
168 int rbound, lbound, j; bin_search() local
170 for (j = ((rbound = num - 1) + (lbound = 0)) / 2; bin_search()
171 lbound <= rbound; j = (rbound + lbound) / 2) bin_search()
179 rbound = j - 1; bin_search()
H A Dnamei.c33 int rbound, lbound, j; bin_search_in_dir_item() local
36 rbound = ih_entry_count(ih) - 1; bin_search_in_dir_item()
38 for (j = (rbound + lbound) / 2; lbound <= rbound; bin_search_in_dir_item()
39 j = (rbound + lbound) / 2) { bin_search_in_dir_item()
41 rbound = j - 1; bin_search_in_dir_item()

Completed in 90 milliseconds