#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include "linear.h"
#include "genC.h"
#include "text.h"
#include "ri.h"
#include "effects.h"
#include "complexity_ri.h"
#include "database.h"
#include "resources.h"
#include "ri-util.h"
#include "effects-util.h"
#include "pipsdbm.h"
#include "matrice.h"
#include "properties.h"
#include "misc.h"
#include "callgraph.h"
#include "prettyprint.h"
#include "text-util.h"
#include "top-level.h"
#include "complexity.h"
#include "pips-libs.h"

Include dependency graph for comp_prettyprint.c:

Functions
static text	text_complexity (_UNUSED_ entity module, _UNUSED_ int margin, statement stat)

static text	text_summary_complexity (entity module)

static text	get_text_complexities (const string module_name)

static bool	print_code_or_source_comp (const string module_name)

bool	print_code_complexities (const string module_name)
	comp_prettyprint.c More...

bool	print_code_as_a_graph_complexities (const string mod_name)

bool	print_source_complexities (const string module_name)

bool	print_call_graph_with_complexities (const string module_name)

Variables
static bool	is_user_view
	useful More...

static hash_table	nts = hash_table_undefined
	print_code_complexities or print_source_complexities More...

Function Documentation

◆ get_text_complexities()

static text get_text_complexities ( const string module_name )

static

FI: different kind of complexities should later be made available. Instead of the module intrinsic complexity, it would be interesting to have its contextual complexity. The same is true for the icfg

Definition at line 161 of file comp_prettyprint.c.

 {
   /* FI: different kind of complexities should later be made
      available.  Instead of the module intrinsic complexity, it would
      be interesting to have its contextual complexity. The same is
      true for the icfg
   */
   entity module = module_name_to_entity(module_name);
   return text_summary_complexity(module);
 }

References module, module_name(), module_name_to_entity(), and text_summary_complexity().

Referenced by print_call_graph_with_complexities().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ print_call_graph_with_complexities()

bool print_call_graph_with_complexities ( const string module_name )

Parameters

module_name odule_name

Definition at line 254 of file comp_prettyprint.c.

 {
   bool success = false;
   success = print_decorated_call_graph(module_name, get_text_complexities);
   return success;
 }

References get_text_complexities(), module_name(), and print_decorated_call_graph().

Here is the call graph for this function:

◆ print_code_as_a_graph_complexities()

bool print_code_as_a_graph_complexities ( const string mod_name )

Parameters

mod_name od_name

Definition at line 234 of file comp_prettyprint.c.

 {
     bool success;
  
     set_bool_property("PRETTYPRINT_UNSTRUCTURED_AS_A_GRAPH", true);
     success = print_code_complexities(mod_name);
     set_bool_property("PRETTYPRINT_UNSTRUCTURED_AS_A_GRAPH", false);
  
     return success;
 }

References print_code_complexities(), and set_bool_property().

Here is the call graph for this function:

◆ print_code_complexities()

bool print_code_complexities ( const string module_name )

comp_prettyprint.c

Parameters

module_name odule_name

Definition at line 228 of file comp_prettyprint.c.

 {
   is_user_view = false;
   return print_code_or_source_comp(module_name);
 }

References is_user_view, module_name(), and print_code_or_source_comp().

Referenced by print_code_as_a_graph_complexities().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ print_code_or_source_comp()

static bool print_code_or_source_comp ( const string module_name )

static

Definition at line 172 of file comp_prettyprint.c.

 {
     bool success = true;
     entity mod;
     statement mod_stat, user_stat = statement_undefined;
     char *file_ext = strdup
       (concatenate(
         is_user_view? ".ucomp" : ".comp",
         get_bool_property("PRETTYPRINT_UNSTRUCTURED_AS_A_GRAPH") ?
         GRAPH_FILE_EXT : "",
         NULL));
     char * resource_name =
       get_bool_property("PRETTYPRINT_UNSTRUCTURED_AS_A_GRAPH") ?
             DBR_GRAPH_PRINTED_FILE
       : is_user_view ? DBR_PARSED_PRINTED_FILE : DBR_PRINTED_FILE;
     text txt = make_text(NIL);
  
     set_current_module_statement(
       (statement) db_get_memory_resource(DBR_CODE, module_name, true) );
     mod_stat = get_current_module_statement();
     set_current_module_entity(module_name_to_entity(module_name) );
     mod = get_current_module_entity();
  
     if(is_user_view) {
       user_stat =  (statement)
         db_get_memory_resource(DBR_PARSED_CODE, module_name, true);
  
       nts = allocate_number_to_statement();
       nts = build_number_to_statement(nts, mod_stat);
     }
  
  
     set_complexity_map( (statement_mapping)
          db_get_memory_resource(DBR_COMPLEXITIES, module_name, true));
  
     init_prettyprint(text_complexity);
  
     MERGE_TEXTS(txt, text_summary_complexity( get_current_module_entity() ));
     MERGE_TEXTS(txt, text_module(mod, is_user_view ? user_stat : mod_stat));
  
     close_prettyprint();
     success = make_text_resource_and_free
         (module_name, resource_name, file_ext, txt);
     free(file_ext);
  
     if(is_user_view) {
         hash_table_free(nts);
         nts = hash_table_undefined;
     }
     reset_complexity_map();
     reset_current_module_entity();
     reset_current_module_statement();
  
     return success;
 }

