icfg.h File Reference

#include "dg.h"
#include "graph.h"

Include dependency graph for icfg.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	ICFG_NOT_FOUND   NULL
	Warning! Do not modify this file that is automatically generated! More...
#define	ICFG_OPTIONS   "tcdDIFl"
#define	ICFG_CALLEES_TOPO_SORT   "ICFG_CALLEES_TOPO_SORT"
#define	ICFG_DRAW   "ICFG_DRAW"
#define	ICFG_DEBUG   "ICFG_DEBUG"
#define	ICFG_DEBUG_LEVEL   "ICFG_DEBUG_LEVEL"
#define	ICFG_DOs   "ICFG_DOs"
#define	ICFG_IFs   "ICFG_IFs"
#define	ICFG_DV   "ICFG_DV"
#define	ICFG_FLOATs   "ICFG_FLOATs"
#define	ICFG_SHORT_NAMES   "ICFG_SHORT_NAMES"
#define	CALL_MARK   "CALL_MARK@@@@"
#define	ADD_ELEMENT_TO_LIST(_list, _type, _element)    (_list = gen_nconc( _list, CONS( _type, _element, NIL)))

Typedefs
typedef dg_arc_label	arc_label
typedef dg_vertex_label	vertex_label

Functions
list	module_name_to_callees (const char *)
	cproto-generated files More...
list	module_to_callees (entity)
void	topological_number_assign_to_module (hash_table, entity, size_t)
list	module_list_sort (hash_table, list, entity, size_t)
list	topologically_sorted_module_list (entity)
void	print_module_name_to_toposorts (const char *)
void	icfg_set_indentation (int)
	icfg_scan.c More...
void	icfg_reset_indentation (void)
void	icfg_error_handler (void)
bool	generic_print_icfg (const string, bool, bool, bool, text(*)(const string))
bool	generic_print_icfg_precise (const string, bool, bool, bool, text(*)(entity, entity, statement, call))
bool	generic_print_icfg_filtered (const string, bool, bool, bool, text(*)(entity, statement, call), text(*)(entity, statement))
bool	print_icfg (const string)
	print.c More...
bool	print_icfg_with_loops (const string)
bool	print_icfg_with_control (const string)
void	safe_free_vertex (vertex, list)
	util.c More...
list	safe_add_vertex_to_list (vertex, list)
list	list_of_connected_nodes (vertex, list)
vertex	get_vertex_by_string (const char *, list)
list	safe_make_successor (vertex, vertex, list)
void	print_graph_of_text_to_daVinci (FILE *, list)
void	print_graph_daVinci_from_starting_node (FILE *, vertex)
void	print_marged_text_from_starting_node (FILE *, int, vertex, list)
bool	make_resource_from_starting_node (const char *, string, string, vertex, list, bool)

Macro Definition Documentation

ADD_ELEMENT_TO_LIST

#define ADD_ELEMENT_TO_LIST	(		_list,
			_type,
			_element
	)		(_list = gen_nconc( _list, CONS( _type, _element, NIL)))

Definition at line 58 of file icfg.h.

CALL_MARK

#define CALL_MARK   "CALL_MARK@@@@"

Definition at line 57 of file icfg.h.

ICFG_CALLEES_TOPO_SORT

#define ICFG_CALLEES_TOPO_SORT   "ICFG_CALLEES_TOPO_SORT"

Definition at line 40 of file icfg.h.

ICFG_DEBUG

#define ICFG_DEBUG   "ICFG_DEBUG"

Definition at line 42 of file icfg.h.

ICFG_DEBUG_LEVEL

#define ICFG_DEBUG_LEVEL   "ICFG_DEBUG_LEVEL"

Definition at line 43 of file icfg.h.

ICFG_DOs

#define ICFG_DOs   "ICFG_DOs"

Definition at line 44 of file icfg.h.

ICFG_DRAW

#define ICFG_DRAW   "ICFG_DRAW"

Definition at line 41 of file icfg.h.

ICFG_DV

#define ICFG_DV   "ICFG_DV"

Definition at line 46 of file icfg.h.

ICFG_FLOATs

#define ICFG_FLOATs   "ICFG_FLOATs"

Definition at line 47 of file icfg.h.

ICFG_IFs

#define ICFG_IFs   "ICFG_IFs"

Definition at line 45 of file icfg.h.

ICFG_NOT_FOUND

#define ICFG_NOT_FOUND   NULL

