lestes::backend_v2::workers::order_governor Class Reference

Linearizes pseudopinstructions within function's body. More...

#include <order_governor.g.hh>

Inheritance diagram for lestes::backend_v2::workers::order_governor:

List of all members.

Public Types
typedef ulint	level_t
Public Member Functions
ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > >	pis_ordered_get () const
	The method pis_ordered_get returns the value of the field order_governor::pis_ordered.
void	pis_ordered_set (const ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > > &)
	The method pis_ordered_set sets the field order_governor::pis_ordered to the given value.
ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > >	pis_unordered_get () const
	The method pis_unordered_get returns the value of the field order_governor::pis_unordered.
void	pis_unordered_set (const ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > > &)
	The method pis_unordered_set sets the field order_governor::pis_unordered to the given value.
ptr< ::lestes::std::map< srp< ::lestes::backend_v2::intercode::pi_pi >, bool > >	is_ordered_get () const
	The method is_ordered_get returns the value of the field order_governor::is_ordered.
void	is_ordered_set (const ptr< ::lestes::std::map< srp< ::lestes::backend_v2::intercode::pi_pi >, bool > > &)
	The method is_ordered_set sets the field order_governor::is_ordered to the given value.
void	process ()
	Manages linearization.
ptr< ::lestes::backend_v2::structs::func_data >	get_result ()
	Returns func_data with linearized pseudoinstructions.
void	merge_ordered_with_unordered_level_X (level_t level_to_merge)
	Merges unordered pseudoinstructions of given level with ordered pseudoinstructions.
void	torder_ordered ()
	Linearizes pis_ordered list.
bool	pi_operands_origins_ordered (ptr< vector< srp< ::lestes::backend_v2::intercode::pi_operand > > > operand_list)
	Tells whether origin of each operand in list is ordered.
void	renumber_levels (ptr< list< srp< ::lestes::backend_v2::intercode::pi_pi > > > pi_list)
	Decrease by 1 level of pseudoinstructions in a list.
bool	nsp_for_any (ptr< ::lestes::backend_v2::intercode::pi_pi > sp, ptr< list< srp< ::lestes::backend_v2::intercode::pi_pi > > > list)
	Tells whether a sequencepoint is psp for any of pseudoinstructions in a list.
void	identify_level_0 ()
	Moves pseudoinstructions of level 0 from pis_unordered to pis_ordered list.
void	linearize_ordered_sps ()
	Linearizes sequencepoints in pis_ordered list.
void	shift_unordered_nsp_psp ()
	Shifts psp and nsp of pis_unordered pseudoinstructions.
lint	get_pi_level (ptr< ::lestes::backend_v2::intercode::pi_pi > pi)
	Returns level of a pi_pi pseudoinstruction.
ptr< ::lestes::backend_v2::intercode::pi_pi >	conjugated_chain_end_find (ptr< ::lestes::backend_v2::intercode::pi_pi > pi)
	Gets last pi_pi pseudoinstruction of chain where two consequent pi_pi point with psp and nsp to each other.
ptr< ::lestes::backend_v2::intercode::pi_pi >	conjugated_chain_start_find (ptr< ::lestes::backend_v2::intercode::pi_pi > pi)
	Gets first pi_pi pseudoinstruction of chain where two consequent pi_pi point with psp and nsp to each other.
virtual ptr< reflection_list >	reflection_get () const
	for purposes of dumping
virtual ptr< field_list_list >	field_values_get () const
	for purposes of dumping
Static Public Member Functions
static ptr< order_governor >	create (ptr< ::lestes::backend_v2::structs::func_data > a__worker_base__data, ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > > a__order_governor__pis_ordered, ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > > a__order_governor__pis_unordered, ptr< ::lestes::std::map< srp< ::lestes::backend_v2::intercode::pi_pi >, bool > > a__order_governor__is_ordered)
	First generated factory method for class order_governor.
static ptr< order_governor >	create (ptr< ::lestes::backend_v2::structs::func_data > a__worker_base__data)
	Second generated factory method for class order_governor.
