1. 10 Mar, 2014 1 commit
  2. 04 Mar, 2014 1 commit
  3. 05 Feb, 2014 1 commit
  4. 02 Feb, 2014 3 commits
  5. 01 Feb, 2014 1 commit
  6. 15 Dec, 2013 1 commit
  7. 07 Dec, 2013 1 commit
  8. 03 Dec, 2013 1 commit
  9. 01 Dec, 2013 3 commits
    • Daniel Sabo's avatar
      Add gegl_node_get_gegl_operation · f51fb780
      Daniel Sabo authored
      While obscured behind a property the operation object of GeglNode
      was already public, this just provides a more convenient access
      point for it.
      f51fb780
    • Daniel Sabo's avatar
      Move gegl.h declarations into their own headers. · 90e5935f
      Daniel Sabo authored
      gegl-init.c -> gegl-init.h
      gegl-apply.c -> gegl-apply.h
      gegl-processor.c -> process/gegl-processor.h
      gegl-c.c -> gegl-c.h
      gegl-node.c -> graph/gegl-node.h
      misc -> gegl-operations-util.h
      
      gegl-c.h is intentionally left out of the documentation
      list because it contains only deprecated functions.
      
      The functions in gegl-operations-util.h are still duplicate
      definitions, but moving them to another file for now is
      necessary to fix the ordering of the documentation html files.
      
      There is a guard against directly including gegl-operations-util.h
      because its future is uncertain and it shouldn't be included
      directly even in internal code.
      90e5935f
    • Daniel Sabo's avatar
      Add all gegl include paths to AM_CPPFLAGS · f5faad8b
      Daniel Sabo authored
      Necessary to move declarations into their own headers.
      f5faad8b
  10. 20 Nov, 2013 2 commits
  11. 19 Nov, 2013 1 commit
  12. 08 Nov, 2013 1 commit
  13. 18 Oct, 2013 2 commits
  14. 06 Oct, 2013 2 commits
  15. 03 Oct, 2013 1 commit
  16. 07 Jun, 2013 5 commits
  17. 05 Jun, 2013 1 commit
    • 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
  18. 07 May, 2013 1 commit
    • Daniel Sabo's avatar
      Remove GeglCache's knowledge of GeglNode · b4ff63c4
      Daniel Sabo authored
      Tracking which node owned the cache created a messy circular
      reference, and GeglNode was already explicitly invalidating
      the cache in most cases. This patch changes the GeglNode logic
      to always explicitly invalidate, and removes the need to keep
      a signal hookup in GeglCache.
      b4ff63c4
  19. 29 Mar, 2013 2 commits
  20. 15 Mar, 2013 1 commit
  21. 01 Dec, 2012 2 commits
  22. 27 Aug, 2012 1 commit
  23. 25 Aug, 2012 1 commit
  24. 02 Aug, 2012 4 commits