Displaying 3 results from an estimated 3 matches for "pqdownheap_35".
2004 May 05
0
[LLVMdev] Testing LLVM on OS X
...ly=inline. Let me make sure I understand how to
interpret this output correctly:
Inliner visiting SCC: .gen_codes_26
Inspecting function: .gen_codes_26
Inlining: cost=100, Call: %tmp.37 = call uint %bi_reverse( uint
%tmp.42, int %tmp.27 ) ; <uint> [#uses=1]
Inliner visiting SCC: .pqdownheap_35
Inspecting function: .pqdownheap_35
Inliner visiting SCC: .build_tree_41
Inspecting function: .build_tree_41
NOT Inlining: cost=501, Call: call void %.pqdownheap_35(
%struct.ct_data* %tmp.2, int %n.1.0 )
NOT Inlining: cost=466, Call: call void %.pqdownheap_35(
%struct.ct_data* %...
2004 May 04
6
[LLVMdev] Testing LLVM on OS X
On Tue, 4 May 2004, Chris Lattner wrote:
> I suspect that a large reason that LLVM does worst than a native C
> compiler with the CBE+GCC is that LLVM generates very low-level C code,
> and I'm not convinced that GCC is doing a very good job (ie, without
> syntactic loops).
Yup, this is EXACTLY what is going on.
I took this very simple C function:
int Array[1000];
void test(int
2004 May 05
2
[LLVMdev] Testing LLVM on OS X
...derstand how to
> interpret this output correctly:
>
> Inliner visiting SCC: .gen_codes_26
> Inspecting function: .gen_codes_26
> Inlining: cost=100, Call: %tmp.37 = call uint %bi_reverse( uint
> %tmp.42, int %tmp.27 ) ; <uint> [#uses=1]
> Inliner visiting SCC: .pqdownheap_35
> Inspecting function: .pqdownheap_35
> Inliner visiting SCC: .build_tree_41
> Inspecting function: .build_tree_41
> NOT Inlining: cost=501, Call: call void %.pqdownheap_35(
> %struct.ct_data* %tmp.2, int %n.1.0 )
> NOT Inlining: cost=466, Call: call void %.pqdow...