Protected Member Functions
	order_governor (ptr< ::lestes::backend_v2::structs::func_data > a__worker_base__data, ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > > a__order_governor__pis_ordered, ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > > a__order_governor__pis_unordered, ptr< ::lestes::std::map< srp< ::lestes::backend_v2::intercode::pi_pi >, bool > > a__order_governor__is_ordered)
	Generated constructor for class order_governor.
virtual void	gc_mark ()
	Marking routine for class order_governor.
Private Attributes
srp< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > >	pis_ordered
	List of already linearized pseudoinstructions.
srp< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > >	pis_unordered
	List of not yet linerized pseudoinstructions.
srp< ::lestes::std::map< srp< ::lestes::backend_v2::intercode::pi_pi >, bool > >	is_ordered
	Map that tells whether a pseudoinstruction is already in ordered list.
Static Private Attributes
static ptr< reflection_list >	reflection = reflection

---

Detailed Description

Linearizes pseudopinstructions within function's body.

Result of linearization is order where every pseudoinstruction is positioned between its psp and nsp sequencepoints and after origins of its operands. It means that pseudoinstruction is executed after all its origins are ready.

Definition at line 64 of file order_governor.g.hh.

---

Member Typedef Documentation

typedef ulint lestes::backend_v2::workers::order_governor::level_t

Definition at line 66 of file order_governor.g.hh.

---

Constructor & Destructor Documentation

lestes::backend_v2::workers::order_governor::order_governor	(	ptr< ::lestes::backend_v2::structs::func_data >	a__worker_base__data,
		ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > >	a__order_governor__pis_ordered,
		ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > >	a__order_governor__pis_unordered,
		ptr< ::lestes::std::map< srp< ::lestes::backend_v2::intercode::pi_pi >, bool > >	a__order_governor__is_ordered
	)			[protected]

Generated constructor for class order_governor.

Generated constructor for class order_governor.

Author:

lsg

Definition at line 107 of file order_governor.g.cc.

Referenced by create().

        : worker_base(a__worker_base__data), pis_ordered(checked(a__order_governor__pis_ordered)), pis_unordered(a__order_governor__pis_unordered), is_ordered(checked(a__order_governor__is_ordered))
{}

---

Member Function Documentation

ptr<::lestes::std::list< srp<::lestes::backend_v2::intercode::pi_pi > > > lestes::backend_v2::workers::order_governor::pis_ordered_get

(

)

const

The method pis_ordered_get returns the value of the field order_governor::pis_ordered.

Returns:

The value of order_governor::pis_ordered.

Author:

lsg

Definition at line 29 of file order_governor.g.cc.

References pis_ordered.

Referenced by process(), and torder_ordered().

{
        return pis_ordered;
}

void lestes::backend_v2::workers::order_governor::pis_ordered_set

(

const ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > > &

x

)

The method pis_ordered_set sets the field order_governor::pis_ordered to the given value.

Parameters:

[in]

x

The new value to set order_governor::pis_ordered to.

Author:

lsg

Definition at line 38 of file order_governor.g.cc.

References pis_ordered.

Referenced by torder_ordered().

{
        order_governor::pis_ordered = x;
}

ptr<::lestes::std::list< srp<::lestes::backend_v2::intercode::pi_pi > > > lestes::backend_v2::workers::order_governor::pis_unordered_get

(

)

const

The method pis_unordered_get returns the value of the field order_governor::pis_unordered.

Returns:

The value of order_governor::pis_unordered.

Author:

lsg

Definition at line 47 of file order_governor.g.cc.

References pis_unordered.

Referenced by merge_ordered_with_unordered_level_X(), and process().

{
        return pis_unordered;
}

void lestes::backend_v2::workers::order_governor::pis_unordered_set

(

const ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > > &

x

)

The method pis_unordered_set sets the field order_governor::pis_unordered to the given value.

Parameters:

[in]

x

The new value to set order_governor::pis_unordered to.

Author:

lsg

Definition at line 56 of file order_governor.g.cc.

References pis_unordered.

{
        order_governor::pis_unordered = x;
}

ptr<::lestes::std::map< srp<::lestes::backend_v2::intercode::pi_pi >, bool > > lestes::backend_v2::workers::order_governor::is_ordered_get

(

)

const

The method is_ordered_get returns the value of the field order_governor::is_ordered.

