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

Include dependency graph for complexity_ri.c:

Typedefs
typedef void *	Ppolynome

Functions
complexity	copy_complexity (complexity p)
	COMPLEXITY. More...

void	free_complexity (complexity p)

complexity	check_complexity (complexity p)

bool	complexity_consistent_p (complexity p)

bool	complexity_defined_p (complexity p)

list	gen_complexity_cons (complexity p, list l)

void	complexity_assign_contents (complexity r, complexity v)

void	complexity_non_recursive_free (complexity p)

void	write_complexity (FILE *f, complexity p)

complexity	read_complexity (FILE *f)

complexity	make_complexity (Ppolynome a1, varcount a2, rangecount a3, ifcount a4)

ifcount	copy_ifcount (ifcount p)
	IFCOUNT. More...

void	free_ifcount (ifcount p)

ifcount	check_ifcount (ifcount p)

bool	ifcount_consistent_p (ifcount p)

bool	ifcount_defined_p (ifcount p)

list	gen_ifcount_cons (ifcount p, list l)

void	ifcount_assign_contents (ifcount r, ifcount v)

void	ifcount_non_recursive_free (ifcount p)

void	write_ifcount (FILE *f, ifcount p)

ifcount	read_ifcount (FILE *f)

ifcount	make_ifcount (intptr_t a1, intptr_t a2, intptr_t a3)

rangecount	copy_rangecount (rangecount p)
	RANGECOUNT. More...

void	free_rangecount (rangecount p)

rangecount	check_rangecount (rangecount p)

bool	rangecount_consistent_p (rangecount p)

bool	rangecount_defined_p (rangecount p)

list	gen_rangecount_cons (rangecount p, list l)

void	rangecount_assign_contents (rangecount r, rangecount v)

void	rangecount_non_recursive_free (rangecount p)

void	write_rangecount (FILE *f, rangecount p)

rangecount	read_rangecount (FILE *f)

rangecount	make_rangecount (intptr_t a1, intptr_t a2, intptr_t a3, intptr_t a4)

varcount	copy_varcount (varcount p)
	VARCOUNT. More...

void	free_varcount (varcount p)

varcount	check_varcount (varcount p)

bool	varcount_consistent_p (varcount p)

bool	varcount_defined_p (varcount p)

list	gen_varcount_cons (varcount p, list l)

void	varcount_assign_contents (varcount r, varcount v)

void	varcount_non_recursive_free (varcount p)

void	write_varcount (FILE *f, varcount p)

varcount	read_varcount (FILE *f)

varcount	make_varcount (intptr_t a1, intptr_t a2, intptr_t a3, intptr_t a4)

Typedef Documentation

◆ Ppolynome

typedef void* Ppolynome

Definition at line 7 of file complexity_ri.c.

Function Documentation

◆ check_complexity()

complexity check_complexity ( complexity p )

Definition at line 24 of file complexity_ri.c.

                                           {
   return (complexity) gen_check((gen_chunk*) p, complexity_domain);
 }

References complexity_domain, and gen_check().

Here is the call graph for this function:

◆ check_ifcount()

ifcount check_ifcount ( ifcount p )

Definition at line 66 of file complexity_ri.c.

                                  {
   return (ifcount) gen_check((gen_chunk*) p, ifcount_domain);
 }

References gen_check(), and ifcount_domain.

Here is the call graph for this function:

◆ check_rangecount()

rangecount check_rangecount ( rangecount p )

Definition at line 108 of file complexity_ri.c.

                                           {
   return (rangecount) gen_check((gen_chunk*) p, rangecount_domain);
 }

References gen_check(), and rangecount_domain.

Here is the call graph for this function:

◆ check_varcount()

varcount check_varcount ( varcount p )

Definition at line 150 of file complexity_ri.c.

                                     {
   return (varcount) gen_check((gen_chunk*) p, varcount_domain);
 }

References gen_check(), and varcount_domain.

Here is the call graph for this function:

◆ complexity_assign_contents()

void complexity_assign_contents	(	complexity	r,
		complexity	v
	)