Warning! Do not modify this file that is automatically generated!

Modify src/Libs/icfg/icfg-local.h instead, to add your own modifications. header file built by cproto icfg-local.h

Definition at line 37 of file icfg.h.

ICFG_OPTIONS

#define ICFG_OPTIONS   "tcdDIFl"

Definition at line 38 of file icfg.h.

ICFG_SHORT_NAMES

#define ICFG_SHORT_NAMES   "ICFG_SHORT_NAMES"

Definition at line 48 of file icfg.h.

Typedef Documentation

arc_label

typedef dg_arc_label arc_label

Definition at line 52 of file icfg.h.

vertex_label

typedef dg_vertex_label vertex_label

Definition at line 53 of file icfg.h.

Function Documentation

generic_print_icfg()

bool generic_print_icfg	(	const	string,
		bool	with_ifs,
		bool	with_loops,
		bool	do_graph,
		text(*)(const string)	decoration
	)

Parameters

string	odule_name
with_ifs	ith_ifs
with_loops	ith_loops
do_graph	o_graph

Definition at line 713 of file icfg_scan.c.

{
  return internal_print_icfg(module_name, with_ifs, with_loops, do_graph,
                             true, decoration, NULL, NULL, NULL);
}

References internal_print_icfg(), and module_name().

Referenced by print_icfg(), print_icfg_with_control(), and print_icfg_with_loops().

Here is the call graph for this function:

Here is the caller graph for this function:

generic_print_icfg_filtered()

bool generic_print_icfg_filtered	(	const	string,
		bool	with_ifs,
		bool	with_loops,
		bool	do_graph,
		text(*)(entity, statement, call)	decoration_call,
		text(*)(entity, statement)	decoration_stmt
	)

Parameters

string	odule_name
with_ifs	ith_ifs
with_loops	ith_loops
do_graph	o_graph

Definition at line 735 of file icfg_scan.c.

{
  return internal_print_icfg(module_name, with_ifs, with_loops, do_graph,
                         false, NULL, NULL, decoration_call, decoration_stmt);
}

References internal_print_icfg(), and module_name().

Here is the call graph for this function:

generic_print_icfg_precise()

bool generic_print_icfg_precise	(	const	string,
		bool	with_ifs,
		bool	with_loops,
		bool	do_graph,
		text(*)(entity, entity, statement, call)	decoration
	)

Parameters

string	odule_name
with_ifs	ith_ifs
with_loops	ith_loops
do_graph	o_graph

Definition at line 724 of file icfg_scan.c.

{
  return internal_print_icfg(module_name, with_ifs, with_loops, do_graph,
                             true, NULL, decoration, NULL, NULL);
}

References internal_print_icfg(), and module_name().

Here is the call graph for this function:

get_vertex_by_string()

vertex get_vertex_by_string	(	const char *	str_name,
		list	l_of_vers
	)

Parameters

str_name	tr_name
l_of_vers	_of_vers

Definition at line 92 of file util.c.

{
    MAP(VERTEX, ver, {
        text ver_label = (text)vertex_vertex_label(ver);
        list sens = text_sentences(ver_label);
        sentence ver_first_sen = SENTENCE(CAR(sens));
        string ver_name = first_word_of_sentence(ver_first_sen);
        string ver_real_name = remove_newline_of_string(ver_name);
        if (same_string_p(ver_real_name, str_name) || same_string_p(ver_name, str_name)) {
            free(ver_real_name);
            return ver;
        } else
            free(ver_real_name);
    }, l_of_vers);
    return vertex_undefined;
}

References CAR, first_word_of_sentence(), free(), MAP, remove_newline_of_string(), same_string_p, sens, SENTENCE, text_sentences, VERTEX, vertex_undefined, and vertex_vertex_label.

Referenced by call_flt(), and print_marged_text_from_starting_node().

Here is the call graph for this function:

Here is the caller graph for this function:

icfg_error_handler()

void icfg_error_handler

(

void

)

Definition at line 122 of file icfg_scan.c.

{
  // ???
}

Referenced by print_module_icfg().

Here is the caller graph for this function:

icfg_reset_indentation()

void icfg_reset_indentation

(

void

)

Definition at line 117 of file icfg_scan.c.

{
  icfg_indent = ICFG_DEFAULT_INDENTATION;
}

References ICFG_DEFAULT_INDENTATION, and icfg_indent.

Referenced by internal_print_icfg().

