PIPS
paf_ri.c File Reference
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "genC.h"
#include "paf_ri.h"
+ Include dependency graph for paf_ri.c:

Go to the source code of this file.

Typedefs

typedef void * Pvecteur
 

Functions

bdt copy_bdt (bdt p)
 BDT. More...
 
void free_bdt (bdt p)
 
bdt check_bdt (bdt p)
 
bool bdt_consistent_p (bdt p)
 
bool bdt_defined_p (bdt p)
 
list gen_bdt_cons (bdt p, list l)
 
void bdt_assign_contents (bdt r, bdt v)
 
void bdt_non_recursive_free (bdt p)
 
void write_bdt (FILE *f, bdt p)
 
bdt read_bdt (FILE *f)
 
bdt make_bdt (list a)
 
communication copy_communication (communication p)
 COMMUNICATION. More...
 
void free_communication (communication p)
 
communication check_communication (communication p)
 
bool communication_consistent_p (communication p)
 
bool communication_defined_p (communication p)
 
list gen_communication_cons (communication p, list l)
 
void communication_assign_contents (communication r, communication v)
 
void communication_non_recursive_free (communication p)
 
void write_communication (FILE *f, communication p)
 
communication read_communication (FILE *f)
 
communication make_communication (predicate a1, predicate a2, predicate a3)
 
conditional copy_conditional (conditional p)
 CONDITIONAL. More...
 
void free_conditional (conditional p)
 
conditional check_conditional (conditional p)
 
bool conditional_consistent_p (conditional p)
 
bool conditional_defined_p (conditional p)
 
list gen_conditional_cons (conditional p, list l)
 
void conditional_assign_contents (conditional r, conditional v)
 
void conditional_non_recursive_free (conditional p)
 
void write_conditional (FILE *f, conditional p)
 
conditional read_conditional (FILE *f)
 
conditional make_conditional (predicate a1, quast a2, quast a3)
 
dataflow copy_dataflow (dataflow p)
 DATAFLOW. More...
 
void free_dataflow (dataflow p)
 
dataflow check_dataflow (dataflow p)
 
bool dataflow_consistent_p (dataflow p)
 
bool dataflow_defined_p (dataflow p)
 
list gen_dataflow_cons (dataflow p, list l)
 
void dataflow_assign_contents (dataflow r, dataflow v)
 
void dataflow_non_recursive_free (dataflow p)
 
void write_dataflow (FILE *f, dataflow p)
 
dataflow read_dataflow (FILE *f)
 
dataflow make_dataflow (reference a1, list a2, predicate a3, communication a4)
 
dfg_arc_label copy_dfg_arc_label (dfg_arc_label p)
 DFG_ARC_LABEL. More...
 
void free_dfg_arc_label (dfg_arc_label p)
 
dfg_arc_label check_dfg_arc_label (dfg_arc_label p)
 
bool dfg_arc_label_consistent_p (dfg_arc_label p)
 
bool dfg_arc_label_defined_p (dfg_arc_label p)
 
list gen_dfg_arc_label_cons (dfg_arc_label p, list l)
 
void dfg_arc_label_assign_contents (dfg_arc_label r, dfg_arc_label v)
 
void dfg_arc_label_non_recursive_free (dfg_arc_label p)
 
void write_dfg_arc_label (FILE *f, dfg_arc_label p)
 
dfg_arc_label read_dfg_arc_label (FILE *f)
 
dfg_arc_label make_dfg_arc_label (list a)
 
dfg_vertex_label copy_dfg_vertex_label (dfg_vertex_label p)
 DFG_VERTEX_LABEL. More...
 
void free_dfg_vertex_label (dfg_vertex_label p)
 
dfg_vertex_label check_dfg_vertex_label (dfg_vertex_label p)
 
bool dfg_vertex_label_consistent_p (dfg_vertex_label p)
 
bool dfg_vertex_label_defined_p (dfg_vertex_label p)
 
list gen_dfg_vertex_label_cons (dfg_vertex_label p, list l)
 
void dfg_vertex_label_assign_contents (dfg_vertex_label r, dfg_vertex_label v)
 
void dfg_vertex_label_non_recursive_free (dfg_vertex_label p)
 
void write_dfg_vertex_label (FILE *f, dfg_vertex_label p)
 
dfg_vertex_label read_dfg_vertex_label (FILE *f)
 
dfg_vertex_label make_dfg_vertex_label (intptr_t a1, predicate a2, sccflags a3)
 
leaf_label copy_leaf_label (leaf_label p)
 LEAF_LABEL. More...
 
void free_leaf_label (leaf_label p)
 
leaf_label check_leaf_label (leaf_label p)
 
bool leaf_label_consistent_p (leaf_label p)
 
bool leaf_label_defined_p (leaf_label p)
 
list gen_leaf_label_cons (leaf_label p, list l)
 
void leaf_label_assign_contents (leaf_label r, leaf_label v)
 
void leaf_label_non_recursive_free (leaf_label p)
 
void write_leaf_label (FILE *f, leaf_label p)
 
leaf_label read_leaf_label (FILE *f)
 
leaf_label make_leaf_label (intptr_t a1, intptr_t a2)
 
lisp_expression copy_lisp_expression (lisp_expression p)
 LISP_EXPRESSION. More...
 
void free_lisp_expression (lisp_expression p)
 
lisp_expression check_lisp_expression (lisp_expression p)
 
bool lisp_expression_consistent_p (lisp_expression p)
 
bool lisp_expression_defined_p (lisp_expression p)
 
list gen_lisp_expression_cons (lisp_expression p, list l)
 
void lisp_expression_assign_contents (lisp_expression r, lisp_expression v)
 
void lisp_expression_non_recursive_free (lisp_expression p)
 
void write_lisp_expression (FILE *f, lisp_expression p)
 
lisp_expression read_lisp_expression (FILE *f)
 
lisp_expression make_lisp_expression (string a1, list a2)
 
placement copy_placement (placement p)
 PLACEMENT. More...
 
void free_placement (placement p)
 
placement check_placement (placement p)
 
bool placement_consistent_p (placement p)
 
bool placement_defined_p (placement p)
 
list gen_placement_cons (placement p, list l)
 
void placement_assign_contents (placement r, placement v)
 
void placement_non_recursive_free (placement p)
 
void write_placement (FILE *f, placement p)
 
placement read_placement (FILE *f)
 
placement make_placement (intptr_t a1, list a2)
 
plc copy_plc (plc p)
 PLC. More...
 
void free_plc (plc p)
 
plc check_plc (plc p)
 
bool plc_consistent_p (plc p)
 
bool plc_defined_p (plc p)
 
list gen_plc_cons (plc p, list l)
 
void plc_assign_contents (plc r, plc v)
 
void plc_non_recursive_free (plc p)
 
void write_plc (FILE *f, plc p)
 
plc read_plc (FILE *f)
 
plc make_plc (list a)
 
quast_leaf copy_quast_leaf (quast_leaf p)
 QUAST_LEAF. More...
 
void free_quast_leaf (quast_leaf p)
 
quast_leaf check_quast_leaf (quast_leaf p)
 
bool quast_leaf_consistent_p (quast_leaf p)
 
bool quast_leaf_defined_p (quast_leaf p)
 
list gen_quast_leaf_cons (quast_leaf p, list l)
 
void quast_leaf_assign_contents (quast_leaf r, quast_leaf v)
 
void quast_leaf_non_recursive_free (quast_leaf p)
 
void write_quast_leaf (FILE *f, quast_leaf p)
 
quast_leaf read_quast_leaf (FILE *f)
 
quast_leaf make_quast_leaf (list a1, leaf_label a2)
 
quast copy_quast (quast p)
 QUAST. More...
 
void free_quast (quast p)
 
quast check_quast (quast p)
 
bool quast_consistent_p (quast p)
 
bool quast_defined_p (quast p)
 
list gen_quast_cons (quast p, list l)
 
void quast_assign_contents (quast r, quast v)
 
void quast_non_recursive_free (quast p)
 
void write_quast (FILE *f, quast p)
 
quast read_quast (FILE *f)
 
quast make_quast (quast_value a1, list a2)
 
quast_value copy_quast_value (quast_value p)
 QUAST_VALUE. More...
 
void free_quast_value (quast_value p)
 
quast_value check_quast_value (quast_value p)
 
bool quast_value_consistent_p (quast_value p)
 
bool quast_value_defined_p (quast_value p)
 
