search for: aech

This looks wrong to me, though the x86 backend produces code that does the right thing (reads each element once). If you change the code (see below) to read each element twice, llvm-gcc still does the right thing but llvm-g++ does not (i.e. it fails to read aech location twice). Current versions of gcc/g++ also look wrong. All 4 compilers (gcc,g++,llvm-gcc,llvm-g++) do the right thing when the array is global. John #define N 3 typedef volatile int vint; int sum(vint a[N]) { int sum = 0; unsigned i; for (i = 0; i < N; i++) sum += a[...

Hi, I encountered a problem about volatile quantifier when using llvm-gcc, here is the example: #define N 10 int sum(volatile int a[N]) { int sum = 0; unsigned i = 0; for (i = 0; i < N; ++i) sum += a[i]; return sum; } If I compile it as C code, then llvm-gcc will dump: define i32 @sum(i32* nocapture %a) nounwind { bb1.thread: %0 = volatile load i32* %a, align 4

People who use "asterisk -r" already know that if you don't try it as root (for example webservers), you don't get access. Of course you can chmod it aech time you start asterisk, but that gets annoying after two times. I have made a patch (against HEAD and 1.0.5) which makes it possible for you (=asterisk admin) to configure the ownership and permissions of /var/run/asterisk.ctl. If you need this feature, see http://bugs.digium.com/bug_view_page.p...

...llo, friends! I vahe a problem using prototype1.4 in IE6. I am trying to create bandwidth speed test tool. The idea is to download one by one X times (i.e. 10) one and the same ASCII-file with size = 1MB. I would like to measure time and speed of each run, to display the intermediate results after aech run and finally after all X rund display total results as average of all runs. But when I run my script with 10 iterations and 1MB filesize on a 1Mbps link I get very strange numbers: about 2 seconds per iterations or 10Mbps in less then 20 seconds! I tried to use asynchronous=false option, but in...