Displaying 5 results from an estimated 5 matches for "l04dead".
Did you mean:
0xdead
2016 Jan 30
4
DCE in the presence of control flow.
...arks control dependent edges of those operands as necessary, and branches that generate those edges.
(IE
for each block in RDF(useful block):
mark terminator of block as useful
FWIW, Keith Cooper's slide deck on this has a nice explanation: https://www.cs.rice.edu/~keith/512/2011/Lectures/L04Dead-1up.pdf
We might be able to do this without precomputing an RDF, however. For example, you could solve a data-flow problem on the reverse CFG, where for each block you solve for the "next" live instruction. Then a branch is alive only if the next live instruction for each successor is di...
2016 Jan 30
3
DCE in the presence of control flow.
...arks control dependent edges of those operands as necessary, and branches that generate those edges.
(IE
for each block in RDF(useful block):
mark terminator of block as useful
FWIW, Keith Cooper's slide deck on this has a nice explanation: https://www.cs.rice.edu/~keith/512/2011/Lectures/L04Dead-1up.pdf<https://urldefense.proofpoint.com/v2/url?u=https-3A__www.cs.rice.edu_-7Ekeith_512_2011_Lectures_L04Dead-2D1up.pdf&d=CwMFaQ&c=5VD0RTtNlTh3ycd41b3MUw&r=lFyiPUrFdOHdaobP7i4hoA&m=85DfLWatM6urqzYLUvrWBgn5LKUxCbQ3YheI3kh5XdU&s=C3xP_URm9hGCDdAsg-pKQsJ6sWhEVYgyYAGKbhC6ENU&...
2016 Jan 30
0
DCE in the presence of control flow.
...rands as necessary, and branches that generate those edges.
>
> (IE
>
> for each block in RDF(useful block):
> mark terminator of block as useful
>
>
> FWIW, Keith Cooper's slide deck on this has a nice explanation:
> https://www.cs.rice.edu/~keith/512/2011/Lectures/L04Dead-1up.pdf
>
> We might be able to do this without precomputing an RDF, however. For
> example, you could solve a data-flow problem on the reverse CFG, where for
> each block you solve for the "next" live instruction. Then a branch is
> alive only if the next live instruction...
2016 Jan 29
3
DCE in the presence of control flow.
On Thu, Jan 28, 2016 at 10:09 PM, Hal Finkel <hfinkel at anl.gov> wrote:
>
> ------------------------------
>
> *From: *"David Callahan via llvm-dev" <llvm-dev at lists.llvm.org>
> *To: *"Daniel Berlin" <dberlin at dberlin.org>, "LLVM Dev Mailing list" <
> llvm-dev at lists.llvm.org>
> *Sent: *Thursday, January 28, 2016
2016 Jan 30
0
DCE in the presence of control flow.
...arks control dependent edges of those operands as necessary, and branches that generate those edges.
(IE
for each block in RDF(useful block):
mark terminator of block as useful
FWIW, Keith Cooper's slide deck on this has a nice explanation: https://www.cs.rice.edu/~keith/512/2011/Lectures/L04Dead-1up.pdf<https://urldefense.proofpoint.com/v2/url?u=https-3A__www.cs.rice.edu_-7Ekeith_512_2011_Lectures_L04Dead-2D1up.pdf&d=CwMFaQ&c=5VD0RTtNlTh3ycd41b3MUw&r=lFyiPUrFdOHdaobP7i4hoA&m=85DfLWatM6urqzYLUvrWBgn5LKUxCbQ3YheI3kh5XdU&s=C3xP_URm9hGCDdAsg-pKQsJ6sWhEVYgyYAGKbhC6ENU&...