Lines Matching refs:blockIndex

46 									size_t nameLength, uint64 blockIndex);
72 status_t InsertEntry(const char* name, uint64 blockIndex,
98 size_t nameLength, uint64 blockIndex,
108 bool _Check(int32 level, uint64 blockIndex,
277 uint64 blockIndex)
313 blockIndices[-index] = blockIndex;
591 uint64 blockIndex = entryBlock.BlockIndexAt(index);
598 _blockIndex = blockIndex;
604 if (!block.GetReadable(fDirectory->GetVolume(), blockIndex))
752 DirEntryTree::InsertEntry(const char* name, uint64 blockIndex,
755 FUNCTION("name: \"%s\", blockIndex: %" B_PRIu64 "\n", name, blockIndex);
838 return _UpdateOrInsertKey(infos, depth, name, nameLength, blockIndex, true,
1105 const char* name, size_t nameLength, uint64 blockIndex, bool insertKey,
1109 "blockIndex: %" B_PRIu64 "\n", level, insertKey ? "insert" : "update",
1110 (int)nameLength, name, nameLength, blockIndex);
1132 uint64 nextBlockIndexToInsert = blockIndex;
1146 blockIndex = nextBlockIndexToInsert;
1260 "\"%.*s\" (%" B_PRIuSIZE "), blockIndex: %" B_PRIu64 "\n",
1262 blockIndex);
1266 nameLength, blockIndex);
1313 nameLength, blockIndex);
1331 blockIndex);
1441 DirEntryTree::_Check(int32 level, uint64 blockIndex, const char* key,
1447 B_PRIu64 " not valid!\n", level, blockIndex);
1459 B_PRIu64 " empty!\n", level, blockIndex);
1471 level, blockIndex, (int)keyLength, key, (int)nameLength, name);
1489 B_PRIu32 ")\n", level, blockIndex, childBlockIndex, i);
1508 Directory::Directory(Volume* volume, uint64 blockIndex,
1511 Node(volume, blockIndex, nodeData)
1540 uint64 blockIndex;
1542 blockIndex) == B_OK) {
1544 if (GetVolume()->GetNode(blockIndex, node) == B_OK) {
1565 "directory at %" B_PRIu64 "\n", blockIndex, BlockIndex());
1613 Directory::InsertEntry(const char* name, uint64 blockIndex,
1618 status_t error = entryTree.InsertEntry(name, blockIndex, transaction);