// return a directed graph with all possible values for this offset including all child regions
public static ByteGraphNode BuildFullGraph(ByteSource byteSource, int sourceIndex)
{
if (sourceIndex < 0 || sourceIndex >= byteSource.Bytes.Count)
{
return(null);
}
var node = new ByteGraphNode(byteSource, sourceIndex);
BuildChildGraph(byteSource, sourceIndex, ref node);
return(node);
}
private static ByteEntry CreateByteEntryByFlatteningGraph(
ByteGraphNode byteGraphNode, ByteEntry rootEntryToPopulate = null
)
{
byteGraphNode.Validate();
EnsureRootEntryExists();
PopulateFromChildNodes(); // use child data first
PopulateFromRootNode(); // override/append our data second as the priority
return(rootEntryToPopulate);
void EnsureRootEntryExists()
{
rootEntryToPopulate ??= new ByteEntry
{
Parent = byteGraphNode.ByteSource.Bytes,
ParentIndex = byteGraphNode.ByteEntry?.ParentIndex ?? byteGraphNode.SourceIndex,
// several of our collection items (bytes, annotations, etc) will store
// a reference to their parent container. since this new ByteEntry object we're making
// is more of an aggregator, we don't want to modify the parents of the things we're storing.
// we just store a reference, they really live elsewhere and hence, we're not their 'real' parent.
// "YOU'RE NOT MY REAL DAD"
DontSetParentOnCollectionItems = true,
};
}
void PopulateFromChildNodes()
{
// traverse any child nodes first.
if (byteGraphNode.Children == null)
{
return;
}
foreach (var childNode in byteGraphNode.Children)
{
CreateByteEntryByFlatteningGraph(childNode, rootEntryToPopulate);
}
}
void PopulateFromRootNode()
{
// annotations are concatenated together
if (byteGraphNode.ByteEntry?.Annotations?.Count > 0)
{
rootEntryToPopulate.AppendAnnotationsFrom(byteGraphNode.ByteEntry);
}
}
}
// caution: recursion
private static void BuildChildGraph(ByteSource byteSource, int sourceIndex, ref ByteGraphNode nodeToPopulate)
{
foreach (var childSourceToTraverse in byteSource.ChildSources)
{
var childIndex = childSourceToTraverse.RegionMapping
.ConvertIndexFromParentToChild(sourceIndex, childSourceToTraverse.ByteSource);
var newChildNode = BuildFullGraph(childSourceToTraverse.ByteSource, childIndex);
if (newChildNode == null)
{
continue;
}
nodeToPopulate.AttachChildNode(newChildNode);
}
}
// Simplified graph traversal utility.
//
// after graph traversal has happened, collapse the graph
// (of which this node is the root node) into one object.
//
// Annotations will be combined together into one list.
// If there are multiple 'byte' at different children, then we'll pick the most recent one.
//
// If you need anything more advanced than this, parse it yourself.
public static ByteEntry BuildFlatDataFrom(ByteGraphNode byteGraphNode)
{
return(CreateByteEntryByFlatteningGraph(byteGraphNode));
}
