[LLVMdev] The implementation algorithm behind LLVM's RegionInfo class
Paul Vario
paul.paul.mit at gmail.com
Fri Jun 27 16:07:55 PDT 2014
The draft is pretty clearly written (with some typos that correct
themselves).
I was just thinking if the implementation is only based on empirical
studies of example CFGs, then under what condition it fails. My OpenCL
barrier work right now is mainly using DT and PDT trees (instead of
dominance frontier). But the algorithm looks similar to what was
implemented in regioninfo's findRegionsWithEntry function. I am trying to
understand the connection between the two a bit better so that I can
maximize the re-use of what is already existing in the LLVM. I will keep
you updated with the progress. Thanks.
Best,
Paul
On Fri, Jun 27, 2014 at 3:55 PM, Tobias Grosser <tobias at grosser.es> wrote:
> On 27/06/2014 22:43, Paul Vario wrote:
>
>> Thanks very much for the quick response. I have read the text many times,
>> but it was not very clear to me why checking the two conditions involving
>> dominance frontiers is equivalent to proving the pair {entry, exit}
>> defines
>> a refined region. I was asking for an mathematical proof really. It sounds
>> to me like there should be a theorem or two in the graph theory endorsing
>> it. Or do you mean, the implementation is solely based on empirical
>> observation instead of theory. The reason I am interested in the
>> formalization is that I find the current RegionInfo implementation very
>> helpful in defining regions in between barriers in the OpenCL
>> implementation on CPU. I haven't found a test case that breaks it. I got
>> the right intuition, just could not figure out a way to formally prove it,
>> neither did I find one in your regioninfo draft.
>>
>
> The code was written as a student project during my masters and I never
> got around to write a paper or a formal mathematical proof. I believe the
> description should give an intuition for the prove, but I am currently a
> little too loaded to do it myself. Obviously, I would be interested in any
> kind of further formalisation. Is there a specific part of the description
> that is unclear to you and that would allow you to possibly develop a proof?
>
> Also, please keep me updated with your OpenCL barrier work. This sounds
> very interesting.
>
> Cheers,
> Tobias
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20140627/fc7e5146/attachment.html>
More information about the llvm-dev
mailing list