Displaying 3 results from an estimated 3 matches for "compute_df".
Did you mean:
compute_35
2013 Nov 02
0
[LLVMdev] DominanceFrontier/PostDominanceFrontier for PRE
...Caveat: It is at your own risk, as this algorithm is not
proved at all!!!!!
---------------------------
Let DF(N) be { x | x is N's dom-frontier}
Let Dom(N) be { x | x is dominated by N}
"kid" = successor in dominator tree
"succ" = successor in CFG.
compute_df(function f) {
walk f's dominator tree from bottom up {
Let N be the node being visited.
1: DF(N) = union of DF(K) where K is N's immediate kid in
dom-tree
2; DF(N) -= DOM(N)
3: DF(N) += { some N's immediate CFG succ which qualifie...
2013 Nov 02
2
[LLVMdev] DominanceFrontier/PostDominanceFrontier for PRE
Hi all,
Does anyone know how to recreate the DominanceFronter and
PostDominanceFrontier structures using the API of the latest release? To my
knowledge, these are needed to implement a PRE pass (as done in the
past<https://llvm.org/svn/llvm-project/llvm/tags/RELEASE_13/lib/Transforms/Scalar/PRE.cpp>),
but they were removed a while ago for efficiency reasons. Is there a better
way to
2013 Nov 03
4
[LLVMdev] DominanceFrontier/PostDominanceFrontier for PRE
...his algorithm is not
> proved at all!!!!!
>
> ---------------------------
> Let DF(N) be { x | x is N's dom-frontier}
> Let Dom(N) be { x | x is dominated by N}
> "kid" = successor in dominator tree
> "succ" = successor in CFG.
>
> compute_df(function f) {
> walk f's dominator tree from bottom up {
> Let N be the node being visited.
> 1: DF(N) = union of DF(K) where K is N's immediate kid in
> dom-tree
> 2; DF(N) -= DOM(N)
> 3: DF(N) += { some N's immediate...