llvm dev - Dec 2009 - [LLVMdev] hi, Hi, (Preccessors' Number) < MachineBasicBlock's Number < (Successors's Number), Is it really?

Hi, EveryOne:

I am travelling CFG with MachineFunction. So I want to sure it.
(Preccessors' Number) < MachineBasicBlock's Number <
(Successors's Number), Is it really?

best regards.




      ___________________________________________________________ 
  好玩贺卡等你发，邮箱贺卡全新上线！ 
http://card.mail.cn.yahoo.com/
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://lists.llvm.org/pipermail/llvm-dev/attachments/20091204/e92ab3a6/attachment.html>

On Dec 3, 2009, at 9:52 PM, 任坤 wrote:
> Hi, EveryOne:
> 
> I am travelling CFG with MachineFunction. So I want to sure it.
> (Preccessors' Number) < MachineBasicBlock's Number <
(Successors's Number), Is it really?
> 
Hi 任坤,

I can't say for sure, though I don't think we make assurances that this
is the case. If you want to traverse the CFG, there should be better ways to
perform this. What order do you want your traversal to go? Depth-first?
Breadth-first? Other?

-bw

Hi, Bill.

I am scaning MachineFunction to collect physical registers' define-use
messages.
I have known llc provides dominance tree at MachineFunction level.
I don't confuse to MachineBasicBlock Loop at CFG.
So I don't need to use BasicBlock number messages.

Thanks for your answer.

--- 09年12月4日，周五, Bill Wendling <wendling at apple.com> 写道：

发件人: Bill Wendling <wendling at apple.com>
主题: Re: [LLVMdev] hi, Hi, (Preccessors' Number) < MachineBasicBlock's
Number < (Successors's Number), Is it really?
收件人: "任坤" <hbrenkun at yahoo.cn>
抄送: "llvm" <llvmdev at cs.uiuc.edu>
日期: 2009年12月4日,周五,下午2:12

On Dec 3, 2009, at 9:52 PM, 任坤 wrote:
> Hi, EveryOne:
> 
> I am travelling CFG with MachineFunction. So I want to sure it.
> (Preccessors' Number) < MachineBasicBlock's Number <
(Successors's Number), Is it really?
> 
Hi 任坤,

I can't say for sure, though I don't think we make assurances that this
is the case. If you want to traverse the CFG, there should be better ways to
perform this. What order do you want your traversal to go? Depth-first?
Breadth-first? Other?

-bw




      ___________________________________________________________ 
  好玩贺卡等你发，邮箱贺卡全新上线！ 
http://card.mail.cn.yahoo.com/
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://lists.llvm.org/pipermail/llvm-dev/attachments/20091204/8e30e614/attachment.html>

On Dec 3, 2009, at 9:52 PM, 任坤 wrote:
> I am travelling CFG with MachineFunction. So I want to sure it.
> (Preccessors' Number) < MachineBasicBlock's Number <
(Successors's Number), Is it really?
If the CFG contains loops, how could this be possible?

Anyway, no you can't use MBB numbers for that. Perhaps you need the
MachineDominatorTree analysis?

Regards,
/jakob

yes, Jakob:

 I have found MachineDominatorTree pass.
So I don't need to care MachineBasicBlock's Number.

Best Regards, 



--- 09年12月5日，周六, Jakob Stoklund Olesen <stoklund at 2pi.dk> 写道：

发件人: Jakob Stoklund Olesen <stoklund at 2pi.dk>
主题: Re: [LLVMdev] hi, Hi, (Preccessors' Number) < MachineBasicBlock's
Number < (Successors's Number), Is it really?
收件人: "任坤" <hbrenkun at yahoo.cn>
抄送: "llvm" <llvmdev at cs.uiuc.edu>
日期: 2009年12月5日,周六,上午1:50


On Dec 3, 2009, at 9:52 PM, 任坤 wrote:
> I am travelling CFG with MachineFunction. So I want to sure it.
> (Preccessors' Number) < MachineBasicBlock's Number <
(Successors's Number), Is it really?
If the CFG contains loops, how could this be possible?

Anyway, no you can't use MBB numbers for that. Perhaps you need the
MachineDominatorTree analysis?

Regards,
/jakob




      ___________________________________________________________ 
  好玩贺卡等你发，邮箱贺卡全新上线！ 
http://card.mail.cn.yahoo.com/
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://lists.llvm.org/pipermail/llvm-dev/attachments/20091205/c7bba5d6/attachment.html>