public KeyValuePairList <MftSegmentReference, FileNameRecord> GetAllEntries(NTFSVolume volume, IndexRootRecord rootRecord)
{
KeyValuePairList <MftSegmentReference, FileNameRecord> result = new KeyValuePairList <MftSegmentReference, FileNameRecord>();
List <IndexNodeEntry> parents = new List <IndexNodeEntry>(rootRecord.IndexEntries);
List <IndexRecord> leaves = new List <IndexRecord>();
int parentIndex = 0;
while (parentIndex < parents.Count)
{
IndexNodeEntry parent = parents[parentIndex];
byte[] clusters = this.ReadDataClusters(volume, parent.SubnodeVCN, rootRecord.ClustersPerIndexRecord);
IndexRecord record = new IndexRecord(clusters, 0);
if (record.HasChildren)
{
foreach (IndexNodeEntry node in record.IndexEntries)
{
parents.Add(node);
}
}
else
{
leaves.Add(record);
}
parentIndex++;
}
foreach (IndexNodeEntry node in parents)
{
if (!node.IsLastEntry)
{
// Some of the tree data in NTFS is contained in non-leaf keys
FileNameRecord parentRecord = new FileNameRecord(node.Key, 0);
result.Add(node.SegmentReference, parentRecord);
}
}
foreach (IndexRecord record in leaves)
{
foreach (FileNameIndexEntry entry in record.FileNameEntries)
{
result.Add(entry.FileReference, entry.Record);
}
}
result.Sort(Compare);
return(result);
}
public IndexNode(byte[] buffer, int offset)
{
int position = offset;
while (true)
{
IndexNodeEntry node = new IndexNodeEntry(buffer, ref position);
if (node.IsLastEntry && !node.PointsToSubnode)
{
break;
}
Entries.Add(node);
if (node.IsLastEntry)
{
break;
}
}
}