Displaying 5 results from an estimated 5 matches for "ct_data".
Did you mean:
ctx_data
2004 May 05
0
[LLVMdev] Testing LLVM on OS X
...ll 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* %tmp.2, int 1 )
NOT Inlining: cost=466, Call: call void %.pqdownheap_35(
%struct.ct_data* %tmp.2, int 1 )
NOT Inlining: cost=406, Call: call void %.gen_codes_26(
%struct.ct_data* %tm...
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
...mp.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* %tmp.2, int 1 )
> NOT Inlining: cost=466, Call: call void %.pqdownheap_35(
> %struct.ct_data* %tmp.2, int 1 )
> NOT Inlining: cost=406, Call: call void %.gen_codes_26...
2002 Jan 30
1
Patch: update zlib/* to 1.1.3
...d_len = stored_len << 3;
- s->method = STORED;
- } else
-#endif /* STORED_FILE_OK */
-
#ifdef FORCE_STORED
if (buf != (char*)0) { /* force stored block */
#else
@@ -997,25 +988,32 @@
#endif
send_bits(s, (STATIC_TREES<<1)+eof, 3);
compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
+#ifdef DEBUG
s->compressed_len += 3 + s->static_len;
+#endif
} else {
send_bits(s, (DYN_TREES<<1)+eof, 3);
send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,
max_blindex+1...
2007 Sep 22
0
rsync build on IA64 using icc
...2): remark #310: old-style parameter list (anachronism)
deflate_state *s;
^
zlib/trees.c(456): remark #310: old-style parameter list (anachronism)
deflate_state *s;
^
zlib/trees.c(457): remark #310: old-style parameter list (anachronism)
ct_data *tree; /* the tree to restore */
^
zlib/trees.c(458): remark #310: old-style parameter list (anachronism)
int k; /* node to move down */
^
zlib/trees.c(491): remark #310: old-style parameter list (anachronism)
deflate_state *s;...