bfs/r5/BPlusTree.cpp

334 	CachedNode cached(this, fHeader->RootNode(), false);
335 	if (cached.Node() == NULL)
338 	cached.Node()->Initialize();
339 	return fStatus = cached.WriteBack(transaction);
391 	CachedNode cached(this, fHeader->RootNode());
392 	RETURN_ERROR(fStatus = cached.Node() ? B_OK : B_BAD_DATA);
596 	CachedNode cached(this);
598 	while ((node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
625 BPlusTree::FindFreeDuplicateFragment(bplustree_node *node, CachedNode *cached, off_t *_offset,
636 		bplustree_node *fragment = cached->SetTo(bplustree_node::FragmentOffset(value), false);
660 BPlusTree::InsertDuplicate(Transaction *transaction, CachedNode *cached, bplustree_node *node,
732 				if ((status = cached->WriteBack(transaction)) < B_OK)
808 	return cached->WriteBack(transaction);
1097 	CachedNode cached(this);
1098 	while (stack.Pop(&nodeAndKey) && (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
1109 					return InsertDuplicate(transaction, &cached, node, nodeAndKey.keyIndex, value);
1122 			return cached.WriteBack(transaction);
1164 			if (cached.WriteBack(transaction) < B_OK
1202 BPlusTree::RemoveDuplicate(Transaction *transaction, bplustree_node *node, CachedNode *cached,
1247 			return cached->WriteBack(transaction);
1303 				if ((status = cached->WriteBack(transaction)) < B_OK)
1368 			if ((status = cached->WriteBack(transaction)) < B_OK)
1461 	CachedNode cached(this);
1462 	while (stack.Pop(&nodeAndKey) && (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
1484 					return RemoveDuplicate(transaction, node, &cached, nodeAndKey.keyIndex, value);
1499 			if (cached.WriteBack(transaction) < B_OK)
1517 			return cached.WriteBack(transaction);
1537 		cached.Free(transaction, nodeAndKey.nodeOffset);
1566 	CachedNode cached(this);
1569 	while ((node = cached.SetTo(nodeOffset)) != NULL) {
1577 				return cached.WriteBack(transaction);
1616 	CachedNode cached(this);
1623 	while ((node = cached.SetTo(nodeOffset)) != NULL) {
1680 	CachedNode cached(fTree);
1683 	while ((node = cached.SetTo(nodeOffset)) != NULL) {
1745 	CachedNode cached(fTree);
1754 			node = cached.SetTo(bplustree_node::FragmentOffset(fDuplicateNode), false);
1763 					&& (node = cached.SetTo(fDuplicateNode, false)) != NULL) {
1781 	if ((node = cached.SetTo(fCurrentNodeOffset)) == NULL)
1796 			node = cached.SetTo(fCurrentNodeOffset);
1840 		node = cached.SetTo(bplustree_node::FragmentOffset(fDuplicateNode), false);
1883 	CachedNode cached(fTree);
1885 	while ((node = cached.SetTo(nodeOffset)) != NULL) {