file_systems/bfs/BPlusTree.cpp

84 		Check("integrity check failed on construction.");
89 		Check("integrity check failed on destruction.");
97 			DEBUGGER(("NodeChecker integrity check failed!"));
289 CachedNode::SetTo(off_t offset, bool check)
292 	if (SetTo(offset, &node, check) == B_OK)
300 CachedNode::SetTo(off_t offset, const bplustree_node** _node, bool check)
316 	if (InternalSetTo(NULL, offset) != NULL && check) {
333 CachedNode::SetToWritable(Transaction& transaction, off_t offset, bool check)
350 	if (InternalSetTo(&transaction, offset) != NULL && check) {
726 	// validity check
765 	TreeCheck check(this);
766 	if (check.InitCheck() != B_OK)
769 	check.SetVisited(0);
785 			check.FoundError();
789 		if (check.Visited(freeOffset)) {
794 			check.FoundError();
798 		check.SetVisited(freeOffset);
814 	status = _ValidateChildren(check, 0, fHeader.RootNode(), NULL, 0, root);
816 	if (check.ErrorsFound())
822 	if (check.MaxLevels() + 1 != fHeader.MaxNumberOfLevels()) {
824 			"declared %" B_PRIu32 "!\n", fStream->ID(), check.MaxLevels(),
828 	if ((off_t)check.VisitedCount() != fHeader.MaximumSize() / fNodeSize) {
830 			" nodes.\n", fStream->ID(), check.VisitedCount(),
1708 			// first round, check for duplicate entries
2121 			// first round, check for duplicate entries
2331 BPlusTree::_ValidateChildren(TreeCheck& check, uint32 level, off_t offset,
2336 		dprintf("inode %" B_PRIdOFF ": node %" B_PRIdOFF " integrity check "
2338 		check.FoundError();
2344 		check.FoundError();
2348 	check.SetLevel(level);
2350 	if (check.Visited(offset)) {
2353 		check.FoundError();
2357 	check.SetVisited(offset);
2361 	off_t lastOffset = check.PreviousOffset(level);
2374 				check.FoundError();
2394 					check.FoundError();
2401 					&& check.VisitedFragment(duplicateOffset);
2403 				if (!isKnownFragment && check.Visited(duplicateOffset)) {
2409 					check.FoundError();
2415 				if (!check.Visited(duplicateOffset))
2416 					check.SetVisited(duplicateOffset);
2418 					check.SetVisitedFragment(duplicateOffset);
2439 					check.FoundError();
2441 					// Simple check if the values in the array may be valid
2449 							check.FoundError();
2464 					check.FoundError();
2487 					check.FoundError();
2491 			status_t status = _ValidateChild(check, cached, level, childOffset,
2499 			check.FoundError();
2507 		status_t status = _ValidateChild(check, cached, level, childOffset,
2515 	check.SetPreviousOffset(level, lastOffset);
2521 BPlusTree::_ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level,
2533 		check.FoundError();
2541 		check.FoundError();
2548 		check.FoundError();
2551 	return _ValidateChildren(check, level + 1, offset, key, keyLength, node);