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

1249

if (arrayCount > NUM_FRAGMENT_VALUES || arrayCount < 1) {

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

1258

if (arrayCount < NUM_FRAGMENT_VALUES) {

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

1269

(NUM_FRAGMENT_VALUES + 1) * sizeof(off_t));

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

1293

memset(array, 0, (NUM_FRAGMENT_VALUES + 1) * sizeof(off_t));

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

1876

if (arrayCount > NUM_FRAGMENT_VALUES || arrayCount <= 1) {

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

1996

&& arrayCount <= NUM_FRAGMENT_VALUES) {

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

2012

&& arrayCount <= NUM_FRAGMENT_VALUES) {

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

2019

if (isLast && arrayCount <= NUM_FRAGMENT_VALUES) {

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

2033

(NUM_FRAGMENT_VALUES + 1) * sizeof(off_t));

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

2040

(NUM_FRAGMENT_VALUES + 1) * sizeof(off_t));

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

2041

memset((off_t*)duplicate + NUM_FRAGMENT_VALUES + 1, 0,

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

2042

fNodeSize - (NUM_FRAGMENT_VALUES + 1) * sizeof(off_t));

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

2455

maxSize = NUM_FRAGMENT_VALUES;

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

2983

uint32 fragment = (NUM_FRAGMENT_VALUES + 1) * ((uint64)offset & 0x3ff);

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

609

return (duplicate_array*)((off_t*)this + index * (NUM_FRAGMENT_VALUES + 1));

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

660

return nodeSize / ((NUM_FRAGMENT_VALUES + 1) * sizeof(off_t));