Tarun,
what you are asking for would be a very simple instance
of an Iterative-
Data-Flow-Algorithm. Look in any compiler theory book that has a
chapter on
IDF and you should be able to figure this out for yourself. If that
is what you already
did, and you are worrying about performance, I suggest not doing
worrying, IDF are
typically fast at converging, and especially one that is this simple.
-Peter Lawrence.
On May 4, 2011, at 10:00 AM, llvmdev-request at cs.uiuc.edu wrote:
> On 5/4/11 1:37 AM, tarun agrawal wrote:
>> Thanks John,
>>
>> I know how to iterate through def-use chains and I also have realized
>> the need for an algorithm to do the work. But the algorithm I am able
>> to figure out is not linear in time. It wold be a great help if
>> someone suggest me a way to get all basic-block along all path
>> between
>> two instruction.
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://lists.llvm.org/pipermail/llvm-dev/attachments/20110505/1773d347/attachment.html>
