file_corruption/fs/Directory.cpp

40 									size_t nameLength, bool& _exactMatch) const;
46 									size_t nameLength, uint64 blockIndex);
48 									size_t nameLength);
98 									size_t nameLength, uint64 blockIndex,
221 DirEntryBlock::FindInsertionIndex(const char* name, size_t nameLength,
241 		cmp = compare_names(entryName, entryNameLength, name, nameLength);
276 DirEntryBlock::InsertEntry(int32 index, const char* name, size_t nameLength,
294 		memmove(entryNames + nameOffset + nameLength + 2,
303 			fBlock->nameEnds[i] = fBlock->nameEnds[i - 1] + nameLength;
311 	memcpy(entryNames + nameOffset, name, nameLength);
312 	fBlock->nameEnds[index] = nameOffset + nameLength;
321 	size_t nameLength)
332 	if (oldNameLength != nameLength) {
333 		int32 lengthDiff = (int32)nameLength - (int32)oldNameLength;
339 			memmove(entryNames + nameOffset + nameLength,
350 	memcpy(entryNames + nameOffset, name, nameLength);
376 		uint32 nameLength = nameEnd - nameOffset;
384 			fBlock->nameEnds[i - 1] = fBlock->nameEnds[i] - nameLength;
489 		uint16 nameLength = nameEnd - previousEnd;
490 		if (nameLength > kCheckSumFSNameLength) {
492 				"long: %u\n", i, nameLength);
498 		if (strnlen(name, nameLength) != nameLength) {
507 				nameLength);
511 					(int)nameLength, name);
516 					(int)previousNameLength, previousName, (int)nameLength,
530 		previousNameLength = nameLength;
557 	size_t nameLength = strlen(name);
558 	if (nameLength > kCheckSumFSNameLength)
573 		int32 index = entryBlock.FindInsertionIndex(name, nameLength,
627 	size_t nameLength = strlen(name);
628 	if (nameLength > kCheckSumFSNameLength)
655 		info.index = info.entryBlock.FindInsertionIndex(name, nameLength,
733 	name = info.entryBlock.NameAt(info.index, nameLength);
734 	if (nameLength > kCheckSumFSNameLength
735 		|| strnlen(name, nameLength) != nameLength) {
740 	memcpy(foundName, name, nameLength);
741 	foundName[nameLength] = '\0';
742 	_foundNameLength = nameLength;
761 	size_t nameLength = strlen(name);
762 	if (nameLength == 0)
764 	if (nameLength > kCheckSumFSNameLength)
791 		info.index = info.entryBlock.FindInsertionIndex(name, nameLength,
838 	return _UpdateOrInsertKey(infos, depth, name, nameLength, blockIndex, true,
852 	size_t nameLength = strlen(name);
853 	if (nameLength == 0)
855 	if (nameLength > kCheckSumFSNameLength)
881 		info.index = info.entryBlock.FindInsertionIndex(name, nameLength,
945 			"\"%.*s\" (%" B_PRIuSIZE ")\n", level, info.index, (int)nameLength,
946 			name, nameLength);
975 		name = info.entryBlock.NameAt(0, nameLength);
976 		return _UpdateOrInsertKey(infos, level - 1, name, nameLength, 0, false,
1105 	const char* name, size_t nameLength, uint64 blockIndex, bool insertKey,
1110 		(int)nameLength, name, nameLength, blockIndex);
1129 	size_t nameToUpdateLength = nameLength;
1131 	size_t nextNameToInsertLength = nameLength;
1148 		nameLength = nextNameToInsertLength;
1261 				level, info.index, (int)nameLength, name, nameLength,
1264 			if (info.entryBlock.FreeSpace() >= nameLength + 10) {
1266 					nameLength, blockIndex);
1299 			error = _InsertEntrySplitBlock(level, info, nameLength + 10,
1310 				ASSERT(info.entryBlock.FreeSpace() >= nameLength + 10);
1313 					nameLength, blockIndex);
1326 				ASSERT(newEntryBlock.FreeSpace() >= nameLength + 10);
1330 				newEntryBlock.InsertEntry(info.index, name, nameLength,
1384 	size_t nameLength;
1385 	const char* name = newInfo.entryBlock.NameAt(0, nameLength);
1386 	rootInfo.entryBlock.InsertEntry(0, name, nameLength,
1466 		size_t nameLength;
1467 		const char* name = entryBlock.NameAt(0, nameLength);
1468 		if (nameLength != keyLength || strncmp(name, key, keyLength) != 0) {
1471 				level, blockIndex, (int)keyLength, key, (int)nameLength, name);
1481 		size_t nameLength;
1482 		const char* name = entryBlock.NameAt(i, nameLength);
1495 		if (!_Check(level + 1, childBlockIndex, name, nameLength,
1539 		size_t nameLength;
1541 		while (entryTree.LookupNextEntry(name, name, nameLength,