110448Snilay@cs.wisc.edu/* Copyright (c) 2012 Massachusetts Institute of Technology 210448Snilay@cs.wisc.edu * 310448Snilay@cs.wisc.edu * Permission is hereby granted, free of charge, to any person obtaining a copy 410448Snilay@cs.wisc.edu * of this software and associated documentation files (the "Software"), to deal 510448Snilay@cs.wisc.edu * in the Software without restriction, including without limitation the rights 610448Snilay@cs.wisc.edu * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell 710448Snilay@cs.wisc.edu * copies of the Software, and to permit persons to whom the Software is 810448Snilay@cs.wisc.edu * furnished to do so, subject to the following conditions: 910448Snilay@cs.wisc.edu * 1010448Snilay@cs.wisc.edu * The above copyright notice and this permission notice shall be included in 1110448Snilay@cs.wisc.edu * all copies or substantial portions of the Software. 1210448Snilay@cs.wisc.edu * 1310448Snilay@cs.wisc.edu * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR 1410448Snilay@cs.wisc.edu * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 1510448Snilay@cs.wisc.edu * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE 1610448Snilay@cs.wisc.edu * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER 1710448Snilay@cs.wisc.edu * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 1810448Snilay@cs.wisc.edu * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN 1910448Snilay@cs.wisc.edu * THE SOFTWARE. 2010448Snilay@cs.wisc.edu */ 2110448Snilay@cs.wisc.edu 2210447Snilay@cs.wisc.edu#ifndef __DSENT_MODEL_ELECTRICAL_TIMING_NODE_H__ 2310447Snilay@cs.wisc.edu#define __DSENT_MODEL_ELECTRICAL_TIMING_NODE_H__ 2410447Snilay@cs.wisc.edu 2510447Snilay@cs.wisc.edu#include "util/CommonType.h" 2610447Snilay@cs.wisc.edu 2710447Snilay@cs.wisc.edunamespace DSENT 2810447Snilay@cs.wisc.edu{ 2910447Snilay@cs.wisc.edu class ElectricalModel; 3010447Snilay@cs.wisc.edu 3110447Snilay@cs.wisc.edu class ElectricalTimingNode 3210447Snilay@cs.wisc.edu { 3310447Snilay@cs.wisc.edu public: 3410447Snilay@cs.wisc.edu // The starting visited number flag of all timing nodes 3510447Snilay@cs.wisc.edu static const int TIMING_NODE_INIT_VISITED_NUM; 3610447Snilay@cs.wisc.edu 3710447Snilay@cs.wisc.edu public: 3810447Snilay@cs.wisc.edu ElectricalTimingNode(const String& instance_name_, ElectricalModel* model_); 3910447Snilay@cs.wisc.edu virtual ~ElectricalTimingNode(); 4010447Snilay@cs.wisc.edu 4110447Snilay@cs.wisc.edu public: 4210447Snilay@cs.wisc.edu 4310447Snilay@cs.wisc.edu // Calculate the delay this node contributes 4410447Snilay@cs.wisc.edu virtual double calculateDelay() const = 0; 4510447Snilay@cs.wisc.edu // Calculate the transition at this node 4610447Snilay@cs.wisc.edu virtual double calculateTransition() const = 0; 4710447Snilay@cs.wisc.edu // get maximum of upstream drive resistance 4810447Snilay@cs.wisc.edu virtual double getMaxUpstreamRes() const; 4910447Snilay@cs.wisc.edu // get total amount of downstream load capacitance 5010447Snilay@cs.wisc.edu virtual double getTotalDownstreamCap() const; 5110447Snilay@cs.wisc.edu // Return instance name 5210447Snilay@cs.wisc.edu const String& getInstanceName() const; 5310447Snilay@cs.wisc.edu // get upstream timing nodes 5410447Snilay@cs.wisc.edu vector<ElectricalTimingNode*>* getUpstreamNodes() const; 5510447Snilay@cs.wisc.edu // get downstream timing nodes 5610447Snilay@cs.wisc.edu vector<ElectricalTimingNode*>* getDownstreamNodes() const; 5710447Snilay@cs.wisc.edu // Connect a downstream timing node 5810447Snilay@cs.wisc.edu void addDownstreamNode(ElectricalTimingNode* node_); 5910447Snilay@cs.wisc.edu // Return the node's parent model 6010447Snilay@cs.wisc.edu ElectricalModel* getModel(); 6110447Snilay@cs.wisc.edu const ElectricalModel* getModel() const; 6210447Snilay@cs.wisc.edu // Set/get false path marker 6310447Snilay@cs.wisc.edu void setFalsePath(bool false_path_); 6410447Snilay@cs.wisc.edu bool getFalsePath() const; 6510447Snilay@cs.wisc.edu 6610447Snilay@cs.wisc.edu virtual bool isDriver() const; 6710447Snilay@cs.wisc.edu virtual bool isNet() const; 6810447Snilay@cs.wisc.edu virtual bool isLoad() const; 6910447Snilay@cs.wisc.edu 7010447Snilay@cs.wisc.edu 7110447Snilay@cs.wisc.edu //----------------------------------------------------------------- 7210447Snilay@cs.wisc.edu // Functions for delay optimization 7310447Snilay@cs.wisc.edu //----------------------------------------------------------------- 7410447Snilay@cs.wisc.edu // Return true if the instance has minimum driving strength 7510447Snilay@cs.wisc.edu virtual bool hasMinDrivingStrength() const; 7610447Snilay@cs.wisc.edu // Return true if the instance has maximum driving strength 7710447Snilay@cs.wisc.edu virtual bool hasMaxDrivingStrength() const; 7810447Snilay@cs.wisc.edu // Increase driving strength index by 1 7910447Snilay@cs.wisc.edu virtual void increaseDrivingStrength(); 8010447Snilay@cs.wisc.edu // Decrease driving strength index by 1 8110447Snilay@cs.wisc.edu virtual void decreaseDrivingStrength(); 8210447Snilay@cs.wisc.edu //----------------------------------------------------------------- 8310447Snilay@cs.wisc.edu 8410447Snilay@cs.wisc.edu //----------------------------------------------------------------- 8510447Snilay@cs.wisc.edu // Node variables for critical path delay calculations 8610447Snilay@cs.wisc.edu //----------------------------------------------------------------- 8710447Snilay@cs.wisc.edu // Critical path marker 8810447Snilay@cs.wisc.edu void setCritPath(int crit_path_); 8910447Snilay@cs.wisc.edu int getCritPath() const; 9010447Snilay@cs.wisc.edu // Visited parity marker 9110447Snilay@cs.wisc.edu void setVisitedNum(int visited_parity_); 9210447Snilay@cs.wisc.edu int getVisitedNum() const; 9310447Snilay@cs.wisc.edu // Delay left in this path 9410447Snilay@cs.wisc.edu void setDelayLeft(double delay_left_); 9510447Snilay@cs.wisc.edu double getDelayLeft() const; 9610447Snilay@cs.wisc.edu //----------------------------------------------------------------- 9710447Snilay@cs.wisc.edu 9810447Snilay@cs.wisc.edu 9910447Snilay@cs.wisc.edu private: 10010447Snilay@cs.wisc.edu // Disable copy constructor 10110447Snilay@cs.wisc.edu ElectricalTimingNode(const ElectricalTimingNode& node_); 10210447Snilay@cs.wisc.edu 10310447Snilay@cs.wisc.edu private: 10410447Snilay@cs.wisc.edu // Name of this instance 10510447Snilay@cs.wisc.edu String m_instance_name_; 10610447Snilay@cs.wisc.edu // A pointer to the model that contains this node 10710447Snilay@cs.wisc.edu ElectricalModel* m_model_; 10810447Snilay@cs.wisc.edu // Upstream electrical nets 10910447Snilay@cs.wisc.edu vector<ElectricalTimingNode*>* m_upstream_nodes_; 11010447Snilay@cs.wisc.edu // Downstream electrical nets 11110447Snilay@cs.wisc.edu vector<ElectricalTimingNode*>* m_downstream_nodes_; 11210447Snilay@cs.wisc.edu // False path marker 11310447Snilay@cs.wisc.edu bool m_false_path_; 11410447Snilay@cs.wisc.edu // Critical path index (to next downstream node) 11510447Snilay@cs.wisc.edu int m_crit_path_; 11610447Snilay@cs.wisc.edu // Odd / even path visited (so that you don't have to clear it) 11710447Snilay@cs.wisc.edu int m_visited_num_; 11810447Snilay@cs.wisc.edu // The amount of delay left to the end of the timing path 11910447Snilay@cs.wisc.edu double m_delay_left_; 12010447Snilay@cs.wisc.edu }; 12110447Snilay@cs.wisc.edu 12210447Snilay@cs.wisc.edu} // namespace DSENT 12310447Snilay@cs.wisc.edu 12410447Snilay@cs.wisc.edu#endif // __DSENT_MODEL_ELECTRICAL_TIMING_NODE_H__ 12510447Snilay@cs.wisc.edu 126