source: branches/HeuristicLab.DataAnalysis.Symbolic.LinearInterpreter/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.4/Compiler/SymbolicExpressionTreeCompiler.cs @ 9732

Last change on this file since 9732 was 9732, checked in by bburlacu, 6 years ago

#2021: Merged trunk changes for HeuristicLab.Encodings.SymbolicExpressionTreeEncoding and HeuristicLab.Problems.DataAnalysis.Symbolic. Replaced prefix iteration of nodes in the linear interpretation with breadth iteration for simplified logic and extra performance. Reversed unnecessary changes to other projects.

File size: 3.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22using System;
23using System.Collections.Generic;
24using System.Linq;
25
26namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
27  public static class SymbolicExpressionTreeCompiler {
28
29    public static Instruction[] Compile(ISymbolicExpressionTree tree, Func<ISymbolicExpressionTreeNode, byte> opCodeMapper) {
30      return Compile(tree, opCodeMapper, Enumerable.Empty<Func<Instruction, Instruction>>());
31    }
32    public static Instruction[] Compile(ISymbolicExpressionTree tree, Func<ISymbolicExpressionTreeNode, byte> opCodeMapper, IEnumerable<Func<Instruction, Instruction>> postInstructionCompiledHooks) {
33      Dictionary<string, ushort> entryPoint = new Dictionary<string, ushort>();
34      List<Instruction> code = new List<Instruction>();
35      // compile main body branches
36      foreach (var branch in tree.Root.GetSubtree(0).Subtrees) {
37        code.AddRange(Compile(branch, opCodeMapper, postInstructionCompiledHooks));
38      }
39      // compile function branches
40      var functionBranches = from node in tree.IterateNodesPrefix()
41                             where node.Symbol is Defun
42                             select node;
43      foreach (DefunTreeNode branch in functionBranches) {
44        if (code.Count > ushort.MaxValue) throw new ArgumentException("Code for the tree is too long (> ushort.MaxValue).");
45        entryPoint[branch.FunctionName] = (ushort)code.Count;
46        code.AddRange(Compile(branch.GetSubtree(0), opCodeMapper, postInstructionCompiledHooks));
47      }
48      // address of all functions is fixed now
49      // iterate through code again and fill in the jump locations
50      for (int i = 0; i < code.Count; i++) {
51        Instruction instr = code[i];
52        if (instr.dynamicNode.Symbol is InvokeFunction) {
53          var invokeNode = (InvokeFunctionTreeNode)instr.dynamicNode;
54          instr.iArg0 = entryPoint[invokeNode.Symbol.FunctionName];
55        }
56      }
57
58      return code.ToArray();
59    }
60
61    private static IEnumerable<Instruction> Compile(ISymbolicExpressionTreeNode branch, Func<ISymbolicExpressionTreeNode, byte> opCodeMapper, IEnumerable<Func<Instruction, Instruction>> postInstructionCompiledHooks) {
62      foreach (var node in branch.IterateNodesPrefix()) {
63        Instruction instr = new Instruction();
64        int subtreesCount = node.SubtreeCount;
65        if (subtreesCount > 255) throw new ArgumentException("Number of subtrees is too big (>255)");
66        instr.nArguments = (byte)subtreesCount;
67        instr.opCode = opCodeMapper(node);
68        if (node.Symbol is Argument) {
69          var argNode = (ArgumentTreeNode)node;
70          instr.iArg0 = (ushort)argNode.Symbol.ArgumentIndex;
71        }
72        instr.dynamicNode = node;
73        foreach (var hook in postInstructionCompiledHooks) {
74          instr = hook(instr);
75        }
76        yield return instr;
77      }
78    }
79  }
80}
Note: See TracBrowser for help on using the repository browser.