• Daniel Sabo's avatar
    New graph processor · 78264149
    Daniel Sabo authored
    Streamline the graph evaluation process to reduce overhead.
    
    Important changes / gotchas:
    * get_cached_region is no longer used. The cache bounds are
      always the full output bounds, but the request will not be
      expanded.
    * The cache intersect is calculated after all requests to a node
      are combined, so partial cache hits from multiple nodes may
      skip the cache.
    * Meta nodes (nodes who's pads do not reference them) will never
      be visited.
    * Prepare is called only once per node, and must not modify the
      connectivity of the graph.
    78264149
Name
Last commit
Last update
..
.gitignore Loading commit data...
Makefile.am Loading commit data...
gegl-connection.c Loading commit data...
gegl-connection.h Loading commit data...
gegl-node.c Loading commit data...
gegl-node.h Loading commit data...
gegl-pad.c Loading commit data...
gegl-pad.h Loading commit data...
gegl-visitable.c Loading commit data...
gegl-visitable.h Loading commit data...
gegl-visitor.c Loading commit data...
gegl-visitor.h Loading commit data...