file_systems/btrfs/BTree.cpp

214 	status_t status = origin->_SpaceCheck(length);
215 	if (status != B_OK)
216 		return status;
250 	status_t status = _SpaceCheck(length);
251 	if (status != B_OK || length == 0/*B_OK*/)
252 		return status;
419 	status_t status;
422 		status = node->MoveEntries(start, start + num - 1, length);
423 		if (status != B_OK)
424 			return status;
437 	status = fTree->SystemVolume()->GetNewBlock(address, block);
438 	if (status != B_OK)
439 		return status;
447 	status = fNodes[level]->Copy(node, start, start + num - 1, length);
448 	if (status != B_OK)
449 		return status;
493 	status_t status;
496 		status = CopyOnWrite(transaction, from, 0, node->ItemCount(), 0);
498 		if (status != B_OK)
499 			return status;
581 	status_t status = B_OK;
586 		status = node.SearchSlot(key, &slot, BTREE_BACKWARD);
587 		if (status != B_OK)
588 			return status;
594 		status = fVolume->FindBlock(node.Index(slot)->LogicalAddress(),
596 		if (status != B_OK) {
599 			return status;
605 	status = node.SearchSlot(key, &slot, type);
606 	if (status != B_OK)
607 		return status;
621 	status_t status = Traverse(type, path, wanted);
622 	if (status < B_OK)
623 		return status;
626 	status = path->GetCurrentEntry(&found, _value, _size, _offset);
627 	if (status != B_OK)
628 		return status;
675 	status_t status = Traverse(BTREE_FORWARD, path, startKey);
676 	if (status < B_OK)
677 		return status;
679 	int slot = status;
680 	status = path->InternalCopy(transaction, 1);
681 	if (status != B_OK)
682 		return status;
684 	status = path->CopyOnWrite(transaction, 0, slot, num, length);
685 	if (status == B_DEVICE_FULL) {
687 		return status;
690 	if (status != B_OK)
691 		return status;
735 	status_t status = Traverse(BTREE_EXACT, path, startKey);
736 	if (status < B_OK)
737 		return status;
739 	int slot = status;
747 	status = path->InternalCopy(transaction, 1);
748 	if (status != B_OK)
749 		return status;
751 	status = path->CopyOnWrite(transaction, 0, slot, num, length);
752 	if (status == B_DIRECTORY_NOT_EMPTY) {
756 	return status;
784 		status_t status = fVolume->FindBlock(
786 		if (status != B_OK)
787 			return status;
823 		status_t status = fVolume->FindBlock(
825 		if (status != B_OK)
826 			return status;
926 	status_t status = fTree->Traverse(direction, fPath, fKey);
927 	if (status < B_OK) {
929 		return status;
940 	status_t status = B_OK;
942 		status = _Traverse(type);
943 		if (status != B_OK)
944 			return status;
953 		status = fTree->NextLeaf(fPath);
955 		status = fTree->PreviousLeaf(fPath);
956 	if (status != B_OK)
957 		return status;
960 	status = fPath->GetCurrentEntry(&found, _value, _size, _offset);
961 	if (status != B_OK)
962 		return status;