Lines Matching defs:start
157 HTreeEntry* start = (HTreeEntry*)block + fCurrentEntry + 1;
159 HTreeEntry* middle = start;
164 indirections, start, middle, end);
166 while (start <= end) {
167 middle = (HTreeEntry*)((end - start) / 2
168 + start);
171 indirections, start, middle, end);
177 start = middle + 1;
182 --start;
184 fCurrentEntry = ((uint8*)start - block) / sizeof(HTreeEntry);
189 "\n", start->Block(), start->Hash());
191 DirectoryIterator(fDirectory, start->Block() * fBlockSize, this);
202 start->Block(), start->Hash());
204 status_t status = fDirectory->FindBlock(start->Block() * fBlockSize,
212 fDirectory, this, (start->Hash() & 1) == 1);