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

209

runs[CountRuns()] = run;

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

213

(CountRuns() - index) * sizeof(off_t));

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

217

count = HOST_ENDIAN_TO_BFS_INT32(CountRuns() + 1);

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

247

int32 min = 0, max = CountRuns() - 1;

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

304

for (int32 j = 0; j < array->CountRuns(); j++) {

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

332

if (fLastArray == NULL || fLastArray->CountRuns() == fLastArray->MaxRuns())

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

390

if (ArrayAt(i)->CountRuns() > max)

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

391

max = ArrayAt(i)->CountRuns();

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

455

|| array->CountRuns() > maxRuns

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

456

|| array->CountRuns() <= 0) {

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

458

(int)array->CountRuns(), (int)array->MaxRuns(), (int)maxRuns);

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

463

for (int32 i = 0; i < array->CountRuns(); i++) {

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

468

PRINT(("Log entry has %" B_PRId32 " entries\n", array->CountRuns()));

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

503

for (int32 index = 0; index < array->CountRuns(); index++) {

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

533

for (int32 index = 0; index < array->CountRuns(); index++) {

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

819

for (int32 i = 0; i < array->CountRuns(); i++) {

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

858

for (int32 i = 0; i < array->CountRuns(); i++) {