OpenASIP 2.2
Loading...
Searching...
No Matches
LiveRange.cc
Go to the documentation of this file.
1/*
2 Copyright (c) 2002-2009 Tampere University.
3
4 This file is part of TTA-Based Codesign Environment (TCE).
5
6 Permission is hereby granted, free of charge, to any person obtaining a
7 copy of this software and associated documentation files (the "Software"),
8 to deal in the Software without restriction, including without limitation
9 the rights to use, copy, modify, merge, publish, distribute, sublicense,
10 and/or sell copies of the Software, and to permit persons to whom the
11 Software is furnished to do so, subject to the following conditions:
12
13 The above copyright notice and this permission notice shall be included in
14 all copies or substantial portions of the Software.
15
16 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
21 FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
22 DEALINGS IN THE SOFTWARE.
23 */
24/**
25 * @file LiveRange.cc
26 *
27 * LiveRange is used to mark one liverange for register renaming purposes.
28 *
29 * @author Heikki Kultala 2011 (heikki.kultala-no.spam-tut.fi)
30 * @note rating: red
31 */
32
33#include "LiveRange.hh"
34
35bool
37 for (DataDependenceGraph::NodeSet::iterator i = writes.begin();
38 i != writes.end(); i++) {
39 if ((*i)->isScheduled()) {
40 return false;
41 }
42 }
43 for (DataDependenceGraph::NodeSet::iterator i = reads.begin();
44 i != reads.end(); i++) {
45 if ((*i)->isScheduled()) {
46 return false;
47 }
48 }
49 for (DataDependenceGraph::NodeSet::iterator i = guards.begin();
50 i != guards.end(); i++) {
51 if ((*i)->isScheduled()) {
52 return false;
53 }
54 }
55 return true;
56}
57
60 TCEString rv;
61 for (DataDependenceGraph::NodeSet::iterator i = writes.begin();
62 i != writes.end(); i++) {
63 rv << (*i)->toString() << " ";
64 }
65 for (DataDependenceGraph::NodeSet::iterator i = reads.begin();
66 i != reads.end(); i++) {
67 rv << (*i)->toString() << " ";
68 }
69 for (DataDependenceGraph::NodeSet::iterator i = guards.begin();
70 i != guards.end(); i++) {
71 rv << (*i)->toString() << " ";
72 }
73 return rv;
74}
75
76int
78 int fc = INT_MAX;
79 for (DataDependenceGraph::NodeSet::iterator i = writes.begin();
80 i != writes.end(); i++) {
81 if ((*i)->isScheduled()) {
82 fc = std::min(fc, (*i)->cycle());
83 }
84 }
85 for (DataDependenceGraph::NodeSet::iterator i = reads.begin();
86 i != reads.end(); i++) {
87 if ((*i)->isScheduled()) {
88 fc = std::min(fc, (*i)->cycle());
89
90 }
91 }
92 for (DataDependenceGraph::NodeSet::iterator i = guards.begin();
93 i != guards.end(); i++) {
94 if ((*i)->isScheduled()) {
95 fc = std::min(fc, (*i)->cycle());
96
97 }
98 }
99 return fc;
100}
101
102int
104 int fc = -1;
105 for (DataDependenceGraph::NodeSet::iterator i = writes.begin();
106 i != writes.end(); i++) {
107 if ((*i)->isScheduled()) {
108 fc = std::max(fc, (*i)->cycle());
109 }
110 }
111 for (DataDependenceGraph::NodeSet::iterator i = reads.begin();
112 i != reads.end(); i++) {
113 if ((*i)->isScheduled()) {
114 fc = std::max(fc, (*i)->cycle());
115
116 }
117 }
118 for (DataDependenceGraph::NodeSet::iterator i = guards.begin();
119 i != guards.end(); i++) {
120 if ((*i)->isScheduled()) {
121 fc = std::max(fc, (*i)->cycle());
122
123 }
124 }
125 return fc;
126}
127
128void
130 writes.clear();
131 reads.clear();
132 guards.clear();
133}
int firstCycle() const
Definition LiveRange.cc:77
bool noneScheduled() const
Definition LiveRange.cc:36
int lastCycle() const
Definition LiveRange.cc:103
DataDependenceGraph::NodeSet reads
Definition LiveRange.hh:40
void clear()
Definition LiveRange.cc:129
DataDependenceGraph::NodeSet guards
Definition LiveRange.hh:41
TCEString toString() const
Definition LiveRange.cc:59
DataDependenceGraph::NodeSet writes
Definition LiveRange.hh:39