file_systems/btrfs/BTree.cpp

211 BTree::Node::Copy(const Node* origin, uint32 start, uint32 end, int length)
220 		// like removing [0, start - 1] and keeping [start, end]
221 		length = -origin->_CalculateSpace(0, start - 1, 2);
222 		_Copy(origin, 0, start, end, length);
224 		// removing all items in [start, end]
225 		if (start > 0)
226 			_Copy(origin, 0, 0, start - 1, 0);	// <-- [start,...
230 			length += origin->_CalculateSpace(start, end);
231 			_Copy(origin, start, end + 1, origin->ItemCount() - 1, length);
234 		// inserting in [start, end] - make a hole for later
235 		if (start > 0)
236 			_Copy(origin, 0, 0, start - 1, 0);
237 		if (start < origin->ItemCount()) {
238 			length -= origin->_CalculateSpace(start, end);
239 			_Copy(origin, end + 1, start, origin->ItemCount() - 1, length);
248 BTree::Node::MoveEntries(uint32 start, uint32 end, int length) const
261 		// removing [start, end]
262 		TRACE("Node::MoveEntries() removing ... start %" B_PRIu32 " end %"
263 			B_PRIu32 " length %i\n", start, end, length);
264 		length += _CalculateSpace(start, end - 1);
267 		// inserting into [start, end] - make room for later
268 		TRACE("Node::MoveEntries() inserting ... start %" B_PRIu32 " end %"
269 			B_PRIu32 " length %i\n", start, end, length);
270 		length -= _CalculateSpace(start, end - 1);
271 		uint32 tmp = start;
272 		start = end;
281 	memmove(base + start * entrySize, base + end * entrySize,
285 		int num = start - end;
286 		for (uint32 i = start; i < ItemCount() + num; ++i)
412 BTree::Path::CopyOnWrite(Transaction& transaction, int level, uint32 start,
422 		status = node->MoveEntries(start, start + num - 1, length);
447 	status = fNodes[level]->Copy(node, start, start + num - 1, length);