#include <LiveRange.hh>

Collaboration diagram for LiveRange:

Public Member Functions
bool	noneScheduled () const

TCEString	toString () const

int	firstCycle () const

int	lastCycle () const

void	clear ()

Public Attributes
DataDependenceGraph::NodeSet	writes

DataDependenceGraph::NodeSet	reads

DataDependenceGraph::NodeSet	guards

Detailed Description

Definition at line 38 of file LiveRange.hh.

Member Function Documentation

◆ clear()

void LiveRange::clear ( )

Definition at line 129 of file LiveRange.cc.

                 {
    writes.clear();
    reads.clear();
    guards.clear();
}

References guards, reads, and writes.

Referenced by DataDependenceGraph::findLiveRange().

◆ firstCycle()

int LiveRange::firstCycle ( ) const

Definition at line 77 of file LiveRange.cc.

                            {
    int fc = INT_MAX;
    for (DataDependenceGraph::NodeSet::iterator i = writes.begin();
         i != writes.end(); i++) {
        if ((*i)->isScheduled()) {
            fc = std::min(fc, (*i)->cycle());
        }
    }
    for (DataDependenceGraph::NodeSet::iterator i = reads.begin();
         i != reads.end(); i++) {
        if ((*i)->isScheduled()) {
            fc = std::min(fc, (*i)->cycle());
 
        }
    }
    for (DataDependenceGraph::NodeSet::iterator i = guards.begin();
         i != guards.end(); i++) {
        if ((*i)->isScheduled()) {
            fc = std::min(fc, (*i)->cycle());
 
        }
    }
    return fc;
}

References guards, reads, and writes.

◆ lastCycle()

int LiveRange::lastCycle ( ) const

Definition at line 103 of file LiveRange.cc.

                           {
    int fc = -1;
    for (DataDependenceGraph::NodeSet::iterator i = writes.begin();
         i != writes.end(); i++) {
        if ((*i)->isScheduled()) {
            fc = std::max(fc, (*i)->cycle());
        }
    }
    for (DataDependenceGraph::NodeSet::iterator i = reads.begin();
         i != reads.end(); i++) {
        if ((*i)->isScheduled()) {
            fc = std::max(fc, (*i)->cycle());
 
        }
    }
    for (DataDependenceGraph::NodeSet::iterator i = guards.begin();
         i != guards.end(); i++) {
        if ((*i)->isScheduled()) {
            fc = std::max(fc, (*i)->cycle());
 
        }
    }
    return fc;
}

References guards, reads, and writes.

◆ noneScheduled()

bool LiveRange::noneScheduled ( ) const

Definition at line 36 of file LiveRange.cc.

                               {
    for (DataDependenceGraph::NodeSet::iterator i = writes.begin();
         i != writes.end(); i++) {
        if ((*i)->isScheduled()) {
            return false;
        }
    }
    for (DataDependenceGraph::NodeSet::iterator i = reads.begin();
         i != reads.end(); i++) {
        if ((*i)->isScheduled()) {
            return false;
        }
    }
    for (DataDependenceGraph::NodeSet::iterator i = guards.begin();
         i != guards.end(); i++) {
        if ((*i)->isScheduled()) {
            return false;
        }
    }
    return true;
}

References guards, reads, and writes.

◆ toString()

TCEString LiveRange::toString ( ) const

Definition at line 59 of file LiveRange.cc.

                          {
    TCEString rv;
    for (DataDependenceGraph::NodeSet::iterator i = writes.begin();
         i != writes.end(); i++) {
        rv << (*i)->toString() << " ";
    }
    for (DataDependenceGraph::NodeSet::iterator i = reads.begin();
         i != reads.end(); i++) {
        rv << (*i)->toString() << " ";
    }
    for (DataDependenceGraph::NodeSet::iterator i = guards.begin();
         i != guards.end(); i++) {
        rv << (*i)->toString() << " ";
    }
    return rv;
}    