public override void CaseASimpleInvokeExp(ASimpleInvokeExp node)
{
Item currentFile = GetIncludeItem(node);
//If the method invocation is in a moved field, refference that field instead
if (Util.GetAncestor <AFieldDecl>(node) != null)
{
Item i = allItems.OfType <FieldItem>().FirstOrDefault(item => item.FieldDecl == Util.GetAncestor <AFieldDecl>(node));
if (i != null)
{
currentFile = i;
}
}
AMethodDecl decl = finalTrans.data.SimpleMethodLinks[node];
Item declItem = ((Item)allItems.OfType <MethodDeclItem>().FirstOrDefault(item => item.RealDecl == decl)) ??
allItems.OfType <IncludeItem>().First(
item => item.Current == Util.GetAncestor <AASourceFile>(decl));
List <Item> cPath = currentFile.Path;
List <Item> dPath = declItem.Path;
for (int i = 0; i < Math.Min(cPath.Count, dPath.Count); i++)
{
Item cItem = cPath[i];
Item dItem = dPath[i];
if (cItem != dItem)
{//We have a fork in the decls. make sure that the decl is before the used
int cI = cPath[i - 1].Children.IndexOf(cItem);
int dI = dPath[i - 1].Children.IndexOf(dItem);
if (dI < cI)
{
break;
}
//Move the decl up before the used
if (!(declItem is MethodDeclItem))
{
declItem = new MethodDeclItem(decl, cPath[i - 1], new List <Item>());
allItems.Add(declItem);
}
else
{
declItem.Parent.Children.Remove(declItem);
declItem.Parent = cPath[i - 1];
}
cPath[i - 1].Children.Insert(cI, declItem);
break;
}
if (i == cPath.Count - 1)
{
if (i == dPath.Count - 1)
{
//The decl and use is in same file. Ensure that the decl is before
if (Util.TokenLessThan(decl.GetName(), node.GetName()))
{
break;
}
//Add the decl item
declItem = new MethodDeclItem(decl, cPath[i], new List <Item>());
allItems.Add(declItem);
cPath[i].Children.Add(declItem);
break;
}
else
{
//The decl is included here or somewhere deeper. But above the use
break;
}
}
else if (i == dPath.Count - 1)
{
//We have reached the file where the decl is, but the use is included deeper, so it is above. Insert decl
int cI = cPath[i].Children.IndexOf(cPath[i + 1]);
declItem = new MethodDeclItem(decl, cPath[i], new List <Item>());
allItems.Add(declItem);
cPath[i].Children.Insert(cI, declItem);
break;
}
}
base.CaseASimpleInvokeExp(node);
}
public override void CaseASimpleInvokeExp(ASimpleInvokeExp node)
{
Item currentFile = GetIncludeItem(node);
//If the method invocation is in a moved field, refference that field instead
if (Util.GetAncestor<AFieldDecl>(node) != null)
{
Item i = allItems.OfType<FieldItem>().FirstOrDefault(item => item.FieldDecl == Util.GetAncestor<AFieldDecl>(node));
if (i != null)
currentFile = i;
}
AMethodDecl decl = finalTrans.data.SimpleMethodLinks[node];
Item declItem = ((Item)allItems.OfType<MethodDeclItem>().FirstOrDefault(item => item.RealDecl == decl)) ??
allItems.OfType<IncludeItem>().First(
item => item.Current == Util.GetAncestor<AASourceFile>(decl));
List<Item> cPath = currentFile.Path;
List<Item> dPath = declItem.Path;
for (int i = 0; i < Math.Min(cPath.Count, dPath.Count); i++)
{
Item cItem = cPath[i];
Item dItem = dPath[i];
if (cItem != dItem)
{//We have a fork in the decls. make sure that the decl is before the used
int cI = cPath[i - 1].Children.IndexOf(cItem);
int dI = dPath[i - 1].Children.IndexOf(dItem);
if (dI < cI)
{
break;
}
//Move the decl up before the used
if (!(declItem is MethodDeclItem))
{
declItem = new MethodDeclItem(decl, cPath[i - 1], new List<Item>());
allItems.Add(declItem);
}
else
{
declItem.Parent.Children.Remove(declItem);
declItem.Parent = cPath[i - 1];
}
cPath[i - 1].Children.Insert(cI, declItem);
break;
}
if (i == cPath.Count - 1)
{
if (i == dPath.Count - 1)
{
//The decl and use is in same file. Ensure that the decl is before
if (Util.TokenLessThan(decl.GetName(), node.GetName()))
break;
//Add the decl item
declItem = new MethodDeclItem(decl, cPath[i], new List<Item>());
allItems.Add(declItem);
cPath[i].Children.Add(declItem);
break;
}
else
{
//The decl is included here or somewhere deeper. But above the use
break;
}
}
else if (i == dPath.Count - 1)
{
//We have reached the file where the decl is, but the use is included deeper, so it is above. Insert decl
int cI = cPath[i].Children.IndexOf(cPath[i + 1]);
declItem = new MethodDeclItem(decl, cPath[i], new List<Item>());
allItems.Add(declItem);
cPath[i].Children.Insert(cI, declItem);
break;
}
}
base.CaseASimpleInvokeExp(node);
}
public static void Apply(AAProgram ast, FinalTransformations finalTrans)
{
//Build list of file dependacies
Phase1 phase1 = new Phase1(finalTrans);
ast.Apply(phase1);
var dependancies = phase1.dependancies;
if (dependancies.Keys.Count == 0)
{
return;
}
AASourceFile root = Util.GetAncestor <AASourceFile>(finalTrans.mainEntry) ??
dependancies.Keys.FirstOrDefault(file => !file.GetName().Text.Contains("\\")) ??
dependancies.Keys.First(file => true);
//Remove files unreachable from root
//On second thought, dont. there might be static refferences the other way which needs to be included
/*{
* List<AASourceFile> reachable = GetReachable(root, dependancies);
* AASourceFile[] keys = new AASourceFile[dependancies.Count];
* dependancies.Keys.CopyTo(keys, 0);
* foreach (AASourceFile key in keys)
* {
* if (!reachable.Contains(key))
* dependancies.Remove(key);
* }
* }*/
//Push common depancies up
/*
* root -> (item1 -> (item3), item2 -> (item4 -> (item3)))
*
* root -> (item3, item1, item2 -> (item4))
*/
//Add unreachable to the root
while (true)
{
List <AASourceFile> reachable = new List <AASourceFile>();
GetReachable(root, dependancies, ref reachable);
if (reachable.Count == dependancies.Count + (reachable.Contains(null) ? 1 : 0))
{
break;
}
AASourceFile[] keys = new AASourceFile[dependancies.Count];
dependancies.Keys.CopyTo(keys, 0);
foreach (AASourceFile key in keys)
{
if (!reachable.Contains(key))
{
AASourceFile k = key;
//See if you can find another unreachable file which need this file
Dictionary <AASourceFile, int> decendantCounts = new Dictionary <AASourceFile, int>();
decendantCounts.Add(k, CountDecendants(k, dependancies, new List <AASourceFile>()));
while (true)
{
AASourceFile file = null;
foreach (KeyValuePair <AASourceFile, List <AASourceFile> > dependancy in dependancies)
{
if (decendantCounts.ContainsKey(dependancy.Key))
{
continue;
}
if (!dependancy.Value.Contains(k))
{
continue;
}
file = dependancy.Key;
break;
}
//AASourceFile file = dependancies.FirstOrDefault(item => item.Value.Contains(k)).Key;
if (file == null)
{
break;
}
decendantCounts.Add(file, CountDecendants(file, dependancies, new List <AASourceFile>()));
k = file;
}
foreach (KeyValuePair <AASourceFile, int> decendantItem in decendantCounts)
{
if (decendantItem.Value > decendantCounts[k])
{
k = decendantItem.Key;
}
}
dependancies[root].Add(k);
break;
}
}
}
//It is moved down here because cycles are not removed in unreachable
RemoveCycles(root, dependancies, new List <AASourceFile> {
root
});
//Convert to tree to make it easier
List <Item> allItems = new List <Item>();
IncludeItem rootIncludeItem = MakeTree(root, dependancies, allItems, null);
bool[] removed = new bool[allItems.Count];
for (int i = 0; i < removed.Length; i++)
{
removed[i] = false;
}
int removedCount = 0;
//Ensure that each include is only included one place
for (int i = 0; i < allItems.Count; i++)
{
if (removed[i])
{
continue;
}
IncludeItem item1 = (IncludeItem)allItems[i];
for (int j = i + 1; j < allItems.Count; j++)
{
if (removed[j])
{
continue;
}
IncludeItem item2 = (IncludeItem)allItems[j];
if (item1.Current == item2.Current)
{
List <Item> path1 = item1.Path;
List <Item> path2 = item2.Path;
for (int k = 0; k < Math.Min(path1.Count, path2.Count); k++)
{
if (path1[k] != path2[k])
{
int insertAt = Math.Min(path1[k - 1].Children.IndexOf(path1[k]),
path2[k - 1].Children.IndexOf(path2[k]));
item1.Parent.Children.Remove(item1);
LinkedList <IncludeItem> toRemove = new LinkedList <IncludeItem>();
toRemove.AddLast(item2);
while (toRemove.Count > 0)
{
IncludeItem item = toRemove.First.Value;
toRemove.RemoveFirst();
item.Parent.Children.Remove(item);
//allItems.Remove(item);
removedCount++;
removed[item.ListIndex] = true;
foreach (IncludeItem child in item.Children)
{
toRemove.AddLast(child);
}
}
//j--;
path1[k - 1].Children.Insert(insertAt, item1);
item1.Parent = path1[k - 1];
break;
}
}
}
}
}
List <Item> newAllItems = new List <Item>(allItems.Count - removedCount);
for (int i = 0; i < allItems.Count; i++)
{
if (!removed[i])
{
newAllItems.Add(allItems[i]);
}
}
allItems = newAllItems;
//Move the null node to nr [0]
foreach (IncludeItem item in allItems)
{
if (item.Current == null)
{
int itemIndex = item.Parent.Children.IndexOf(item);
Item item0 = item.Parent.Children[0];
item.Parent.Children[0] = item;
item.Parent.Children[itemIndex] = item0;
break;
}
}
//Insert method decls and move structs & fields up as needed
ast.Apply(new Phase2(finalTrans, allItems));
//Insert the headers in the files
if (Options.Compiler.OneOutputFile)
{
//for (int i = 0; i < allItems.Count; i++)
int i = 0;
while (allItems.Count > 0)
{
if (allItems[i] is IncludeItem)
{
IncludeItem includeItem = (IncludeItem)allItems[i];
//Dont want the standard lib
if (includeItem.Current == null)
{
i++;
continue;
}
//If it has children with children, then pick another first
if (includeItem.Children.Any(child => child.Children.Count > 0))
{
i++;
continue;
}
if (includeItem.Children.Count == 0)
{
if (includeItem.Parent == null)
{
break;
}
i++;
continue;
}
i = 0;
//Put all children into this
while (includeItem.Children.Count > 0)
{
int childNr = includeItem.Children.Count - 1;
allItems.Remove(includeItem.Children[childNr]);
if (includeItem.Children[childNr] is FieldItem)
{
FieldItem aItem = (FieldItem)includeItem.Children[childNr];
Node node = aItem.FieldDecl;
node.Parent().RemoveChild(node);
includeItem.Current.GetDecl().Insert(0, node);
}
else if (includeItem.Children[childNr] is StructItem)
{
StructItem aItem = (StructItem)includeItem.Children[childNr];
Node node = aItem.StructDecl;
node.Parent().RemoveChild(node);
includeItem.Current.GetDecl().Insert(0, node);
}
else if (includeItem.Children[childNr] is MethodDeclItem)
{
MethodDeclItem aItem = (MethodDeclItem)includeItem.Children[childNr];
AMethodDecl aNode = new AMethodDecl();
if (aItem.RealDecl.GetStatic() != null)
{
aNode.SetStatic(new TStatic("static"));
}
aNode.SetReturnType(Util.MakeClone(aItem.RealDecl.GetReturnType(), finalTrans.data));
aNode.SetName(new TIdentifier(aItem.RealDecl.GetName().Text));
foreach (AALocalDecl formal in aItem.RealDecl.GetFormals())
{
AALocalDecl clone = new AALocalDecl(new APublicVisibilityModifier(), null, null, null, null, Util.MakeClone(formal.GetType(), finalTrans.data), new TIdentifier(formal.GetName().Text), null);
aNode.GetFormals().Add(clone);
}
includeItem.Current.GetDecl().Insert(0, aNode);
}
else if (includeItem.Children[childNr] is IncludeItem)
{
IncludeItem aChild = (IncludeItem)includeItem.Children[childNr];
if (aChild.Current == null)
{
AIncludeDecl node = new AIncludeDecl(new TInclude("include"),
new TStringLiteral("\"TriggerLibs/NativeLib\""));
includeItem.Current.GetDecl().Insert(0, node);
}
else
{
PDecl[] decls = new PDecl[aChild.Current.GetDecl().Count];
aChild.Current.GetDecl().CopyTo(decls, 0);
for (int k = decls.Length - 1; k >= 0; k--)
{
includeItem.Current.GetDecl().Insert(0, decls[k]);
}
aChild.Current.Parent().RemoveChild(aChild.Current);
//i = -1;
}
}
includeItem.Children.RemoveAt(childNr);
}
}
}
}
else
{
foreach (IncludeItem includeItem in allItems.OfType <IncludeItem>())
{
for (int i = includeItem.Children.Count - 1; i >= 0; i--)
{
Node node;
if (includeItem.Children[i] is IncludeItem)
{
IncludeItem aItem = (IncludeItem)includeItem.Children[i];
node = new AIncludeDecl(new TInclude("include"),
new TStringLiteral("\"" + (aItem.Current == null ? "TriggerLibs/NativeLib" : aItem.Current.GetName().Text.Replace("\\", "/")) + "\""));
if (aItem.Current == null && finalTrans.mainEntry != null)
{
//Search for user defined initlib
bool foundInvoke = false;
foreach (ASimpleInvokeExp invokeExp in finalTrans.data.SimpleMethodLinks.Keys)
{
if (invokeExp.GetName().Text == "libNtve_InitLib" && invokeExp.GetArgs().Count == 0)
{
/*finalTrans.errors.Add(new ErrorCollection.Error(invokeExp.GetName(),
* Util.GetAncestor<AASourceFile>(
* invokeExp),
* "You are invoking libNtve_InitLib() yourself somewhere. It will not be auto inserted.",
* true));*/
foundInvoke = true;
break;
}
}
if (!foundInvoke)
{
//Init the lib
ASimpleInvokeExp initExp = new ASimpleInvokeExp();
initExp.SetName(new TIdentifier("libNtve_InitLib"));
finalTrans.data.ExpTypes[initExp] = new AVoidType(new TVoid("void"));
foreach (AMethodDecl method in finalTrans.data.Libraries.Methods)
{
if (method.GetName().Text == "libNtve_InitLib" && method.GetFormals().Count == 0)
{
finalTrans.data.SimpleMethodLinks[initExp] = method;
}
}
AABlock block = (AABlock)finalTrans.mainEntry.GetBlock();
block.GetStatements().Insert(0, new AExpStm(new TSemicolon(";"), initExp));
}
}
}
else if (includeItem.Children[i] is FieldItem)
{
FieldItem aItem = (FieldItem)includeItem.Children[i];
node = aItem.FieldDecl;
node.Parent().RemoveChild(node);
}
else if (includeItem.Children[i] is StructItem)
{
StructItem aItem = (StructItem)includeItem.Children[i];
node = aItem.StructDecl;
node.Parent().RemoveChild(node);
}
else if (includeItem.Children[i] is MethodDeclItem)
{
MethodDeclItem aItem = (MethodDeclItem)includeItem.Children[i];
AMethodDecl aNode = new AMethodDecl();
if (aItem.RealDecl.GetStatic() != null)
{
aNode.SetStatic(new TStatic("static"));
}
aNode.SetReturnType(Util.MakeClone(aItem.RealDecl.GetReturnType(), finalTrans.data));
aNode.SetName(new TIdentifier(aItem.RealDecl.GetName().Text));
foreach (AALocalDecl formal in aItem.RealDecl.GetFormals())
{
AALocalDecl clone = new AALocalDecl(new APublicVisibilityModifier(), null, null, null, null, Util.MakeClone(formal.GetType(), finalTrans.data), new TIdentifier(formal.GetName().Text), null);
aNode.GetFormals().Add(clone);
}
node = aNode;
}
else
{
throw new Exception("FixIncludes.Apply: Unexpected item type");
}
includeItem.Current.GetDecl().Insert(0, node);
}
}
}
}