Here is the caller graph for this function:

icfg_set_indentation()

void icfg_set_indentation

(

int

indent

)

icfg_scan.c

icfg_scan.c

Parameters

indent

ndent

Definition at line 112 of file icfg_scan.c.

{
  icfg_indent = indent;
}

References icfg_indent.

Referenced by internal_print_icfg().

Here is the caller graph for this function:

list_of_connected_nodes()

list list_of_connected_nodes	(	vertex	ver,
		list	l_of_vers
	)

Parameters

ver	er
l_of_vers	_of_vers

Definition at line 57 of file util.c.

{
    MAP(SUCCESSOR, succ, {
        vertex ver_child = successor_vertex(succ);
        l_of_vers = safe_add_vertex_to_list(ver_child, l_of_vers);
        l_of_vers = list_of_connected_nodes(ver_child, l_of_vers);
    }, vertex_successors(ver));
    return l_of_vers;
}

References list_of_connected_nodes(), MAP, safe_add_vertex_to_list(), SUCCESSOR, successor_vertex, and vertex_successors.

Referenced by list_of_connected_nodes(), and print_graph_daVinci_from_starting_node().

Here is the call graph for this function:

Here is the caller graph for this function:

make_resource_from_starting_node()

bool make_resource_from_starting_node	(	const char *	mod_name,
		string	res_name,
		string	file_ext,
		vertex	start_ver,
		list	l_of_vers,
		bool	res_text_type
	)

ree(dir);

this line may cause a problem of bus errone

this line must be after DB_PUT_FILE_RESOURCE for the reason of memory liberation

Parameters

mod_name	od_name
res_name	es_name
file_ext	ile_ext
start_ver	tart_ver
l_of_vers	_of_vers
res_text_type	es_text_type

Definition at line 220 of file util.c.

{
    string filename, localfilename, dir;
    FILE *fd;
 
    localfilename = db_build_file_resource_name(res_name, mod_name, file_ext);
    dir = db_get_current_workspace_directory();
    filename = strdup(concatenate(dir, "/", localfilename, NULL));
    /*free(dir);*/ /* this line may cause a problem of bus errone*/
 
    fd = safe_fopen(filename, "w");
    if (!vertex_undefined_p(start_ver)) {
        if (res_text_type) {
            print_marged_text_from_starting_node(fd, 0, start_ver, l_of_vers);
            safe_fclose(fd, filename);
            write_an_attachment_file(filename);
        } else {
            print_graph_daVinci_from_starting_node(fd, start_ver);
            safe_fclose(fd, filename);
        }
    }
    DB_PUT_FILE_RESOURCE(res_name, mod_name, localfilename);
    free(filename); /* this line must be after DB_PUT_FILE_RESOURCE for the reason of memory liberation */
 
    return true;
}

References concatenate(), db_build_file_resource_name(), db_get_current_workspace_directory(), DB_PUT_FILE_RESOURCE, free(), print_graph_daVinci_from_starting_node(), print_marged_text_from_starting_node(), safe_fclose(), safe_fopen(), strdup(), vertex_undefined_p, and write_an_attachment_file().

Referenced by print_module_icfg().

Here is the call graph for this function:

Here is the caller graph for this function:

module_list_sort()

list module_list_sort	(	hash_table	hash_module_to_depth,
		list	current_list,
		entity	mod,
		size_t	n
	)

create the callees list whose caller has the depth n

free the same_depth_list for later use

create same_depth_list whose depth is n+1

concatenate former current_list with same_depth_list

use module_list_sort recursively

Parameters

hash_module_to_depth	ash_module_to_depth
current_list	urrent_list
mod	od

Definition at line 123 of file toposort.c.

{
    list callees_list = NIL;
    static list same_depth_list = NIL;
    size_t depth;
 
    /* create the callees list whose caller has the depth n */
    if ( same_depth_list == NIL )
        callees_list = module_to_callees(mod);
    else {
        MAPL(pm,{ entity e = ENTITY(CAR(pm));
                  callees_list = gen_nconc(callees_list,
                                           gen_copy_seq(module_to_callees(e)));
                },
             same_depth_list);
    }
 
    /* free the same_depth_list for later use */
 
    same_depth_list = NIL;
 
    /* create same_depth_list whose depth is n+1 */
    if ( callees_list != NIL ) {
        MAPL(pm,{ entity e = ENTITY(CAR(pm));
                  depth = (size_t) hash_get(hash_module_to_depth, (char *) e);
                  if ( depth == n+1 ) {
                      same_depth_list = gen_nconc(same_depth_list,
                                             CONS(ENTITY, e, NIL));
                      hash_put(hash_module_to_depth,
                               (char *) e, (char *) -1);
                  }
                },
             callees_list);
 
        /* concatenate former current_list with same_depth_list */
        current_list = gen_nconc(current_list, same_depth_list);
 
        /* use module_list_sort recursively */
        current_list = module_list_sort(hash_module_to_depth, 
                                           current_list,
                                           ENTITY(CAR(same_depth_list)), 
                                           n+1);
    }
    return (current_list);
}

