Lines Matching defs:bzf
894 if (bzf != NULL) bzf->lastErr = eee; \
929 bzFile* bzf = NULL;
942 bzf = (bzFile*) malloc ( sizeof(bzFile) );
943 if (bzf == NULL)
947 bzf->initialisedOk = False;
948 bzf->bufN = 0;
949 bzf->handle = f;
950 bzf->writing = True;
951 bzf->strm.bzalloc = NULL;
952 bzf->strm.bzfree = NULL;
953 bzf->strm.opaque = NULL;
956 ret = BZ2_bzCompressInit ( &(bzf->strm), blockSize100k,
959 { BZ_SETERR(ret); free(bzf); return NULL; };
961 bzf->strm.avail_in = 0;
962 bzf->initialisedOk = True;
963 return bzf;
976 bzFile* bzf = (bzFile*)b;
979 if (bzf == NULL || buf == NULL || len < 0)
981 if (!(bzf->writing))
983 if (ferror(bzf->handle))
989 bzf->strm.avail_in = len;
990 bzf->strm.next_in = (char*)buf;
993 bzf->strm.avail_out = BZ_MAX_UNUSED;
994 bzf->strm.next_out = bzf->buf;
995 ret = BZ2_bzCompress ( &(bzf->strm), BZ_RUN );
999 if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
1000 n = BZ_MAX_UNUSED - bzf->strm.avail_out;
1001 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
1002 n, bzf->handle );
1003 if (n != n2 || ferror(bzf->handle))
1007 if (bzf->strm.avail_in == 0)
1036 bzFile* bzf = (bzFile*)b;
1038 if (bzf == NULL)
1040 if (!(bzf->writing))
1042 if (ferror(bzf->handle))
1050 if ((!abandon) && bzf->lastErr == BZ_OK) {
1052 bzf->strm.avail_out = BZ_MAX_UNUSED;
1053 bzf->strm.next_out = bzf->buf;
1054 ret = BZ2_bzCompress ( &(bzf->strm), BZ_FINISH );
1058 if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
1059 n = BZ_MAX_UNUSED - bzf->strm.avail_out;
1060 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
1061 n, bzf->handle );
1062 if (n != n2 || ferror(bzf->handle))
1070 if ( !abandon && !ferror ( bzf->handle ) ) {
1071 fflush ( bzf->handle );
1072 if (ferror(bzf->handle))
1077 *nbytes_in_lo32 = bzf->strm.total_in_lo32;
1079 *nbytes_in_hi32 = bzf->strm.total_in_hi32;
1081 *nbytes_out_lo32 = bzf->strm.total_out_lo32;
1083 *nbytes_out_hi32 = bzf->strm.total_out_hi32;
1086 BZ2_bzCompressEnd ( &(bzf->strm) );
1087 free ( bzf );
1100 bzFile* bzf = NULL;
1115 bzf = (bzFile*) malloc ( sizeof(bzFile) );
1116 if (bzf == NULL)
1121 bzf->initialisedOk = False;
1122 bzf->handle = f;
1123 bzf->bufN = 0;
1124 bzf->writing = False;
1125 bzf->strm.bzalloc = NULL;
1126 bzf->strm.bzfree = NULL;
1127 bzf->strm.opaque = NULL;
1130 bzf->buf[bzf->bufN] = *((UChar*)(unused)); bzf->bufN++;
1135 ret = BZ2_bzDecompressInit ( &(bzf->strm), verbosity, small );
1137 { BZ_SETERR(ret); free(bzf); return NULL; };
1139 bzf->strm.avail_in = bzf->bufN;
1140 bzf->strm.next_in = bzf->buf;
1142 bzf->initialisedOk = True;
1143 return bzf;
1150 bzFile* bzf = (bzFile*)b;
1153 if (bzf == NULL)
1156 if (bzf->writing)
1159 if (bzf->initialisedOk)
1160 (void)BZ2_bzDecompressEnd ( &(bzf->strm) );
1161 free ( bzf );
1173 bzFile* bzf = (bzFile*)b;
1177 if (bzf == NULL || buf == NULL || len < 0)
1180 if (bzf->writing)
1186 bzf->strm.avail_out = len;
1187 bzf->strm.next_out = (char*) buf;
1191 if (ferror(bzf->handle))
1194 if (bzf->strm.avail_in == 0 && !myfeof(bzf->handle)) {
1195 n = fread ( bzf->buf, sizeof(UChar),
1196 BZ_MAX_UNUSED, bzf->handle );
1197 if (ferror(bzf->handle))
1199 bzf->bufN = n;
1200 bzf->strm.avail_in = bzf->bufN;
1201 bzf->strm.next_in = bzf->buf;
1204 ret = BZ2_bzDecompress ( &(bzf->strm) );
1209 if (ret == BZ_OK && myfeof(bzf->handle) &&
1210 bzf->strm.avail_in == 0 && bzf->strm.avail_out > 0)
1215 return len - bzf->strm.avail_out; };
1216 if (bzf->strm.avail_out == 0)
1232 bzFile* bzf = (bzFile*)b;
1233 if (bzf == NULL)
1235 if (bzf->lastErr != BZ_STREAM_END)
1241 *nUnused = bzf->strm.avail_in;
1242 *unused = bzf->strm.next_in;