References allocate_number_to_statement(), build_number_to_statement(), close_prettyprint(), concatenate(), db_get_memory_resource(), free(), get_bool_property(), get_current_module_entity(), get_current_module_statement(), hash_table_free(), hash_table_undefined, init_prettyprint(), is_user_view, make_text(), make_text_resource_and_free(), MERGE_TEXTS, mod_stat, module_name(), module_name_to_entity(), NIL, nts, reset_complexity_map(), reset_current_module_entity(), reset_current_module_statement(), resource_name, set_complexity_map(), set_current_module_entity(), set_current_module_statement(), statement_undefined, strdup(), text_complexity(), text_module(), and text_summary_complexity().

Referenced by print_code_complexities(), and print_source_complexities().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ print_source_complexities()

bool print_source_complexities ( const string module_name )

Parameters

module_name odule_name

Definition at line 245 of file comp_prettyprint.c.

 {
   is_user_view = true;
   return print_code_or_source_comp(module_name);
 }

References is_user_view, module_name(), and print_code_or_source_comp().

Here is the call graph for this function:

◆ text_complexity()

static text text_complexity	(	_UNUSED_ entity	module,
		_UNUSED_ int	margin,
		statement	stat
	)

static

Definition at line 63 of file comp_prettyprint.c.

 {
   complexity stat_comp = complexity_undefined;
   int print_stats_level = get_int_property("COMPLEXITY_PRINT_STATISTICS");
   bool print_stats_p = ((print_stats_level == 2) ||
                         ((print_stats_level == 1) &&
                          !statement_call_p(stat)));
   cons *pc ;
   char *r ;
   int nblanks ;
   instruction ins = statement_instruction(stat);
   char *s;
   text t = make_text(NIL);
  
   if (get_bool_property("COMPLEXITY_INTERMEDIATES")) {
     fprintf(stderr, "statement %s, ordering (%td %td)\n",
             module_local_name(statement_label(stat)),
             ORDERING_NUMBER(statement_ordering(stat)),
             ORDERING_STATEMENT(statement_ordering(stat)));
   }
  
   if(is_user_view) {
     statement i = apply_number_to_statement(nts, statement_number(stat));
  
     if(!statement_undefined_p(i)) {
             stat_comp = load_statement_complexity(i);
     }
     else
             stat_comp = (complexity) HASH_UNDEFINED_VALUE;
   }
   else
     stat_comp = load_statement_complexity(stat);
  
   if(stat_comp != (complexity) HASH_UNDEFINED_VALUE) {
     string it = string_undefined;
  
     complexity_check_and_warn("text_complexity", stat_comp);
     pc = CHAIN_SWORD(NIL, complexity_sprint(stat_comp, print_stats_p,
                                             PRINT_LOCAL_NAMES));
     r = words_to_string(pc);
     nblanks = 65-strlen(r);
  
     if (nblanks<1)
             nblanks = 1;
  
         //Becher Molka : Replacing the control structure 'if' by selective structure 'switch case' +  Updating of instruction's tags.
     switch (instruction_tag(ins))
     {
     case is_instruction_sequence: it = "(SEQ)"; break;
     case is_instruction_test: it = "(TEST)"; break;
     case is_instruction_loop: it = "(DO)"; break;
     case is_instruction_whileloop: it = "(WHILE)"; break;
     case is_instruction_goto: it = "(GOTO)"; break;
     case is_instruction_call: it = "(STMT)"; break;
     case is_instruction_unstructured: it = "(UNSTR)"; break;
     case is_instruction_forloop: it = "(FOR)"; break;
     case is_instruction_expression: it = "(EXPR)"; break;
     case is_instruction_multitest: it = "(MTEST)"; break;
     default:
       pips_internal_error("Never occur!");
       break;
     }
  
     asprintf(&s, "%s    %*s%s %s\n",
              get_comment_sentinel(), nblanks, "", r, it);
  
     ADD_SENTENCE_TO_TEXT(t, make_sentence(is_sentence_formatted, s));
   }
  
   return t;
 }

References ADD_SENTENCE_TO_TEXT, apply_number_to_statement(), asprintf, CHAIN_SWORD, complexity_check_and_warn(), complexity_sprint(), complexity_undefined, fprintf(), get_bool_property(), get_comment_sentinel(), get_int_property(), HASH_UNDEFINED_VALUE, instruction_tag, is_instruction_call, is_instruction_expression, is_instruction_forloop, is_instruction_goto, is_instruction_loop, is_instruction_multitest, is_instruction_sequence, is_instruction_test, is_instruction_unstructured, is_instruction_whileloop, is_sentence_formatted, is_user_view, load_statement_complexity(), make_sentence(), make_text(), module_local_name(), NIL, nts, ORDERING_NUMBER, ORDERING_STATEMENT, pips_internal_error, PRINT_LOCAL_NAMES, statement_call_p(), statement_instruction, statement_label, statement_number, statement_ordering, statement_undefined_p, string_undefined, and words_to_string().

Referenced by print_code_or_source_comp().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ text_summary_complexity()

static text text_summary_complexity ( entity module )

static

Definition at line 138 of file comp_prettyprint.c.

 {
   const char* module_name = module_local_name(module);
   complexity stat_comp = (complexity)
     db_get_memory_resource(DBR_SUMMARY_COMPLEXITY, module_name, true);
   cons *pc = CHAIN_SWORD(NIL, complexity_sprint(stat_comp, false,
                                                 PRINT_LOCAL_NAMES));
   char *r = words_to_string(pc);
   int nblanks = 65-strlen(r);
   char *s;
   text t = make_text(NIL);
  
   if (nblanks < 1)
     nblanks = 1;
   asprintf(&s, "%s    %*s%s (SUMMARY)\n",
            fortran_module_p(module)? "C" : "//",
            nblanks, "", r);
   ADD_SENTENCE_TO_TEXT(t, make_sentence(is_sentence_formatted,
                                         s));
  
   return t;
 }