file_systems/bfs/BPlusTree.cpp

491 	CachedNode cached(fTree);
492 	bplustree_header* header = cached.SetToWritableHeader(transaction);
535 		CachedNode cached(fTree);
536 		header = cached.SetToWritableHeader(transaction);
554 	CachedNode cached(fTree);
555 	header = cached.SetToWritableHeader(transaction);
565 	cached.Unset();
649 	CachedNode cached(this);
650 	bplustree_header* header = cached.SetToWritableHeader(transaction);
657 		header = cached.SetToWritableHeader(transaction);
677 	cached.Unset();
680 	cached.SetToWritable(transaction, fHeader.RootNode(), false);
681 	if (cached.Node() == NULL)
684 	cached.Node()->Initialize();
701 	CachedNode cached(this);
702 	const bplustree_header* header = cached.SetToHeader();
749 	cached.SetTo(fHeader.RootNode());
750 	RETURN_ERROR(fStatus = cached.Node() ? B_OK : B_BAD_DATA);
773 	CachedNode cached(this);
777 		status_t status = cached.SetTo(freeOffset, &node, false);
810 	status_t status = cached.SetTo(fHeader.RootNode(), &root, true);
845 	CachedNode cached(this);
846 	bplustree_header* header = cached.SetToWritableHeader(transaction);
859 	bplustree_node* node = cached.SetToWritable(transaction, NodeSize(), false);
871 		bplustree_node* node = cached.SetToWritable(transaction, offset, false);
956 		CachedNode cached(this);
957 		const bplustree_header* header = cached.SetToHeader();
1116 	CachedNode cached(this);
1118 	while ((node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
1157 	const bplustree_node* node, CachedNode& cached,
1168 		const bplustree_node* fragment = cached.SetTo(
1183 				*_fragment = cached.MakeWritable(transaction);
1198 BPlusTree::_InsertDuplicate(Transaction& transaction, CachedNode& cached,
1272 				if (cached.MakeWritable(transaction) == NULL)
1354 	if (cached.MakeWritable(transaction) == NULL)
1701 	CachedNode cached(this);
1703 		&& (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
1715 					status = _InsertDuplicate(transaction, cached, node,
1726 		bplustree_node* writableNode = cached.MakeWritable(transaction);
1805 				CachedNode cached(this);
1807 					= cached.SetToWritableHeader(transaction);
1829 	const bplustree_node* node, CachedNode& cached, uint16 index,
1865 			if (cached.MakeWritable(transaction) == NULL)
1936 				if (cached.MakeWritable(transaction) == NULL)
2017 			if (cached.MakeWritable(transaction) == NULL)
2114 	CachedNode cached(this);
2116 		&& (node = cached.SetTo(nodeAndKey.nodeOffset)) != NULL) {
2131 					return _RemoveDuplicate(transaction, node, cached,
2153 		bplustree_node* writableNode = cached.MakeWritable(transaction);
2171 				CachedNode cached(this);
2173 					= cached.SetToWritableHeader(transaction);
2205 		cached.Free(transaction, nodeAndKey.nodeOffset);
2235 	CachedNode cached(this);
2238 	while ((node = cached.SetTo(nodeOffset)) != NULL) {
2246 				bplustree_node* writableNode = cached.MakeWritable(transaction);
2293 	CachedNode cached(this);
2300 	while ((node = cached.SetTo(nodeOffset)) != NULL) {
2362 	CachedNode cached(this);
2386 				status_t status = cached.SetTo(duplicateOffset, &node, false);
2478 				const bplustree_node* previous = cached.SetTo(lastOffset, true);
2491 			status_t status = _ValidateChild(check, cached, level, childOffset,
2507 		status_t status = _ValidateChild(check, cached, level, childOffset,
2521 BPlusTree::_ValidateChild(TreeCheck& check, CachedNode& cached, uint32 level,
2526 	status_t status = cached.SetTo(offset, &node, true);
2591 	CachedNode cached(fTree);
2594 	while ((node = cached.SetTo(nodeOffset)) != NULL) {
2661 	CachedNode cached(fTree);
2670 			node = cached.SetTo(bplustree_node::FragmentOffset(fDuplicateNode),
2681 					&& (node = cached.SetTo(fDuplicateNode, false)) != NULL) {
2701 	if ((node = cached.SetTo(fCurrentNodeOffset)) == NULL)
2716 			node = cached.SetTo(fCurrentNodeOffset);
2777 		node = cached.SetTo(bplustree_node::FragmentOffset(fDuplicateNode),
2824 	CachedNode cached(fTree);
2826 	while ((node = cached.SetTo(nodeOffset)) != NULL) {