Returns:

The value of order_governor::is_ordered.

Author:

lsg

Definition at line 65 of file order_governor.g.cc.

References is_ordered.

Referenced by torder_ordered().

{
        return is_ordered;
}

void lestes::backend_v2::workers::order_governor::is_ordered_set

(

const ptr< ::lestes::std::map< srp< ::lestes::backend_v2::intercode::pi_pi >, bool > > &

x

)

The method is_ordered_set sets the field order_governor::is_ordered to the given value.

Parameters:

[in]

x

The new value to set order_governor::is_ordered to.

Author:

lsg

Definition at line 74 of file order_governor.g.cc.

References is_ordered.

{
        order_governor::is_ordered = x;
}

void lestes::backend_v2::workers::order_governor::process

(

)

[virtual]

Manages linearization.

Implements lestes::backend_v2::workers::worker_base.

Definition at line 30 of file order_governor.cc.

References lestes::backend_v2::workers::worker_base::data_get(), lestes::msg::eolog, identify_level_0(), linearize_ordered_sps(), merge_ordered_with_unordered_level_X(), pis_ordered_get(), pis_unordered, pis_unordered_get(), renumber_levels(), shift_unordered_nsp_psp(), and torder_ordered().

{
        og_log << "Process begin\n" << eolog;
        
        pis_unordered = data_get()->pi_body_get();
        
        //Find pis with level set to 0.    
    identify_level_0();
        
        //Repeat loop while there are any unordered pis. 
    while( !pis_unordered_get()->empty() ) {
                og_log << "Main loop begin.\n" << eolog;
                
                //Find unordered pis with level=1 and move them to the ordered set.
                merge_ordered_with_unordered_level_X(1);
                //Order merged level 0&1 set.
                torder_ordered();
                //Linearize ordered sps.
                linearize_ordered_sps();
                //Move psp and nsp pointers.
                shift_unordered_nsp_psp();
                //Recalculate levels for unordered pis.
                renumber_levels(pis_unordered_get());
                //Recalculate levels for ordered pis.
                renumber_levels(pis_ordered_get());
                
                og_log << "Main loop end.\n" << eolog;
    }
        
        og_log << "Process end.\n" << eolog;
}

ptr< func_data > lestes::backend_v2::workers::order_governor::get_result

(

)

[virtual]

Returns func_data with linearized pseudoinstructions.

Implements lestes::backend_v2::workers::worker_base.

Definition at line 381 of file order_governor.cc.

References lestes::backend_v2::workers::worker_base::data_get(), lassert, and pis_ordered.

{
        lassert(pis_ordered);
                
        ptr<visitor_pi_pi2id> pi_id_getter = visitor_pi_pi2id::create();
        
        /*
                Set psp to the previous pi_sp (now it can also be pi_pi).
        */
        ptr<pi_sp> tmp_sp = NULL;
        for(pi_list_type::iterator it_pi_list = pis_ordered->begin(); it_pi_list!=pis_ordered->end(); ++it_pi_list) {
                ptr<pi_pi> pi = *it_pi_list;

                visitor_pi_pi2id::kind_type pi_id = (visitor_pi_pi2id::kind_type)pi->accept_visitor_pi_pi2ulint_gen_base(pi_id_getter);
                
                //Set psp to previous sequencepoint (now psp can be pi_sp or pi_pi )
                pi->psp_set(tmp_sp);
                
                //Add pi to an output list
                if ( pi_id==visitor_pi_pi2id::PI_SP ) {
                        tmp_sp = pi.dncast<pi_sp>();
                }
                
        }
        
        /*
                Set nsp to the following pi_sp (now it can also be pi_pi). 
        */
        tmp_sp = NULL;
        for(pi_list_type::reverse_iterator it_pi_list = pis_ordered->rbegin(); it_pi_list!=pis_ordered->rend(); ++it_pi_list) {
                ptr<pi_pi> pi = *it_pi_list;
                
                visitor_pi_pi2id::kind_type pi_id = (visitor_pi_pi2id::kind_type)pi->accept_visitor_pi_pi2ulint_gen_base(pi_id_getter);
                
                pi->nsp_set(tmp_sp);
                
                if ( pi_id==visitor_pi_pi2id::PI_SP ) {
                        tmp_sp = pi.dncast<pi_sp>();
                }
        }       
        
        data_get()->pi_body_set(pis_ordered);
        
        return data_get();
}

