/* This file is part of GEGL
*
* GEGL is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 3 of the License, or (at your option) any later version.
*
* GEGL is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with GEGL; if not, see .
*
* Copyright 2003 Calvin Williamson
* 2006 Øyvind Kolås
*/
#ifndef __GEGL_NODE_H__
#define __GEGL_NODE_H__
#include "operation/gegl-operation-context.h"
#include
#include
G_BEGIN_DECLS
#define GEGL_NODE_CLASS(klass) (G_TYPE_CHECK_CLASS_CAST ((klass), GEGL_TYPE_NODE, GeglNodeClass))
#define GEGL_IS_NODE_CLASS(klass) (G_TYPE_CHECK_CLASS_TYPE ((klass), GEGL_TYPE_NODE))
#define GEGL_NODE_GET_CLASS(obj) (G_TYPE_INSTANCE_GET_CLASS ((obj), GEGL_TYPE_NODE, GeglNodeClass))
/* The rest is in gegl-types.h */
typedef struct _GeglNodeClass GeglNodeClass;
typedef struct _GeglNodePrivate GeglNodePrivate;
struct _GeglNode
{
GObject parent_instance;
/* The current operation associated with this node */
GeglOperation *operation;
/* The region for which this node provides pixel data */
GeglRectangle have_rect;
/* If TRUE the above have_rect is correct and can be returned
* directly instead of computed
*/
gboolean valid_have_rect;
/* All the pads on this node, depends on operation */
GSList *pads;
/* The input pads */
GSList *input_pads;
/* The output pads */
GSList *output_pads;
/* If a node is a graph it means it has children. Typically the
* children connect to the input/output proxies of their graph
* node. This results in that the graph node can more or less be
* transparently treated as a normal node in most contexts
*/
gboolean is_graph;
/* For a node, the cache should be created at first demand if
* applicable, and the cache object reused for all subsequent
* requests for the cache object.
*/
GeglCache *cache;
/* Whether result is cached or not, inherited by children */
gboolean dont_cache;
GMutex *mutex;
/*< private >*/
GeglNodePrivate *priv;
};
struct _GeglNodeClass
{
GObjectClass parent_class;
};
/* renders the desired region of interest to a buffer of the specified
* bablformat */
void gegl_node_blit (GeglNode *node,
gdouble scale,
const GeglRectangle *roi,
const Babl *format,
gpointer destination_buf,
gint rowstride,
GeglBlitFlags flags);
void gegl_node_process (GeglNode *self);
void gegl_node_link (GeglNode *source,
GeglNode *sink);
void gegl_node_link_many (GeglNode *source,
GeglNode *dest,
...) G_GNUC_NULL_TERMINATED;
gboolean gegl_node_connect_from (GeglNode *self,
const gchar *input_pad_name,
GeglNode *source,
const gchar *output_pad_name);
gboolean gegl_node_connect_to (GeglNode *self,
const gchar *output_pad_name,
GeglNode *sink,
const gchar *input_pad_name);
gboolean gegl_node_disconnect (GeglNode *self,
const gchar *input_pad_name);
void gegl_node_set (GeglNode *self,
const gchar *first_property_name,
...) G_GNUC_NULL_TERMINATED;
void gegl_node_get (GeglNode *self,
const gchar *first_property_name,
...) G_GNUC_NULL_TERMINATED;
GeglNode * gegl_node_get_parent (GeglNode *self);
/* functions below are internal to gegl */
GType gegl_node_get_type (void) G_GNUC_CONST;
GeglOperationContext *gegl_node_get_context (GeglNode *self,
gpointer context_id);
void gegl_node_remove_context (GeglNode *self,
gpointer context_id);
GeglOperationContext *gegl_node_add_context (GeglNode *self,
gpointer context_id);
void gegl_node_add_pad (GeglNode *self,
GeglPad *pad);
void gegl_node_remove_pad (GeglNode *self,
GeglPad *pad);
gboolean gegl_node_has_pad (GeglNode *self,
const gchar *name);
GeglPad * gegl_node_get_pad (GeglNode *self,
const gchar *name);
GSList * gegl_node_get_pads (GeglNode *self);
GSList * gegl_node_get_input_pads (GeglNode *self);
GSList * gegl_node_get_sinks (GeglNode *self);
gint gegl_node_get_num_sinks (GeglNode *self);
GeglNode * gegl_node_get_producer (GeglNode *self,
gchar *pad_name,
gchar **output_pad);
void gegl_node_dump_depends_on (GeglNode *self);
void gegl_node_set_valist (GeglNode *object,
const gchar *first_property_name,
va_list var_args);
void gegl_node_get_valist (GeglNode *object,
const gchar *first_property_name,
va_list var_args);
void gegl_node_set_property (GeglNode *object,
const gchar *property_name,
const GValue *value);
void gegl_node_get_property (GeglNode *object,
const gchar *property_name,
GValue *value);
GParamSpec * gegl_node_find_property (GeglNode *self,
const gchar *property_name);
void gegl_node_set_need_rect (GeglNode *node,
gpointer context_id,
const GeglRectangle *rect);
/* Graph related member functions of the GeglNode class */
GeglNode * gegl_node_add_child (GeglNode *self,
GeglNode *child);
GeglNode * gegl_node_remove_child (GeglNode *self,
GeglNode *child);
GeglNode * gegl_node_get_nth_child (GeglNode *self,
gint n);
GSList * gegl_node_get_children (GeglNode *self);
void gegl_node_remove_children (GeglNode *self);
gint gegl_node_get_num_children (GeglNode *self);
GeglNode * gegl_node_new (void);
GeglNode * gegl_node_new_child (GeglNode *self,
const gchar *first_property_name,
...) G_GNUC_NULL_TERMINATED;
GeglNode * gegl_node_create_child (GeglNode *self,
const gchar *operation);
GeglNode * gegl_node_get_input_proxy (GeglNode *graph,
const gchar *name);
GeglNode * gegl_node_get_output_proxy (GeglNode *graph,
const gchar *name);
const gchar * gegl_node_get_operation (const GeglNode*node);
const gchar * gegl_node_get_debug_name (GeglNode *node);
GeglNode * gegl_node_detect (GeglNode *root,
gint x,
gint y);
void gegl_node_insert_before (GeglNode *self,
GeglNode *to_be_inserted);
gint gegl_node_get_consumers (GeglNode *node,
const gchar *output_pad,
GeglNode ***nodes,
const gchar ***pads);
GeglCache * gegl_node_get_cache (GeglNode *node);
void gegl_node_invalidated (GeglNode *node,
const GeglRectangle *rect,
gboolean clean_cache);
GeglRectangle gegl_node_get_bounding_box (GeglNode *root);
const gchar * gegl_node_get_name (GeglNode *self);
void gegl_node_set_name (GeglNode *self,
const gchar *name);
void
gegl_node_emit_computed (GeglNode *node,
const GeglRectangle *rect);
/* macros used to set flags on objects passed in the graph */
#define gegl_object_set_has_forked(object) \
g_object_set_data(G_OBJECT(object), "gegl has-forked", (void*)0xf)
#define gegl_object_get_has_forked(object) \
(g_object_get_data(G_OBJECT(object), "gegl has-forked")!=NULL)
#define GEGL_MAX_THREADS 16
G_END_DECLS
#endif /* __GEGL_NODE_H__ */