Definition at line 37 of file complexity_ri.c.

                                                             {
   check_complexity(r);
   check_complexity(v);
   message_assert("defined references to domain complexity",
                  complexity_defined_p(r) && complexity_defined_p(v));
        memcpy(r, v, sizeof(struct _newgen_struct_complexity_));
 }

References check_complexity(), complexity_defined_p(), and message_assert.

Here is the call graph for this function:

◆ complexity_consistent_p()

bool complexity_consistent_p ( complexity p )

Definition at line 27 of file complexity_ri.c.

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

References check_complexity(), and gen_consistent_p().

Here is the call graph for this function:

◆ complexity_defined_p()

bool complexity_defined_p ( complexity p )

Definition at line 31 of file complexity_ri.c.

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

References gen_defined_p().

Here is the call graph for this function:

◆ complexity_non_recursive_free()

void complexity_non_recursive_free ( complexity p )

Definition at line 44 of file complexity_ri.c.

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

References free().

Here is the call graph for this function:

◆ copy_complexity()

complexity copy_complexity ( complexity p )

COMPLEXITY.

Definition at line 18 of file complexity_ri.c.

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

References gen_copy_tree().

Here is the call graph for this function:

◆ copy_ifcount()

ifcount copy_ifcount ( ifcount p )

IFCOUNT.

Definition at line 60 of file complexity_ri.c.

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

References gen_copy_tree().

Here is the call graph for this function:

◆ copy_rangecount()

rangecount copy_rangecount ( rangecount p )

RANGECOUNT.

Definition at line 102 of file complexity_ri.c.

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

References gen_copy_tree().

Here is the call graph for this function:

◆ copy_varcount()

varcount copy_varcount ( varcount p )

VARCOUNT.

Definition at line 144 of file complexity_ri.c.

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

References gen_copy_tree().

Here is the call graph for this function:

◆ free_complexity()

void free_complexity ( complexity p )

Definition at line 21 of file complexity_ri.c.

                                    {
   gen_free((gen_chunk*) p);
 }

References gen_free().

Here is the call graph for this function:

◆ free_ifcount()

void free_ifcount ( ifcount p )

Definition at line 63 of file complexity_ri.c.

                              {
   gen_free((gen_chunk*) p);
 }

References gen_free().

Here is the call graph for this function:

◆ free_rangecount()

void free_rangecount ( rangecount p )

Definition at line 105 of file complexity_ri.c.

                                    {
   gen_free((gen_chunk*) p);
 }

References gen_free().

Here is the call graph for this function:

◆ free_varcount()

void free_varcount ( varcount p )

Definition at line 147 of file complexity_ri.c.

                                {
   gen_free((gen_chunk*) p);
 }

References gen_free().

Here is the call graph for this function:

◆ gen_complexity_cons()

list gen_complexity_cons	(	complexity	p,
		list	l
	)

Definition at line 34 of file complexity_ri.c.

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

References COMPLEXITY_NEWGEN_DOMAIN, and gen_typed_cons().

Here is the call graph for this function:

◆ gen_ifcount_cons()

list gen_ifcount_cons	(	ifcount	p,
		list	l
	)

Definition at line 76 of file complexity_ri.c.

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

References gen_typed_cons(), and IFCOUNT_NEWGEN_DOMAIN.

Here is the call graph for this function:

◆ gen_rangecount_cons()

list gen_rangecount_cons	(	rangecount	p,
		list	l
	)

Definition at line 118 of file complexity_ri.c.

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

References gen_typed_cons(), and RANGECOUNT_NEWGEN_DOMAIN.

Here is the call graph for this function:

◆ gen_varcount_cons()

list gen_varcount_cons	(	varcount	p,
		list	l
	)

Definition at line 160 of file complexity_ri.c.

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

References gen_typed_cons(), and VARCOUNT_NEWGEN_DOMAIN.

Here is the call graph for this function:

◆ ifcount_assign_contents()

void ifcount_assign_contents	(	ifcount	r,
		ifcount	v
	)

Definition at line 79 of file complexity_ri.c.

                                                    {
   check_ifcount(r);
   check_ifcount(v);
   message_assert("defined references to domain ifcount",
                  ifcount_defined_p(r) && ifcount_defined_p(v));
        memcpy(r, v, sizeof(struct _newgen_struct_ifcount_));
 }

