ok.tan.summary

quartus下实现的简易人羊白菜过河问题

--------------------------------------------------------------------------------------
Timing Analyzer Summary
--------------------------------------------------------------------------------------

Type           : Worst-case tsu
Slack          : N/A
Required Time  : None
Actual Time    : 16.000 ns
From           : a[2]
To             : count1[2]
From Clock     : 
To Clock       : m
Failed Paths   : 0

Type           : Worst-case tco
Slack          : N/A
Required Time  : None
Actual Time    : 34.000 ns
From           : n[0]
To             : b[6]
From Clock     : m
To Clock       : 
Failed Paths   : 0

Type           : Worst-case th
Slack          : N/A
Required Time  : None
Actual Time    : 4.000 ns
From           : a[2]
To             : n[0]
From Clock     : 
To Clock       : m
Failed Paths   : 0

Type           : Worst-case Minimum tco
Slack          : N/A
Required Time  : None
Actual Time    : 8.000 ns
From           : kongzhi:a1|temp[3]
To             : disp[3]
From Clock     : clk
To Clock       : 
Failed Paths   : 0

Type           : Clock Setup: 'm'
Slack          : N/A
Required Time  : None
Actual Time    : 40.00 MHz ( period = 25.000 ns )
From           : b1_temp[3]
To             : count1[2]
From Clock     : m
To Clock       : m
Failed Paths   : 0

Type           : Clock Setup: 'clk'
Slack          : N/A
Required Time  : None
Actual Time    : 71.43 MHz ( period = 14.000 ns )
From           : kongzhi:a1|temp[3]
To             : kongzhi:a1|temp[5]
From Clock     : clk
To Clock       : clk
Failed Paths   : 0

Type           : Total number of failed paths
Slack          : 
Required Time  : 
Actual Time    : 
From           : 
To             : 
From Clock     : 
To Clock       : 
Failed Paths   : 0

--------------------------------------------------------------------------------------