Branch Coverage

deps/libgit2/deps/zlib/infback.c

Criterion	Covered	Total	%
branch	0	214	0.0

line	true	false	branch
37	0	0	if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
	0	0	if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
	0	0	if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
40	0	0	if (strm == Z_NULL || window == Z_NULL ||
	0	0	if (strm == Z_NULL || window == Z_NULL ||
	0	0	if (strm == Z_NULL || window == Z_NULL ||
41	0	0	windowBits < 8 || windowBits > 15)
44	0	0	if (strm->zalloc == (alloc_func)0) {
52	0	0	if (strm->zfree == (free_func)0)
60	0	0	if (state == Z_NULL) return Z_MEM_ERROR;
273	0	0	if (strm == Z_NULL || strm->state == Z_NULL)
	0	0	if (strm == Z_NULL || strm->state == Z_NULL)
283	0	0	have = next != Z_NULL ? strm->avail_in : 0;
294	0	0	if (state->last) {
299	0	0	NEEDBITS(3);
	0	0	NEEDBITS(3);
	0	0	NEEDBITS(3);
329	0	0	NEEDBITS(32);
	0	0	NEEDBITS(32);
	0	0	NEEDBITS(32);
330	0	0	if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
341	0	0	while (state->length != 0) {
343	0	0	PULL();
	0	0	PULL();
344	0	0	ROOM();
	0	0	ROOM();
345	0	0	if (copy > have) copy = have;
346	0	0	if (copy > left) copy = left;
360	0	0	NEEDBITS(14);
	0	0	NEEDBITS(14);
	0	0	NEEDBITS(14);
368	0	0	if (state->nlen > 286 || state->ndist > 30) {
	0	0	if (state->nlen > 286 || state->ndist > 30) {
378	0	0	while (state->have < state->ncode) {
379	0	0	NEEDBITS(3);
	0	0	NEEDBITS(3);
	0	0	NEEDBITS(3);
383	0	0	while (state->have < 19)
390	0	0	if (ret) {
399	0	0	while (state->have < state->nlen + state->ndist) {
402	0	0	if ((unsigned)(here.bits) <= bits) break;
403	0	0	PULLBYTE();
	0	0	PULLBYTE();
405	0	0	if (here.val < 16) {
410	0	0	if (here.val == 16) {
411	0	0	NEEDBITS(here.bits + 2);
	0	0	NEEDBITS(here.bits + 2);
	0	0	NEEDBITS(here.bits + 2);
413	0	0	if (state->have == 0) {
422	0	0	else if (here.val == 17) {
423	0	0	NEEDBITS(here.bits + 3);
	0	0	NEEDBITS(here.bits + 3);
	0	0	NEEDBITS(here.bits + 3);
430	0	0	NEEDBITS(here.bits + 7);
	0	0	NEEDBITS(here.bits + 7);
	0	0	NEEDBITS(here.bits + 7);
436	0	0	if (state->have + copy > state->nlen + state->ndist) {
441	0	0	while (copy--)
447	0	0	if (state->mode == BAD) break;
450	0	0	if (state->lens[256] == 0) {
464	0	0	if (ret) {
473	0	0	if (ret) {
483	0	0	if (have >= 6 && left >= 258) {
	0	0	if (have >= 6 && left >= 258) {
485	0	0	if (state->whave < state->wsize)
495	0	0	if ((unsigned)(here.bits) <= bits) break;
496	0	0	PULLBYTE();
	0	0	PULLBYTE();
498	0	0	if (here.op && (here.op & 0xf0) == 0) {
	0	0	if (here.op && (here.op & 0xf0) == 0) {
503	0	0	if ((unsigned)(last.bits + here.bits) <= bits) break;
504	0	0	PULLBYTE();
	0	0	PULLBYTE();
512	0	0	if (here.op == 0) {
516	0	0	ROOM();
	0	0	ROOM();
524	0	0	if (here.op & 32) {
531	0	0	if (here.op & 64) {
539	0	0	if (state->extra != 0) {
540	0	0	NEEDBITS(state->extra);
	0	0	NEEDBITS(state->extra);
	0	0	NEEDBITS(state->extra);
549	0	0	if ((unsigned)(here.bits) <= bits) break;
550	0	0	PULLBYTE();
	0	0	PULLBYTE();
552	0	0	if ((here.op & 0xf0) == 0) {
557	0	0	if ((unsigned)(last.bits + here.bits) <= bits) break;
558	0	0	PULLBYTE();
	0	0	PULLBYTE();
563	0	0	if (here.op & 64) {
572	0	0	if (state->extra != 0) {
573	0	0	NEEDBITS(state->extra);
	0	0	NEEDBITS(state->extra);
	0	0	NEEDBITS(state->extra);
577	0	0	if (state->offset > state->wsize - (state->whave < state->wsize ?
578	0	0	left : 0)) {
587	0	0	ROOM();
	0	0	ROOM();
589	0	0	if (copy < left) {
597	0	0	if (copy > state->length) copy = state->length;
602	0	0	} while (--copy);
603	0	0	} while (state->length != 0);
609	0	0	if (left < state->wsize) {
610	0	0	if (out(out_desc, state->window, state->wsize - left))
634	0	0	if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
	0	0	if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
	0	0	if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)