References check_ifcount(), ifcount_defined_p(), and message_assert.

Here is the call graph for this function:

◆ ifcount_consistent_p()

bool ifcount_consistent_p ( ifcount p )

Definition at line 69 of file complexity_ri.c.

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

References check_ifcount(), and gen_consistent_p().

Here is the call graph for this function:

◆ ifcount_defined_p()

bool ifcount_defined_p ( ifcount p )

Definition at line 73 of file complexity_ri.c.

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

References gen_defined_p().

Here is the call graph for this function:

◆ ifcount_non_recursive_free()

void ifcount_non_recursive_free ( ifcount p )

Definition at line 86 of file complexity_ri.c.

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

References free().

Here is the call graph for this function:

◆ make_complexity()

complexity make_complexity	(	Ppolynome	a1,
		varcount	a2,
		rangecount	a3,
		ifcount	a4
	)

Definition at line 54 of file complexity_ri.c.

                                                                                  {
   return (complexity) gen_alloc(5*sizeof(gen_chunk), GEN_CHECK_ALLOC, complexity_domain, a1, a2, a3, a4);
 }

References complexity_domain, gen_alloc(), and GEN_CHECK_ALLOC.

Here is the call graph for this function:

◆ make_ifcount()

ifcount make_ifcount	(	intptr_t	a1,
		intptr_t	a2,
		intptr_t	a3
	)

Definition at line 96 of file complexity_ri.c.

                                                             {
   return (ifcount) gen_alloc(4*sizeof(gen_chunk), GEN_CHECK_ALLOC, ifcount_domain, a1, a2, a3);
 }

References gen_alloc(), GEN_CHECK_ALLOC, and ifcount_domain.

Here is the call graph for this function:

◆ make_rangecount()

rangecount make_rangecount	(	intptr_t	a1,
		intptr_t	a2,
		intptr_t	a3,
		intptr_t	a4
	)

Definition at line 138 of file complexity_ri.c.

                                                                                {
   return (rangecount) gen_alloc(5*sizeof(gen_chunk), GEN_CHECK_ALLOC, rangecount_domain, a1, a2, a3, a4);
 }

References gen_alloc(), GEN_CHECK_ALLOC, and rangecount_domain.

Here is the call graph for this function:

◆ make_varcount()

varcount make_varcount	(	intptr_t	a1,
		intptr_t	a2,
		intptr_t	a3,
		intptr_t	a4
	)

Definition at line 180 of file complexity_ri.c.

                                                                            {
   return (varcount) gen_alloc(5*sizeof(gen_chunk), GEN_CHECK_ALLOC, varcount_domain, a1, a2, a3, a4);
 }

References gen_alloc(), GEN_CHECK_ALLOC, and varcount_domain.

Here is the call graph for this function:

◆ rangecount_assign_contents()

void rangecount_assign_contents	(	rangecount	r,
		rangecount	v
	)

Definition at line 121 of file complexity_ri.c.

                                                             {
   check_rangecount(r);
   check_rangecount(v);
   message_assert("defined references to domain rangecount",
                  rangecount_defined_p(r) && rangecount_defined_p(v));
        memcpy(r, v, sizeof(struct _newgen_struct_rangecount_));
 }

References check_rangecount(), message_assert, and rangecount_defined_p().

Here is the call graph for this function:

◆ rangecount_consistent_p()

bool rangecount_consistent_p ( rangecount p )

Definition at line 111 of file complexity_ri.c.

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

References check_rangecount(), and gen_consistent_p().

Here is the call graph for this function:

◆ rangecount_defined_p()

bool rangecount_defined_p ( rangecount p )

Definition at line 115 of file complexity_ri.c.

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

References gen_defined_p().

Here is the call graph for this function:

◆ rangecount_non_recursive_free()

void rangecount_non_recursive_free ( rangecount p )

Definition at line 128 of file complexity_ri.c.

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

References free().

Here is the call graph for this function:

◆ read_complexity()

complexity read_complexity ( FILE * f )

Definition at line 51 of file complexity_ri.c.

                                     {
   return (complexity) gen_read(f);
 }

References f(), and gen_read().