References CAR, CONS, depth, ENTITY, gen_copy_seq(), gen_nconc(), hash_get(), hash_put(), MAPL, module_list_sort(), module_to_callees(), and NIL.

Referenced by module_list_sort(), and topologically_sorted_module_list().

Here is the call graph for this function:

Here is the caller graph for this function:

module_name_to_callees()

list module_name_to_callees

(

const char *

)

cproto-generated files

toposort.c

module_to_callees()

list module_to_callees

(

entity

mod

)

Parameters

mod

od

Definition at line 85 of file toposort.c.

{
    list return_list = NIL;
    list callees_list = code_declarations(entity_code(mod));
    
    MAPL(ce,{
        entity e = ENTITY(CAR(ce));
        if ( type_functional_p(entity_type(e)) )
            return_list = CONS(ENTITY, 
                               local_name_to_top_level_entity(entity_local_name(e)),
                               return_list);
    },callees_list);
 
    return(return_list);
}

References CAR, code_declarations, CONS, ENTITY, entity_code(), entity_local_name(), entity_type, local_name_to_top_level_entity(), MAPL, NIL, and type_functional_p.

Referenced by module_list_sort(), and topological_number_assign_to_module().

Here is the call graph for this function:

Here is the caller graph for this function:

print_graph_daVinci_from_starting_node()

void print_graph_daVinci_from_starting_node	(	FILE *	f_out,
		vertex	start_ver
	)

Parameters

f_out	_out
start_ver	tart_ver

Definition at line 190 of file util.c.

{
    list l = NIL;
    ADD_ELEMENT_TO_LIST(l, VERTEX, start_ver);
    l = list_of_connected_nodes(start_ver, l);
    print_graph_of_text_to_daVinci(f_out, l);
    gen_free_list(l);
    return;
}

References ADD_ELEMENT_TO_LIST, gen_free_list(), list_of_connected_nodes(), NIL, print_graph_of_text_to_daVinci(), and VERTEX.

Referenced by make_resource_from_starting_node().

Here is the call graph for this function:

Here is the caller graph for this function:

print_graph_of_text_to_daVinci()

void print_graph_of_text_to_daVinci	(	FILE *	f_out,
		list	l_of_vers
	)

printf(f_out, convert_string_for_daVinci_graph(s + strlen(CALL_MARK)));

Parameters

f_out	_out
l_of_vers	_of_vers

Definition at line 134 of file util.c.

{
    bool first_node_parent = true;
    fprintf(f_out, "[\n");
 
    FOREACH (VERTEX, ver_parent, l_of_vers) {
      bool first_node_child = true;
      text node_parent_text = (text)vertex_vertex_label(ver_parent);
      bool first_sentence = true;
 
      if (first_node_parent)
        first_node_parent = false;
      else
        fprintf(f_out, ",\n");
 
      FOREACH (SENTENCE, sen, text_sentences(node_parent_text)){
        string s = sentence_to_string(sen);
        if (first_sentence) {
          string tmp = remove_newline_of_string (s);
          fprintf(f_out, "l(\"%s\",n(\"\",[a(\"OBJECT\",\"", tmp);
          first_sentence = false;
          free (tmp);
        }
        if (strstr(s, CALL_MARK)) {
          /*fprintf(f_out, convert_string_for_daVinci_graph(s + strlen(CALL_MARK)));*/
        } else {
          string r = convert_string_for_daVinci_graph(s);
          fputs(r, f_out);
          free(r);
        }
      }
 
      fprintf(f_out, "\")],[\n");
 
      FOREACH (SUCCESSOR, succ, vertex_successors(ver_parent)){
        vertex ver_child = successor_vertex(succ);
        text node_child_text = (text)vertex_vertex_label(ver_child);
        sentence node_child_sen = SENTENCE(CAR(text_sentences(node_child_text)));
        string node_name_child = remove_newline_of_string(first_word_of_sentence(node_child_sen));
 
        if (first_node_child)
          first_node_child = false;
        else
          fprintf(f_out, ",\n");
        fprintf(f_out, "  l(\"\",e(\"\",[],r(\"%s\")))", node_name_child);
        free(node_name_child);
      }
 
      fprintf(f_out, "]))");
    }
 
    fprintf(f_out, "\n]");
 
    return;
}

