Branch Coverage

infback.c

Criterion	Covered	Total	%
branch	0	216	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;
274	0	0	if (strm == Z_NULL || strm->state == Z_NULL)
	0	0	if (strm == Z_NULL || strm->state == Z_NULL)
284	0	0	have = next != Z_NULL ? strm->avail_in : 0;
295	0	0	if (state->last) {
300	0	0	NEEDBITS(3);
	0	0	NEEDBITS(3);
	0	0	NEEDBITS(3);
330	0	0	NEEDBITS(32);
	0	0	NEEDBITS(32);
	0	0	NEEDBITS(32);
331	0	0	if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
342	0	0	while (state->length != 0) {
344	0	0	PULL();
	0	0	PULL();
345	0	0	ROOM();
	0	0	ROOM();
346	0	0	if (copy > have) copy = have;
347	0	0	if (copy > left) copy = left;
361	0	0	NEEDBITS(14);
	0	0	NEEDBITS(14);
	0	0	NEEDBITS(14);
369	0	0	if (state->nlen > 286 || state->ndist > 30) {
	0	0	if (state->nlen > 286 || state->ndist > 30) {
379	0	0	while (state->have < state->ncode) {
380	0	0	NEEDBITS(3);
	0	0	NEEDBITS(3);
	0	0	NEEDBITS(3);
384	0	0	while (state->have < 19)
391	0	0	if (ret) {
400	0	0	while (state->have < state->nlen + state->ndist) {
403	0	0	if ((unsigned)(here.bits) <= bits) break;
404	0	0	PULLBYTE();
	0	0	PULLBYTE();
406	0	0	if (here.val < 16) {
411	0	0	if (here.val == 16) {
412	0	0	NEEDBITS(here.bits + 2);
	0	0	NEEDBITS(here.bits + 2);
	0	0	NEEDBITS(here.bits + 2);
414	0	0	if (state->have == 0) {
423	0	0	else if (here.val == 17) {
424	0	0	NEEDBITS(here.bits + 3);
	0	0	NEEDBITS(here.bits + 3);
	0	0	NEEDBITS(here.bits + 3);
431	0	0	NEEDBITS(here.bits + 7);
	0	0	NEEDBITS(here.bits + 7);
	0	0	NEEDBITS(here.bits + 7);
437	0	0	if (state->have + copy > state->nlen + state->ndist) {
442	0	0	while (copy--)
448	0	0	if (state->mode == BAD) break;
451	0	0	if (state->lens[256] == 0) {
465	0	0	if (ret) {
474	0	0	if (ret) {
485	0	0	if (have >= 6 && left >= 258) {
	0	0	if (have >= 6 && left >= 258) {
487	0	0	if (state->whave < state->wsize)
497	0	0	if ((unsigned)(here.bits) <= bits) break;
498	0	0	PULLBYTE();
	0	0	PULLBYTE();
500	0	0	if (here.op && (here.op & 0xf0) == 0) {
	0	0	if (here.op && (here.op & 0xf0) == 0) {
505	0	0	if ((unsigned)(last.bits + here.bits) <= bits) break;
506	0	0	PULLBYTE();
	0	0	PULLBYTE();
514	0	0	if (here.op == 0) {
518	0	0	ROOM();
	0	0	ROOM();
526	0	0	if (here.op & 32) {
533	0	0	if (here.op & 64) {
541	0	0	if (state->extra != 0) {
542	0	0	NEEDBITS(state->extra);
	0	0	NEEDBITS(state->extra);
	0	0	NEEDBITS(state->extra);
551	0	0	if ((unsigned)(here.bits) <= bits) break;
552	0	0	PULLBYTE();
	0	0	PULLBYTE();
554	0	0	if ((here.op & 0xf0) == 0) {
559	0	0	if ((unsigned)(last.bits + here.bits) <= bits) break;
560	0	0	PULLBYTE();
	0	0	PULLBYTE();
565	0	0	if (here.op & 64) {
574	0	0	if (state->extra != 0) {
575	0	0	NEEDBITS(state->extra);
	0	0	NEEDBITS(state->extra);
	0	0	NEEDBITS(state->extra);
579	0	0	if (state->offset > state->wsize - (state->whave < state->wsize ?
580	0	0	left : 0)) {
589	0	0	ROOM();
	0	0	ROOM();
591	0	0	if (copy < left) {
599	0	0	if (copy > state->length) copy = state->length;
604	0	0	} while (--copy);
605	0	0	} while (state->length != 0);
625	0	0	if (left < state->wsize) {
626	0	0	if (out(out_desc, state->window, state->wsize - left) &&
	0	0	if (out(out_desc, state->window, state->wsize - left) &&
638	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)