void lestes::backend_v2::workers::order_governor::merge_ordered_with_unordered_level_X

(

level_t

level_to_merge

)

Merges unordered pseudoinstructions of given level with ordered pseudoinstructions.

Parameters:

level_to_merge

The level to be merged.

Definition at line 87 of file order_governor.cc.

References lestes::msg::eolog, pis_ordered, pis_unordered, and pis_unordered_get().

Referenced by identify_level_0(), and process().

{
        //Go through the unordered set.
    for(pi_list_type::iterator it = pis_unordered_get()->begin(); it != pis_unordered_get()->end();) {
                if ( (*it)->level_get() == level_to_merge ) {
                        og_log << "Merging L0 with L" << level_to_merge << ": " << (*it)->reflection_get()->back()->name_get() << "(" << (*it)->uid_get() << ")[level=" << (*it)->level_get() << "] added\n" << eolog;;
                        
                        //Current pi has the right level. Move it to the ordered set.
                pis_ordered->push_back(*it);
                        //Delete it from unordered set.
                it = pis_unordered->erase(it);
                } else {
                        ++it;
                }
    }
        
}

void lestes::backend_v2::workers::order_governor::torder_ordered

(

)

Linearizes pis_ordered list.

Performs topological ordering in directed acyclic graph. Vertices are pseudoinstructions from pis_ordered list. Incoming edges for pseudoinstruction pi are psp->pi and origin->pi for each pi's operand. Outcoming edge is pi->nsp.

Definition at line 140 of file order_governor.cc.

References lestes::msg::eolog, is_ordered, is_ordered_get(), lassert2, nsp_for_any(), pi_operands_origins_ordered(), pis_ordered_get(), and pis_ordered_set().

Referenced by process().

{

        og_log << "Tordering begin\n" << eolog;
        
        //The getter can obtain operands from any generic pi.
        ptr<visitor_pi_pi2pi_operands> operands_getter = visitor_pi_pi2pi_operands::create();
        
        //identificator can identify kind of any generic pi
        ptr<visitor_pi_pi2id> identificator = visitor_pi_pi2id::create();
        
        //List of ordered pis. No pi is ordered at the beginning.
    ptr<pi_list_type> tordered_list = pi_list_type::create();
        //List of unordered pis. Every pi is unordered at the beginning.
    ptr<pi_list_type> tunordered_list = pis_ordered_get();
    
        //Set is_ordered=false for all unordered pis.
    pi_list_type::iterator it;
    for(it=tunordered_list->begin(); it != tunordered_list->end(); it++) { 
                (*is_ordered)[*it] = false;
    }

#ifdef BACKEND_V2_DEBUG
        //infinite loop detection
        ulint dbg = 0;    
#endif

        //Repeat loop while there are any unordered pis. 
    while( !tunordered_list->empty()) {
        
#ifdef BACKEND_V2_DEBUG
                lassert2(dbg<=tunordered_list->size(),"An inifinite loop detected.");
                dbg++;
#endif          

                //Get first unorderd pi.
                ptr<pi_pi> pi = tunordered_list->front();
                
                //Remove it from unordered set.
                tunordered_list->pop_front();
                
                og_log << "Tordering: trying order " << pi->reflection_get()->back()->name_get() << "(" << pi->uid_get() << ")\n" << eolog;
        
                if ( pi->psp_get() && (*is_ordered_get())[pi->psp_get()] == false )  {
                        //Psp is unordered. So this pi is also unordered.
                tunordered_list->push_back(pi);
                        
                        og_log << "\tTordering: current pi can't be ordered (psp is not ordered yet)\n" << eolog;
                        
                        continue;
                }
                
                //Get it's operands.
                ptr<pi_operands> operands = pi->accept_visitor_pi_pi2pi_operands_gen_base(operands_getter);
                /* Test if every input operand's origin is ordered. 
                 ( Do not test output operands - its origin is set to the current pi. )
                */
                
            if ( !pi_operands_origins_ordered(operands->operands_input_get()) ) {
                        //One of operands hasn't got its origin ordered
                        tunordered_list->push_back(pi);
                        
                        og_log << "\tTordering: current pi can't be ordered (origins of operands are not ordered yet)\n" << eolog;
                        
                        continue;
                }
                
            if ( nsp_for_any(pi, tunordered_list) ) {
                        //It is pi_sp and it is nsp for one of unordered pis.
                        tunordered_list->push_back(pi);
                        
                        og_log << "\tTordering: current pi can't be ordered (sp is nsp for unorderd pi)\n" << eolog;
                        
                        continue;
                }
                
                (*is_ordered_get())[pi] = true;
            tordered_list->push_back(pi);
                
                og_log << "\tTordering: " << pi->reflection_get()->back()->name_get() << "(" << pi->uid_get() << ") is set as ordered\n" << eolog;

#ifdef BACKEND_V2_DEBUG
                dbg = 0;
#endif

    }
        
        //We have new bigger ordered set.
    pis_ordered_set(tordered_list);
        
        og_log << "Tordering end\n" << eolog;
}

