graph.c File Reference

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "genC.h"
#include "graph.h"

Include dependency graph for graph.c:

Go to the source code of this file.

Typedefs
typedef void *	vertex_label
typedef void *	arc_label

Functions
graph	copy_graph (graph p)
	GRAPH. More...
void	free_graph (graph p)
graph	check_graph (graph p)
bool	graph_consistent_p (graph p)
bool	graph_defined_p (graph p)
list	gen_graph_cons (graph p, list l)
void	graph_assign_contents (graph r, graph v)
void	graph_non_recursive_free (graph p)
void	write_graph (FILE *f, graph p)
graph	read_graph (FILE *f)
graph	make_graph (list a)
successor	copy_successor (successor p)
	SUCCESSOR. More...
void	free_successor (successor p)
successor	check_successor (successor p)
bool	successor_consistent_p (successor p)
bool	successor_defined_p (successor p)
list	gen_successor_cons (successor p, list l)
void	successor_assign_contents (successor r, successor v)
void	successor_non_recursive_free (successor p)
void	write_successor (FILE *f, successor p)
successor	read_successor (FILE *f)
successor	make_successor (arc_label a1, vertex a2)
vertex	copy_vertex (vertex p)
	VERTEX. More...
void	free_vertex (vertex p)
vertex	check_vertex (vertex p)
bool	vertex_consistent_p (vertex p)
bool	vertex_defined_p (vertex p)
list	gen_vertex_cons (vertex p, list l)
void	vertex_assign_contents (vertex r, vertex v)
void	vertex_non_recursive_free (vertex p)
void	write_vertex (FILE *f, vertex p)
vertex	read_vertex (FILE *f)
vertex	make_vertex (vertex_label a1, list a2)

Typedef Documentation

arc_label

typedef void* arc_label

Definition at line 8 of file graph.c.

vertex_label

typedef void* vertex_label

Definition at line 7 of file graph.c.

Function Documentation

check_graph()

graph check_graph

(

graph

p

)

Definition at line 26 of file graph.c.

                           {
  return (graph) gen_check((gen_chunk*) p, graph_domain);
}

References gen_check(), and graph_domain.

Here is the call graph for this function:

check_successor()

successor check_successor

(

successor

p

)

Definition at line 68 of file graph.c.

                                       {
  return (successor) gen_check((gen_chunk*) p, successor_domain);
}

References gen_check(), and successor_domain.

Here is the call graph for this function:

check_vertex()

vertex check_vertex

(

vertex

p

)

Definition at line 110 of file graph.c.

                              {
  return (vertex) gen_check((gen_chunk*) p, vertex_domain);
}

References gen_check(), and vertex_domain.

Here is the call graph for this function:

copy_graph()

graph copy_graph

(

graph

p

)

GRAPH.

Definition at line 20 of file graph.c.

                          {
  return (graph) gen_copy_tree((gen_chunk*) p);
}

References gen_copy_tree().

Here is the call graph for this function:

copy_successor()

successor copy_successor

(

successor

p

)

SUCCESSOR.

Definition at line 62 of file graph.c.

                                      {
  return (successor) gen_copy_tree((gen_chunk*) p);
}

References gen_copy_tree().

Here is the call graph for this function:

copy_vertex()

vertex copy_vertex

(

vertex

p

)

VERTEX.

Definition at line 104 of file graph.c.

                             {
  return (vertex) gen_copy_tree((gen_chunk*) p);
}

References gen_copy_tree().

Here is the call graph for this function:

free_graph()

void free_graph

(

graph

p

)

Definition at line 23 of file graph.c.

                         {
  gen_free((gen_chunk*) p);
}

References gen_free().

Here is the call graph for this function:

free_successor()

void free_successor

(

successor

p

)

Definition at line 65 of file graph.c.

                                 {
  gen_free((gen_chunk*) p);
}

References gen_free().

Here is the call graph for this function:

free_vertex()

void free_vertex

(

vertex

p

)

Definition at line 107 of file graph.c.

                           {
  gen_free((gen_chunk*) p);
}

References gen_free().

Here is the call graph for this function:

gen_graph_cons()

list gen_graph_cons	(	graph	p,
		list	l
	)

Definition at line 36 of file graph.c.

                                     {
  return gen_typed_cons(GRAPH_NEWGEN_DOMAIN, p, l);
}

References gen_typed_cons(), and GRAPH_NEWGEN_DOMAIN.

Here is the call graph for this function:

gen_successor_cons()

list gen_successor_cons	(	successor	p,
		list	l
	)

Definition at line 78 of file graph.c.

                                             {
  return gen_typed_cons(SUCCESSOR_NEWGEN_DOMAIN, p, l);
}

References gen_typed_cons(), and SUCCESSOR_NEWGEN_DOMAIN.

Here is the call graph for this function:

gen_vertex_cons()

list gen_vertex_cons	(	vertex	p,
		list	l
	)

Definition at line 120 of file graph.c.

                                       {
  return gen_typed_cons(VERTEX_NEWGEN_DOMAIN, p, l);
}

References gen_typed_cons(), and VERTEX_NEWGEN_DOMAIN.

Here is the call graph for this function:

graph_assign_contents()

void graph_assign_contents	(	graph	r,
		graph	v
	)

Definition at line 39 of file graph.c.

                                             {
  check_graph(r);
  check_graph(v);
  message_assert("defined references to domain graph",
                 graph_defined_p(r) && graph_defined_p(v));
       memcpy(r, v, sizeof(struct _newgen_struct_graph_));
}

References check_graph(), graph_defined_p(), and message_assert.

Here is the call graph for this function:

graph_consistent_p()

bool graph_consistent_p

