util.c File Reference

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

Include dependency graph for util.c:

Go to the source code of this file.

Functions
void	safe_free_vertex (vertex ver, list l_of_vers)
	util.c More...
list	safe_add_vertex_to_list (vertex ver, list l_of_vers)
list	list_of_connected_nodes (vertex ver, list l_of_vers)
static string	convert_string_for_daVinci_graph (string s)
vertex	get_vertex_by_string (const char *str_name, list l_of_vers)
list	safe_make_successor (vertex ver_parent, vertex ver_child, list l_of_vers)
void	print_graph_of_text_to_daVinci (FILE *f_out, list l_of_vers)
void	print_graph_daVinci_from_starting_node (FILE *f_out, vertex start_ver)
void	print_marged_text_from_starting_node (FILE *fd, int margin, vertex start_ver, list l_of_vers)
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)

Function Documentation

convert_string_for_daVinci_graph()

static string convert_string_for_daVinci_graph ( string  s )

static

if empty, do nothing

effects lines

delete the comment of effects

Definition at line 67 of file util.c.

{
  string r;
  int l = strlen(s);
  if (l == 0) /* if empty, do nothing */
    return strdup(s);
  else {
    int len;
    r = (string) malloc(l + 3);
    memset(r, 0, l + 3);
    if (strstr(s, "C               <") == s) {/* effects lines */
      r[0] = ' '; /* delete the comment of effects */
      strcpy(r + 1, s + 1);
      len = l+1;
    } else {
      strcpy(r, s);
      len = l;
    }
    // append a \n if needed
    if (r[len-1] != '\n')
      r[len] = '\n';
  }
  return r;
}

References malloc(), memset(), and strdup().

Referenced by print_graph_of_text_to_daVinci().

Here is the call graph for this function:

Here is the caller 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:

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:

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_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:

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: