* started adding common OpenCL headers

 * added early JobPool class

git-svn-id: https://camplinux.in.tum.de/svn/campvis/trunk@249 bb408c1c-ae56-11e1-83d9-df6b3e0c105e

src/tumvis/core/cl/tools/raycasting.cl

+// ================================================================================================
+// 
+// This file is part of the TUMVis Visualization Framework.
+// 
+// If not explicitly stated otherwise: Copyright (C) 2012, all rights reserved,
+//      Christian Schulte zu Berge (christian.szb@in.tum.de)
+//      Chair for Computer Aided Medical Procedures
+//      Technische Universität München
+//      Boltzmannstr. 3, 85748 Garching b. München, Germany
+// 
+// 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.
+// 
+// ================================================================================================
+
+/**
+ * Code adapted from: https://www.marcusbannerman.co.uk/index.php/component/content/article/42-articles/97-vol-render-optimizations.htm
+ */
+float4 jitterEntryPoint(float4 position, float4 direction, float stepSize) {
+    float random;
+    fract(sin((float)get_global_id(0) * 12.9898 + (float)get_global_id(1) * 78.233) * 43758.5453, &random);
+    return position + direction * (stepSize * random);
+}

src/tumvis/core/tools/jobpool.cpp

+// ================================================================================================
+// 
+// This file is part of the TUMVis Visualization Framework.
+// 
+// If not explicitly stated otherwise: Copyright (C) 2012, all rights reserved,
+//      Christian Schulte zu Berge (christian.szb@in.tum.de)
+//      Chair for Computer Aided Medical Procedures
+//      Technische Universität München
+//      Boltzmannstr. 3, 85748 Garching b. München, Germany
+// 
+// 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 "jobpool.h"
+#include "tgt/assert.h"
+
+namespace TUMVis {
+
+    const size_t JobPool::NUM_PRIORITIES = 3;
+
+    JobPool::JobPool()
+        : _queues(0)
+    {
+        _queues = new std::list<Job*>[NUM_PRIORITIES];
+    }
+
+    JobPool::~JobPool() {
+        // delete jobs
+        for (size_t i = 0; i < NUM_PRIORITIES; ++i) {
+            for (std::list<Job*>::iterator it = _queues[i].begin(); it != _queues[i].end(); ++it) {
+                delete *it;
+            }
+        }
+
+        // delete queues
+        delete[] _queues;
+    }
+
+    void JobPool::enqueueJob(Job* job, JobPriority priority) {
+        size_t i = static_cast<size_t>(priority);
+        tgtAssert(i < NUM_PRIORITIES, "Job priority index must be lower than the total number or priorities.");
+        tgtAssert(job != 0, "Job must not be 0");
+
+        _queues[i].push_back(job);
+    }
+
+    Job* JobPool::dequeueJob() {
+        // very simple scheduling algorithm. This should be made fairer and avoid starving!
+        for (size_t i = 0; i < NUM_PRIORITIES; ++i) {
+            if (! _queues[i].empty()) {
+                Job* toReturn = _queues[i].front();
+                _queues[i].pop_front();
+                return toReturn;
+            }
+        }
+        return 0;
+    }
+
+}
+

src/tumvis/core/tools/jobpool.h

+// ================================================================================================
+// 
+// This file is part of the TUMVis Visualization Framework.
+// 
+// If not explicitly stated otherwise: Copyright (C) 2012, all rights reserved,
+//      Christian Schulte zu Berge (christian.szb@in.tum.de)
+//      Chair for Computer Aided Medical Procedures
+//      Technische Universität München
+//      Boltzmannstr. 3, 85748 Garching b. München, Germany
+// 
+// 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.
+// 
+// ================================================================================================
+
+#ifndef JOBPOOL_H__
+#define JOBPOOL_H__
+
+#include <list>
+
+namespace TUMVis {
+
+    class Job;
+
+    /**
+     * A JobPool manages multible Jobs in queues with different priorities.
+     * 
+     * \todo    Implement a suitable scheduling strategy to avoid starving of low priority jobs.
+     *          This sounds like a good opportunity to take a look at the Betriebssysteme lecture slides. :)
+     */
+    class JobPool {
+    public:
+        /**
+         * Enumeration of the different priorities of jobs.
+         */
+        enum JobPriority {
+            Realtime = 0,   ///< Realtime jobs are always considered first during dequeueing.
+            Normal = 1,     ///< Jobs with normal priorities are dequeued as soon as there are no realtime jobs left
+            Low = 2         ///< Low priority jobs are only considered if there are no jobs in the queue with higher priority
+        };
+
+        JobPool();
+
+        ~JobPool();
+
+        /**
+         * Enqueues the given Job with the given priority.
+         * 
+         * \note    JobPool takes ownership of \a job.
+         * \param job       Job to enqueue, JobPool takes ownership of this Job!
+         * \param priority  Priority of the job to enqueue
+         */
+        void enqueueJob(Job* job, JobPriority priority);
+
+        /**
+         * Dequeues the next job according to the scheduling strategy.
+         * \todo    Develop a good scheduling strategy and describe it here.
+         * \return  The next job to execute, 0 if there is currently no job to execute.
+         */
+        Job* dequeueJob();
+
+
+    protected:
+        static const size_t NUM_PRIORITIES;
+
+        std::list<Job*>* _queues;       ///< Array of job queues, one for each JobPriority
+    };
+}
+
+#endif // JOBPOOL_H__
\ No newline at end of file

src/tumvis/modules/vis/clraycaster.cl

+#include "tools/raycasting.cl"
+
 __constant sampler_t smpNorm = CLK_NORMALIZED_COORDS_TRUE | CLK_ADDRESS_CLAMP | CLK_FILTER_LINEAR;
 __constant float SAMPLING_BASE_INTERVAL_RCP = 200.0;