Prime Time使用
PrimeTime一般用作sign off的timing check,也可用在DC之后的netlist的timing analysis
一般的使用流程:
1) Read design data,--------------netlist,db,sdf,parasitics,milkway
2) Constrain design,--------------sdc
3) Specify env and analysis condition,
4) Check design and analysis setup,
5) Perform a full analysis,
Read design:
通过set search_path "" 来设置db/lib
set link_path "" (optional)
link_design TOP (指定design top)
read_verilog/read_vhdl 来读入netlist到PrimeTime
read_parasitics/read_sdf 进行annotation
read_sdc/source 进行timing constraints和exception约束
Constraining The Design:
约束clock characteristics
约束input delay at input port
约束output delay at output port
针对clock,create_clock创建,include name,source,period,waveform
clock network,set_clock_uncertainty, set_propagated_clock, set_clock_transiaction, set_clock_latency
create_generated_clock
set_input_delay
set_output_delay
Specify env and analysis condition
Specify process, temperature, voltage
apply case analysis and mode analysis set_case_analysis single/BC_WC/OCV set_case_analysis/set_mode(lib中不同的characteristic)
specify driving cell at input ports, load at output ports set_driving_cell set_load
specify timing exceptions set_min_delay set_max_delay set_disable_timing
specify wire load model and back-annotated set_wire_load_model/read_sdf/read_parastics
Check Design and analysis setup
check timing
report_design
report_port
report_net
report_lib
report_path_group
report_clock
report_wire_load
Performing a Full Analysis
report_timing -delay_type/-from/-to/-through/-rise_through/-rise_from
report_constraint
report_analysis_coverage
report_delay_calculation
PrimeTime中的Design Objects,可以使用get命令, set_input_delay 2.3 [get_ports IN*]

cell---------instance in the design, include reference hierarchical blocks and library cell
lib_cell--------cells in technology library
lib_pin-------pins in library cells
net----------nets in current design
pin-----pins of lower-level cells in the design, can be input/ output/ inout
port-------ports of current design, can be input/ output/ inout
path group----Timing reports organized by path group
Prime Time使用的更多相关文章
- Java 素数 prime numbers-LeetCode 204
Description: Count the number of prime numbers less than a non-negative number, n click to show more ...
- Prime Generator
Peter wants to generate some prime numbers for his cryptosystem. Help him! Your task is to generate ...
- POJ 2739. Sum of Consecutive Prime Numbers
Sum of Consecutive Prime Numbers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 20050 ...
- UVa 524 Prime Ring Problem(回溯法)
传送门 Description A ring is composed of n (even number) circles as shown in diagram. Put natural numbe ...
- Sicily 1444: Prime Path(BFS)
题意为给出两个四位素数A.B,每次只能对A的某一位数字进行修改,使它成为另一个四位的素数,问最少经过多少操作,能使A变到B.可以直接进行BFS搜索 #include<bits/stdc++.h& ...
- hdu 5901 count prime & code vs 3223 素数密度
hdu5901题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5901 code vs 3223题目链接:http://codevs.cn/problem ...
- 最小生成树 prime zoj1586
题意:在n个星球,每2个星球之间的联通需要依靠一个网络适配器,每个星球喜欢的网络适配器的价钱不同,先给你一个n,然后n个数,代表第i个星球喜爱的网络适配器的价钱,然后给出一个矩阵M[i][j]代表第i ...
- 最小生成树 prime poj1258
题意:给你一个矩阵M[i][j]表示i到j的距离 求最小生成树 思路:裸最小生成树 prime就可以了 最小生成树专题 AC代码: #include "iostream" #inc ...
- 最小生成树 prime + 队列优化
存图方式 最小生成树prime+队列优化 优化后时间复杂度是O(m*lgm) m为边数 优化后简直神速,应该说对于绝大多数的题目来说都够用了 具体有多快呢 请参照这篇博客:堆排序 Heapsort / ...
- 最小生成树 prime poj1287
poj1287 裸最小生成树 代码 #include "map" #include "queue" #include "math.h" #i ...
随机推荐
- UVA567
var i,n,j,k,t:longint;a:array[1..20,1..20]of longint; function min(a,b:longint):longint;begin if a&l ...
- android开发中fragment获取context
在用到fragment时无法使用.this来指定当前context内容,android开发中fragment获取context,可以使用getActivity().getApplicationCont ...
- ZeroMQ接口函数之 :zmq_bind - 绑定一个socket
ZeroMQ 官方地址 : http://api.zeromq.org/4-0:zmq-bind zmq_bind(3) ZMQ Manual - ZMQ/3.2.5 Name zmq_bind - ...
- CentOS7 编译安装 Nginx (实测 笔记 Centos 7.0 + nginx 1.6.2)
环境: 系统硬件:vmware vsphere (CPU:2*4核,内存2G,双网卡) 系统版本:CentOS-7.0-1406-x86_64-DVD.iso 安装步骤: 1.准备 1.1 显示系统版 ...
- hdu 5122
只要一个数的后面有比它小的数,这个数就要移,于是从后往前一趟遍历,记录一下这些数的个数就可以了. #include"iostream" #include"stdio.h& ...
- bzoj3083 遥远的国度 && bzoj3626 LCA (树链剖分)
今早刷了两道树剖的题目,用时两小时十五分钟= = 树剖的题目代码量普遍120+ 其实打熟练之后是很容易调的,不熟练的话代码量大可能会因为某些小细节调很久 3083:裸树剖+"换根" ...
- Windows自带压缩解压工具
压缩一个文件: 命令行:makecab fileName.txt fileName.zip 鼠标操作:选中文件-->鼠标右键-->Send to-->Compressed (zipp ...
- linux安装jdk和scala
安装jdk 1.下载jdk 2.在linux中创建一个文件夹java,我习惯放在user下 3.上传jdk安装包到java下,然后解压 4.ect/profile下修改文件,添加环境变量 JAVA_H ...
- Source Insight 3.X 标签插件v1.0发布
Source Insight可以说是一款程序员必备的开发/阅读源码工具,美中不足的是SI没有标签栏,多个源码之间切换很不方便,于是我就乘闲暇之余写了该作品sihook:标签插件;不过严格意义上来说si ...
- RSA+DES动态加密
RSA可以用于加密,其加密强度很高,被人攻克的可能性极小.但是其加密速度很慢,如果对一段长数据进行加密是不现实的.因为无论加密还是解密都需要很长时间.所以通常是先用对称加密算法(DES, AES等)对 ...