search for: jvt

...ust a gdb artifact. I've been tracking this back a > little further, and it seems there's at least an origin propagation problem: > > (gdb) list > 281 goto value_to_pointer_error; > 282 } > 283 else { > 284 if (jl_is_cpointer_type(jvt) && jl_tparam0(jvt) == jt) { > 285 void *ptr = jl_unbox_voidpointer(v); > 286 assert(__msan_test_shadow(&ptr,sizeof(void**)) == -1); > 287 return (void*)ptr; > 288 } > 289 } > 290 > (gdb) p __msan_p...

...little further, and it seems there's at least an origin propagation > problem: > >> > >> (gdb) list > >> 281 goto value_to_pointer_error; > >> 282 } > >> 283 else { > >> 284 if (jl_is_cpointer_type(jvt) && jl_tparam0(jvt) == jt) { > >> 285 void *ptr = jl_unbox_voidpointer(v); > >> 286 assert(__msan_test_shadow(&ptr,sizeof(void**)) == > -1); > >> 287 return (void*)ptr; > >> 288 } > &gt...

The code for ccall looks right. Sounds like you have a very small range of instructions where an uninitialized value appear. You could try debugging at asm level. Shadow for b should be passed at offset 0 in __msan_param_tls. MSan could propagate shadow through arithmetic and even some logic operations (like select). It could be that b is clean on function entry, but then something uninitialized

Dear all, I have been going through below mentioned update. http://web.mit.edu/xiphmont/Public/theora/demo.html I found this line- Timothy Terriberry estimates a simple self-training range-coding backend could be reasonably expected to decrease bit usage overhead by 15-20%. Is it really true? I found one implementation.... http://svn.xiph.org/trunk/ghost/libentcode/ Did anyone verified this

Dear all I'm currently using a simple encoding implementation based on the encoding example delivered with theora. Now i tried to change the quality of the output file. Its my understanding, that either a bitrate can be set for Constant Bitrate (CBR) encoding, or a quality (0-63) for Variable Bitrate (VBR). As you might know, the basic Encoder Example uses the so-called 2-Pass method for

Hi, Is there anything special I need to know about VP3's IDCT? I mean besides the fact that there are separate IDCTs to handle sparse coefficient matrices. Are the IDCT functions mathematically equivalent to any textbook IDCT functions? Thanks... -- -Mike Melanson --- >8 ---- List archives: http://www.xiph.org/archives/ Ogg project homepage: http://www.xiph.org/ogg/ To

Hello list. I'm trying to rebuild the 2.6.9.67.0.20.EL kernel, but it fails even without modifications. How did I try it? Created a (non-root) build environment (not a mock ) Installed the kernel.scr.rpm and did a rpmbuild -ba --target=`uname -m` kernel-2.6.spec 2> prep-err.log | tee prep-out.log The build failed at the end: Processing files: kernel-xenU-devel-2.6.9-67.0.20.EL Checking

...#N!onXSlVYt)2&>6b%n^rMzG0%b)<ptb&?6Rb_p2#gG&C6~N1r^^Vt291 z-3M!1GKatsI0=M^T#0SSd#ySC2FAi`Nd|sC3Nq6rq$<xS08NPlh$lA+Pu=TGt#&&e zMIG=+HE8TJ33BvKK!U8A1)x^*^4K1K@~|@lKuoLwFPrxGPzW5rcNQ9yP7y!pjrxv9 z75kDvGeyhyr+DDLJpGb&IlSbfZpTmM8<ocHnalpiC7koc at 7G2(++Ems`p{_krJ(}! zMjVtRmPHbqp>6))<capfKY5s_?Xgq>U at QPsvF^!qsamI_QzV|K{V<X|(Vgq-d+6MJ zYf`S&J)L6zo;$TwlA9-#hS{^OMW#}Un-0G5sT-Mm{NU2Nx}t&p3yPT%I!00H28K;_ zj?m+N&m)EwvkoQU0DZ(Oi6+y at izyfmb0;=MH4&w=6TvTpVLp#f=2 at vZ+FP8v-5~7S zc9`n=<jH!Iq!wFeti`M2hTwqz;;~+`kUa1=1XlyU$c at M+tVPMzr9PNShry()...