bool lestes::backend_v2::workers::order_governor::pi_operands_origins_ordered

(

ptr< vector< srp< ::lestes::backend_v2::intercode::pi_operand > > >

operand_list

)

Tells whether origin of each operand in list is ordered.

Referenced by torder_ordered().

void lestes::backend_v2::workers::order_governor::renumber_levels

(

ptr< list< srp< ::lestes::backend_v2::intercode::pi_pi > > >

pi_list

)

Decrease by 1 level of pseudoinstructions in a list.

Referenced by process().

bool lestes::backend_v2::workers::order_governor::nsp_for_any	(	ptr< ::lestes::backend_v2::intercode::pi_pi >	sp,
		ptr< list< srp< ::lestes::backend_v2::intercode::pi_pi > > >	list
	)

Tells whether a sequencepoint is psp for any of pseudoinstructions in a list.

Referenced by torder_ordered().

void lestes::backend_v2::workers::order_governor::identify_level_0

(

)

Moves pseudoinstructions of level 0 from pis_unordered to pis_ordered list.

Definition at line 66 of file order_governor.cc.

References is_ordered, merge_ordered_with_unordered_level_X(), pis_ordered, and pis_unordered.

Referenced by process().

{
        //the ordered set is empty. Copy pis with level=0 to it.
    merge_ordered_with_unordered_level_X(0);
        
        //Set is_ordered=true for all pis with level=0.
    pi_list_type::iterator it;
    for(it=pis_ordered->begin(); it != pis_ordered->end(); it++) { 
                (*is_ordered)[*it] = true;
    }
        
        //Set is_ordered=false for all pis with level>0.
    for(it=pis_unordered->begin(); it != pis_unordered->end(); it++) { 
                (*is_ordered)[*it] = false;
    }
}

void lestes::backend_v2::workers::order_governor::linearize_ordered_sps

(

)

Linearizes sequencepoints in pis_ordered list.

Definition at line 108 of file order_governor.cc.

References pis_ordered.

Referenced by process().

                                           {
        ptr<visitor_pi_pi2id> identificator = visitor_pi_pi2id::create();
        /*
                Go through ordered list and for each pi_sp set psp to the previous one
                and previous one's nsp to this sp.
        */
        ptr<pi_pi> previous = NULL;
        ptr<pi_pi> current = NULL;
        pi_list_type::iterator it;
    for(it=pis_ordered->begin(); it != pis_ordered->end(); it++) { 
        
                //if ( (*it)->accept_visitor_pi_pi2ulint_gen_base(identificator) == visitor_pi_pi2id::PI_SP ) {
                        //current pi is type of pi_sp
                        current = (*it);
                        
                        if ( previous ) {
                                previous->nsp_set(current);
                        }
                        current->psp_set(previous);
                        previous = current;
                //}
    }
        current->nsp_set(NULL);
}

void lestes::backend_v2::workers::order_governor::shift_unordered_nsp_psp

(

)

Shifts psp and nsp of pis_unordered pseudoinstructions.

