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

/linux-master/fs/reiserfs/
H A Dnamei.c33 int rbound, lbound, j; local
36 rbound = ih_entry_count(ih) - 1;
38 for (j = (rbound + lbound) / 2; lbound <= rbound;
39 j = (rbound + lbound) / 2) {
41 rbound = j - 1;
H A Dstree.c147 * that it could be, rbound the rightmost item that it could be. We examine
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; local
171 for (j = ((rbound = num - 1) + (lbound = 0)) / 2;
172 lbound <= rbound; j = (rbound + lbound) / 2)
180 rbound = j - 1;

Completed in 231 milliseconds