list gen_quast_value_cons (quast_value p, list l)
 
void quast_value_assign_contents (quast_value r, quast_value v)
 
void quast_value_non_recursive_free (quast_value p)
 
void write_quast_value (FILE *f, quast_value p)
 
quast_value read_quast_value (FILE *f)
 
string quast_value_tag_as_string (enum quast_value_utype tag)
 
quast_value make_quast_value (enum quast_value_utype tag, void *val)
 
quast_value make_quast_value_quast_leaf (quast_leaf _field_)
 
quast_value make_quast_value_conditional (conditional _field_)
 
schedule copy_schedule (schedule p)
 SCHEDULE. More...
 
void free_schedule (schedule p)
 
schedule check_schedule (schedule p)
 
bool schedule_consistent_p (schedule p)
 
bool schedule_defined_p (schedule p)
 
list gen_schedule_cons (schedule p, list l)
 
void schedule_assign_contents (schedule r, schedule v)
 
void schedule_non_recursive_free (schedule p)
 
void write_schedule (FILE *f, schedule p)
 
schedule read_schedule (FILE *f)
 
schedule make_schedule (intptr_t a1, predicate a2, list a3)
 
static_control copy_static_control (static_control p)
 STATIC_CONTROL. More...
 
void free_static_control (static_control p)
 
static_control check_static_control (static_control p)
 
bool static_control_consistent_p (static_control p)
 
bool static_control_defined_p (static_control p)
 
list gen_static_control_cons (static_control p, list l)
 
void static_control_assign_contents (static_control r, static_control v)
 
void static_control_non_recursive_free (static_control p)
 
void write_static_control (FILE *f, static_control p)
 
static_control read_static_control (FILE *f)
 
static_control make_static_control (bool a1, list a2, list a3, list a4)
 
var_val copy_var_val (var_val p)
 VAR_VAL. More...
 
void free_var_val (var_val p)
 
var_val check_var_val (var_val p)
 
bool var_val_consistent_p (var_val p)
 
bool var_val_defined_p (var_val p)
 
list gen_var_val_cons (var_val p, list l)
 
void var_val_assign_contents (var_val r, var_val v)
 
void var_val_non_recursive_free (var_val p)
 
void write_var_val (FILE *f, var_val p)
 
var_val read_var_val (FILE *f)
 
var_val make_var_val (entity a1, expression a2)
 

Typedef Documentation

◆ Pvecteur

typedef void* Pvecteur

Definition at line 7 of file paf_ri.c.

Function Documentation

◆ bdt_assign_contents()

void bdt_assign_contents ( bdt  r,
bdt  v 
)

Definition at line 37 of file paf_ri.c.

37  {
38  check_bdt(r);
39  check_bdt(v);
40  message_assert("defined references to domain bdt",
41  bdt_defined_p(r) && bdt_defined_p(v));
42  memcpy(r, v, sizeof(struct _newgen_struct_bdt_));
43 }
bdt check_bdt(bdt p)
Definition: paf_ri.c:24
bool bdt_defined_p(bdt p)
Definition: paf_ri.c:31
#define message_assert(msg, ex)
Definition: newgen_assert.h:47

References bdt_defined_p(), check_bdt(), and message_assert.

+ Here is the call graph for this function:

◆ bdt_consistent_p()

bool bdt_consistent_p ( bdt  p)

Definition at line 27 of file paf_ri.c.

27  {
28  check_bdt(p);
29  return gen_consistent_p((gen_chunk*) p);
30 }
int gen_consistent_p(gen_chunk *obj)
GEN_CONSISTENT_P dynamically checks the type correctness of OBJ.
Definition: genClib.c:2398
A gen_chunk is used to store every object.
Definition: genC.h:58