(

graph

p

)

Definition at line 29 of file graph.c.

                                 {
  check_graph(p);
  return gen_consistent_p((gen_chunk*) p);
}

References check_graph(), and gen_consistent_p().

Here is the call graph for this function:

graph_defined_p()

bool graph_defined_p

(

graph

p

)

Definition at line 33 of file graph.c.

                              {
  return gen_defined_p((gen_chunk*) p);
}

References gen_defined_p().

Here is the call graph for this function:

graph_non_recursive_free()

void graph_non_recursive_free

(

graph

p

)

Definition at line 46 of file graph.c.

                                       {
  // should clear up contents...
  free(p);
}

References free().

Here is the call graph for this function:

make_graph()

graph make_graph

(

list

a

)

Definition at line 56 of file graph.c.

                         {
  return (graph) gen_alloc(2*sizeof(gen_chunk), GEN_CHECK_ALLOC, graph_domain, a);
}

References gen_alloc(), GEN_CHECK_ALLOC, and graph_domain.

Here is the call graph for this function:

make_successor()

successor make_successor	(	arc_label	a1,
		vertex	a2
	)

Definition at line 98 of file graph.c.

                                                  {
  return (successor) gen_alloc(3*sizeof(gen_chunk), GEN_CHECK_ALLOC, successor_domain, a1, a2);
}

References gen_alloc(), GEN_CHECK_ALLOC, and successor_domain.

Here is the call graph for this function:

make_vertex()

vertex make_vertex	(	vertex_label	a1,
		list	a2
	)

Definition at line 140 of file graph.c.

                                             {
  return (vertex) gen_alloc(3*sizeof(gen_chunk), GEN_CHECK_ALLOC, vertex_domain, a1, a2);
}

References gen_alloc(), GEN_CHECK_ALLOC, and vertex_domain.

Here is the call graph for this function:

read_graph()

graph read_graph

(

FILE *

f

)

Definition at line 53 of file graph.c.

                          {
  return (graph) gen_read(f);
}

References f(), and gen_read().

Here is the call graph for this function:

read_successor()

successor read_successor

(

FILE *

f

)

Definition at line 95 of file graph.c.

                                  {
  return (successor) gen_read(f);
}

References f(), and gen_read().

Here is the call graph for this function:

read_vertex()

vertex read_vertex

(

FILE *

f

)

Definition at line 137 of file graph.c.

                            {
  return (vertex) gen_read(f);
}

References f(), and gen_read().

Here is the call graph for this function:

successor_assign_contents()

void successor_assign_contents	(	successor	r,
		successor	v
	)

Definition at line 81 of file graph.c.

                                                         {
  check_successor(r);
  check_successor(v);
  message_assert("defined references to domain successor",
                 successor_defined_p(r) && successor_defined_p(v));
       memcpy(r, v, sizeof(struct _newgen_struct_successor_));
}

References check_successor(), message_assert, and successor_defined_p().

Here is the call graph for this function:

successor_consistent_p()

bool successor_consistent_p

(

successor

p

)

Definition at line 71 of file graph.c.

                                         {
  check_successor(p);
  return gen_consistent_p((gen_chunk*) p);
}

References check_successor(), and gen_consistent_p().

Here is the call graph for this function:

successor_defined_p()

bool successor_defined_p

(

successor

p

)

Definition at line 75 of file graph.c.

                                      {
  return gen_defined_p((gen_chunk*) p);
}

References gen_defined_p().

Here is the call graph for this function:

successor_non_recursive_free()

void successor_non_recursive_free

(

successor

p

)

Definition at line 88 of file graph.c.

                                               {
  // should clear up contents...
  free(p);
}

References free().

Here is the call graph for this function:

vertex_assign_contents()

void vertex_assign_contents	(	vertex	r,
		vertex	v
	)

Definition at line 123 of file graph.c.

                                                {
  check_vertex(r);
  check_vertex(v);
  message_assert("defined references to domain vertex",
                 vertex_defined_p(r) && vertex_defined_p(v));
       memcpy(r, v, sizeof(struct _newgen_struct_vertex_));
}

References check_vertex(), message_assert, and vertex_defined_p().

Here is the call graph for this function:

vertex_consistent_p()

bool vertex_consistent_p

(

vertex

p

)

Definition at line 113 of file graph.c.

                                   {
  check_vertex(p);
  return gen_consistent_p((gen_chunk*) p);
}

References check_vertex(), and gen_consistent_p().

Here is the call graph for this function:

vertex_defined_p()

bool vertex_defined_p

(

vertex

p

)

Definition at line 117 of file graph.c.

                                {
  return gen_defined_p((gen_chunk*) p);
}

References gen_defined_p().

Here is the call graph for this function:

vertex_non_recursive_free()

void vertex_non_recursive_free

(

vertex

p

)

Definition at line 130 of file graph.c.

                                         {
  // should clear up contents...
  free(p);
}

References free().

Here is the call graph for this function:

write_graph()

void write_graph	(	FILE *	f,
		graph	p
	)

Definition at line 50 of file graph.c.

                                   {
  gen_write(f, (gen_chunk*) p);
}

References f(), and gen_write().

Here is the call graph for this function:

write_successor()

void write_successor	(	FILE *	f,
		successor	p
	)

Definition at line 92 of file graph.c.

                                           {
  gen_write(f, (gen_chunk*) p);
}

References f(), and gen_write().

Here is the call graph for this function:

write_vertex()

void write_vertex	(	FILE *	f,
		vertex	p
	)

Definition at line 134 of file graph.c.

                                     {
  gen_write(f, (gen_chunk*) p);
}

References f(), and gen_write().

Here is the call graph for this function: