graph.h

Go to the documentation of this file.

#ifndef _LIBSAPLING_GRAPH_H_
#define _LIBSAPLING_GRAPH_H_
 
#include <stddef.h>
#include <stdio.h>
#include "libsapling/idiom.h"
#include "libsapling/dm/logic.h"
 
struct info_stack {
    void *user;
    void *impl;
};
 
struct info_insert {
    size_t size;
    void *data;
    void *info;
};
 
typedef struct edge_storage *node_t;
 
typedef int (*predicate_t)(const node_t *ref, const struct info_stack *info);
 
typedef void (*apply_t)(node_t *ref, const struct info_stack *info);
 
typedef int (*next_t)(node_t **ref, const struct info_stack *info);
 
typedef void (*edge_management_t)(node_t *ref, const node_t node,
    void *impl_ptr);
 
typedef void (*fpfdata_t)(FILE *stream, const void *data);
 
typedef void (*fpfnode_t)(FILE *stream, const node_t node, fpfdata_t fpfdata,
    void *impl_ptr);
 
typedef void (*all_access_adapter_fn)(node_t *ref, void *info, apply_t apply);
 
int predicate_0(UNUSED const node_t *ref,
    UNUSED const struct info_stack *info);
 
int predicate_1(UNUSED const node_t *ref,
    UNUSED const struct info_stack *info);
 
void *graph__data(const node_t node, size_t edge_storage);
 
void graph__access(enum qt qt, node_t *ref, const struct info_stack *info,
    predicate_t predicate, apply_t apply, next_t next);
 
void graph__insert(node_t *ref, const struct info_stack *info,
    edge_management_t edge_management, size_t edge_storage);
 
 
void graph__delete(node_t *ref, const struct info_stack *info,
    edge_management_t edge_management);
 
void graph__print(FILE *stream, node_t *ref,
    all_access_adapter_fn access_adapter, fpfnode_t fpfnode,
    fpfdata_t fpfdata);
 
void graph__dump_dot(FILE *stream, node_t *ref,
    all_access_adapter_fn access_adapter, fpfnode_t fpfnode,
    fpfdata_t fpfdata, const char *graph_attributes);
 
int graph__length(const node_t *ref, all_access_adapter_fn access_adapter);
 
#endif