References check_bdt(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ bdt_defined_p()

bool bdt_defined_p ( bdt  p)

Definition at line 31 of file paf_ri.c.

31  {
32  return gen_defined_p((gen_chunk*) p);
33 }
int gen_defined_p(gen_chunk *obj)
Definition: genClib.c:2438

References gen_defined_p().

+ Here is the call graph for this function:

◆ bdt_non_recursive_free()

void bdt_non_recursive_free ( bdt  p)

Definition at line 44 of file paf_ri.c.

44  {
45  // should clear up contents...
46  free(p);
47 }
void free(void *)

References free().

+ Here is the call graph for this function:

◆ check_bdt()

bdt check_bdt ( bdt  p)

Definition at line 24 of file paf_ri.c.

24  {
25  return (bdt) gen_check((gen_chunk*) p, bdt_domain);
26 }
gen_chunk * gen_check(gen_chunk *obj, int t)
GEN_CHECK checks that the gen_chunk received OBJ is of the appropriate TYPE.
Definition: genClib.c:2356
#define bdt_domain
newgen_Pvecteur_domain_defined
Definition: paf_ri.h:67

References bdt_domain, and gen_check().

+ Here is the call graph for this function:

◆ check_communication()

communication check_communication ( communication  p)

Definition at line 66 of file paf_ri.c.

66  {
68 }
#define communication_domain
newgen_bdt_domain_defined
Definition: paf_ri.h:75

References communication_domain, and gen_check().

+ Here is the call graph for this function:

◆ check_conditional()

conditional check_conditional ( conditional  p)

Definition at line 108 of file paf_ri.c.

108  {
110 }
#define conditional_domain
newgen_communication_domain_defined
Definition: paf_ri.h:83

References conditional_domain, and gen_check().

+ Here is the call graph for this function:

◆ check_dataflow()

dataflow check_dataflow ( dataflow  p)

Definition at line 150 of file paf_ri.c.

150  {
152 }
#define dataflow_domain
newgen_conditional_domain_defined
Definition: paf_ri.h:91

References dataflow_domain, and gen_check().

+ Here is the call graph for this function:

◆ check_dfg_arc_label()

dfg_arc_label check_dfg_arc_label ( dfg_arc_label  p)

Definition at line 192 of file paf_ri.c.

192  {
194 }
#define dfg_arc_label_domain
newgen_dataflow_domain_defined
Definition: paf_ri.h:99

References dfg_arc_label_domain, and gen_check().

+ Here is the call graph for this function:

◆ check_dfg_vertex_label()

dfg_vertex_label check_dfg_vertex_label ( dfg_vertex_label  p)

Definition at line 234 of file paf_ri.c.

234  {
236 }
#define dfg_vertex_label_domain
newgen_dfg_arc_label_domain_defined
Definition: paf_ri.h:107

References dfg_vertex_label_domain, and gen_check().

+ Here is the call graph for this function:

◆ check_leaf_label()

leaf_label check_leaf_label ( leaf_label  p)

Definition at line 276 of file paf_ri.c.

276  {
278 }
#define leaf_label_domain
newgen_dfg_vertex_label_domain_defined
Definition: paf_ri.h:115

References gen_check(), and leaf_label_domain.

+ Here is the call graph for this function:

◆ check_lisp_expression()

lisp_expression check_lisp_expression ( lisp_expression  p)

Definition at line 318 of file paf_ri.c.

318  {
320 }
#define lisp_expression_domain
newgen_leaf_label_domain_defined
Definition: paf_ri.h:123

References gen_check(), and lisp_expression_domain.

+ Here is the call graph for this function:

◆ check_placement()

placement check_placement ( placement  p)

Definition at line 360 of file paf_ri.c.

360  {
362 }
#define placement_domain
newgen_lisp_expression_domain_defined
Definition: paf_ri.h:131

References gen_check(), and placement_domain.

+ Here is the call graph for this function:

◆ check_plc()

plc check_plc ( plc  p)

Definition at line 402 of file paf_ri.c.

402  {
403  return (plc) gen_check((gen_chunk*) p, plc_domain);
404 }
#define plc_domain
newgen_placement_domain_defined
Definition: paf_ri.h:139

References gen_check(), and plc_domain.

+ Here is the call graph for this function:

◆ check_quast()

quast check_quast ( quast  p)

Definition at line 486 of file paf_ri.c.

486  {
487  return (quast) gen_check((gen_chunk*) p, quast_domain);
488 }
#define quast_domain
newgen_quast_leaf_domain_defined
Definition: paf_ri.h:155

References gen_check(), and quast_domain.

+ Here is the call graph for this function:

◆ check_quast_leaf()

quast_leaf check_quast_leaf ( quast_leaf  p)

Definition at line 444 of file paf_ri.c.

444  {
446 }
#define quast_leaf_domain
newgen_plc_domain_defined
Definition: paf_ri.h:147

References gen_check(), and quast_leaf_domain.

+ Here is the call graph for this function:

◆ check_quast_value()

quast_value check_quast_value ( quast_value  p)

Definition at line 528 of file paf_ri.c.

528  {
530 }
#define quast_value_domain
newgen_quast_domain_defined
Definition: paf_ri.h:163

References gen_check(), and quast_value_domain.

+ Here is the call graph for this function:

◆ check_schedule()

schedule check_schedule ( schedule  p)

Definition at line 583 of file paf_ri.c.

583  {
585 }
#define schedule_domain
newgen_quast_value_domain_defined
Definition: paf_ri.h:171

References gen_check(), and schedule_domain.

+ Here is the call graph for this function:

◆ check_static_control()

static_control check_static_control ( static_control  p)

Definition at line 625 of file paf_ri.c.

625  {
627 }
#define static_control_domain
newgen_schedule_domain_defined
Definition: paf_ri.h:179

References gen_check(), and static_control_domain.

+ Here is the call graph for this function:

◆ check_var_val()

var_val check_var_val ( var_val  p)

Definition at line 667 of file paf_ri.c.

667  {
668  return (var_val) gen_check((gen_chunk*) p, var_val_domain);
669 }
#define var_val_domain
newgen_static_control_domain_defined
Definition: paf_ri.h:187

References gen_check(), and var_val_domain.

+ Here is the call graph for this function:

◆ communication_assign_contents()

void communication_assign_contents ( communication  r,
communication  v 
)

Definition at line 79 of file paf_ri.c.

79  {
82  message_assert("defined references to domain communication",
84  memcpy(r, v, sizeof(struct _newgen_struct_communication_));
85 }
bool communication_defined_p(communication p)
Definition: paf_ri.c:73
communication check_communication(communication p)
Definition: paf_ri.c:66

References check_communication(), communication_defined_p(), and message_assert.

+ Here is the call graph for this function:

◆ communication_consistent_p()

bool communication_consistent_p ( communication  p)

Definition at line 69 of file paf_ri.c.

69  {
71  return gen_consistent_p((gen_chunk*) p);
72 }

References check_communication(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ communication_defined_p()

bool communication_defined_p ( communication  p)

Definition at line 73 of file paf_ri.c.

73  {
74  return gen_defined_p((gen_chunk*) p);
75 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ communication_non_recursive_free()

void communication_non_recursive_free ( communication  p)

Definition at line 86 of file paf_ri.c.

86  {
87  // should clear up contents...
88  free(p);
89 }

References free().

+ Here is the call graph for this function:

◆ conditional_assign_contents()

void conditional_assign_contents ( conditional  r,
conditional  v 
)

Definition at line 121 of file paf_ri.c.

121  {
124  message_assert("defined references to domain conditional",
126  memcpy(r, v, sizeof(struct _newgen_struct_conditional_));
127 }
bool conditional_defined_p(conditional p)
Definition: paf_ri.c:115
conditional check_conditional(conditional p)
Definition: paf_ri.c:108

References check_conditional(), conditional_defined_p(), and message_assert.

+ Here is the call graph for this function:

◆ conditional_consistent_p()

bool conditional_consistent_p ( conditional  p)

Definition at line 111 of file paf_ri.c.

111  {
113  return gen_consistent_p((gen_chunk*) p);
114 }

References check_conditional(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ conditional_defined_p()

bool conditional_defined_p ( conditional  p)

Definition at line 115 of file paf_ri.c.

115  {
116  return gen_defined_p((gen_chunk*) p);
117 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ conditional_non_recursive_free()

void conditional_non_recursive_free ( conditional  p)

Definition at line 128 of file paf_ri.c.

128  {
129  // should clear up contents...
130  free(p);
131 }

References free().

+ Here is the call graph for this function:

◆ copy_bdt()

bdt copy_bdt ( bdt  p)

BDT.

Definition at line 18 of file paf_ri.c.

18  {
19  return (bdt) gen_copy_tree((gen_chunk*) p);
20 }
gen_chunk * gen_copy_tree(gen_chunk *obj)
Definition: genClib.c:1429

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_communication()

communication copy_communication ( communication  p)

COMMUNICATION.

Definition at line 60 of file paf_ri.c.

60  {
61  return (communication) gen_copy_tree((gen_chunk*) p);
62 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_conditional()

conditional copy_conditional ( conditional  p)

CONDITIONAL.

Definition at line 102 of file paf_ri.c.

102  {
103  return (conditional) gen_copy_tree((gen_chunk*) p);
104 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_dataflow()

dataflow copy_dataflow ( dataflow  p)

DATAFLOW.

Definition at line 144 of file paf_ri.c.

144  {
145  return (dataflow) gen_copy_tree((gen_chunk*) p);
146 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_dfg_arc_label()

dfg_arc_label copy_dfg_arc_label ( dfg_arc_label  p)

DFG_ARC_LABEL.

Definition at line 186 of file paf_ri.c.

186  {
187  return (dfg_arc_label) gen_copy_tree((gen_chunk*) p);
188 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_dfg_vertex_label()

dfg_vertex_label copy_dfg_vertex_label ( dfg_vertex_label  p)

DFG_VERTEX_LABEL.

Definition at line 228 of file paf_ri.c.

228  {
230 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_leaf_label()

leaf_label copy_leaf_label ( leaf_label  p)

LEAF_LABEL.

Definition at line 270 of file paf_ri.c.

270  {
271  return (leaf_label) gen_copy_tree((gen_chunk*) p);
272 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_lisp_expression()

lisp_expression copy_lisp_expression ( lisp_expression  p)

LISP_EXPRESSION.

Definition at line 312 of file paf_ri.c.

312  {
313  return (lisp_expression) gen_copy_tree((gen_chunk*) p);
314 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_placement()

placement copy_placement ( placement  p)

PLACEMENT.

Definition at line 354 of file paf_ri.c.

354  {
355  return (placement) gen_copy_tree((gen_chunk*) p);
356 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_plc()

plc copy_plc ( plc  p)

PLC.

Definition at line 396 of file paf_ri.c.

396  {
397  return (plc) gen_copy_tree((gen_chunk*) p);
398 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_quast()

quast copy_quast ( quast  p)

QUAST.

Definition at line 480 of file paf_ri.c.

480  {
481  return (quast) gen_copy_tree((gen_chunk*) p);
482 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_quast_leaf()

quast_leaf copy_quast_leaf ( quast_leaf  p)

QUAST_LEAF.

Definition at line 438 of file paf_ri.c.

438  {
439  return (quast_leaf) gen_copy_tree((gen_chunk*) p);
440 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_quast_value()

quast_value copy_quast_value ( quast_value  p)

QUAST_VALUE.

Definition at line 522 of file paf_ri.c.

522  {
523  return (quast_value) gen_copy_tree((gen_chunk*) p);
524 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_schedule()

schedule copy_schedule ( schedule  p)

SCHEDULE.

Definition at line 577 of file paf_ri.c.

577  {
578  return (schedule) gen_copy_tree((gen_chunk*) p);
579 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_static_control()

static_control copy_static_control ( static_control  p)

STATIC_CONTROL.

Definition at line 619 of file paf_ri.c.

619  {
620  return (static_control) gen_copy_tree((gen_chunk*) p);
621 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ copy_var_val()

var_val copy_var_val ( var_val  p)

VAR_VAL.

Definition at line 661 of file paf_ri.c.

661  {
662  return (var_val) gen_copy_tree((gen_chunk*) p);
663 }

References gen_copy_tree().

+ Here is the call graph for this function:

◆ dataflow_assign_contents()

void dataflow_assign_contents ( dataflow  r,
dataflow  v 
)

Definition at line 163 of file paf_ri.c.

163  {
164  check_dataflow(r);
165  check_dataflow(v);
166  message_assert("defined references to domain dataflow",
168  memcpy(r, v, sizeof(struct _newgen_struct_dataflow_));
169 }
bool dataflow_defined_p(dataflow p)
Definition: paf_ri.c:157
dataflow check_dataflow(dataflow p)
Definition: paf_ri.c:150

References check_dataflow(), dataflow_defined_p(), and message_assert.

+ Here is the call graph for this function:

◆ dataflow_consistent_p()

bool dataflow_consistent_p ( dataflow  p)

Definition at line 153 of file paf_ri.c.

153  {
154  check_dataflow(p);
155  return gen_consistent_p((gen_chunk*) p);
156 }

References check_dataflow(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ dataflow_defined_p()

bool dataflow_defined_p ( dataflow  p)

Definition at line 157 of file paf_ri.c.

157  {
158  return gen_defined_p((gen_chunk*) p);
159 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ dataflow_non_recursive_free()

void dataflow_non_recursive_free ( dataflow  p)

Definition at line 170 of file paf_ri.c.

170  {
171  // should clear up contents...
172  free(p);
173 }

References free().

+ Here is the call graph for this function:

◆ dfg_arc_label_assign_contents()

void dfg_arc_label_assign_contents ( dfg_arc_label  r,
dfg_arc_label  v 
)

Definition at line 205 of file paf_ri.c.

205  {
208  message_assert("defined references to domain dfg_arc_label",
210  memcpy(r, v, sizeof(struct _newgen_struct_dfg_arc_label_));
211 }
bool dfg_arc_label_defined_p(dfg_arc_label p)
Definition: paf_ri.c:199
dfg_arc_label check_dfg_arc_label(dfg_arc_label p)
Definition: paf_ri.c:192

References check_dfg_arc_label(), dfg_arc_label_defined_p(), and message_assert.

+ Here is the call graph for this function:

◆ dfg_arc_label_consistent_p()

bool dfg_arc_label_consistent_p ( dfg_arc_label  p)

Definition at line 195 of file paf_ri.c.

195  {
197  return gen_consistent_p((gen_chunk*) p);
198 }

References check_dfg_arc_label(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ dfg_arc_label_defined_p()

bool dfg_arc_label_defined_p ( dfg_arc_label  p)

Definition at line 199 of file paf_ri.c.

199  {
200  return gen_defined_p((gen_chunk*) p);
201 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ dfg_arc_label_non_recursive_free()

void dfg_arc_label_non_recursive_free ( dfg_arc_label  p)

Definition at line 212 of file paf_ri.c.

212  {
213  // should clear up contents...
214  free(p);
215 }

References free().

+ Here is the call graph for this function:

◆ dfg_vertex_label_assign_contents()

void dfg_vertex_label_assign_contents ( dfg_vertex_label  r,
dfg_vertex_label  v 
)

Definition at line 247 of file paf_ri.c.

247  {
250  message_assert("defined references to domain dfg_vertex_label",
252  memcpy(r, v, sizeof(struct _newgen_struct_dfg_vertex_label_));
253 }
bool dfg_vertex_label_defined_p(dfg_vertex_label p)
Definition: paf_ri.c:241
dfg_vertex_label check_dfg_vertex_label(dfg_vertex_label p)
Definition: paf_ri.c:234

References check_dfg_vertex_label(), dfg_vertex_label_defined_p(), and message_assert.

+ Here is the call graph for this function:

◆ dfg_vertex_label_consistent_p()

bool dfg_vertex_label_consistent_p ( dfg_vertex_label  p)

Definition at line 237 of file paf_ri.c.

237  {
239  return gen_consistent_p((gen_chunk*) p);
240 }

References check_dfg_vertex_label(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ dfg_vertex_label_defined_p()

bool dfg_vertex_label_defined_p ( dfg_vertex_label  p)

Definition at line 241 of file paf_ri.c.

241  {
242  return gen_defined_p((gen_chunk*) p);
243 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ dfg_vertex_label_non_recursive_free()

void dfg_vertex_label_non_recursive_free ( dfg_vertex_label  p)

Definition at line 254 of file paf_ri.c.

254  {
255  // should clear up contents...
256  free(p);
257 }

References free().

+ Here is the call graph for this function:

◆ free_bdt()

void free_bdt ( bdt  p)

Definition at line 21 of file paf_ri.c.

21  {
22  gen_free((gen_chunk*) p);
23 }
void gen_free(gen_chunk *obj)
version without shared_pointers.
Definition: genClib.c:992

References gen_free().

+ Here is the call graph for this function:

◆ free_communication()

void free_communication ( communication  p)

Definition at line 63 of file paf_ri.c.

63  {
64  gen_free((gen_chunk*) p);
65 }

References gen_free().

+ Here is the call graph for this function:

◆ free_conditional()

void free_conditional ( conditional  p)

Definition at line 105 of file paf_ri.c.

105  {
106  gen_free((gen_chunk*) p);
107 }

References gen_free().

+ Here is the call graph for this function:

◆ free_dataflow()

void free_dataflow ( dataflow  p)

Definition at line 147 of file paf_ri.c.

147  {
148  gen_free((gen_chunk*) p);
149 }

References gen_free().

+ Here is the call graph for this function:

◆ free_dfg_arc_label()

void free_dfg_arc_label ( dfg_arc_label  p)

Definition at line 189 of file paf_ri.c.

189  {
190  gen_free((gen_chunk*) p);
191 }

References gen_free().

+ Here is the call graph for this function:

◆ free_dfg_vertex_label()

void free_dfg_vertex_label ( dfg_vertex_label  p)

Definition at line 231 of file paf_ri.c.

231  {
232  gen_free((gen_chunk*) p);
233 }

References gen_free().

+ Here is the call graph for this function:

◆ free_leaf_label()

void free_leaf_label ( leaf_label  p)

Definition at line 273 of file paf_ri.c.

273  {
274  gen_free((gen_chunk*) p);
275 }

References gen_free().

+ Here is the call graph for this function:

◆ free_lisp_expression()

void free_lisp_expression ( lisp_expression  p)

Definition at line 315 of file paf_ri.c.

315  {
316  gen_free((gen_chunk*) p);
317 }

References gen_free().

+ Here is the call graph for this function:

◆ free_placement()

void free_placement ( placement  p)

Definition at line 357 of file paf_ri.c.

357  {
358  gen_free((gen_chunk*) p);
359 }

References gen_free().

+ Here is the call graph for this function:

◆ free_plc()

void free_plc ( plc  p)

Definition at line 399 of file paf_ri.c.

399  {
400  gen_free((gen_chunk*) p);
401 }

References gen_free().

+ Here is the call graph for this function:

◆ free_quast()

void free_quast ( quast  p)

Definition at line 483 of file paf_ri.c.

483  {
484  gen_free((gen_chunk*) p);
485 }

References gen_free().

+ Here is the call graph for this function:

◆ free_quast_leaf()

void free_quast_leaf ( quast_leaf  p)

Definition at line 441 of file paf_ri.c.

441  {
442  gen_free((gen_chunk*) p);
443 }

References gen_free().

+ Here is the call graph for this function:

◆ free_quast_value()

void free_quast_value ( quast_value  p)

Definition at line 525 of file paf_ri.c.

525  {
526  gen_free((gen_chunk*) p);
527 }

References gen_free().

+ Here is the call graph for this function:

◆ free_schedule()

void free_schedule ( schedule  p)

Definition at line 580 of file paf_ri.c.

580  {
581  gen_free((gen_chunk*) p);
582 }

References gen_free().

+ Here is the call graph for this function:

◆ free_static_control()

void free_static_control ( static_control  p)

Definition at line 622 of file paf_ri.c.

622  {
623  gen_free((gen_chunk*) p);
624 }

References gen_free().

+ Here is the call graph for this function:

◆ free_var_val()

void free_var_val ( var_val  p)

Definition at line 664 of file paf_ri.c.

664  {
665  gen_free((gen_chunk*) p);
666 }

References gen_free().

+ Here is the call graph for this function:

◆ gen_bdt_cons()

list gen_bdt_cons ( bdt  p,
list  l 
)

Definition at line 34 of file paf_ri.c.

34  {
35  return gen_typed_cons(BDT_NEWGEN_DOMAIN, p, l);
36 }
list gen_typed_cons(_int type, const void *item, const list next)
CONS a list with minimal type checking this cannot be done within the CONS macro because possible fun...
Definition: list.c:900
#define BDT_NEWGEN_DOMAIN
Definition: paf_ri.h:70

References BDT_NEWGEN_DOMAIN, and gen_typed_cons().

+ Here is the call graph for this function:

◆ gen_communication_cons()

list gen_communication_cons ( communication  p,
list  l 
)

Definition at line 76 of file paf_ri.c.

76  {
78 }
#define COMMUNICATION_NEWGEN_DOMAIN
Definition: paf_ri.h:78

References COMMUNICATION_NEWGEN_DOMAIN, and gen_typed_cons().

+ Here is the call graph for this function:

◆ gen_conditional_cons()

list gen_conditional_cons ( conditional  p,
list  l 
)

Definition at line 118 of file paf_ri.c.

118  {
120 }
#define CONDITIONAL_NEWGEN_DOMAIN
Definition: paf_ri.h:86

References CONDITIONAL_NEWGEN_DOMAIN, and gen_typed_cons().

+ Here is the call graph for this function:

◆ gen_dataflow_cons()

list gen_dataflow_cons ( dataflow  p,
list  l 
)

Definition at line 160 of file paf_ri.c.

160  {
162 }
#define DATAFLOW_NEWGEN_DOMAIN
Definition: paf_ri.h:94

References DATAFLOW_NEWGEN_DOMAIN, and gen_typed_cons().

+ Here is the call graph for this function:

◆ gen_dfg_arc_label_cons()

list gen_dfg_arc_label_cons ( dfg_arc_label  p,
list  l 
)

Definition at line 202 of file paf_ri.c.

202  {
204 }
#define DFG_ARC_LABEL_NEWGEN_DOMAIN
Definition: paf_ri.h:102

References DFG_ARC_LABEL_NEWGEN_DOMAIN, and gen_typed_cons().

+ Here is the call graph for this function:

◆ gen_dfg_vertex_label_cons()

list gen_dfg_vertex_label_cons ( dfg_vertex_label  p,
list  l 
)

Definition at line 244 of file paf_ri.c.

244  {
246 }
#define DFG_VERTEX_LABEL_NEWGEN_DOMAIN
Definition: paf_ri.h:110

References DFG_VERTEX_LABEL_NEWGEN_DOMAIN, and gen_typed_cons().

+ Here is the call graph for this function:

◆ gen_leaf_label_cons()

list gen_leaf_label_cons ( leaf_label  p,
list  l 
)

Definition at line 286 of file paf_ri.c.

286  {
288 }
#define LEAF_LABEL_NEWGEN_DOMAIN
Definition: paf_ri.h:118

References gen_typed_cons(), and LEAF_LABEL_NEWGEN_DOMAIN.

+ Here is the call graph for this function:

◆ gen_lisp_expression_cons()

list gen_lisp_expression_cons ( lisp_expression  p,
list  l 
)

Definition at line 328 of file paf_ri.c.

328  {
330 }
#define LISP_EXPRESSION_NEWGEN_DOMAIN
Definition: paf_ri.h:126

References gen_typed_cons(), and LISP_EXPRESSION_NEWGEN_DOMAIN.

+ Here is the call graph for this function:

◆ gen_placement_cons()

list gen_placement_cons ( placement  p,
list  l 
)

Definition at line 370 of file paf_ri.c.

370  {
372 }
#define PLACEMENT_NEWGEN_DOMAIN
Definition: paf_ri.h:134

References gen_typed_cons(), and PLACEMENT_NEWGEN_DOMAIN.

+ Here is the call graph for this function:

◆ gen_plc_cons()

list gen_plc_cons ( plc  p,
list  l 
)

Definition at line 412 of file paf_ri.c.

412  {
413  return gen_typed_cons(PLC_NEWGEN_DOMAIN, p, l);
414 }
#define PLC_NEWGEN_DOMAIN
Definition: paf_ri.h:142

References gen_typed_cons(), and PLC_NEWGEN_DOMAIN.

+ Here is the call graph for this function:

◆ gen_quast_cons()

list gen_quast_cons ( quast  p,
list  l 
)

Definition at line 496 of file paf_ri.c.

496  {
497  return gen_typed_cons(QUAST_NEWGEN_DOMAIN, p, l);
498 }
#define QUAST_NEWGEN_DOMAIN
Definition: paf_ri.h:158

References gen_typed_cons(), and QUAST_NEWGEN_DOMAIN.

+ Here is the call graph for this function:

◆ gen_quast_leaf_cons()

list gen_quast_leaf_cons ( quast_leaf  p,
list  l 
)

Definition at line 454 of file paf_ri.c.

454  {
456 }
#define QUAST_LEAF_NEWGEN_DOMAIN
Definition: paf_ri.h:150

References gen_typed_cons(), and QUAST_LEAF_NEWGEN_DOMAIN.

+ Here is the call graph for this function:

◆ gen_quast_value_cons()

list gen_quast_value_cons ( quast_value  p,
list  l 
)

Definition at line 538 of file paf_ri.c.

538  {
540 }
#define QUAST_VALUE_NEWGEN_DOMAIN
Definition: paf_ri.h:166

References gen_typed_cons(), and QUAST_VALUE_NEWGEN_DOMAIN.

+ Here is the call graph for this function:

◆ gen_schedule_cons()

list gen_schedule_cons ( schedule  p,
list  l 
)

Definition at line 593 of file paf_ri.c.

593  {
595 }
#define SCHEDULE_NEWGEN_DOMAIN
Definition: paf_ri.h:174

References gen_typed_cons(), and SCHEDULE_NEWGEN_DOMAIN.

+ Here is the call graph for this function:

◆ gen_static_control_cons()

list gen_static_control_cons ( static_control  p,
list  l 
)

Definition at line 635 of file paf_ri.c.

635  {
637 }
#define STATIC_CONTROL_NEWGEN_DOMAIN
Definition: paf_ri.h:182

References gen_typed_cons(), and STATIC_CONTROL_NEWGEN_DOMAIN.

+ Here is the call graph for this function:

◆ gen_var_val_cons()

list gen_var_val_cons ( var_val  p,
list  l 
)

Definition at line 677 of file paf_ri.c.

677  {
679 }
#define VAR_VAL_NEWGEN_DOMAIN
Definition: paf_ri.h:190

References gen_typed_cons(), and VAR_VAL_NEWGEN_DOMAIN.

+ Here is the call graph for this function:

◆ leaf_label_assign_contents()

void leaf_label_assign_contents ( leaf_label  r,
leaf_label  v 
)

Definition at line 289 of file paf_ri.c.

289  {
290  check_leaf_label(r);
291  check_leaf_label(v);
292  message_assert("defined references to domain leaf_label",
294  memcpy(r, v, sizeof(struct _newgen_struct_leaf_label_));
295 }
bool leaf_label_defined_p(leaf_label p)
Definition: paf_ri.c:283
leaf_label check_leaf_label(leaf_label p)
Definition: paf_ri.c:276

References check_leaf_label(), leaf_label_defined_p(), and message_assert.

+ Here is the call graph for this function:

◆ leaf_label_consistent_p()

bool leaf_label_consistent_p ( leaf_label  p)

Definition at line 279 of file paf_ri.c.

279  {
280  check_leaf_label(p);
281  return gen_consistent_p((gen_chunk*) p);
282 }

References check_leaf_label(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ leaf_label_defined_p()

bool leaf_label_defined_p ( leaf_label  p)

Definition at line 283 of file paf_ri.c.

283  {
284  return gen_defined_p((gen_chunk*) p);
285 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ leaf_label_non_recursive_free()

void leaf_label_non_recursive_free ( leaf_label  p)

Definition at line 296 of file paf_ri.c.

296  {
297  // should clear up contents...
298  free(p);
299 }

References free().

+ Here is the call graph for this function:

◆ lisp_expression_assign_contents()

void lisp_expression_assign_contents ( lisp_expression  r,
lisp_expression  v 
)

Definition at line 331 of file paf_ri.c.

331  {
334  message_assert("defined references to domain lisp_expression",
336  memcpy(r, v, sizeof(struct _newgen_struct_lisp_expression_));
337 }
bool lisp_expression_defined_p(lisp_expression p)
Definition: paf_ri.c:325
lisp_expression check_lisp_expression(lisp_expression p)
Definition: paf_ri.c:318

References check_lisp_expression(), lisp_expression_defined_p(), and message_assert.

+ Here is the call graph for this function:

◆ lisp_expression_consistent_p()

bool lisp_expression_consistent_p ( lisp_expression  p)

Definition at line 321 of file paf_ri.c.

321  {
323  return gen_consistent_p((gen_chunk*) p);
324 }

References check_lisp_expression(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ lisp_expression_defined_p()

bool lisp_expression_defined_p ( lisp_expression  p)

Definition at line 325 of file paf_ri.c.

325  {
326  return gen_defined_p((gen_chunk*) p);
327 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ lisp_expression_non_recursive_free()

void lisp_expression_non_recursive_free ( lisp_expression  p)

Definition at line 338 of file paf_ri.c.

338  {
339  // should clear up contents...
340  free(p);
341 }

References free().

+ Here is the call graph for this function:

◆ make_bdt()

bdt make_bdt ( list  a)

Definition at line 54 of file paf_ri.c.

54  {
55  return (bdt) gen_alloc(2*sizeof(gen_chunk), GEN_CHECK_ALLOC, bdt_domain, a);
56 }
#define GEN_CHECK_ALLOC
Definition: genC.h:307
gen_chunk * gen_alloc(int size, int gen_check_p, int dom,...)
allocates something in newgen.
Definition: genClib.c:298

References bdt_domain, gen_alloc(), and GEN_CHECK_ALLOC.

+ Here is the call graph for this function:

◆ make_communication()

communication make_communication ( predicate  a1,
predicate  a2,
predicate  a3 
)

Definition at line 96 of file paf_ri.c.

96  {
97  return (communication) gen_alloc(4*sizeof(gen_chunk), GEN_CHECK_ALLOC, communication_domain, a1, a2, a3);
98 }

References communication_domain, gen_alloc(), and GEN_CHECK_ALLOC.

+ Here is the call graph for this function:

◆ make_conditional()

conditional make_conditional ( predicate  a1,
quast  a2,
quast  a3 
)

Definition at line 138 of file paf_ri.c.

138  {
139  return (conditional) gen_alloc(4*sizeof(gen_chunk), GEN_CHECK_ALLOC, conditional_domain, a1, a2, a3);
140 }

References conditional_domain, gen_alloc(), and GEN_CHECK_ALLOC.

+ Here is the call graph for this function:

◆ make_dataflow()

dataflow make_dataflow ( reference  a1,
list  a2,
predicate  a3,
communication  a4 
)

Definition at line 180 of file paf_ri.c.

180  {
181  return (dataflow) gen_alloc(5*sizeof(gen_chunk), GEN_CHECK_ALLOC, dataflow_domain, a1, a2, a3, a4);
182 }

References dataflow_domain, gen_alloc(), and GEN_CHECK_ALLOC.

+ Here is the call graph for this function:

◆ make_dfg_arc_label()

dfg_arc_label make_dfg_arc_label ( list  a)

Definition at line 222 of file paf_ri.c.

222  {
224 }

References dfg_arc_label_domain, gen_alloc(), and GEN_CHECK_ALLOC.

+ Here is the call graph for this function:

◆ make_dfg_vertex_label()

dfg_vertex_label make_dfg_vertex_label ( intptr_t  a1,
predicate  a2,
sccflags  a3 
)

Definition at line 264 of file paf_ri.c.

264  {
266 }

References dfg_vertex_label_domain, gen_alloc(), and GEN_CHECK_ALLOC.

+ Here is the call graph for this function:

◆ make_leaf_label()

leaf_label make_leaf_label ( intptr_t  a1,
intptr_t  a2 
)

Definition at line 306 of file paf_ri.c.

306  {
307  return (leaf_label) gen_alloc(3*sizeof(gen_chunk), GEN_CHECK_ALLOC, leaf_label_domain, a1, a2);
308 }

References gen_alloc(), GEN_CHECK_ALLOC, and leaf_label_domain.

+ Here is the call graph for this function:

◆ make_lisp_expression()

lisp_expression make_lisp_expression ( string  a1,
list  a2 
)

Definition at line 348 of file paf_ri.c.

348  {
350 }

References gen_alloc(), GEN_CHECK_ALLOC, and lisp_expression_domain.

+ Here is the call graph for this function:

◆ make_placement()

placement make_placement ( intptr_t  a1,
list  a2 
)

Definition at line 390 of file paf_ri.c.

390  {
391  return (placement) gen_alloc(3*sizeof(gen_chunk), GEN_CHECK_ALLOC, placement_domain, a1, a2);
392 }

References gen_alloc(), GEN_CHECK_ALLOC, and placement_domain.

+ Here is the call graph for this function:

◆ make_plc()

plc make_plc ( list  a)

Definition at line 432 of file paf_ri.c.

432  {
433  return (plc) gen_alloc(2*sizeof(gen_chunk), GEN_CHECK_ALLOC, plc_domain, a);
434 }

References gen_alloc(), GEN_CHECK_ALLOC, and plc_domain.

+ Here is the call graph for this function:

◆ make_quast()

quast make_quast ( quast_value  a1,
list  a2 
)

Definition at line 516 of file paf_ri.c.

516  {
517  return (quast) gen_alloc(3*sizeof(gen_chunk), GEN_CHECK_ALLOC, quast_domain, a1, a2);
518 }

References gen_alloc(), GEN_CHECK_ALLOC, and quast_domain.

+ Here is the call graph for this function:

◆ make_quast_leaf()

quast_leaf make_quast_leaf ( list  a1,
leaf_label  a2 
)

Definition at line 474 of file paf_ri.c.

474  {
475  return (quast_leaf) gen_alloc(3*sizeof(gen_chunk), GEN_CHECK_ALLOC, quast_leaf_domain, a1, a2);
476 }

References gen_alloc(), GEN_CHECK_ALLOC, and quast_leaf_domain.

+ Here is the call graph for this function:

◆ make_quast_value()

quast_value make_quast_value ( enum quast_value_utype  tag,
void *  val 
)

Definition at line 565 of file paf_ri.c.

565  {
567 }
int tag
TAG.
Definition: newgen_types.h:92

References gen_alloc(), GEN_CHECK_ALLOC, and quast_value_domain.

+ Here is the call graph for this function:

◆ make_quast_value_conditional()

quast_value make_quast_value_conditional ( conditional  _field_)

Definition at line 571 of file paf_ri.c.

571  {
572  return make_quast_value(is_quast_value_conditional, (void*)(intptr_t) _field_);
573 }
quast_value make_quast_value(enum quast_value_utype tag, void *val)
Definition: paf_ri.c:565
@ is_quast_value_conditional
Definition: paf_ri.h:655
#define intptr_t
Definition: stdint.in.h:294

References intptr_t, is_quast_value_conditional, and make_quast_value().

+ Here is the call graph for this function:

◆ make_quast_value_quast_leaf()

quast_value make_quast_value_quast_leaf ( quast_leaf  _field_)

Definition at line 568 of file paf_ri.c.

568  {
569  return make_quast_value(is_quast_value_quast_leaf, (void*)(intptr_t) _field_);
570 }
@ is_quast_value_quast_leaf
Definition: paf_ri.h:654

References intptr_t, is_quast_value_quast_leaf, and make_quast_value().

+ Here is the call graph for this function:

◆ make_schedule()

schedule make_schedule ( intptr_t  a1,
predicate  a2,
list  a3 
)

Definition at line 613 of file paf_ri.c.

613  {
614  return (schedule) gen_alloc(4*sizeof(gen_chunk), GEN_CHECK_ALLOC, schedule_domain, a1, a2, a3);
615 }

References gen_alloc(), GEN_CHECK_ALLOC, and schedule_domain.

+ Here is the call graph for this function:

◆ make_static_control()

static_control make_static_control ( bool  a1,
list  a2,
list  a3,
list  a4 
)

Definition at line 655 of file paf_ri.c.

655  {
656  return (static_control) gen_alloc(5*sizeof(gen_chunk), GEN_CHECK_ALLOC, static_control_domain, a1, a2, a3, a4);
657 }

References gen_alloc(), GEN_CHECK_ALLOC, and static_control_domain.

+ Here is the call graph for this function:

◆ make_var_val()

var_val make_var_val ( entity  a1,
expression  a2 
)

Definition at line 697 of file paf_ri.c.

697  {
698  return (var_val) gen_alloc(3*sizeof(gen_chunk), GEN_CHECK_ALLOC, var_val_domain, a1, a2);
699 }

References gen_alloc(), GEN_CHECK_ALLOC, and var_val_domain.

+ Here is the call graph for this function:

◆ placement_assign_contents()

void placement_assign_contents ( placement  r,
placement  v 
)

Definition at line 373 of file paf_ri.c.

373  {
374  check_placement(r);
375  check_placement(v);
376  message_assert("defined references to domain placement",
378  memcpy(r, v, sizeof(struct _newgen_struct_placement_));
379 }
bool placement_defined_p(placement p)
Definition: paf_ri.c:367
placement check_placement(placement p)
Definition: paf_ri.c:360

References check_placement(), message_assert, and placement_defined_p().

+ Here is the call graph for this function:

◆ placement_consistent_p()

bool placement_consistent_p ( placement  p)

Definition at line 363 of file paf_ri.c.

363  {
364  check_placement(p);
365  return gen_consistent_p((gen_chunk*) p);
366 }

References check_placement(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ placement_defined_p()

bool placement_defined_p ( placement  p)

Definition at line 367 of file paf_ri.c.

367  {
368  return gen_defined_p((gen_chunk*) p);
369 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ placement_non_recursive_free()

void placement_non_recursive_free ( placement  p)

Definition at line 380 of file paf_ri.c.

380  {
381  // should clear up contents...
382  free(p);
383 }

References free().

+ Here is the call graph for this function:

◆ plc_assign_contents()

void plc_assign_contents ( plc  r,
plc  v 
)

Definition at line 415 of file paf_ri.c.

415  {
416  check_plc(r);
417  check_plc(v);
418  message_assert("defined references to domain plc",
419  plc_defined_p(r) && plc_defined_p(v));
420  memcpy(r, v, sizeof(struct _newgen_struct_plc_));
421 }
plc check_plc(plc p)
Definition: paf_ri.c:402
bool plc_defined_p(plc p)
Definition: paf_ri.c:409

References check_plc(), message_assert, and plc_defined_p().

+ Here is the call graph for this function:

◆ plc_consistent_p()

bool plc_consistent_p ( plc  p)

Definition at line 405 of file paf_ri.c.

405  {
406  check_plc(p);
407  return gen_consistent_p((gen_chunk*) p);
408 }

References check_plc(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ plc_defined_p()

bool plc_defined_p ( plc  p)

Definition at line 409 of file paf_ri.c.

409  {
410  return gen_defined_p((gen_chunk*) p);
411 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ plc_non_recursive_free()

void plc_non_recursive_free ( plc  p)

Definition at line 422 of file paf_ri.c.

422  {
423  // should clear up contents...
424  free(p);
425 }

References free().

+ Here is the call graph for this function:

◆ quast_assign_contents()

void quast_assign_contents ( quast  r,
quast  v 
)

Definition at line 499 of file paf_ri.c.

499  {
500  check_quast(r);
501  check_quast(v);
502  message_assert("defined references to domain quast",
504  memcpy(r, v, sizeof(struct _newgen_struct_quast_));
505 }
quast check_quast(quast p)
Definition: paf_ri.c:486
bool quast_defined_p(quast p)
Definition: paf_ri.c:493

References check_quast(), message_assert, and quast_defined_p().

+ Here is the call graph for this function:

◆ quast_consistent_p()

bool quast_consistent_p ( quast  p)

Definition at line 489 of file paf_ri.c.

489  {
490  check_quast(p);
491  return gen_consistent_p((gen_chunk*) p);
492 }

References check_quast(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ quast_defined_p()

bool quast_defined_p ( quast  p)

Definition at line 493 of file paf_ri.c.

493  {
494  return gen_defined_p((gen_chunk*) p);
495 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ quast_leaf_assign_contents()

void quast_leaf_assign_contents ( quast_leaf  r,
quast_leaf  v 
)

Definition at line 457 of file paf_ri.c.

457  {
458  check_quast_leaf(r);
459  check_quast_leaf(v);
460  message_assert("defined references to domain quast_leaf",
462  memcpy(r, v, sizeof(struct _newgen_struct_quast_leaf_));
463 }
quast_leaf check_quast_leaf(quast_leaf p)
Definition: paf_ri.c:444
bool quast_leaf_defined_p(quast_leaf p)
Definition: paf_ri.c:451

References check_quast_leaf(), message_assert, and quast_leaf_defined_p().

+ Here is the call graph for this function:

◆ quast_leaf_consistent_p()

bool quast_leaf_consistent_p ( quast_leaf  p)

Definition at line 447 of file paf_ri.c.

447  {
448  check_quast_leaf(p);
449  return gen_consistent_p((gen_chunk*) p);
450 }

References check_quast_leaf(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ quast_leaf_defined_p()

bool quast_leaf_defined_p ( quast_leaf  p)

Definition at line 451 of file paf_ri.c.

451  {
452  return gen_defined_p((gen_chunk*) p);
453 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ quast_leaf_non_recursive_free()

void quast_leaf_non_recursive_free ( quast_leaf  p)

Definition at line 464 of file paf_ri.c.

464  {
465  // should clear up contents...
466  free(p);
467 }

References free().

+ Here is the call graph for this function:

◆ quast_non_recursive_free()

void quast_non_recursive_free ( quast  p)

Definition at line 506 of file paf_ri.c.

506  {
507  // should clear up contents...
508  free(p);
509 }

References free().

+ Here is the call graph for this function:

◆ quast_value_assign_contents()

void quast_value_assign_contents ( quast_value  r,
quast_value  v 
)

Definition at line 541 of file paf_ri.c.

541  {
544  message_assert("defined references to domain quast_value",
546  memcpy(r, v, sizeof(struct _newgen_struct_quast_value_));
547 }
quast_value check_quast_value(quast_value p)
Definition: paf_ri.c:528
bool quast_value_defined_p(quast_value p)
Definition: paf_ri.c:535

References check_quast_value(), message_assert, and quast_value_defined_p().

+ Here is the call graph for this function:

◆ quast_value_consistent_p()

bool quast_value_consistent_p ( quast_value  p)

Definition at line 531 of file paf_ri.c.

531  {
533  return gen_consistent_p((gen_chunk*) p);
534 }

References check_quast_value(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ quast_value_defined_p()

bool quast_value_defined_p ( quast_value  p)

Definition at line 535 of file paf_ri.c.

535  {
536  return gen_defined_p((gen_chunk*) p);
537 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ quast_value_non_recursive_free()

void quast_value_non_recursive_free ( quast_value  p)

Definition at line 548 of file paf_ri.c.

548  {
549  // should clear up contents...
550  free(p);
551 }

References free().

+ Here is the call graph for this function:

◆ quast_value_tag_as_string()

string quast_value_tag_as_string ( enum quast_value_utype  tag)

Definition at line 558 of file paf_ri.c.

558  {
559  switch (tag) {
560  case is_quast_value_quast_leaf: return "quast_leaf";
561  case is_quast_value_conditional: return "conditional";
562  default: return string_undefined;
563  }
564 }
#define string_undefined
Definition: newgen_types.h:40

References is_quast_value_conditional, is_quast_value_quast_leaf, and string_undefined.

◆ read_bdt()

bdt read_bdt ( FILE *  f)

Definition at line 51 of file paf_ri.c.

51  {
52  return (bdt) gen_read(f);
53 }
gen_chunk * gen_read(FILE *file)
GEN_READ reads any object from the FILE stream.
Definition: genClib.c:2323
int f(int off1, int off2, int n, float r[n], float a[n], float b[n])
Definition: offsets.c:15

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_communication()

communication read_communication ( FILE *  f)

Definition at line 93 of file paf_ri.c.

93  {
94  return (communication) gen_read(f);
95 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_conditional()

conditional read_conditional ( FILE *  f)

Definition at line 135 of file paf_ri.c.

135  {
136  return (conditional) gen_read(f);
137 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_dataflow()

dataflow read_dataflow ( FILE *  f)

Definition at line 177 of file paf_ri.c.

177  {
178  return (dataflow) gen_read(f);
179 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_dfg_arc_label()

dfg_arc_label read_dfg_arc_label ( FILE *  f)

Definition at line 219 of file paf_ri.c.

219  {
220  return (dfg_arc_label) gen_read(f);
221 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_dfg_vertex_label()

dfg_vertex_label read_dfg_vertex_label ( FILE *  f)

Definition at line 261 of file paf_ri.c.

261  {
262  return (dfg_vertex_label) gen_read(f);
263 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_leaf_label()

leaf_label read_leaf_label ( FILE *  f)

Definition at line 303 of file paf_ri.c.

303  {
304  return (leaf_label) gen_read(f);
305 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_lisp_expression()

lisp_expression read_lisp_expression ( FILE *  f)

Definition at line 345 of file paf_ri.c.

345  {
346  return (lisp_expression) gen_read(f);
347 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_placement()

placement read_placement ( FILE *  f)

Definition at line 387 of file paf_ri.c.

387  {
388  return (placement) gen_read(f);
389 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_plc()

plc read_plc ( FILE *  f)

Definition at line 429 of file paf_ri.c.

429  {
430  return (plc) gen_read(f);
431 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_quast()

quast read_quast ( FILE *  f)

Definition at line 513 of file paf_ri.c.

513  {
514  return (quast) gen_read(f);
515 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_quast_leaf()

quast_leaf read_quast_leaf ( FILE *  f)

Definition at line 471 of file paf_ri.c.

471  {
472  return (quast_leaf) gen_read(f);
473 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_quast_value()

quast_value read_quast_value ( FILE *  f)

Definition at line 555 of file paf_ri.c.

555  {
556  return (quast_value) gen_read(f);
557 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_schedule()

schedule read_schedule ( FILE *  f)

Definition at line 610 of file paf_ri.c.

610  {
611  return (schedule) gen_read(f);
612 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_static_control()

static_control read_static_control ( FILE *  f)

Definition at line 652 of file paf_ri.c.

652  {
653  return (static_control) gen_read(f);
654 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ read_var_val()

var_val read_var_val ( FILE *  f)

Definition at line 694 of file paf_ri.c.

694  {
695  return (var_val) gen_read(f);
696 }

References f(), and gen_read().

+ Here is the call graph for this function:

◆ schedule_assign_contents()

void schedule_assign_contents ( schedule  r,
schedule  v 
)

Definition at line 596 of file paf_ri.c.

596  {
597  check_schedule(r);
598  check_schedule(v);
599  message_assert("defined references to domain schedule",
601  memcpy(r, v, sizeof(struct _newgen_struct_schedule_));
602 }
schedule check_schedule(schedule p)
Definition: paf_ri.c:583
bool schedule_defined_p(schedule p)
Definition: paf_ri.c:590

References check_schedule(), message_assert, and schedule_defined_p().

+ Here is the call graph for this function:

◆ schedule_consistent_p()

bool schedule_consistent_p ( schedule  p)

Definition at line 586 of file paf_ri.c.

586  {
587  check_schedule(p);
588  return gen_consistent_p((gen_chunk*) p);
589 }

References check_schedule(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ schedule_defined_p()

bool schedule_defined_p ( schedule  p)

Definition at line 590 of file paf_ri.c.

590  {
591  return gen_defined_p((gen_chunk*) p);
592 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ schedule_non_recursive_free()

void schedule_non_recursive_free ( schedule  p)

Definition at line 603 of file paf_ri.c.

603  {
604  // should clear up contents...
605  free(p);
606 }

References free().

+ Here is the call graph for this function:

◆ static_control_assign_contents()

void static_control_assign_contents ( static_control  r,
static_control  v 
)

Definition at line 638 of file paf_ri.c.

638  {
641  message_assert("defined references to domain static_control",
643  memcpy(r, v, sizeof(struct _newgen_struct_static_control_));
644 }
static_control check_static_control(static_control p)
Definition: paf_ri.c:625
bool static_control_defined_p(static_control p)
Definition: paf_ri.c:632

References check_static_control(), message_assert, and static_control_defined_p().

+ Here is the call graph for this function:

◆ static_control_consistent_p()

bool static_control_consistent_p ( static_control  p)

Definition at line 628 of file paf_ri.c.

628  {
630  return gen_consistent_p((gen_chunk*) p);
631 }

References check_static_control(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ static_control_defined_p()

bool static_control_defined_p ( static_control  p)

Definition at line 632 of file paf_ri.c.

632  {
633  return gen_defined_p((gen_chunk*) p);
634 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ static_control_non_recursive_free()

void static_control_non_recursive_free ( static_control  p)

Definition at line 645 of file paf_ri.c.

645  {
646  // should clear up contents...
647  free(p);
648 }

References free().

+ Here is the call graph for this function:

◆ var_val_assign_contents()

void var_val_assign_contents ( var_val  r,
var_val  v 
)

Definition at line 680 of file paf_ri.c.

680  {
681  check_var_val(r);
682  check_var_val(v);
683  message_assert("defined references to domain var_val",
685  memcpy(r, v, sizeof(struct _newgen_struct_var_val_));
686 }
bool var_val_defined_p(var_val p)
Definition: paf_ri.c:674
var_val check_var_val(var_val p)
Definition: paf_ri.c:667

References check_var_val(), message_assert, and var_val_defined_p().

+ Here is the call graph for this function:

◆ var_val_consistent_p()

bool var_val_consistent_p ( var_val  p)

Definition at line 670 of file paf_ri.c.

670  {
671  check_var_val(p);
672  return gen_consistent_p((gen_chunk*) p);
673 }

References check_var_val(), and gen_consistent_p().

+ Here is the call graph for this function:

◆ var_val_defined_p()

bool var_val_defined_p ( var_val  p)

Definition at line 674 of file paf_ri.c.

674  {
675  return gen_defined_p((gen_chunk*) p);
676 }

References gen_defined_p().

+ Here is the call graph for this function:

◆ var_val_non_recursive_free()

void var_val_non_recursive_free ( var_val  p)

Definition at line 687 of file paf_ri.c.

687  {
688  // should clear up contents...
689  free(p);
690 }

References free().

+ Here is the call graph for this function:

◆ write_bdt()

void write_bdt ( FILE *  f,
bdt  p 
)

Definition at line 48 of file paf_ri.c.

48  {
49  gen_write(f, (gen_chunk*) p);
50 }
void gen_write(FILE *fd, gen_chunk *obj)
GEN_WRITE writes the OBJect on the stream FD.
Definition: genClib.c:1745

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_communication()

void write_communication ( FILE *  f,
communication  p 
)

Definition at line 90 of file paf_ri.c.

90  {
91  gen_write(f, (gen_chunk*) p);
92 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_conditional()

void write_conditional ( FILE *  f,
conditional  p 
)

Definition at line 132 of file paf_ri.c.

132  {
133  gen_write(f, (gen_chunk*) p);
134 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_dataflow()

void write_dataflow ( FILE *  f,
dataflow  p 
)

Definition at line 174 of file paf_ri.c.

174  {
175  gen_write(f, (gen_chunk*) p);
176 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_dfg_arc_label()

void write_dfg_arc_label ( FILE *  f,
dfg_arc_label  p 
)

Definition at line 216 of file paf_ri.c.

216  {
217  gen_write(f, (gen_chunk*) p);
218 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_dfg_vertex_label()

void write_dfg_vertex_label ( FILE *  f,
dfg_vertex_label  p 
)

Definition at line 258 of file paf_ri.c.

258  {
259  gen_write(f, (gen_chunk*) p);
260 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_leaf_label()

void write_leaf_label ( FILE *  f,
leaf_label  p 
)

Definition at line 300 of file paf_ri.c.

300  {
301  gen_write(f, (gen_chunk*) p);
302 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_lisp_expression()

void write_lisp_expression ( FILE *  f,
lisp_expression  p 
)

Definition at line 342 of file paf_ri.c.

342  {
343  gen_write(f, (gen_chunk*) p);
344 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_placement()

void write_placement ( FILE *  f,
placement  p 
)

Definition at line 384 of file paf_ri.c.

384  {
385  gen_write(f, (gen_chunk*) p);
386 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_plc()

void write_plc ( FILE *  f,
plc  p 
)

Definition at line 426 of file paf_ri.c.

426  {
427  gen_write(f, (gen_chunk*) p);
428 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_quast()

void write_quast ( FILE *  f,
quast  p 
)

Definition at line 510 of file paf_ri.c.

510  {
511  gen_write(f, (gen_chunk*) p);
512 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_quast_leaf()

void write_quast_leaf ( FILE *  f,
quast_leaf  p 
)

Definition at line 468 of file paf_ri.c.

468  {
469  gen_write(f, (gen_chunk*) p);
470 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_quast_value()

void write_quast_value ( FILE *  f,
quast_value  p 
)

Definition at line 552 of file paf_ri.c.

552  {
553  gen_write(f, (gen_chunk*) p);
554 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_schedule()

void write_schedule ( FILE *  f,
schedule  p 
)

Definition at line 607 of file paf_ri.c.

607  {
608  gen_write(f, (gen_chunk*) p);
609 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_static_control()

void write_static_control ( FILE *  f,
static_control  p 
)

Definition at line 649 of file paf_ri.c.

649  {
650  gen_write(f, (gen_chunk*) p);
651 }

References f(), and gen_write().

+ Here is the call graph for this function:

◆ write_var_val()

void write_var_val ( FILE *  f,
var_val  p 
)

Definition at line 691 of file paf_ri.c.

691  {
692  gen_write(f, (gen_chunk*) p);
693 }

References f(), and gen_write().

+ Here is the call graph for this function: