mirror of
https://github.com/aaru-dps/Aaru.git
synced 2026-07-08 18:16:24 +00:00
232 lines
8.9 KiB
C#
232 lines
8.9 KiB
C#
// /***************************************************************************
|
|
// Aaru Data Preservation Suite
|
|
// ----------------------------------------------------------------------------
|
|
//
|
|
// Filename : Analyze.cs
|
|
// Author(s) : Natalia Portillo <claunia@claunia.com>
|
|
//
|
|
// Component : Opera filesystem plugin.
|
|
//
|
|
// --[ License ] --------------------------------------------------------------
|
|
//
|
|
// This library is free software; you can redistribute it and/or modify
|
|
// it under the terms of the GNU Lesser General Public License as
|
|
// published by the Free Software Foundation; either version 2.1 of the
|
|
// License, or (at your option) any later version.
|
|
//
|
|
// This library is distributed in the hope that it will be useful, but
|
|
// WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
// Lesser General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
// License along with this library; if not, see <http://www.gnu.org/licenses/>.
|
|
//
|
|
// ----------------------------------------------------------------------------
|
|
// Copyright © 2011-2026 Natalia Portillo
|
|
// ****************************************************************************/
|
|
|
|
using System;
|
|
using System.Collections.Generic;
|
|
using System.Linq;
|
|
using Aaru.CommonTypes;
|
|
using Aaru.CommonTypes.Enums;
|
|
using Aaru.CommonTypes.Interfaces;
|
|
using Aaru.CommonTypes.Structs;
|
|
|
|
namespace Aaru.Filesystems;
|
|
|
|
public sealed partial class OperaFS
|
|
{
|
|
#region IReadOnlyFilesystem Members
|
|
|
|
/// <inheritdoc />
|
|
public ErrorNumber GetFilesWithAffectedSectors(IEnumerable<(ulong Start, ulong End)> sectorExtents,
|
|
out List<FileSectorInfo> files,
|
|
InitProgressHandler initProgress = null,
|
|
UpdateProgressHandler updateProgress = null,
|
|
PulseProgressHandler pulseProgress = null,
|
|
EndProgressHandler endProgress = null)
|
|
{
|
|
files = [];
|
|
|
|
if(!_mounted) return ErrorNumber.AccessDenied;
|
|
if(sectorExtents is null) return ErrorNumber.InvalidArgument;
|
|
|
|
List<(ulong Start, ulong End)> normalizedExtents = NormalizeAnalyzeExtents(sectorExtents);
|
|
|
|
if(normalizedExtents.Count == 0) return ErrorNumber.NoError;
|
|
|
|
try
|
|
{
|
|
initProgress?.Invoke();
|
|
|
|
return TraverseDirectoryForAffectedSectors("/",
|
|
normalizedExtents,
|
|
files,
|
|
updateProgress,
|
|
pulseProgress);
|
|
}
|
|
finally
|
|
{
|
|
endProgress?.Invoke();
|
|
}
|
|
}
|
|
|
|
#endregion
|
|
|
|
ErrorNumber TraverseDirectoryForAffectedSectors(string path,
|
|
IReadOnlyList<(ulong Start, ulong End)> sectorExtents,
|
|
List<FileSectorInfo> files,
|
|
UpdateProgressHandler updateProgress,
|
|
PulseProgressHandler pulseProgress)
|
|
{
|
|
pulseProgress?.Invoke(path);
|
|
|
|
ErrorNumber errno = OpenDir(path, out IDirNode node);
|
|
|
|
if(errno != ErrorNumber.NoError) return errno;
|
|
|
|
try
|
|
{
|
|
List<string> entries = [];
|
|
|
|
while(true)
|
|
{
|
|
errno = ReadDir(node, out string entryName);
|
|
|
|
if(errno != ErrorNumber.NoError) return errno;
|
|
if(entryName is null) break;
|
|
|
|
entries.Add(entryName);
|
|
}
|
|
|
|
string[] orderedEntries = entries.Where(static entry => !string.IsNullOrWhiteSpace(entry))
|
|
.OrderBy(static entry => entry, StringComparer.OrdinalIgnoreCase)
|
|
.ToArray();
|
|
long maximum = orderedEntries.Length > 0 ? orderedEntries.Length : 1;
|
|
|
|
for(int i = 0; i < orderedEntries.Length; i++)
|
|
{
|
|
string entryPath = path == "/" ? "/" + orderedEntries[i] : path + "/" + orderedEntries[i];
|
|
|
|
updateProgress?.Invoke(entryPath, i + 1, maximum);
|
|
|
|
errno = GetFileEntry(entryPath, out DirectoryEntryWithPointers entry);
|
|
|
|
if(errno != ErrorNumber.NoError) return errno;
|
|
|
|
if((entry.Entry.flags & FLAGS_MASK) == (uint)FileFlags.Directory)
|
|
{
|
|
errno = TraverseDirectoryForAffectedSectors(entryPath,
|
|
sectorExtents,
|
|
files,
|
|
updateProgress,
|
|
pulseProgress);
|
|
|
|
if(errno != ErrorNumber.NoError) return errno;
|
|
|
|
continue;
|
|
}
|
|
|
|
errno = AddOverlappingFile(entryPath, entry, sectorExtents, files);
|
|
|
|
if(errno != ErrorNumber.NoError) return errno;
|
|
}
|
|
|
|
return ErrorNumber.NoError;
|
|
}
|
|
finally
|
|
{
|
|
CloseDir(node);
|
|
}
|
|
}
|
|
|
|
ErrorNumber AddOverlappingFile(string path, DirectoryEntryWithPointers entry,
|
|
IReadOnlyList<(ulong Start, ulong End)> sectorExtents,
|
|
List<FileSectorInfo> files)
|
|
{
|
|
if(entry.Entry.byte_count == 0 || entry.Pointers is not { Length: > 0 }) return ErrorNumber.NoError;
|
|
|
|
List<(ulong Start, ulong End)> overlaps = FindOverlappingExtents(entry, sectorExtents);
|
|
|
|
if(overlaps.Count == 0) return ErrorNumber.NoError;
|
|
|
|
files.Add(new FileSectorInfo
|
|
{
|
|
Path = path,
|
|
Inode = entry.Entry.id,
|
|
AffectedSectors = overlaps
|
|
});
|
|
|
|
return ErrorNumber.NoError;
|
|
}
|
|
|
|
List<(ulong Start, ulong End)> FindOverlappingExtents(DirectoryEntryWithPointers entry,
|
|
IReadOnlyList<(ulong Start, ulong End)> sectorExtents)
|
|
{
|
|
List<(ulong Start, ulong End)> overlaps = [];
|
|
|
|
ulong fileBlockSizeRatio;
|
|
|
|
if(_image.Info.SectorSize is 2336 or 2352 or 2448)
|
|
fileBlockSizeRatio = entry.Entry.block_size / 2048;
|
|
else
|
|
fileBlockSizeRatio = entry.Entry.block_size / _image.Info.SectorSize;
|
|
|
|
if(fileBlockSizeRatio == 0) fileBlockSizeRatio = 1;
|
|
|
|
ulong sectorsUsed = (ulong)entry.Entry.block_count * fileBlockSizeRatio;
|
|
|
|
if(sectorsUsed == 0) sectorsUsed = 1;
|
|
|
|
ulong startSector = entry.Pointers[0];
|
|
ulong endSector = startSector + sectorsUsed - 1;
|
|
|
|
AddExtentOverlaps(startSector, endSector, sectorExtents, overlaps);
|
|
|
|
return NormalizeAnalyzeExtents(overlaps);
|
|
}
|
|
|
|
static void AddExtentOverlaps(ulong startSector, ulong endSector,
|
|
IReadOnlyList<(ulong Start, ulong End)> sectorExtents,
|
|
List<(ulong Start, ulong End)> overlaps)
|
|
{
|
|
foreach((ulong Start, ulong End) requestedExtent in sectorExtents)
|
|
{
|
|
if(requestedExtent.End < startSector || requestedExtent.Start > endSector) continue;
|
|
|
|
overlaps.Add((Math.Max(startSector, requestedExtent.Start), Math.Min(endSector, requestedExtent.End)));
|
|
}
|
|
}
|
|
|
|
static List<(ulong Start, ulong End)> NormalizeAnalyzeExtents(IEnumerable<(ulong Start, ulong End)> extents)
|
|
{
|
|
List<(ulong Start, ulong End)> orderedExtents = extents.Where(static extent => extent.End >= extent.Start)
|
|
.OrderBy(static extent => extent.Start)
|
|
.ThenBy(static extent => extent.End)
|
|
.ToList();
|
|
List<(ulong Start, ulong End)> normalizedExtents = [];
|
|
|
|
if(orderedExtents.Count == 0) return normalizedExtents;
|
|
|
|
(ulong Start, ulong End) currentExtent = orderedExtents[0];
|
|
|
|
for(int i = 1; i < orderedExtents.Count; i++)
|
|
{
|
|
if(orderedExtents[i].Start <= currentExtent.End + 1)
|
|
{
|
|
currentExtent.End = Math.Max(currentExtent.End, orderedExtents[i].End);
|
|
|
|
continue;
|
|
}
|
|
|
|
normalizedExtents.Add(currentExtent);
|
|
currentExtent = orderedExtents[i];
|
|
}
|
|
|
|
normalizedExtents.Add(currentExtent);
|
|
|
|
return normalizedExtents;
|
|
}
|
|
} |