src/add-ons/kernel/file_systems/bfs/Journal.cpp

1084

uint32 maxRuns = run_array::MaxRuns(fVolume->BlockSize());

src/add-ons/kernel/file_systems/bfs/Journal.cpp

192

run_array::Init(int32 blockSize)

src/add-ons/kernel/file_systems/bfs/Journal.cpp

204

run_array::Insert(block_run& run)

src/add-ons/kernel/file_systems/bfs/Journal.cpp

222

run_array::MaxRuns(int32 blockSize)

src/add-ons/kernel/file_systems/bfs/Journal.cpp

225

uint32 maxCount = (blockSize - sizeof(run_array)) / sizeof(block_run);

src/add-ons/kernel/file_systems/bfs/Journal.cpp

234

run_array::_Compare(block_run& a, block_run& b)

src/add-ons/kernel/file_systems/bfs/Journal.cpp

245

run_array::_FindInsertionIndex(block_run& run)

src/add-ons/kernel/file_systems/bfs/Journal.cpp

292

run_array* array;

src/add-ons/kernel/file_systems/bfs/Journal.cpp

302

run_array* array = ArrayAt(i);

src/add-ons/kernel/file_systems/bfs/Journal.cpp

346

run_array* array = (run_array*)malloc(blockSize);

src/add-ons/kernel/file_systems/bfs/Journal.cpp

449

Journal::_CheckRunArray(const run_array* array)

src/add-ons/kernel/file_systems/bfs/Journal.cpp

45

run_array* ArrayAt(int32 i) { return fArrays.Array()[i]; }

src/add-ons/kernel/file_systems/bfs/Journal.cpp

451

int32 maxRuns = run_array::MaxRuns(fVolume->BlockSize()) - 1;

src/add-ons/kernel/file_systems/bfs/Journal.cpp

491

const run_array* array = (const run_array*)cachedArray.Block();

src/add-ons/kernel/file_systems/bfs/Journal.cpp

61

Stack<run_array*> fArrays;

src/add-ons/kernel/file_systems/bfs/Journal.cpp

62

run_array* fLastArray;

src/add-ons/kernel/file_systems/bfs/Journal.cpp

811

run_array* array = runArrays.ArrayAt(k);

src/add-ons/kernel/file_systems/bfs/Journal.h

15

struct run_array;

src/add-ons/kernel/file_systems/bfs/Journal.h

60

status_t _CheckRunArray(const run_array* array);