checking on [3f800000,40000000] [1.000000e+00,2.000000e+00]
| func | e | max ULP | CR | FR | 2 ULP | > 2 ULP | CR% | FR% | 2 ULP% | > 2 ULP% |
|---|---|---|---|---|---|---|---|---|---|---|
| vrsqrte_f32 | -- | 4947968 | 103 | 225 | 216 | 8388065 | 0.001228 | 0.002682 | 0.002575 | 99.993515 |
| FRSR_Mon0 | -- | 564177 | 3 | 8 | 6 | 8388592 | 0.000036 | 0.000095 | 0.000072 | 99.999797 |
| FRSR_Deg0 | -- | 403258 | 0 | 0 | 0 | 8388609 | 0.000000 | 0.000000 | 0.000000 | 100.000000 |
| FRSR_Mon1 | -- | 14751 | 230 | 464 | 466 | 8387449 | 0.002742 | 0.005531 | 0.005555 | 99.986172 |
Memory Optimization (Christer Ericson, GDC 2003)
http://realtimecollisiondetection.net/pubs/GDC03_Ericson_Memory_Optimization.ppt
Cache coherency primer (Fabian Giesen)
https://fgiesen.wordpress.com/2014/07/07/cache-coherency/
Code Clinic 2015: How to Write Code the Compiler Can Actually Optimize (Mike Acton)
http://gdcvault.com/play/1021866/Code-Clinic-2015-How-to
| # Make assembly listings generated by clang -g -S more human readable. | |
| import re | |
| import sys | |
| files = {} | |
| def replace(text, pattern, replacement): | |
| return re.sub(pattern, replacement, text, 0, re.M) |
| // The original author of this software is David M. Gay. | |
| // RAD modifications from here down to the copyright notice | |
| // Actual RAD version of this includes rrCore.h which does | |
| // (among other things) endianness detection - you'll have to | |
| // do that yourself. | |
| #include "dtoa.h" | |
| // Again, we normally use our own assert macros here. |
Locate the section for your github remote in the .git/config file. It looks like this:
[remote "origin"]
fetch = +refs/heads/*:refs/remotes/origin/*
url = git@github.com:joyent/node.git
Now add the line fetch = +refs/pull/*/head:refs/remotes/origin/pr/* to this section. Obviously, change the github url to match your project's URL. It ends up looking like this: