digraphvisualizationpipeline.cpp 6.09 KB
Newer Older
1
2
// ================================================================================================
// 
schultezub's avatar
schultezub committed
3
// This file is part of the CAMPVis Software Framework.
4
5
// 
// If not explicitly stated otherwise: Copyright (C) 2012, all rights reserved,
schultezub's avatar
schultezub committed
6
//      Christian Schulte zu Berge <christian.szb@in.tum.de>
7
8
9
//      Chair for Computer Aided Medical Procedures
//      Technische Universitt Mnchen
//      Boltzmannstr. 3, 85748 Garching b. Mnchen, Germany
schultezub's avatar
schultezub committed
10
// For a full list of authors and contributors, please refer to the file "AUTHORS.txt".
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
// 
// The licensing of this softare is not yet resolved. Until then, redistribution in source or
// binary forms outside the CAMP chair is not permitted, unless explicitly stated in legal form.
// However, the names of the original authors and the above copyright notice must retain in its
// original state in any case.
// 
// Legal disclaimer provided by the BSD license:
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR
// IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY 
// AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR 
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR 
// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
// 
// ================================================================================================

#include "digraphvisualizationpipeline.h"
#include "tgt/tgt_gl.h"
#include "tgt/glcanvas.h"
#include "tgt/glcontext.h"
#include "core/datastructures/imagedatarendertarget.h"
#include "core/pipeline/visualizationprocessor.h"
#include "core/tools/job.h"
#include "core/tools/opengljobprocessor.h"

#include <stack>

schultezub's avatar
schultezub committed
41
42
namespace campvis {
    const std::string DigraphVisualizationPipeline::loggerCat_ = "CAMPVis.core.datastructures.DigraphVisualizationPipeline";
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97



    DigraphVisualizationPipeline::DependencyNode::DependencyNode(AbstractProcessor* processor)
        : _processor(processor)
    {
        tgtAssert(_processor != 0, "Processor must not be 0.");
        if (_processor != 0) {
            _isVisualizationProcessor = (dynamic_cast<VisualizationProcessor*>(_processor) != 0);
        }
    }

    void DigraphVisualizationPipeline::DependencyNode::addDependency(DependencyNode* dependency) {
        tgtAssert(dependency != 0, "DependencyNode must not be 0.");

        // check for acyclicness
        std::stack<DependencyNode*> nodesToVisit;
        for (std::set<DependencyNode*>::const_iterator it = dependency->_dependentNodes.begin(); it != dependency->_dependentNodes.end(); ++it) {
            nodesToVisit.push(*it);
        }
        while (! nodesToVisit.empty()) {
            DependencyNode* node = nodesToVisit.top();
            nodesToVisit.pop();
            if (node == this) {
                LERROR("Circle in dependency graph detected. DependencyNode insertion aborted.");
                return;
            }
            for (std::set<DependencyNode*>::const_iterator it = dependency->_dependentNodes.begin(); it != dependency->_dependentNodes.end(); ++it) {
                nodesToVisit.push(*it);
            }
        }

        // add dependency
        _dependentNodes.insert(dependency);
    }

// ================================================================================================

    DigraphVisualizationPipeline::DigraphVisualizationPipeline()
        : VisualizationPipeline()
    {

    }

    DigraphVisualizationPipeline::~DigraphVisualizationPipeline() {
        // delete all DependencyNodes
        for (std::map<AbstractProcessor*, DependencyNode*>::iterator it = _processorNodeMap.begin(); it != _processorNodeMap.end(); ++it) {
            delete it->second;
        }
    }

    void DigraphVisualizationPipeline::addProcessor(AbstractProcessor* processor) {
        tgtAssert(processor != 0, "Processor must not be 0!");

        // add processor to processor list and connect signals
98
        VisualizationPipeline::addProcessor(processor);
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
        processor->s_invalidated.connect<DigraphVisualizationPipeline>(this, &DigraphVisualizationPipeline::onProcessorInvalidated);

        // create DependencyNode
        std::map<AbstractProcessor*, DependencyNode*>::iterator lb = _processorNodeMap.lower_bound(processor);
        if (lb == _processorNodeMap.end() || lb->first != processor) {
            DependencyNode* node = new DependencyNode(processor);
            _processorNodeMap.insert(lb, std::make_pair(processor, node));
        }
        else {
            LDEBUG("Processor already added!");
        }
    }

    void DigraphVisualizationPipeline::addProcessorDependency(AbstractProcessor* fatherProc, AbstractProcessor* childProc) {
        tgtAssert(fatherProc != 0, "Father Processor must not be 0!");
        tgtAssert(childProc != 0, "Child Processor must not be 0!");

        // find corresponding DependencyNodes
        std::map<AbstractProcessor*, DependencyNode*>::iterator fatherNode = _processorNodeMap.find(fatherProc);
        std::map<AbstractProcessor*, DependencyNode*>::iterator childNode = _processorNodeMap.find(childProc);
        if (fatherNode == _processorNodeMap.end() || childNode == _processorNodeMap.end()) {
            tgtAssert(false, "Add processors first before defining dependencies between them!");
            LERROR("Could not find DependencyNodes for at least one of the given processors. No dependency added!");
            return;
        }

        // add dependency
        fatherNode->second->addDependency(childNode->second);
    }

129
    void DigraphVisualizationPipeline::onProcessorInvalidated(AbstractProcessor* processor) {
130
131
132
133
        // TODO: implement
    }

}