Free cookie consent management tool by TermsFeed Policy Generator

source: branches/gp-crossover/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.3/Compiler/SymbolicExpressionTreeCompiler.cs @ 7064

Last change on this file since 7064 was 5445, checked in by swagner, 14 years ago

Updated year of copyrights (#1406)

File size: 3.9 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2011 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;
25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Symbols;
26
27namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Compiler {
28  public class SymbolicExpressionTreeCompiler {
29    private Dictionary<string, ushort> entryPoint = new Dictionary<string, ushort>();
30    private List<Func<Instruction, Instruction>> postInstructionCompiledHooks = new List<Func<Instruction, Instruction>>();
31
32    public Instruction[] Compile(SymbolicExpressionTree tree, Func<SymbolicExpressionTreeNode, byte> opCodeMapper) {
33      List<Instruction> code = new List<Instruction>();
34      entryPoint.Clear();
35      // compile main body branches
36      foreach (var branch in tree.Root.SubTrees[0].SubTrees) {
37        code.AddRange(Compile(branch, opCodeMapper));
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.SubTrees[0], opCodeMapper));
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          code[i] = instr;
56        }
57      }
58
59      return code.ToArray();
60    }
61
62    private IEnumerable<Instruction> Compile(SymbolicExpressionTreeNode branch, Func<SymbolicExpressionTreeNode, byte> opCodeMapper) {
63      foreach (var node in branch.IterateNodesPrefix()) {
64        Instruction instr = new Instruction();
65        if (node.SubTrees.Count > 255) throw new ArgumentException("Number of subtrees is too big (>255)");
66        instr.nArguments = (byte)node.SubTrees.Count;
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    /// <summary>
81    /// Adds a function that will be called every time an instruction is compiled.
82    /// The compiled will insert the instruction returned by the hook into the code.
83    /// </summary>
84    /// <param name="hook">The hook that should be called for each compiled instruction.</param>
85    public void AddInstructionPostProcessingHook(Func<Instruction, Instruction> hook) {
86      postInstructionCompiledHooks.Add(hook);
87    }
88  }
89}
Note: See TracBrowser for help on using the repository browser.