Branch Coverage

deps/libgit2/src/tsort.c

Criterion	Covered	Total	%
branch	18	134	13.4

line	true	false	branch
32	0	631	assert(size > 0);
40	348	283	if (cmp(x, lx, payload) < 0)
43	0	283	else if (cmp(x, lx, payload) == 0) {
45	0	0	while (cmp(x, dst[i], payload) == 0)
54	177	293	if (val < 0) {
55	79	98	if (c - l <= 1) return c;
57	293	0	} else if (val > 0) {
58	204	89	if (r - c <= 1) return c + 1;
64	0	0	} while (cmp(x, cx, payload) == 0);
80	983	422	for (i = start; i < size; i++) {
83	352	631	if (cmp(dst[i - 1], dst[i], payload) <= 0)
89	1330	631	for (j = (int)i - 1; j >= location; j--) {
112	0	0	while (start < end) {
127	0	0	if (size - start == 1)
130	0	0	if (start >= size - 2) {
131	0	0	if (store->cmp(dst[size - 2], dst[size - 1], store->payload) > 0) {
140	0	0	if (store->cmp(dst[start], dst[start + 1], store->payload) <= 0) {
160	0	0	while (n >= 64) {
169	0	0	if (stack_curr < 2)
172	0	0	else if (stack_curr == 2) {
180	0	0	return !((A <= B + C) || (B <= C));
	0	0	return !((A <= B + C) || (B <= C));
186	0	0	if (store->alloc < new_size) {
196	0	0	if (tempstore == NULL)
215	0	0	if (resize(store, MIN(A, B)) < 0)
221	0	0	if (A < B) {
226	0	0	for (k = curr; k < curr + A + B; k++) {
227	0	0	if ((i < A) && (j < curr + A + B)) {
	0	0	if ((i < A) && (j < curr + A + B)) {
228	0	0	if (store->cmp(storage[i], dst[j], store->payload) <= 0)
232	0	0	} else if (i < A) {
242	0	0	for (k = curr + A + B - 1; k >= curr; k--) {
243	0	0	if ((i >= 0) && (j >= curr)) {
	0	0	if ((i >= 0) && (j >= curr)) {
244	0	0	if (store->cmp(dst[j], storage[i], store->payload) > 0)
248	0	0	} else if (i >= 0)
262	0	0	if (stack_curr <= 1)
266	0	0	if ((stack_curr == 2) && (stack[0].length + stack[1].length == size)) {
	0	0	if ((stack_curr == 2) && (stack[0].length + stack[1].length == size)) {
274	0	0	else if ((stack_curr == 2) && (stack[0].length <= stack[1].length)) {
	0	0	else if ((stack_curr == 2) && (stack[0].length <= stack[1].length)) {
280	0	0	else if (stack_curr == 2)
288	0	0	if (A <= B + C) {
289	0	0	if (A < C) {
299	0	0	} else if (B <= C) {
348	422	0	if (size < 64) {
362	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
363	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
364	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
367	0	0	if (!check_invariant(run_stack, stack_curr)) {
372	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();
	0	0	PUSH_NEXT();