References CALL_MARK, CAR, convert_string_for_daVinci_graph(), first_word_of_sentence(), FOREACH, fprintf(), free(), remove_newline_of_string(), SENTENCE, sentence_to_string(), SUCCESSOR, successor_vertex, text_sentences, VERTEX, vertex_successors, and vertex_vertex_label.

Referenced by print_graph_daVinci_from_starting_node().

Here is the call graph for this function:

Here is the caller graph for this function:

print_icfg()

bool print_icfg

(

const string

module_name

)

print.c

print.c

They should be called by pipsmake

Lei Zhou, February 91

Parameters

module_name

odule_name

Definition at line 45 of file print.c.

{
  return generic_print_icfg(module_name, false, false, false, NULL);
}

References generic_print_icfg(), and module_name().

Here is the call graph for this function:

print_icfg_with_control()

bool print_icfg_with_control

(

const

string

)

Parameters

string

odule_name

Definition at line 55 of file print.c.

{
  return generic_print_icfg(module_name, true, true, false, NULL);
}

References generic_print_icfg(), and module_name().

Here is the call graph for this function:

print_icfg_with_loops()

bool print_icfg_with_loops

(

const

string

)

Parameters

string

odule_name

Definition at line 50 of file print.c.

{
  return generic_print_icfg(module_name, false, true, false, NULL);
}

References generic_print_icfg(), and module_name().

Here is the call graph for this function:

print_marged_text_from_starting_node()

void print_marged_text_from_starting_node	(	FILE *	fd,
		int	margin,
		vertex	start_ver,
		list	l_of_vers
	)

if s in not empty, ok write out

Parameters

fd	d
margin	argin
start_ver	tart_ver
l_of_vers	_of_vers

Definition at line 200 of file util.c.

{
    if (!vertex_undefined_p(start_ver)) {
        text txt = (text)vertex_vertex_label(start_ver);
        MAP(SENTENCE, sen, {
            string s = sentence_to_string(sen);
            string call_mark = strstr(s, CALL_MARK);
            if(call_mark) {
                vertex ver_child = get_vertex_by_string(call_mark + strlen(CALL_MARK), l_of_vers);
                print_marged_text_from_starting_node(fd, margin + (call_mark - s), ver_child, l_of_vers);
            } else if (strlen(s)) { /* if s in not empty, ok write out */
              string tmp = remove_newline_of_string(s);
              fprintf(fd, "%*s%s\n", margin, "", tmp);
              free (tmp);
            }
        }, text_sentences(txt));
    }
    return;
}

References CALL_MARK, fprintf(), free(), get_vertex_by_string(), MAP, print_marged_text_from_starting_node(), remove_newline_of_string(), SENTENCE, sentence_to_string(), text_sentences, vertex_undefined_p, and vertex_vertex_label.

Referenced by make_resource_from_starting_node(), and print_marged_text_from_starting_node().

Here is the call graph for this function:

Here is the caller graph for this function:

print_module_name_to_toposorts()

void print_module_name_to_toposorts

(

const char *

)

safe_add_vertex_to_list()

list safe_add_vertex_to_list	(	vertex	ver,
		list	l_of_vers
	)

Parameters

ver	er
l_of_vers	_of_vers

Definition at line 50 of file util.c.

{
    if (!gen_in_list_p(ver, l_of_vers))
        ADD_ELEMENT_TO_LIST(l_of_vers, VERTEX, ver);
    return l_of_vers;
}

References ADD_ELEMENT_TO_LIST, gen_in_list_p(), and VERTEX.

Referenced by list_of_connected_nodes(), print_module_icfg(), and safe_make_successor().

Here is the call graph for this function:

Here is the caller graph for this function:

safe_free_vertex()

void safe_free_vertex	(	vertex	ver,
		list	l_of_vers
	)

util.c

Parameters

ver	er
l_of_vers	_of_vers

Definition at line 43 of file util.c.

