[LLVMdev] A new project proposal for LLVM and calling help from a chinese student
evan.cheng at apple.com
Thu Oct 30 18:28:29 PDT 2008
On Oct 30, 2008, at 6:23 PM, Star wrote:
> Hi, Evan.
> I'm new in LLVM project developing.
> How should I work on the mainline? I have check out the latest copy
> of LLVM
> from Subvresion using the Read-Only account.
> Do you mean I should provide the patch to the mainline periodic in
> LLVMDEV mailing list?
To start, yes! After a few patches, you'll have commit privilege. You
can then commit patches directly. We'll do review after commit.
> Anyway, thanks for your advice :)
>> -----Original Message-----
>> From: Evan Cheng [mailto:evan.cheng at apple.com]
>> Sent: Thursday, October 30, 2008 11:54 PM
>> To: LLVM Developers Mailing List
>> Subject: Re: [LLVMdev] A new project proposal for LLVM and calling
>> helpfrom a chinese student
>> This is an excellent project. We look forward to seeing your work!
>> Is it possible for you to implement your work on the mainline and
>> contribute back patches along the way? That way, the community can
>> offer suggestions and we will try *harder* not to break your pass.
>> On Oct 29, 2008, at 10:39 PM, Star wrote:
>>> Hi, Benoit,
>>> Thanks very much for your advice.
>>> You see the algorithm greatly improve the performance of liveness
>>> However, it seems still not efficient.
>>> First, it is inefficient in space. You have to pre-compute all Tq
>>> for every
>>> Tq and save them, even though only the highest nodes of Tq are
>>> needed for a
>>> given query(q,v); Second, it is inefficient in time. Given any
>>> you have to traverse all Tq to find the highest nodes. When the Tq
>>> large, it maybe will cost a lot. To conquer this problem, you first
>>> nodes according to dominance, and then the "highest node" will be
>>> the first
>>> node. However, when many nodes are not dominated by each other, you
>>> have to
>>> traverse them.
>>> In fact, I think the highest node proposed in your new slice is very
>>> to the entry of SCC if the node is a loop entry. So, maybe I could
>>> use this
>>> information to improve this algorithm, even though I don't know
>>> clearly how
>>> to improve it now.
>>> Thanks again, I will try to implement it in LLVM, and further more,
>>> try my
>>> best to improve it.
>>> Best wishes,
>>> -----Original Message-----
>>> From: Benoit Boissinot [mailto:bboissin at gmail.com]
>>> Sent: Wednesday, October 29, 2008 10:06 PM
>>> To: LLVM Developers Mailing List
>>> Cc: 谭明星
>>> Subject: Re: [LLVMdev] A new project proposal for LLVM and calling
>>> help from
>>> a chinese student
>>>> On Oct 28, 2008, at 10:10 AM, 谭明星 wrote:
>>>>> PS: The following are links about this paper:
>>> I've put the slides from CGO online:
>>> They should be much better than the one from my presentation at
>>> LLVM Developers mailing list
>>> LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu
> LLVM Developers mailing list
> LLVMdev at cs.uiuc.edu http://llvm.cs.uiuc.edu
More information about the llvm-dev