[LLVMdev] Finding Merge nodes in CFG

[ambika at cse.iitb.ac.in]

Actually I have collected some pointer information in the form [ p -> a,c
]. Now suppose at some node I have information as [p->a,c]. Now i want to
find a merge node above this node where this information is actually
geting merged.
So if I get a merge node above this, I can check in its predecessors if
their out has only [p->a] or [p->c] and if not so then I will look for the
next merge node above this one, and so on.

> ambika wrote:
>> Hi,
>>
>> I have basic block and I want to find a merge node just above this basic
>> block.
>> How can I do this?
>>
>
> Can you clarify what you mean by a "merge node?"  Are you looking for
> the proper place to insert a phi node?  Are you trying to find the first
> basic block that dominates the basic block of interest, or do you mean
> something else entirely?
>
> -- John T.
>
>> Thanks in advance.
>>
>> regards,
>> Ambika
>> _______________________________________________
>> LLVM Developers mailing list
>> LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu
>> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev
>>
>
>