cmakefile
This commit is contained in:
parent
37df007eca
commit
e141c83b2e
|
|
@ -399,7 +399,6 @@ set(STA_TCL_FILES
|
||||||
dcalc/DelayCalc.tcl
|
dcalc/DelayCalc.tcl
|
||||||
parasitics/Parasitics.tcl
|
parasitics/Parasitics.tcl
|
||||||
sdf/Sdf.tcl
|
sdf/Sdf.tcl
|
||||||
tcl/Compatibility.tcl
|
|
||||||
verilog/Verilog.tcl
|
verilog/Verilog.tcl
|
||||||
)
|
)
|
||||||
|
|
||||||
|
|
|
||||||
|
|
@ -3151,14 +3151,14 @@ Sta::pathDcalcAnalysisPt(Path *path)
|
||||||
}
|
}
|
||||||
|
|
||||||
Vertex *
|
Vertex *
|
||||||
Sta::maxPathCountVertex() const
|
Sta::maxArrivalCountVertex() const
|
||||||
{
|
{
|
||||||
Vertex *max_vertex = nullptr;
|
Vertex *max_vertex = nullptr;
|
||||||
VertexIndex max_count = 0;
|
VertexIndex max_count = 0;
|
||||||
VertexIterator vertex_iter(graph_);
|
VertexIterator vertex_iter(graph_);
|
||||||
while (vertex_iter.hasNext()) {
|
while (vertex_iter.hasNext()) {
|
||||||
Vertex *vertex = vertex_iter.next();
|
Vertex *vertex = vertex_iter.next();
|
||||||
VertexIndex count = vertexPathCount(vertex);
|
VertexIndex count = vertexArrivalCount(vertex);
|
||||||
if (count > max_count) {
|
if (count > max_count) {
|
||||||
max_count = count;
|
max_count = count;
|
||||||
max_vertex = vertex;
|
max_vertex = vertex;
|
||||||
|
|
@ -3168,19 +3168,23 @@ Sta::maxPathCountVertex() const
|
||||||
}
|
}
|
||||||
|
|
||||||
int
|
int
|
||||||
Sta::vertexPathCount(Vertex *vertex) const
|
Sta::vertexArrivalCount(Vertex *vertex) const
|
||||||
{
|
{
|
||||||
return search_->tagGroup(vertex)->arrivalCount();
|
auto tag_group = search_->tagGroup(vertex);
|
||||||
|
if (tag_group)
|
||||||
|
return tag_group->arrivalCount();
|
||||||
|
else
|
||||||
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
int
|
int
|
||||||
Sta::pathCount() const
|
Sta::arrivalCount() const
|
||||||
{
|
{
|
||||||
int count = 0;
|
int count = 0;
|
||||||
VertexIterator vertex_iter(graph_);
|
VertexIterator vertex_iter(graph_);
|
||||||
while (vertex_iter.hasNext()) {
|
while (vertex_iter.hasNext()) {
|
||||||
Vertex *vertex = vertex_iter.next();
|
Vertex *vertex = vertex_iter.next();
|
||||||
count += vertexPathCount(vertex);
|
count += vertexArrivalCount(vertex);
|
||||||
}
|
}
|
||||||
return count;
|
return count;
|
||||||
}
|
}
|
||||||
|
|
|
||||||
|
|
@ -1026,9 +1026,9 @@ public:
|
||||||
TagIndex tagCount() const;
|
TagIndex tagCount() const;
|
||||||
TagGroupIndex tagGroupCount() const;
|
TagGroupIndex tagGroupCount() const;
|
||||||
int clkInfoCount() const;
|
int clkInfoCount() const;
|
||||||
int pathCount() const;
|
int arrivalCount() const;
|
||||||
int vertexPathCount(Vertex *vertex) const;
|
int vertexArrivalCount(Vertex *vertex) const;
|
||||||
Vertex *maxPathCountVertex() const;
|
Vertex *maxArrivalCountVertex() const;
|
||||||
|
|
||||||
LogicValue simLogicValue(const Pin *pin);
|
LogicValue simLogicValue(const Pin *pin);
|
||||||
// Iterator for instances sorted by max driver pin slew.
|
// Iterator for instances sorted by max driver pin slew.
|
||||||
|
|
|
||||||
|
|
@ -5070,9 +5070,9 @@ clk_info_count()
|
||||||
}
|
}
|
||||||
|
|
||||||
int
|
int
|
||||||
path_count()
|
arrival_count()
|
||||||
{
|
{
|
||||||
return Sta::sta()->pathCount();
|
return Sta::sta()->arrivalCount();
|
||||||
}
|
}
|
||||||
|
|
||||||
void
|
void
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue