101 #define ERROR_BREAK(code) CERROR_BREAK(error, code)  macro
969     if(!bitlen_cl) ERROR_BREAK(83 /*alloc fail*/);  in getTreeInflateDynamic()
983     if(!bitlen_ll || !bitlen_d) ERROR_BREAK(83 /*alloc fail*/);  in getTreeInflateDynamic()
1003         if(*bp >= inbitlength) ERROR_BREAK(50); /*error, bit pointer jumps past memory*/  in getTreeInflateDynamic()
1004         if (i == 0) ERROR_BREAK(54); /*can't repeat previous if i is 0*/  in getTreeInflateDynamic()
1013           if(i >= HLIT + HDIST) ERROR_BREAK(13); /*error: i is larger than the amount of codes*/  in getTreeInflateDynamic()
1022         if(*bp >= inbitlength) ERROR_BREAK(50); /*error, bit pointer jumps past memory*/  in getTreeInflateDynamic()
1029           if(i >= HLIT + HDIST) ERROR_BREAK(14); /*error: i is larger than the amount of codes*/  in getTreeInflateDynamic()
1039         if(*bp >= inbitlength) ERROR_BREAK(50); /*error, bit pointer jumps past memory*/  in getTreeInflateDynamic()
1046           if(i >= HLIT + HDIST) ERROR_BREAK(15); /*error: i is larger than the amount of codes*/  in getTreeInflateDynamic()
1067 …  if(bitlen_ll[256] == 0) ERROR_BREAK(64); /*the length of the end code 256 must be larger than 0*/  in getTreeInflateDynamic()
1109         if(!ucvector_resize(out, ((*pos) + 1) * 2)) ERROR_BREAK(83 /*alloc fail*/);  in inflateHuffmanBlock()
1125       if(*bp >= inbitlength) ERROR_BREAK(51); /*error, bit pointer will jump past memory*/  in inflateHuffmanBlock()
1145       if(*bp >= inbitlength) ERROR_BREAK(51); /*error, bit pointer will jump past memory*/  in inflateHuffmanBlock()
1151       if(distance > start) ERROR_BREAK(52); /*too long backward distance*/  in inflateHuffmanBlock()
1156         if(!ucvector_resize(out, ((*pos) + length) * 2)) ERROR_BREAK(83 /*alloc fail*/);  in inflateHuffmanBlock()
1544         if(pos == 0) ERROR_BREAK(81);  in encodeLZ77()
1548           if(!uivector_push_back(out, in[pos - 1])) ERROR_BREAK(83 /*alloc fail*/);  in encodeLZ77()
1559 … if(length >= 3 && offset > windowsize) ERROR_BREAK(86 /*too big (or overflown negative) offset*/);  in encodeLZ77()
1564       if(!uivector_push_back(out, in[pos])) ERROR_BREAK(83 /*alloc fail*/);  in encodeLZ77()
1570       if(!uivector_push_back(out, in[pos])) ERROR_BREAK(83 /*alloc fail*/);  in encodeLZ77()
1738       if(!uivector_resize(&lz77_encoded, datasize)) ERROR_BREAK(83 /*alloc fail*/);  in deflateDynamic()
1742     if(!uivector_resizev(&frequencies_ll, 286, 0)) ERROR_BREAK(83 /*alloc fail*/);  in deflateDynamic()
1743     if(!uivector_resizev(&frequencies_d, 30, 0)) ERROR_BREAK(83 /*alloc fail*/);  in deflateDynamic()
1821     if(!uivector_resizev(&frequencies_cl, NUM_CODE_LENGTH_CODES, 0)) ERROR_BREAK(83 /*alloc fail*/);  in deflateDynamic()
1834     if(!uivector_resize(&bitlen_cl, tree_cl.numcodes)) ERROR_BREAK(83 /*alloc fail*/);  in deflateDynamic()
1843       if(!uivector_resize(&bitlen_cl, bitlen_cl.size - 1)) ERROR_BREAK(83 /*alloc fail*/);  in deflateDynamic()
1893     if(HuffmanTree_getLength(&tree_ll, 256) == 0) ERROR_BREAK(64);  in deflateDynamic()
5599           if(!padded) ERROR_BREAK(83); /*alloc fail*/  in preProcessScanlines()