Here is the call graph for this function:

◆ read_ifcount()

ifcount read_ifcount ( FILE * f )

Definition at line 93 of file complexity_ri.c.

                               {
   return (ifcount) gen_read(f);
 }

References f(), and gen_read().

Here is the call graph for this function:

◆ read_rangecount()

rangecount read_rangecount ( FILE * f )

Definition at line 135 of file complexity_ri.c.

                                     {
   return (rangecount) gen_read(f);
 }

References f(), and gen_read().

Here is the call graph for this function:

◆ read_varcount()

varcount read_varcount ( FILE * f )

Definition at line 177 of file complexity_ri.c.

                                 {
   return (varcount) gen_read(f);
 }

References f(), and gen_read().

Here is the call graph for this function:

◆ varcount_assign_contents()

void varcount_assign_contents	(	varcount	r,
		varcount	v
	)

Definition at line 163 of file complexity_ri.c.

                                                       {
   check_varcount(r);
   check_varcount(v);
   message_assert("defined references to domain varcount",
                  varcount_defined_p(r) && varcount_defined_p(v));
        memcpy(r, v, sizeof(struct _newgen_struct_varcount_));
 }

References check_varcount(), message_assert, and varcount_defined_p().

Here is the call graph for this function:

◆ varcount_consistent_p()

bool varcount_consistent_p ( varcount p )

Definition at line 153 of file complexity_ri.c.

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

References check_varcount(), and gen_consistent_p().

Here is the call graph for this function:

◆ varcount_defined_p()

bool varcount_defined_p ( varcount p )

Definition at line 157 of file complexity_ri.c.

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

References gen_defined_p().

Here is the call graph for this function:

◆ varcount_non_recursive_free()

void varcount_non_recursive_free ( varcount p )

Definition at line 170 of file complexity_ri.c.

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

References free().

Here is the call graph for this function:

◆ write_complexity()

void write_complexity	(	FILE *	f,
		complexity	p
	)

Definition at line 48 of file complexity_ri.c.

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

References f(), and gen_write().

Here is the call graph for this function:

◆ write_ifcount()

void write_ifcount	(	FILE *	f,
		ifcount	p
	)

Definition at line 90 of file complexity_ri.c.

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

References f(), and gen_write().

Here is the call graph for this function:

◆ write_rangecount()

void write_rangecount	(	FILE *	f,
		rangecount	p
	)

Definition at line 132 of file complexity_ri.c.

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

References f(), and gen_write().

Here is the call graph for this function:

◆ write_varcount()

void write_varcount	(	FILE *	f,
		varcount	p
	)

Definition at line 174 of file complexity_ri.c.

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

References f(), and gen_write().

Here is the call graph for this function:

Typedefs

Functions

Typedef Documentation

◆ Ppolynome

Function Documentation

◆ check_complexity()

◆ check_ifcount()

◆ check_rangecount()

◆ check_varcount()

◆ complexity_assign_contents()

◆ complexity_consistent_p()

◆ complexity_defined_p()

◆ complexity_non_recursive_free()

◆ copy_complexity()

◆ copy_ifcount()

◆ copy_rangecount()

◆ copy_varcount()

◆ free_complexity()

◆ free_ifcount()

◆ free_rangecount()

◆ free_varcount()

◆ gen_complexity_cons()

◆ gen_ifcount_cons()

◆ gen_rangecount_cons()

◆ gen_varcount_cons()

◆ ifcount_assign_contents()

◆ ifcount_consistent_p()

◆ ifcount_defined_p()

◆ ifcount_non_recursive_free()

◆ make_complexity()

◆ make_ifcount()

◆ make_rangecount()

◆ make_varcount()

◆ rangecount_assign_contents()

◆ rangecount_consistent_p()

◆ rangecount_defined_p()

◆ rangecount_non_recursive_free()

◆ read_complexity()

◆ read_ifcount()

◆ read_rangecount()

◆ read_varcount()

◆ varcount_assign_contents()

◆ varcount_consistent_p()

◆ varcount_defined_p()

◆ varcount_non_recursive_free()

◆ write_complexity()

◆ write_ifcount()

◆ write_rangecount()

◆ write_varcount()