1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2010 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 |
|
---|
22 | using System;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
25 | using HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using System.Collections.Generic;
|
---|
28 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
29 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Symbols;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Compiler {
|
---|
32 | public class SymbolicExpressionTreeCompiler {
|
---|
33 | private Dictionary<string, ushort> entryPoint = new Dictionary<string, ushort>();
|
---|
34 | private List<Func<Instruction, Instruction>> postInstructionCompiledHooks = new List<Func<Instruction, Instruction>>();
|
---|
35 |
|
---|
36 | public Instruction[] Compile(SymbolicExpressionTree tree, Func<SymbolicExpressionTreeNode, byte> opCodeMapper) {
|
---|
37 | List<Instruction> code = new List<Instruction>();
|
---|
38 | entryPoint.Clear();
|
---|
39 | // compile main body branches
|
---|
40 | foreach (var branch in tree.Root.SubTrees[0].SubTrees) {
|
---|
41 | code.AddRange(Compile(branch, opCodeMapper));
|
---|
42 | }
|
---|
43 | // compile function branches
|
---|
44 | var functionBranches = from node in tree.IterateNodesPrefix()
|
---|
45 | where node.Symbol is Defun
|
---|
46 | select node;
|
---|
47 | foreach (DefunTreeNode branch in functionBranches) {
|
---|
48 | if (code.Count > ushort.MaxValue) throw new ArgumentException("Code for the tree is too long (> ushort.MaxValue).");
|
---|
49 | entryPoint[branch.FunctionName] = (ushort)code.Count;
|
---|
50 | code.AddRange(Compile(branch.SubTrees[0], opCodeMapper));
|
---|
51 | }
|
---|
52 | // address of all functions is fixed now
|
---|
53 | // iterate through code again and fill in the jump locations
|
---|
54 | for (int i = 0; i < code.Count; i++) {
|
---|
55 | Instruction instr = code[i];
|
---|
56 | if (instr.dynamicNode.Symbol is InvokeFunction) {
|
---|
57 | var invokeNode = (InvokeFunctionTreeNode)instr.dynamicNode;
|
---|
58 | instr.iArg0 = entryPoint[invokeNode.Symbol.FunctionName];
|
---|
59 | code[i] = instr;
|
---|
60 | }
|
---|
61 | }
|
---|
62 |
|
---|
63 | return code.ToArray();
|
---|
64 | }
|
---|
65 |
|
---|
66 | private IEnumerable<Instruction> Compile(SymbolicExpressionTreeNode branch, Func<SymbolicExpressionTreeNode, byte> opCodeMapper) {
|
---|
67 | foreach (var node in branch.IterateNodesPrefix()) {
|
---|
68 | Instruction instr = new Instruction();
|
---|
69 | if (node.SubTrees.Count > 255) throw new ArgumentException("Number of subtrees is too big (>255)");
|
---|
70 | instr.nArguments = (byte)node.SubTrees.Count;
|
---|
71 | instr.opCode = opCodeMapper(node);
|
---|
72 | if (node.Symbol is Argument) {
|
---|
73 | var argNode = (ArgumentTreeNode)node;
|
---|
74 | instr.iArg0 = (ushort)argNode.Symbol.ArgumentIndex;
|
---|
75 | }
|
---|
76 | instr.dynamicNode = node;
|
---|
77 | foreach (var hook in postInstructionCompiledHooks) {
|
---|
78 | instr = hook(instr);
|
---|
79 | }
|
---|
80 | yield return instr;
|
---|
81 | }
|
---|
82 | }
|
---|
83 |
|
---|
84 | /// <summary>
|
---|
85 | /// Adds a function that will be called every time an instruction is compiled.
|
---|
86 | /// The compiled will insert the instruction returned by the hook into the code.
|
---|
87 | /// </summary>
|
---|
88 | /// <param name="hook">The hook that should be called for each compiled instruction.</param>
|
---|
89 | public void AddInstructionPostProcessingHook(Func<Instruction, Instruction> hook) {
|
---|
90 | postInstructionCompiledHooks.Add(hook);
|
---|
91 | }
|
---|
92 | }
|
---|
93 | }
|
---|