Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
A
abc
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
abc
Commits
5de8e60b
Commit
5de8e60b
authored
Apr 06, 2012
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Improving printouts of critical path.
parent
8c1513df
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
6 additions
and
6 deletions
+6
-6
src/base/abci/abcTiming.c
+5
-5
src/map/mapper/mapperTime.c
+1
-1
No files found.
src/base/abci/abcTiming.c
View file @
5de8e60b
...
@@ -932,16 +932,16 @@ float Abc_NtkDelayTrace( Abc_Ntk_t * pNtk, Abc_Obj_t * pOut, Abc_Obj_t * pIn, in
...
@@ -932,16 +932,16 @@ float Abc_NtkDelayTrace( Abc_Ntk_t * pNtk, Abc_Obj_t * pOut, Abc_Obj_t * pIn, in
printf
(
"I/O time: ("
);
printf
(
"I/O time: ("
);
Abc_ObjForEachFanin
(
pNode
,
pFanin
,
k
)
Abc_ObjForEachFanin
(
pNode
,
pFanin
,
k
)
printf
(
"%s%.1f"
,
(
k
?
", "
:
""
),
Abc_NodeReadArrival
(
pFanin
)
->
Worst
);
printf
(
"%s%.1f"
,
(
k
?
", "
:
""
),
Abc_NodeReadArrival
(
pFanin
)
->
Worst
);
if
(
Abc_NodeReadRequired
(
pNode
)
->
Worst
==
-
ABC_INFINITY
)
printf
(
" -> %.1f)"
,
Abc_NodeReadArrival
(
pNode
)
->
Worst
+
Slack
);
printf
(
" -> ?)"
);
else
printf
(
" -> %.1f)"
,
Abc_NodeReadRequired
(
pNode
)
->
Worst
);
}
}
printf
(
"
\n
"
);
printf
(
"
\n
"
);
}
}
printf
(
"Level %3d : "
,
Abc_ObjLevel
(
Abc_ObjFanin0
(
pOut
))
+
1
);
printf
(
"Level %3d : "
,
Abc_ObjLevel
(
Abc_ObjFanin0
(
pOut
))
+
1
);
printf
(
"Primary output
\"
%s
\"
. "
,
Abc_ObjName
(
pOut
)
);
printf
(
"Primary output
\"
%s
\"
. "
,
Abc_ObjName
(
pOut
)
);
printf
(
"Required time = %6.1f. "
,
Abc_NodeRequired
(
pOut
)
->
Worst
);
if
(
Abc_NodeRequired
(
pOut
)
->
Worst
==
0
.
0
)
printf
(
"Required time = %6.1f. "
,
Abc_NodeReadArrival
(
Abc_ObjFanin0
(
pOut
))
->
Worst
);
else
printf
(
"Required time = %6.1f. "
,
Abc_NodeRequired
(
pOut
)
->
Worst
);
printf
(
"Path slack = %6.1f.
\n
"
,
Slack
);
printf
(
"Path slack = %6.1f.
\n
"
,
Slack
);
}
}
Vec_PtrFree
(
vPath
);
Vec_PtrFree
(
vPath
);
...
...
src/map/mapper/mapperTime.c
View file @
5de8e60b
...
@@ -253,7 +253,7 @@ void Map_TimeComputeRequired( Map_Man_t * p, float fRequired )
...
@@ -253,7 +253,7 @@ void Map_TimeComputeRequired( Map_Man_t * p, float fRequired )
ptTimeA
=
Map_Regular
(
p
->
pOutputs
[
i
])
->
tArrival
+
fPhase
;
ptTimeA
=
Map_Regular
(
p
->
pOutputs
[
i
])
->
tArrival
+
fPhase
;
// if external required time can be achieved, use it
// if external required time can be achieved, use it
if
(
p
->
pOutputRequireds
&&
p
->
pOutputRequireds
[
i
].
Worst
>
0
&&
ptTimeA
->
Worst
<=
p
->
pOutputRequireds
[
i
].
Worst
&&
p
->
pOutputRequireds
[
i
].
Worst
<=
fRequired
)
if
(
p
->
pOutputRequireds
&&
p
->
pOutputRequireds
[
i
].
Worst
>
0
&&
ptTimeA
->
Worst
<=
p
->
pOutputRequireds
[
i
].
Worst
)
//
&& p->pOutputRequireds[i].Worst <= fRequired )
ptTime
->
Rise
=
ptTime
->
Fall
=
ptTime
->
Worst
=
p
->
pOutputRequireds
[
i
].
Worst
;
ptTime
->
Rise
=
ptTime
->
Fall
=
ptTime
->
Worst
=
p
->
pOutputRequireds
[
i
].
Worst
;
// if external required cannot be achieved, set the earliest possible arrival time
// if external required cannot be achieved, set the earliest possible arrival time
else
if
(
p
->
pOutputRequireds
&&
p
->
pOutputRequireds
[
i
].
Worst
>
0
&&
ptTimeA
->
Worst
>
p
->
pOutputRequireds
[
i
].
Worst
)
else
if
(
p
->
pOutputRequireds
&&
p
->
pOutputRequireds
[
i
].
Worst
>
0
&&
ptTimeA
->
Worst
>
p
->
pOutputRequireds
[
i
].
Worst
)
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment