Files
tbb/examples/parallel_for/polygon_overlay/rpolygon.h
T
Hans Johnson e32d75f876 ENH: Update to TBB 2017 (2016-09-08 release)
The new release TBB is now under a new more
open license.
                                 Apache License
                           Version 2.0, January 2004
                        http://www.apache.org/licenses/

The list of most significant changes made over time in
Intel(R) Threading Building Blocks (Intel(R) TBB).

Intel TBB 2017
TBB_INTERFACE_VERSION == 9100

Changes (w.r.t. Intel TBB 4.4 Update 5):

- static_partitioner class is now a fully supported feature.
- async_node class is now a fully supported feature.
- Improved dynamic memory allocation replacement on Windows* OS to skip
    DLLs for which replacement cannot be done, instead of aborting.
- Intel TBB no longer performs dynamic memory allocation replacement
    for Microsoft* Visual Studio* 2008.
- For 64-bit platforms, quadrupled the worst-case limit on the amount
    of memory the Intel TBB allocator can handle.
- Added TBB_USE_GLIBCXX_VERSION macro to specify the version of GNU
    libstdc++ when it cannot be properly recognized, e.g. when used
    with Clang on Linux* OS. Inspired by a contribution from David A.
- Added graph/stereo example to demostrate tbb::flow::async_msg.
- Removed a few cases of excessive user data copying in the flow graph.
- Reworked split_node to eliminate unnecessary overheads.
- Added support for C++11 move semantics to the argument of
    tbb::parallel_do_feeder::add() method.
- Added C++11 move constructor and assignment operator to
    tbb::combinable template class.
- Added tbb::this_task_arena::max_concurrency() function and
    max_concurrency() method of class task_arena returning the maximal
    number of threads that can work inside an arena.
- Deprecated tbb::task_arena::current_thread_index() static method;
    use tbb::this_task_arena::current_thread_index() function instead.
- All examples for commercial version of library moved online:
    https://software.intel.com/en-us/product-code-samples. Examples are
    available as a standalone package or as a part of Intel(R) Parallel
    Studio XE or Intel(R) System Studio Online Samples packages.

Changes affecting backward compatibility:

- Renamed following methods and types in async_node class:
    Old                   New
    async_gateway_type => gateway_type
    async_gateway()    => gateway()
    async_try_put()    => try_put()
    async_reserve()    => reserve_wait()
    async_commit()     => release_wait()
- Internal layout of some flow graph nodes has changed; recompilation
    is recommended for all binaries that use the flow graph.

Preview Features:

- Added template class streaming_node to the flow graph API. It allows
    a flow graph to offload computations to other devices through
    streaming or offloading APIs.
- Template class opencl_node reimplemented as a specialization of
    streaming_node that works with OpenCL*.
- Added tbb::this_task_arena::isolate() function to isolate execution
    of a group of tasks or an algorithm from other tasks submitted
    to the scheduler.

Bugs fixed:

- Added a workaround for GCC bug #62258 in std::rethrow_exception()
    to prevent possible problems in case of exception propagation.
- Fixed parallel_scan to provide correct result if the initial value
    of an accumulator is not the operation identity value.
- Fixed a memory corruption in the memory allocator when it meets
    internal limits.
- Fixed the memory allocator on 64-bit platforms to align memory
    to 16 bytes by default for all allocations bigger than 8 bytes.
- As a workaround for crashes in the Intel TBB library compiled with
    GCC 6, added -flifetime-dse=1 to compilation options on Linux* OS.
- Fixed a race in the flow graph implementation.

Open-source contributions integrated:

- Enabling use of C++11 'override' keyword by Raf Schietekat.

------------------------------------------------------------------------
2016-09-28 21:12:48 +02:00

156 lines
5.1 KiB
C++

