file_systems/bfs/Journal.cpp

24 	void Insert(block_run& run);
35 	int32 _FindInsertionIndex(block_run& run);
56 			bool			_ContainsRun(block_run& run);
57 			bool			_AddRun(block_run& run);
189 	This makes a freshly allocated run_array ready to run.
204 run_array::Insert(block_run& run)
206 	int32 index = _FindInsertionIndex(run);
209 		runs[CountRuns()] = run;
214 		runs[index] = run;
245 run_array::_FindInsertionIndex(block_run& run)
253 			int cmp = _Compare(runs[i], run);
262 		if (_Compare(runs[i], run) < 0)
266 			if (_Compare(runs[i], run) > 0)
299 RunArrays::_ContainsRun(block_run& run)
306 			if (run.AllocationGroup() != arrayRun.AllocationGroup())
309 			if (run.Start() >= arrayRun.Start()
310 				&& run.Start() + run.Length()
325 RunArrays::_AddRun(block_run& run)
327 	ASSERT(run.length == 1);
335 	fLastArray->Insert(run);
365 	block_run run = volume->ToBlockRun(blockNumber);
369 		if (_ContainsRun(run))
375 	if (!_AddRun(run)) {
377 		if (_AddArray() != B_OK || !_AddRun(run))
444 /*!	\brief Does a very basic consistency check of the run array.
445 	It will check the maximum run count as well as if all of the runs fall
457 		dprintf("run count: %d, array max: %d, max runs: %d\n",
495 	// First pass: check integrity of the blocks in the run array
504 		const block_run& run = array->RunAt(index);
506 		off_t offset = fVolume->ToOffset(run);
507 		for (int32 i = 0; i < run.Length(); i++) {
534 		const block_run& run = array->RunAt(index);
535 		INFORM(("replay block run %u:%u:%u in log at %" B_PRIdOFF "!\n",
536 			(int)run.AllocationGroup(), run.Start(), run.Length(), blockNumber));
538 		off_t offset = fVolume->ToOffset(run);
539 		for (int32 i = 0; i < run.Length(); i++) {
820 			const block_run& run = array->RunAt(i);
821 			off_t blockNumber = fVolume->ToBlock(run);
823 			for (int32 j = 0; j < run.Length(); j++) {
859 			const block_run& run = array->RunAt(i);
860 			off_t blockNumber = fVolume->ToBlock(run);
862 			for (int32 j = 0; j < run.Length(); j++) {