file_systems/reiserfs/Iterators.cpp

141 	fIndex = index;
156 	return fIndex;
267 					&& fIndex < fCurrentNode->CountItems()) {
268 					fIndex++;
276 				if (fCurrentNode->IsInternal() && fIndex > 0)
277 					fIndex--;
291 					const DiskChild *child = internal->ChildAt(fIndex);
337 					fIndex = fCurrentNode->CountItems();
406 			fIndex = index;
411 //printf("found node: index: %ld\n", fIndex);
463 	status_t error = fPath->PushElement(fCurrentNode->GetNumber(), fIndex);
467 		fIndex = newIndex;
485 			fIndex = element->GetIndex();
540 	  fIndex(0)
549 	fIndex = 0;
567 		if (fIndex >= 0 && fIndex < node->CountItems())
568 			error = item->SetTo(node, fIndex);
583 		int32 newIndex = fIndex - 1;
592 			fIndex = newIndex;
594 				error = item->SetTo(node, fIndex);
610 		int32 newIndex = fIndex + 1;
618 			fIndex = newIndex;
619 //PRINT(("  index now: %ld\n", fIndex));
621 				error = item->SetTo(node, fIndex);
650 		error = _SearchRightMost(node, k, &fIndex);
653 			error = item->SetTo(node, fIndex);
1061 	  fIndex(-1),
1089 	fIndex = -1;
1136 		   && (fIndex < 0 || fIndex >= fDirItem.GetEntryCount())) {
1140 				fIndex = 0;
1142 				fIndex = -1;
1147 		DirEntry *entry = fDirItem.EntryAt(fIndex);
1152 			*entryIndex = fIndex;
1155 			fIndex++;
1184 		   && (fIndex < 0 || fIndex >= fDirItem.GetEntryCount())) {
1188 				fIndex = fDirItem.GetEntryCount() - 1;
1190 				fIndex = -1;
1195 	while (error == B_OK && fIndex >= 0
1196 		   && fDirItem.EntryAt(fIndex)->GetOffset() > GetOffset()) {
1197 //printf("  skipping entry %ld: offset %lu\n", fIndex, fDirItem.EntryAt(fIndex)->GetOffset());
1198 		fIndex--;
1202 //printf("  entries with greater offsets skipped: index: %ld\n", fIndex);
1203 		if (fIndex >= 0
1204 //&& (printf("  entry index %ld: offset %lu\n", fIndex, fDirItem.EntryAt(fIndex)->GetOffset()), true)
1206 				|| offset_hash_value(fDirItem.EntryAt(fIndex)->GetOffset())
1209 			DirEntry *entry = fDirItem.EntryAt(fIndex);
1211 			*entryIndex = fIndex;
1216 			fIndex--;