{
    if (!gen_in_list_p(ver, l_of_vers))
        free_vertex(ver);
    return;
}

References free_vertex(), and gen_in_list_p().

Referenced by print_module_icfg().

Here is the call graph for this function:

Here is the caller graph for this function:

safe_make_successor()

list safe_make_successor	(	vertex	ver_parent,
		vertex	ver_child,
		list	l_of_vers
	)

search if it was made yet, do not make

if it was not made, do it

add vertex parent to the list of vertex

Parameters

ver_parent	er_parent
ver_child	er_child
l_of_vers	_of_vers

Definition at line 110 of file util.c.

{
    successor succ;
    sentence ver_child_first_sen = SENTENCE(CAR(text_sentences((text)vertex_vertex_label(ver_child))));
    string ver_child_name = first_word_of_sentence(ver_child_first_sen);
 
    /* search if it was made yet, do not make */
    MAP(SUCCESSOR, succ, {
        vertex ver = successor_vertex(succ);
        sentence ver_first_sen = SENTENCE(CAR(text_sentences((text)vertex_vertex_label(ver))));
        string ver_name = first_word_of_sentence(ver_first_sen);
        if (same_string_p(ver_name, ver_child_name)) return l_of_vers;
    }, vertex_successors(ver_parent));
 
    /* if it was not made, do it */
    succ = make_successor(NULL, ver_child);
    ADD_ELEMENT_TO_LIST(vertex_successors(ver_parent), SUCCESSOR, succ);
    /* add vertex parent to the list of vertex */
    l_of_vers = safe_add_vertex_to_list(ver_parent, l_of_vers);
 
    return l_of_vers;
}

References ADD_ELEMENT_TO_LIST, CAR, first_word_of_sentence(), make_successor(), MAP, safe_add_vertex_to_list(), same_string_p, SENTENCE, SUCCESSOR, successor_vertex, text_sentences, vertex_successors, and vertex_vertex_label.

Referenced by call_flt().

Here is the call graph for this function:

Here is the caller graph for this function:

topological_number_assign_to_module()

void topological_number_assign_to_module	(	hash_table	hash_module_to_depth,
		entity	mod,
		size_t	n
	)

assigns depth n+1 to callees of current module

Parameters

hash_module_to_depth	ash_module_to_depth
mod	od

Definition at line 102 of file toposort.c.

{
    size_t depth = (size_t) hash_get(hash_module_to_depth, (char *) mod);
    list callees_list = module_to_callees(mod);
 
    if ((depth == (size_t) ICFG_NOT_FOUND) || (depth < n))
        hash_put(hash_module_to_depth, (char *) mod, (char *) n);
              
    if ( callees_list != NIL ) {
    /* assigns depth n+1 to callees of current module */
        MAPL(pm,
            { entity e = ENTITY(CAR(pm));
              topological_number_assign_to_module(hash_module_to_depth, e, n+1);
            },
         callees_list);
    }
}

References CAR, depth, ENTITY, hash_get(), hash_put(), ICFG_NOT_FOUND, MAPL, module_to_callees(), NIL, and topological_number_assign_to_module().

Referenced by topological_number_assign_to_module(), and topologically_sorted_module_list().

Here is the call graph for this function:

Here is the caller graph for this function:

topologically_sorted_module_list()

list topologically_sorted_module_list

(

entity

mod

)

"depth" of subroutine or function for topological sort

Parameters

mod

od

Definition at line 173 of file toposort.c.

{
    /* "depth" of subroutine or function for topological sort */
    hash_table hash_module_to_depth = (hash_table) NULL;
    list sorted_list;
    
    hash_module_to_depth = hash_table_make(hash_pointer, 0);
    hash_dont_warn_on_redefinition();
 
    topological_number_assign_to_module(hash_module_to_depth, mod, 0);
 
    sorted_list = module_list_sort(hash_module_to_depth, NIL, mod, 0);
 
    pips_assert("free_hash_table",
                hash_module_to_depth != (hash_table) NULL);
    hash_table_free(hash_module_to_depth);
    hash_module_to_depth = (hash_table) NULL;
 
    return (sorted_list);
} 

References hash_dont_warn_on_redefinition(), hash_pointer, hash_table_free(), hash_table_make(), module_list_sort(), NIL, pips_assert, and topological_number_assign_to_module().

Referenced by print_module_name_to_toposorts().

Here is the call graph for this function:

Here is the caller graph for this function: