graph.c File Reference

#include <stdio.h>
#include <string.h>
#include "linear.h"
#include "genC.h"
#include "misc.h"
#include "pipsdbm.h"
#include "ri.h"
#include "ri-util.h"

Include dependency graph for graph.c:

Go to the source code of this file.

Macros
#define	DV_SUFFIX   ".daVinci"

Functions
static void	node (FILE *out, string name)
	Build for module name a node and link to its successors. More...
static void	init_seen (void)
static void	close_seen (void)
static void	set_as_seen (string m)
static bool	seen_p (string m)
static void	recursive_append (FILE *out, string name)
	generates into "out" a davinci node for module "name", and recurse to its not yet seen callees. More...
bool	graph_of_calls (const string name)
	to be called by pipsmake. More...
bool	full_graph_of_calls (string name)
	To be called by pipsmake. More...

Variables
static hash_table	seen = hash_table_undefined
	static function to store whether a module has been seen during the recursive generation of the daVinci file. More...
static bool	first_seen = false

Macro Definition Documentation

DV_SUFFIX

#define DV_SUFFIX   ".daVinci"

Definition at line 48 of file graph.c.

Function Documentation

close_seen()

static void close_seen ( void  )

static

Definition at line 89 of file graph.c.

                             {
    hash_table_free(seen); seen = hash_table_undefined; }

References hash_table_free(), hash_table_undefined, and seen.

Referenced by graph_of_calls().

Here is the call graph for this function:

Here is the caller graph for this function:

full_graph_of_calls()

bool full_graph_of_calls

(

string

name

)

To be called by pipsmake.

Generate a global resource, hence name is ignored.

build file name... and open it.

prolog, per module stuff, epilog.

close and clean...

put resulting resource into pipsdbm.

Parameters

name

ame

Definition at line 147 of file graph.c.

{
    gen_array_t modules = db_get_module_list();
    int n = gen_array_nitems(modules), i;
    FILE * out;
    bool first = true;
    string dir_name, file_name, full_name;
 
    pips_debug(7, "global call graph requested for %s (PROGRAM)\n", name);
 
    /* build file name... and open it. */
    dir_name = db_get_current_workspace_directory();
 
    file_name = db_build_file_resource_name
      (DBR_DVCG_FILE, PROGRAM_RESOURCE_OWNER, DV_SUFFIX);
 
    full_name = strdup(concatenate(dir_name, "/", file_name, NULL));
 
    out = safe_fopen(full_name, "w");
 
    /* prolog, per module stuff, epilog. */
    fprintf(out, "[\n");
 
    for (i=0; i<n; i++)
    {
        if (!first) fprintf(out, ",\n");
        first=false;
        node(out, gen_array_item(modules, i));
    }
 
    fprintf(out, "]\n");
 
    /* close and clean... */
    safe_fclose(out, full_name);
    gen_array_free(modules);
    free(dir_name), dir_name=NULL;
    free(full_name), full_name=NULL;
 
    /* put resulting resource into pipsdbm. */
    DB_PUT_FILE_RESOURCE(DBR_DVCG_FILE, PROGRAM_RESOURCE_OWNER, file_name);
 
    return true;
}

References concatenate(), db_build_file_resource_name(), db_get_current_workspace_directory(), db_get_module_list(), DB_PUT_FILE_RESOURCE, DV_SUFFIX, file_name, fprintf(), free(), full_name, gen_array_free(), gen_array_item(), gen_array_nitems(), node(), out, pips_debug, PROGRAM_RESOURCE_OWNER, safe_fclose(), safe_fopen(), and strdup().

Here is the call graph for this function:

graph_of_calls()

bool graph_of_calls

(

const string

name

)

to be called by pipsmake.

graph.c

builds the daVinci file for module "name".

do the job here.

Parameters

name

ame

Definition at line 120 of file graph.c.

{
    FILE * out;
    string dir_name, file_name, full_name;
    dir_name = db_get_current_workspace_directory();
    file_name = db_build_file_resource_name(DBR_DVCG_FILE, name, DV_SUFFIX);
    full_name = strdup(concatenate(dir_name, "/", file_name, NULL));
    free(dir_name), dir_name = NULL;
    out = safe_fopen(full_name, "w");
    init_seen();
 
    /* do the job here. */
    fprintf(out, "[\n");
    recursive_append(out, name);
    fprintf(out, "]\n");
 
    close_seen();
    safe_fclose(out, full_name);
    free(full_name), full_name = NULL;
    DB_PUT_FILE_RESOURCE(DBR_DVCG_FILE, name, file_name);
 
    return true;
}

