multiple_entry_if_reduction.cpp File Reference

This class implements the reduction of blocks with n input and m output These operations can be done if the BB contains only conditional statements and phi First duplicate the block on all the n input and add the respective connections to predecessor and successors (bidirectional) Each duplicate starts as an empty one with only connections Then the new BB is populated by conditional functions derivated from the original statement list. More...

#include "multiple_entry_if_reduction.hpp"
#include "loop.hpp"
#include "loops.hpp"
#include "application_manager.hpp"
#include "basic_block.hpp"
#include "behavioral_helper.hpp"
#include "function_behavior.hpp"
#include "design_flow_graph.hpp"
#include "design_flow_manager.hpp"
#include "simple_code_motion.hpp"
#include "hls.hpp"
#include "hls_manager.hpp"
#include "allocation_information.hpp"
#include "Parameter.hpp"
#include "token_interface.hpp"
#include <boost/range/adaptor/reversed.hpp>
#include <cmath>
#include <fstream>
#include <limits>
#include <string>
#include "custom_map.hpp"
#include "custom_set.hpp"
#include <list>
#include <set>
#include <utility>
#include "ext_tree_node.hpp"
#include "tree_basic_block.hpp"
#include "tree_helper.hpp"
#include "tree_manager.hpp"
#include "tree_manipulation.hpp"
#include "tree_node.hpp"
#include "dbgPrintHelper.hpp"
#include "string_manipulation.hpp"
#include "tree_node_dup.hpp"
#include "tree_reindex.hpp"

Include dependency graph for multiple_entry_if_reduction.cpp:

Go to the source code of this file.

Macros
#define	MAX_DOUBLE   std::numeric_limits<double>::max();

Functions
	REF_FORWARD_DECL (tree_node_dup)
	Header include. More...

Detailed Description

This class implements the reduction of blocks with n input and m output These operations can be done if the BB contains only conditional statements and phi First duplicate the block on all the n input and add the respective connections to predecessor and successors (bidirectional) Each duplicate starts as an empty one with only connections Then the new BB is populated by conditional functions derivated from the original statement list.

• if cond is defined outside the BB keep them
• if cond is defined in the BB then modify it leaving only the component of the condition defined in the BB predecessor After that the phi statement defined in the original BB are added to the successors blocks changing this ssa names To keep the tree coherent each time that an old ssa name of a phi is used substitute it with the new one Then remove the old BB connections from predecessor and successors and eventually eliminate it

for more details look at the comments in the code

Author

Andrea Caielli andre.nosp@m.a.ca.nosp@m.ielli.nosp@m.@mai.nosp@m.l.pol.nosp@m.imi..nosp@m.it

Marco Lattuada marco.nosp@m..lat.nosp@m.tuada.nosp@m.@pol.nosp@m.imi.i.nosp@m.t

Definition in file multiple_entry_if_reduction.cpp.

Macro Definition Documentation

MAX_DOUBLE

#define MAX_DOUBLE   std::numeric_limits<double>::max();

Definition at line 116 of file multiple_entry_if_reduction.cpp.

Function Documentation

REF_FORWARD_DECL()

REF_FORWARD_DECL

(

tree_node_dup

)

Header include.

algorithms/loops_detection includes Behavior include design_flows includes frontend_analysis/IR_analysis HLS include HLS/allocation include Parameter include parser/compiler include STD include STL includes Tree include