Blender Git Loki

reduce likelyhood for heap allocation in fgraph evaluation

splitup graph evaluation in three parts

move more into the value storage abstraction

move value storage into separate struct

use macro for pointer offset

put values in a struct that are accessed together

remove unused socket flag

do less unnecessary data copies

copy computed value to fn_out immediatly

make it optional to run value destructors when tuple is destructed

multipool tried to deallocate the wrong pointer

initial non recursive evaluation of new data flow graph

utility set functions

extract ensure tuple calls function

dot export for new data flow graph

Split up the data flow graph data structure

The main goal is to be able to traverse the graph very efficiently
once it is build. This is hard when the structure has to be dynamic
(i.e. it can be changed). The solution is to use a builder that
can dynamically construct the graph. Once everything is set up,
the graph is converted into the compact form for further use.

Merge branch 'master' into functions

Merge branch 'master' into functions

Merge branch 'master' into functions

Simple range iterator with tests