Definition at line 323 of file order_governor.cc.

References conjugated_chain_end_find(), conjugated_chain_start_find(), lestes::msg::eolog, get_pi_level(), lassert, and pis_unordered.

Referenced by process().

{
        //Move psp and nsp of unordered pis.
    pi_list_type::iterator it;
    for(it = pis_unordered->begin(); it!=pis_unordered->end(); it++) {
                ptr<pi_pi> pi = (*it);
                
                og_log << "shift_unordered_nsp_psp: pi(" << pi->uid_get() << ").level= " << get_pi_level(pi) << "\n" <<  msg::eolog;
                
                lassert(get_pi_level(pi)>1);
                
                if ( get_pi_level(pi->psp_get())==0 ) {
                        ptr<pi_pi> pi_hlp = conjugated_chain_end_find(pi);
                        
                        og_log << "shift_psp: chain_end(" << pi_hlp->uid_get() << ").nsp.level=" << get_pi_level(pi_hlp->nsp_get()) << "\n" <<  msg::eolog;
                        
                        lassert(get_pi_level(pi_hlp)==get_pi_level(pi));
                        
                        if (get_pi_level(pi_hlp->nsp_get())>0){
                                pi->psp_set(pi_hlp->nsp_get()->psp_get());
                        }
                        
                } else if ( get_pi_level(pi->nsp_get())==0 ) {
                        ptr<pi_pi> pi_hlp = conjugated_chain_start_find(pi);

                        og_log << "shift_nsp: chain_begin(" << pi_hlp->uid_get() << ").psp.level=" << get_pi_level(pi_hlp->psp_get()) << "\n" << msg::eolog;

                        lassert(get_pi_level(pi_hlp)==get_pi_level(pi));

                        if (get_pi_level(pi_hlp->psp_get())>0) {
                                pi->nsp_set(pi_hlp->psp_get()->nsp_get());
                        }
                }
    }
}

lint lestes::backend_v2::workers::order_governor::get_pi_level

(

ptr< ::lestes::backend_v2::intercode::pi_pi >

pi

)

Returns level of a pi_pi pseudoinstruction.

Referenced by shift_unordered_nsp_psp().

ptr< ::lestes::backend_v2::intercode::pi_pi > lestes::backend_v2::workers::order_governor::conjugated_chain_end_find

(

ptr< ::lestes::backend_v2::intercode::pi_pi >

pi

)

Gets last pi_pi pseudoinstruction of chain where two consequent pi_pi point with psp and nsp to each other.

Referenced by shift_unordered_nsp_psp().

ptr< ::lestes::backend_v2::intercode::pi_pi > lestes::backend_v2::workers::order_governor::conjugated_chain_start_find

(

ptr< ::lestes::backend_v2::intercode::pi_pi >

pi

)

Gets first pi_pi pseudoinstruction of chain where two consequent pi_pi point with psp and nsp to each other.

Referenced by shift_unordered_nsp_psp().

ptr< order_governor > lestes::backend_v2::workers::order_governor::create	(	ptr< ::lestes::backend_v2::structs::func_data >	a__worker_base__data,
		ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > >	a__order_governor__pis_ordered,
		ptr< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > >	a__order_governor__pis_unordered,
		ptr< ::lestes::std::map< srp< ::lestes::backend_v2::intercode::pi_pi >, bool > >	a__order_governor__is_ordered
	)			[static]

First generated factory method for class order_governor.

This factory method for class order_governor takes values of all fields as arguments.

Author:

lsg

Definition at line 83 of file order_governor.g.cc.

References order_governor().

Referenced by create().

{
        return ptr< order_governor > ( new order_governor(a__worker_base__data,
                a__order_governor__pis_ordered,
                a__order_governor__pis_unordered,
                a__order_governor__is_ordered) );
}

ptr< order_governor > lestes::backend_v2::workers::order_governor::create

(

ptr< ::lestes::backend_v2::structs::func_data >

a__worker_base__data

)

[static]

Second generated factory method for class order_governor.

This factory method for class order_governor uses initializers.

Author:

lsg

Definition at line 98 of file order_governor.g.cc.

References create(), and order_governor().

