Explore >> Select a destination


You are here

www.a11yproject.com
| | a11yproject.com
0.6 parsecs away

Travel
| | The numeronym 'a11y' is shorthand for 'accessibility.'
| | a11yproject.com
2.5 parsecs away

Travel
| | The Web Accessibility Initiative is W3C's effort to improve accessibility of the Web for people with disabilities.
| | a11yproject.com
2.9 parsecs away

Travel
| | Key facts about web accessibility initiative, what it is, and why it exists.
| | blog.jak-linux.org
140.5 parsecs away

Travel
| 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.