References close_seen(), concatenate(), db_build_file_resource_name(), db_get_current_workspace_directory(), DB_PUT_FILE_RESOURCE, DV_SUFFIX, file_name, fprintf(), free(), full_name, init_seen(), out, recursive_append(), safe_fclose(), safe_fopen(), and strdup().

Here is the call graph for this function:

init_seen()

static void init_seen ( void  )

static

Definition at line 87 of file graph.c.

                            { first_seen = false;
    seen = hash_table_make(hash_string, 0); }

References first_seen, hash_string, hash_table_make(), and seen.

Referenced by graph_of_calls().

Here is the call graph for this function:

Here is the caller graph for this function:

node()

static void node ( FILE *  out, string  name  )

static

Build for module name a node and link to its successors.

It could be a per module resource, however the callgraph is not expected to change often, and we can avoid to manipulate the many small files.

lazy callees.

daVinci node prolog.

one edge per callee

node epilog

Definition at line 56 of file graph.c.

{
    bool first=true;
    list lcallees = NIL;
 
    if (db_resource_p(DBR_CALLEES, name)) /* lazy callees. */
      lcallees = callees_callees
        ((callees) db_get_memory_resource(DBR_CALLEES, name, true));
 
    /* daVinci node prolog. */
    fprintf(out, "l(\"%s\",n(\"\",[a(\"OBJECT\",\"%s\")],[", name, name);
 
    /* one edge per callee */
    MAP(STRING, module_called,
    {
        if (!first) fprintf(out, ",\n");
        else { fprintf(out, "\n"); first=false; }
        fprintf(out, " l(\"%s->%s\",e(\"\",[],r(\"%s\")))",
                name, module_called, module_called);
    },
        lcallees);
 
    /* node epilog */
    fprintf(out, "]))");
}

References callees_callees, db_get_memory_resource(), db_resource_p(), fprintf(), MAP, NIL, out, and STRING.

Referenced by __attribute__(), add_node_to_interval(), automatic_translation(), build_bdt_null(), build_creductions_of_statement(), build_reduction_of_variable(), display_interval_graph(), full_graph_of_calls(), interval_graph(), list_of_reduced_variables(), make_host_and_node_modules(), recursive_append(), and write_resulting_bdt().

Here is the call graph for this function:

Here is the caller graph for this function:

recursive_append()

static void recursive_append ( FILE *  out, string  name  )

static

generates into "out" a davinci node for module "name", and recurse to its not yet seen callees.

else

the resource may not have been defined, for instance if the code was not parsed, because the ALL dependence is limited.

Definition at line 98 of file graph.c.

{
    if (seen_p(name)) return;
    /* else */
    if (first_seen) fprintf(out, ",\n");
    else first_seen = true;
    node(out, name);
    set_as_seen(name);
 
    /* the resource may not have been defined, for instance if the
     * code was not parsed, because the %ALL dependence is limited.
     */
    if (db_resource_p(DBR_CALLEES, name))
    {
      callees l = (callees) db_get_memory_resource(DBR_CALLEES, name, true);
      MAP(STRING, c, recursive_append(out, c), callees_callees(l));
    }
}

References callees_callees, db_get_memory_resource(), db_resource_p(), first_seen, fprintf(), MAP, node(), out, seen_p(), set_as_seen(), and STRING.

Referenced by graph_of_calls().

Here is the call graph for this function:

Here is the caller graph for this function:

seen_p()

static bool seen_p ( string  m )

static

Definition at line 92 of file graph.c.

{ return hash_defined_p(seen, (char*)m); }

References hash_defined_p(), and seen.

Referenced by recursive_append().

Here is the call graph for this function:

Here is the caller graph for this function:

set_as_seen()

static void set_as_seen ( string  m )

static

Definition at line 91 of file graph.c.

{ hash_put(seen, (char*) m, (char*) 1); }

References hash_put(), and seen.

Referenced by recursive_append().

Here is the call graph for this function:

Here is the caller graph for this function:

Variable Documentation

first_seen

bool first_seen = false

static

Definition at line 86 of file graph.c.

Referenced by init_seen(), and recursive_append().

seen

hash_table seen = hash_table_undefined

static

static function to store whether a module has been seen during the recursive generation of the daVinci file.

Definition at line 85 of file graph.c.

Referenced by base_append(), base_included_p(), base_union(), clean_enclosing_loops(), close_seen(), dag_fix_image_reuse(), davinci_dump_expression(), davinci_dump_expression_rc(), do_reduction_detection(), do_reduction_propagation(), gen_set_closure_iterate(), init_seen(), insert_before_current_statement(), propagate_constant_image_to_succs(), sc_to_minimal_basis(), seen_p(), set_as_seen(), shared_obj_in(), and vect_check().