From: Christopher Li <sparse@chrisli.org>
To: Luc Van Oostenryck <luc.vanoostenryck@gmail.com>
Cc: Dibyendu Majumdar <mobile@majumdar.org.uk>,
Linux-Sparse <linux-sparse@vger.kernel.org>,
Linus Torvalds <torvalds@linux-foundation.org>
Subject: Re: Simple SSA status
Date: Thu, 7 Sep 2017 00:02:07 -0400 [thread overview]
Message-ID: <CANeU7QkPX30OHb_GLqDv=22YJ6aAY5KCe55=QJ17fbNaFqtFVA@mail.gmail.com> (raw)
In-Reply-To: <CAExDi1Qmv5iyZX2GQHa5jb7qTw+F8a3VmBXwBh+7EvpRfkQYtQ@mail.gmail.com>
On Wed, Sep 6, 2017 at 11:46 PM, Luc Van Oostenryck
<luc.vanoostenryck@gmail.com> wrote:
>> For reducible graph that algorithm converge in constant iteration.
>
> Where the 'constant' is a function of the loop complexity (maximum
> nesting level) ...
I think we are talking different things.
My iteration means one pass of the reverse postorder.
In the Keith Cooper et al paper end of first page:
quote "
show that reverse postorder iterative scheme solves these
equations in a single pass over the CFG for reducible graphs.
"
page 2 reference 19 also mention solved in linear time
on reducible graphs.
It is just linear to the size of the CFG if graph is reducible.
I don't recall it is related to maximum nesting level of loops.
For the Simple SSA paper, maybe.
Chris
next prev parent reply other threads:[~2017-09-07 4:02 UTC|newest]
Thread overview: 33+ messages / expand[flat|nested] mbox.gz Atom feed top
2017-08-21 19:39 master merge plans Christopher Li
2017-08-22 13:32 ` Luc Van Oostenryck
2017-08-22 14:47 ` Christopher Li
2017-08-22 15:51 ` Christopher Li
2017-08-22 20:05 ` Luc Van Oostenryck
2017-08-23 20:50 ` Christopher Li
2017-08-29 11:27 ` Christopher Li
2017-09-03 19:24 ` Luc Van Oostenryck
2017-08-22 14:53 ` Dibyendu Majumdar
2017-08-22 14:59 ` Christopher Li
2017-09-03 20:26 ` Simple SSA status Luc Van Oostenryck
2017-09-04 18:29 ` Christopher Li
2017-09-04 20:07 ` Luc Van Oostenryck
2017-09-04 20:37 ` Dibyendu Majumdar
2017-09-04 20:55 ` Luc Van Oostenryck
2017-09-04 21:24 ` Dibyendu Majumdar
2017-09-04 23:31 ` Christopher Li
2017-09-05 0:55 ` Luc Van Oostenryck
2017-09-05 3:28 ` Christopher Li
2017-09-07 2:03 ` Luc Van Oostenryck
2017-09-07 2:15 ` Linus Torvalds
2017-09-07 2:55 ` Christopher Li
2017-09-07 3:17 ` Luc Van Oostenryck
2017-09-07 4:04 ` Christopher Li
2017-09-07 4:49 ` Luc Van Oostenryck
2017-09-07 6:17 ` Christopher Li
2017-09-07 7:38 ` Luc Van Oostenryck
2017-09-07 3:05 ` Luc Van Oostenryck
2017-09-07 2:20 ` Christopher Li
2017-09-07 3:46 ` Luc Van Oostenryck
2017-09-07 4:02 ` Christopher Li [this message]
2017-09-07 4:24 ` Luc Van Oostenryck
2017-09-07 4:33 ` Christopher Li
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to='CANeU7QkPX30OHb_GLqDv=22YJ6aAY5KCe55=QJ17fbNaFqtFVA@mail.gmail.com' \
--to=sparse@chrisli.org \
--cc=linux-sparse@vger.kernel.org \
--cc=luc.vanoostenryck@gmail.com \
--cc=mobile@majumdar.org.uk \
--cc=torvalds@linux-foundation.org \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).