| Pshortestpath(Globals, ST_Ppoly_t, CArray, ST_Ppoly_t) |   | 86% | | 82% | 13 | 44 | 22 | 127 | 0 | 1 |
| growpnls(Globals, int) | | 64% | | 66% | 4 | 7 | 8 | 19 | 0 | 1 |
| realloc2(ST_triangle_t[], int) | | 0% | | 0% | 3 | 3 | 6 | 6 | 1 | 1 |
| malloc2(int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| growtris(Globals, int) | | 70% | | 62% | 3 | 5 | 5 | 13 | 0 | 1 |
| growops(Globals, int) | | 72% | | 75% | 2 | 5 | 4 | 13 | 0 | 1 |
| growdq(Globals, int) | | 70% | | 75% | 2 | 5 | 4 | 13 | 0 | 1 |
| triangulate(Globals, ST_pointnlink_t[], int) | | 91% | | 87% | 1 | 5 | 2 | 17 | 0 | 1 |
| shortest__c() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| realloc(ST_pointnlink_t[], int) | | 92% | | 75% | 1 | 3 | 1 | 6 | 0 | 1 |
| isdiagonal(int, int, ST_pointnlink_t[], int) | | 100% | | 95% | 1 | 12 | 0 | 17 | 0 | 1 |
| loadtriangle(Globals, __ptr__, __ptr__, __ptr__) | | 100% | | 100% | 0 | 3 | 0 | 18 | 0 | 1 |
| connecttris(Globals, int, int) | | 100% | | 91% | 1 | 7 | 0 | 13 | 0 | 1 |
| intersects(ST_pointf, ST_pointf, ST_pointf, ST_pointf) | | 100% | | 89% | 3 | 15 | 0 | 13 | 0 | 1 |
| between(ST_pointf, ST_pointf, ST_pointf) | | 100% | | 100% | 0 | 4 | 0 | 10 | 0 | 1 |
| finddqsplit(Globals, ST_pointnlink_t) | | 100% | | 100% | 0 | 5 | 0 | 9 | 0 | 1 |
| marktripath(Globals, int, int) | | 100% | | 100% | 0 | 6 | 0 | 13 | 0 | 1 |
| add2dq(Globals, int, ST_pointnlink_t) | | 100% | | 83% | 1 | 4 | 0 | 12 | 0 | 1 |
| pointintri(Globals, int, ST_pointf) | | 100% | | 87% | 1 | 5 | 0 | 7 | 0 | 1 |
| ccw(ST_pointf, ST_pointf, ST_pointf) | | 100% | | 100% | 0 | 3 | 0 | 4 | 0 | 1 |
| splitdq(Globals, int, int) | | 100% | | 100% | 0 | 2 | 0 | 6 | 0 | 1 |
| malloc(int) | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| static {...} | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |