| unifyTrees(int, int, int[], Term[], Term[], int[], int, int) |  | 0% | | 0% | 35 | 35 | 50 | 50 | 1 | 1 |
| checkForInternalOccurencesOfVarInTerm(int, int, Term, int) | | 0% | | 0% | 16 | 16 | 25 | 25 | 1 | 1 |
| evalExpression(Prolog, EvaluableTerm) |  | 53% | | 60% | 3 | 6 | 8 | 21 | 0 | 1 |
| createStructList(Collection) | | 0% | | 0% | 3 | 3 | 13 | 13 | 1 | 1 |
| structListIterator(Struct, boolean) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| leftMostChildsPost(int, int[]) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| unifyBranchTwo(Term, Term, int, int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| unifyBranch(Term, Term, int, int) | | 91% | | 82% | 5 | 15 | 4 | 29 | 0 | 1 |
| setCurrentExecCtx(int) | | 65% | | 50% | 1 | 2 | 1 | 5 | 0 | 1 |
| getUniqueExecutionCtxID() | | 66% | | 50% | 1 | 2 | 1 | 3 | 0 | 1 |
| variant(Term) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| wrapWithID(Term) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getKeysForCp(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| wrapWithID(Term, int) | | 93% | | 87% | 1 | 5 | 1 | 7 | 0 | 1 |
| resolve(Term) | | 92% | | 75% | 1 | 3 | 0 | 5 | 0 | 1 |
| resolveArgs(Struct, int) | | 100% | | 100% | 0 | 3 | 0 | 9 | 0 | 1 |
| resolveFaster(Term, int) | | 100% | | 100% | 0 | 3 | 0 | 10 | 0 | 1 |
| unify(Term, Term) | | 100% | | 100% | 0 | 3 | 0 | 3 | 0 | 1 |
| BindingsTable() | | 100% | | n/a | 0 | 1 | 0 | 6 | 0 | 1 |
| setLink(int, int, Term, int) | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| collectGarbage(int) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| collectGarbageSmall() | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| flatCopy(Term, int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| unWrap(Term) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| expandLinkTable(int) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |