1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
|
/* Copyright (c) 2012 Massachusetts Institute of Technology
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
#ifndef __DSENT_MODEL_ELECTRICAL_TIMING_TREE_H__
#define __DSENT_MODEL_ELECTRICAL_TIMING_TREE_H__
#include <vector>
#include "util/CommonType.h"
#include "model/timing_graph/ElectricalTimingNode.h"
namespace DSENT
{
using std::vector;
class ElectricalDriver;
class ElectricalTimingTree
{
public:
// The visited number for the next timing run. This needs to be
// global because several timing trees may be created to evaluate
// a single timing path, causing problems
static int msTreeNum;
public:
// Construct timing tree that watches over model_
ElectricalTimingTree(const String& instance_name_, ElectricalModel* model_);
~ElectricalTimingTree();
public:
// Get tree name
const String& getInstanceName() const;
// A wrapper for extractCritPathDelay
// Update the tree num before do extract critical path delay recursively
double performCritPathExtract(ElectricalTimingNode* node_);
// Calculate the delay of the marked critical path from a starting node
double calculateCritPathDelay(ElectricalTimingNode* node_) const;
// Calculate the transition at a node
double calculateNodeTransition(ElectricalTimingNode* node_) const;
// Returns the optimal node to optimize timing (by sizing up) in the critical
// path to reduce critical path delay
ElectricalTimingNode* findNodeForTimingOpt(ElectricalTimingNode* node_) const;
// Perform incremental timing optimization to guarantee that all timing paths from a
// starting node meets a required delay
// Return false if the timing optimization fails to meet the required delay
bool performTimingOpt(ElectricalTimingNode* node_, double required_delay_);
// Return the model
ElectricalModel* getModel();
private:
// Disable the use of copy constructor
ElectricalTimingTree(const ElectricalTimingTree& graph_);
// Recursively calculate delay from a starting node, finding and marking the
// critical path along the way and returns the delay of the critical path
double extractCritPathDelay(ElectricalTimingNode* node_);
public:
// Set the sequence number of the timing tree
static void setTreeNum(int tree_num_);
static int getTreeNum();
private:
// Name of the timing tree
const String m_instance_name_;
// A pointer to the model that contains this node
ElectricalModel* m_model_;
}; // class ElectricalTimingTree
} // namespace DSENT
#endif // __DSENT_MODEL_ELECTRICAL_TIMING_TREE_H__
|
