file_systems/bfs/Inode.cpp

147 								block_run& run, fs_vnode_ops* vnodeOps,
195 	block_run& run, fs_vnode_ops* vnodeOps, Inode** _inode)
208 	run = fRun;
210 		volume->ToVnode(run), mode, run);
374 		block_run& run)
404 	Node().inode_num = run;
1472 Inode::FindBlockRun(off_t pos, block_run& run, off_t& offset)
1476 	// find matching block run
1510 			run = indirect[current % runsPerBlock];
1511 			if (run.Length() != data->double_indirect.Length())
1539 						run = indirect[current];
1540 						offset = runBlockEnd - ((uint32)run.Length()
1542 						return fVolume->ValidateBlockRun(run);
1561 				run = data->direct[current];
1563 					- ((uint32)run.Length() << fVolume->BlockShift());
1564 				return fVolume->ValidateBlockRun(run);
1570 	return fVolume->ValidateBlockRun(run);
1691 	The allocated block_run is saved in "run"
1694 Inode::_AllocateBlockArray(Transaction& transaction, block_run& run,
1697 	if (!run.IsZero())
1700 	status_t status = fVolume->Allocate(transaction, this, length, run,
1707 	off_t block = fVolume->ToBlock(run);
1709 	for (int32 i = 0; i < run.Length(); i++) {
1811 		block_run run;
1813 			run, minimum);
1820 		blocksNeeded -= run.Length();
1835 				// can we merge the last allocated run with the new one?
1837 				if (free > 0 && data->direct[last].MergeableWith(run)) {
1839 						data->direct[last].Length() + run.Length());
1841 					data->direct[free] = run;
1845 					+ run.Length() * fVolume->BlockSize());
1900 				// try to insert the run to the last one - note that this
1906 				if (free > 0 && runs[last].MergeableWith(run)) {
1908 						runs[last].Length() + run.Length());
1910 					runs[free] = run;
1914 					+ ((uint32)run.Length() << fVolume->BlockShift()));
1926 			// the allocation succeeds, we don't run into an endless loop.
1932 			if ((run.Length() % minimum) != 0) {
1938 				int32 rest = run.Length() % minimum;
1939 				run.length = HOST_ENDIAN_TO_BFS_INT16(run.Length() - rest);
1942 					block_run::Run(run.AllocationGroup(),
1943 					run.Start() + run.Length(), rest));
1950 				// Are there any blocks left in the run? If not, allocate
1952 				if (run.length == 0)
1988 			uint32 runLength = run.Length();
1990 			while (run.length != 0) {
2027 						runs[index % runsPerBlock] = run;
2032 						run.start = HOST_ENDIAN_TO_BFS_INT16(run.Start()
2034 						run.length = HOST_ENDIAN_TO_BFS_INT16(run.Length()
2036 					} while ((++index % runsPerBlock) != 0 && run.length);
2037 				} while ((index % runsPerArray) != 0 && run.length);
2080 	block_run run, off_t size, off_t offset, off_t& max)
2084 		indirectSize = double_indirect_max_indirect_size(run.Length(),
2087 		indirectSize = double_indirect_max_direct_size(run.Length(),
2103 	off_t blockNumber = fVolume->ToBlock(run);
2105 	// set the file offset to the current block run
2108 	for (int32 i = index / runsPerBlock; i < run.Length(); i++) {
2118 				i = run.Length();
2170 		block_run run = array[i];
2175 			run.start = HOST_ENDIAN_TO_BFS_INT16(array[i].Start()
2179 			array[i].length = HOST_ENDIAN_TO_BFS_INT16(run.Start()
2181 			run.length = HOST_ENDIAN_TO_BFS_INT16(run.Length()
2184 			if (run.length == 0)
2198 		if (fVolume->Free(transaction, run) < B_OK)
2717 	block_run run;
2719 	status = allocator.New(&parentRun, mode, publishFlags, run, vnodeOps,
2734 		node->parent = run;
2768 		parent->Attributes() = run;