private static FCallGraphNode FindRecursiveChildNode(FCallGraphNode SelectedNode, FNodeSearchParams SearchParams)
{
foreach (FCallGraphNode ChildNode in SelectedNode.Children)
{
if (SearchParams.DoesNodeMatchSearch(ChildNode))
{
return(ChildNode);
}
FCallGraphNode FoundNode = FindRecursiveChildNode(ChildNode, SearchParams);
if (FoundNode != null)
{
return(FoundNode);
}
}
return(null);
}
private static FCallGraphNode FindRecursiveSiblingNode(List <FCallGraphNode> Siblings, FCallGraphNode SelectedNode, FNodeSearchParams SearchParams)
{
for (int SiblingIndex = Siblings.IndexOf(SelectedNode) + 1; SiblingIndex < Siblings.Count; ++SiblingIndex)
{
FCallGraphNode SiblingNode = Siblings[SiblingIndex];
if (SearchParams.DoesNodeMatchSearch(SiblingNode))
{
return(SiblingNode);
}
FCallGraphNode FoundNode = FindRecursiveChildNode(SiblingNode, SearchParams);
if (FoundNode != null)
{
return(FoundNode);
}
}
return(null);
}
private static void GetAllMatchingNodes(FCallGraphNode ParentNode, List <FCallGraphNode> MatchingNodes, FNodeSearchState SearchState, FNodeSearchParams SearchParams)
{
foreach (FCallGraphNode ChildNode in ParentNode.Children)
{
if (SearchParams.DoesNodeMatchSearch(ChildNode))
{
MatchingNodes.Add(ChildNode);
if (!SearchState.CallStacks.Contains(ChildNode.CallStacks[0]))
{
// If one callstack from this node is new, then all must be, due to the way the graph is arranged and the order in which it is searched
foreach (FCallStack CallStack in ChildNode.CallStacks)
{
SearchState.CallStacks.Add(CallStack);
}
SearchState.AllocationSize += ChildNode.AllocationSize;
SearchState.AllocationCount += ChildNode.AllocationCount;
}
}
GetAllMatchingNodes(ChildNode, MatchingNodes, SearchState, SearchParams);
}
}
private static void GetAllMatchingNodes(FCallGraphNode ParentNode, List<FCallGraphNode> MatchingNodes, FNodeSearchState SearchState, FNodeSearchParams SearchParams)
{
foreach (FCallGraphNode ChildNode in ParentNode.Children)
{
if (SearchParams.DoesNodeMatchSearch(ChildNode))
{
MatchingNodes.Add(ChildNode);
if (!SearchState.CallStacks.Contains(ChildNode.CallStacks[0]))
{
// If one callstack from this node is new, then all must be, due to the way the graph is arranged and the order in which it is searched
foreach (FCallStack CallStack in ChildNode.CallStacks)
{
SearchState.CallStacks.Add(CallStack);
}
SearchState.AllocationSize += ChildNode.AllocationSize;
SearchState.AllocationCount += ChildNode.AllocationCount;
}
}
GetAllMatchingNodes(ChildNode, MatchingNodes, SearchState, SearchParams);
}
}
private static FCallGraphNode FindRecursiveChildNode(FCallGraphNode SelectedNode, FNodeSearchParams SearchParams)
{
foreach (FCallGraphNode ChildNode in SelectedNode.Children)
{
if (SearchParams.DoesNodeMatchSearch(ChildNode))
{
return ChildNode;
}
FCallGraphNode FoundNode = FindRecursiveChildNode(ChildNode, SearchParams);
if (FoundNode != null)
{
return FoundNode;
}
}
return null;
}
private static FCallGraphNode FindRecursiveSiblingNode(List<FCallGraphNode> Siblings, FCallGraphNode SelectedNode, FNodeSearchParams SearchParams)
{
for (int SiblingIndex = Siblings.IndexOf(SelectedNode) + 1; SiblingIndex < Siblings.Count; ++SiblingIndex)
{
FCallGraphNode SiblingNode = Siblings[SiblingIndex];
if (SearchParams.DoesNodeMatchSearch(SiblingNode))
{
return SiblingNode;
}
FCallGraphNode FoundNode = FindRecursiveChildNode(SiblingNode, SearchParams);
if (FoundNode != null)
{
return FoundNode;
}
}
return null;
}