Explore >> Select a destination
|
You are here 
|
idea.popcount.org | ||
| | | | |
gist.github.com
|
|
| | | | | Get process name and argv in Solaris from /proc/[pid/psinfo - solaris_getprocs.c | |
| | | | |
blog.jak-linux.org
|
|
| | | | | The following program, compiled with clang 1.1, runs 500 times faster than the gcc4.5-compiled code (in both cases with -O2): #include #define len 1000000000L unsigned long f(unsigned long a, unsigned long b) __attribute__((noinline)); int main() { printf("%lu\n", f(0, 2*len)); return 0; } unsigned long f(unsigned long a, unsigned long b) { unsigned long sum = 0; for (; a < b; a++) sum += a; return sum; } Now, I would be interested to see what's happening here. I took a look at the assembler code both compilers create, but the only thing I found out so far is that gcc's assembly is easier to understand - 50 lines (gcc) vs 134 lines (clang). If someone knows the answer, please tell me. | |
| | | | |
yurisk.info
|
|
| | | | | Yuri Slobodyanyuk's blog on IT Security and Networking - | |
| | | | |
www.openedr.com
|
|
| | | Endpoint Detection and Response (EDR), identify and respond to cyber threats instantly. Protect your endpoints using the EDR software tool from OpenEDR® | ||
