[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2008 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.Collections.Generic;
|
---|
| 24 | using System.Linq;
|
---|
| 25 | using System.Text;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
| 27 | using System.Xml;
|
---|
[27] | 28 | using System.Threading;
|
---|
[2] | 29 |
|
---|
| 30 | namespace HeuristicLab.Grid {
|
---|
[27] | 31 | public class ProcessingEngine : EngineBase {
|
---|
[2] | 32 | private AtomicOperation initialOperation;
|
---|
| 33 | public AtomicOperation InitialOperation {
|
---|
| 34 | get { return initialOperation; }
|
---|
| 35 | }
|
---|
| 36 |
|
---|
| 37 | public ProcessingEngine()
|
---|
| 38 | : base() {
|
---|
| 39 | }
|
---|
| 40 |
|
---|
[279] | 41 | public ProcessingEngine(IScope globalScope, AtomicOperation initialOperation)
|
---|
[2] | 42 | : base() {
|
---|
| 43 | this.initialOperation = initialOperation;
|
---|
| 44 | myGlobalScope = globalScope;
|
---|
| 45 | myExecutionStack.Push(initialOperation);
|
---|
| 46 | }
|
---|
| 47 | public override XmlNode GetXmlNode(string name, XmlDocument document, IDictionary<Guid, IStorable> persistedObjects) {
|
---|
| 48 | XmlNode node = base.GetXmlNode(name, document, persistedObjects);
|
---|
| 49 | node.AppendChild(PersistenceManager.Persist("InitialOperation", initialOperation, document, persistedObjects));
|
---|
| 50 | return node;
|
---|
| 51 | }
|
---|
| 52 |
|
---|
| 53 | public override void Populate(XmlNode node, IDictionary<Guid, IStorable> restoredObjects) {
|
---|
| 54 | base.Populate(node, restoredObjects);
|
---|
| 55 | initialOperation = (AtomicOperation)PersistenceManager.Restore(node.SelectSingleNode("InitialOperation"), restoredObjects);
|
---|
| 56 | }
|
---|
[27] | 57 |
|
---|
| 58 | protected override void ProcessNextOperation() {
|
---|
| 59 | IOperation operation = myExecutionStack.Pop();
|
---|
| 60 | if(operation is AtomicOperation) {
|
---|
| 61 | AtomicOperation atomicOperation = (AtomicOperation)operation;
|
---|
| 62 | IOperation next = null;
|
---|
| 63 | try {
|
---|
| 64 | next = atomicOperation.Operator.Execute(atomicOperation.Scope);
|
---|
| 65 | } catch(Exception ex) {
|
---|
| 66 | // push operation on stack again
|
---|
| 67 | myExecutionStack.Push(atomicOperation);
|
---|
| 68 | Abort();
|
---|
| 69 | }
|
---|
| 70 | if(next != null)
|
---|
| 71 | myExecutionStack.Push(next);
|
---|
| 72 | if(atomicOperation.Operator.Breakpoint) Abort();
|
---|
| 73 | } else if(operation is CompositeOperation) {
|
---|
| 74 | CompositeOperation compositeOperation = (CompositeOperation)operation;
|
---|
| 75 | for(int i = compositeOperation.Operations.Count - 1; i >= 0; i--)
|
---|
| 76 | myExecutionStack.Push(compositeOperation.Operations[i]);
|
---|
| 77 | }
|
---|
| 78 | }
|
---|
[2] | 79 | }
|
---|
| 80 | }
|
---|