FORMUS3IC_LAS3 / embb

* Initial commit for the Chromatic binary search tree. Currently uses a readers-writers lock to synchronize access to the tree.
* Basic tests for inserting, updating, retrieving and deleting elements (both single and multi threaded).

portability: changed all checks for platform specific defines to checks for EMBB_* defines, fixed affinity implementation for FreeBSD

Michael, Maged M. "Hazard pointers: Safe memory reclamation for lock-free objects." Parallel and Distributed Systems, IEEE Transactions on 15.6 (2004): 491-504.

Might fix bug, where the MPMC queue hang (very very spuriously), because tail->GetNext() == tail...

The old version depended on the build-dir to be a subdirectory of the
source directory.
With this patch one can build in tree or put the build-dir anywhere.

Signed-off-by: Henning Schild <henning...@siemens.com>

This reverts commit 807308ab819e778915b8a6c5c5cdb68288233f72.
This reverts commit 399ddba00be2f45a4768f4a2e92d1c12d3e75552.

- shift initialization of is_active to correct position
- remove unused variable

HelpScan was implemented wrong -> Scan could be executed be different threads the same time -> FixedSize lists got messed up -> program tried to return wrong pointers to the object pool -> segfault or hang

Moreover, added assertion that checks that only one thread concurrently enters scan, for avoiding these kind of bugs in the future.