{
        return ptr< order_governor > ( new order_governor(a__worker_base__data, ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > ::create(), NULL, ::lestes::std::map< srp< ::lestes::backend_v2::intercode::pi_pi >, bool > ::create()) );
}

ptr< object::reflection_list > lestes::backend_v2::workers::order_governor::reflection_get

(

)

const [virtual]

for purposes of dumping

Reimplemented from lestes::backend_v2::workers::worker_base.

Definition at line 114 of file order_governor.g.cc.

References lestes::std::list< T >::create(), reflection, and lestes::backend_v2::workers::worker_base::reflection_get().

{
        if (!reflection) {
                typedef class_reflection::field_metadata md;
                typedef class_reflection::field_metadata_list mdlist;
                ptr<mdlist> mdl = mdlist::create();
                mdl->push_back( md::create( "pis_ordered", "list&lt; srp&lt; ::lestes::backend_v2::intercode::pi_pi &gt; &gt;" ) );
                mdl->push_back( md::create( "pis_unordered", "list&lt; srp&lt; ::lestes::backend_v2::intercode::pi_pi &gt; &gt;" ) );
                mdl->push_back( md::create( "is_ordered", "map&lt; srp&lt; ::lestes::backend_v2::intercode::pi_pi &gt;, bool &gt;" ) );
                reflection = reflection_list::create( worker_base::reflection_get() );
                reflection->push_back( class_reflection::create( "order_governor", mdl ) );
        }
        return reflection;
}

ptr< object::field_list_list > lestes::backend_v2::workers::order_governor::field_values_get

(

)

const [virtual]

for purposes of dumping

Reimplemented from lestes::backend_v2::workers::worker_base.

Definition at line 129 of file order_governor.g.cc.

References lestes::std::list< T >::create(), and lestes::backend_v2::workers::worker_base::field_values_get().

{
        ptr < field_list_list > result = worker_base::field_values_get();
        result->push_back( value_list::create() );
        result->back()->push_back( this->pis_ordered );
        result->push_back( value_list::create() );
        result->back()->push_back( this->pis_unordered );
        result->push_back( value_list::create() );
        result->back()->push_back( this->is_ordered );
        return result;
}

void lestes::backend_v2::workers::order_governor::gc_mark

(

void

)

[protected, virtual]

Marking routine for class order_governor.

Marking routine is used for garbage collection.

Author:

lsg

Reimplemented from lestes::backend_v2::workers::worker_base.

Definition at line 146 of file order_governor.g.cc.

References lestes::backend_v2::workers::worker_base::gc_mark().

{
        worker_base::gc_mark();
}

---

Member Data Documentation

srp< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > > lestes::backend_v2::workers::order_governor::pis_ordered [private]

List of already linearized pseudoinstructions.

Definition at line 155 of file order_governor.g.hh.

Referenced by get_result(), identify_level_0(), linearize_ordered_sps(), merge_ordered_with_unordered_level_X(), pis_ordered_get(), and pis_ordered_set().

srp< ::lestes::std::list< srp< ::lestes::backend_v2::intercode::pi_pi > > > lestes::backend_v2::workers::order_governor::pis_unordered [private]

List of not yet linerized pseudoinstructions.

Definition at line 157 of file order_governor.g.hh.

Referenced by identify_level_0(), merge_ordered_with_unordered_level_X(), pis_unordered_get(), pis_unordered_set(), process(), and shift_unordered_nsp_psp().

srp< ::lestes::std::map< srp< ::lestes::backend_v2::intercode::pi_pi >, bool > > lestes::backend_v2::workers::order_governor::is_ordered [private]

Map that tells whether a pseudoinstruction is already in ordered list.

Definition at line 159 of file order_governor.g.hh.

Referenced by identify_level_0(), is_ordered_get(), is_ordered_set(), and torder_ordered().

ptr< object::reflection_list > lestes::backend_v2::workers::order_governor::reflection = reflection [static, private]

Reimplemented from lestes::backend_v2::workers::worker_base.

Definition at line 160 of file order_governor.g.hh.

Referenced by reflection_get().

---

The documentation for this class was generated from the following files:

• order_governor.g.hh
• order_governor.cc
• order_governor.g.cc

---