/*
Copyright (c) 2005-2016 Intel Corporation
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
// rpolygon.h
//
#ifndef _RPOLYGON_H_
#define _RPOLYGON_H_
#include <vector>
#include <iostream>
#include "pover_video.h"
#include "tbb/scalable_allocator.h"
#include "tbb/concurrent_vector.h"
#include "tbb/enumerable_thread_specific.h"
using namespace std;
using namespace tbb;
class RPolygon;
typedef scalable_allocator<RPolygon> RPolygon_allocator;
DEFINE RPolygon_allocator rAlloc;
enum MallocBehavior {
UseMalloc,
UseScalableAllocator
};
DEFINE MallocBehavior gMBehavior INIT(UseScalableAllocator);
class RPolygon {
public:
RPolygon() {m_XMin = m_YMin = m_XMax = m_YMax = 0;
m_r = m_g = m_b = 0;
}
RPolygon(int xMin, int yMin, int xMax, int yMax, int r=-1, int g=-1, int b=-1) : m_XMin(xMin), m_YMin(yMin), m_XMax(xMax), m_YMax(yMax) {
if( r >= 0) {
m_r=(colorcomp_t)r; m_g=(colorcomp_t)g; m_b=(colorcomp_t)b;
if(gDoDraw) drawPoly();
}
}
void set_nodraw(int xMin, int yMin, int xMax, int yMax) {m_XMin=xMin; m_YMin=yMin; m_XMax=xMax; m_YMax=yMax;}
RPolygon &intersect(RPolygon &otherPoly);
void set(int xMin, int yMin, int xMax, int yMax) {
set_nodraw(xMin,yMin,xMax,yMax);
if(gDoDraw) {
drawPoly();
}
}
void get(int *xMin, int *yMin, int *xMax, int *yMax) const {*xMin=m_XMin;*yMin=m_YMin;*xMax=m_XMax;*yMax=m_YMax;}
int xmax() const { return m_XMax; }
int xmin() const { return m_XMin; }
int ymax() const { return m_YMax; }
int ymin() const { return m_YMin; }
void setColor(colorcomp_t newr, colorcomp_t newg, colorcomp_t newb) {m_r = newr; m_g=newg; m_b=newb;}
void getColor(int *myr, int *myg, int *myb) {*myr=m_r; *myg=m_g; *myb=m_b;}
color_t myColor() {return gVideo->get_color(m_r, m_g, m_b);}
void drawPoly() {
if(gVideo->running) {
if(g_next_frame()) { // Shouldn't call next_frame each time
drawing_area ldrawing(
gDrawXOffset+m_XMin*gPolyXBoxSize, //x
gDrawYOffset+m_YMin*gPolyYBoxSize, //y
(m_XMax-m_XMin+1)*gPolyXBoxSize, //sizex
(m_YMax-m_YMin+1)*gPolyYBoxSize); //sizey
for(int y=0; y<ldrawing.size_y; y++) {
ldrawing.set_pos(0,y);
color_t my_color = myColor();
for(int x=0;x < ldrawing.size_x; x++) {
ldrawing.put_pixel(my_color);
}
}
}
}
}
int area() {return ((m_XMax-m_XMin+1)*(m_YMax-m_YMin+1));}
void print(int i) { cout << "RPolygon " << i << " (" << m_XMin << ", " << m_YMin << ")-(" << m_XMax << ", " << m_YMax << ") " << endl; fflush(stdout);}
private:
int m_XMin;
int m_YMin;
int m_XMax;
int m_YMax;
colorcomp_t m_r;
colorcomp_t m_g;
colorcomp_t m_b;
};
#if _MAIN_C_
bool operator<(const RPolygon& a, const RPolygon& b) {
if(a.ymin() > b.ymin()) return false;
if(a.ymin() < b.ymin()) return true;
return a.xmin() < b.xmin();
}
#else
extern bool operator<(const RPolygon& a, const RPolygon& b);
#endif
extern ostream& operator<<(ostream& s, const RPolygon &p);
class RPolygon_flagged {
RPolygon *myPoly;
bool is_duplicate;
public:
RPolygon_flagged() {myPoly = NULL; is_duplicate = false;}
RPolygon_flagged(RPolygon* _p, bool _is_duplicate) : myPoly(_p), is_duplicate(_is_duplicate) { }
bool isDuplicate() {return is_duplicate;}
void setDuplicate(bool newValue) {is_duplicate = newValue;}
RPolygon *p() {return myPoly;}
void setp(RPolygon *newp) {myPoly = newp;}
};
typedef class vector<RPolygon, RPolygon_allocator> Polygon_map_t;
typedef class concurrent_vector<RPolygon, RPolygon_allocator> concurrent_Polygon_map_t;
typedef class enumerable_thread_specific<Polygon_map_t> ETS_Polygon_map_t;
typedef class vector<RPolygon_flagged, scalable_allocator<RPolygon_flagged> > Flagged_map_t; // we'll make shallow copies
inline bool PolygonsOverlap(RPolygon *p1, RPolygon *p2, int &xl, int &yl, int &xh, int &yh) {
int xl1, yl1, xh1, yh1, xl2, yl2, xh2, yh2;
#if _DEBUG
rt_sleep(1); // slow down the process so we can see it.
#endif
p1->get(&xl1, &yl1, &xh1, &yh1);
p2->get(&xl2, &yl2, &xh2, &yh2);
if(xl1 > xh2) return false;
if(xh1 < xl2) return false;
if(yl1 > yh2) return false;
if(yh1 < yl2) return false;
xl = (xl1 < xl2) ? xl2 : xl1;
xh = (xh1 < xh2) ? xh1 : xh2;
yl = (yl1 < yl2) ? yl2 : yl1;
yh = (yh1 < yh2) ? yh1 : yh2;
return true;
}
#endif // _RPOLYGON_H_