Lines Matching defs:bzf
1055 if (bzf != NULL) bzf->lastErr = eee; \
1090 bzFile* bzf = NULL;
1103 bzf = malloc ( sizeof(bzFile) );
1104 if (bzf == NULL)
1108 bzf->initialisedOk = False;
1109 bzf->bufN = 0;
1110 bzf->handle = f;
1111 bzf->writing = True;
1112 bzf->strm.bzalloc = NULL;
1113 bzf->strm.bzfree = NULL;
1114 bzf->strm.opaque = NULL;
1117 ret = BZ2_bzCompressInit ( &(bzf->strm), blockSize100k,
1120 { BZ_SETERR(ret); free(bzf); return NULL; };
1122 bzf->strm.avail_in = 0;
1123 bzf->initialisedOk = True;
1124 return bzf;
1137 bzFile* bzf = (bzFile*)b;
1140 if (bzf == NULL || buf == NULL || len < 0)
1142 if (!(bzf->writing))
1144 if (ferror(bzf->handle))
1150 bzf->strm.avail_in = len;
1151 bzf->strm.next_in = buf;
1154 bzf->strm.avail_out = BZ_MAX_UNUSED;
1155 bzf->strm.next_out = bzf->buf;
1156 ret = BZ2_bzCompress ( &(bzf->strm), BZ_RUN );
1160 if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
1161 n = BZ_MAX_UNUSED - bzf->strm.avail_out;
1162 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
1163 n, bzf->handle );
1164 if (n != n2 || ferror(bzf->handle))
1168 if (bzf->strm.avail_in == 0)
1197 bzFile* bzf = (bzFile*)b;
1199 if (bzf == NULL)
1201 if (!(bzf->writing))
1203 if (ferror(bzf->handle))
1211 if ((!abandon) && bzf->lastErr == BZ_OK) {
1213 bzf->strm.avail_out = BZ_MAX_UNUSED;
1214 bzf->strm.next_out = bzf->buf;
1215 ret = BZ2_bzCompress ( &(bzf->strm), BZ_FINISH );
1219 if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
1220 n = BZ_MAX_UNUSED - bzf->strm.avail_out;
1221 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
1222 n, bzf->handle );
1223 if (n != n2 || ferror(bzf->handle))
1231 if ( !abandon && !ferror ( bzf->handle ) ) {
1232 fflush ( bzf->handle );
1233 if (ferror(bzf->handle))
1238 *nbytes_in_lo32 = bzf->strm.total_in_lo32;
1240 *nbytes_in_hi32 = bzf->strm.total_in_hi32;
1242 *nbytes_out_lo32 = bzf->strm.total_out_lo32;
1244 *nbytes_out_hi32 = bzf->strm.total_out_hi32;
1247 (void) BZ2_bzCompressEnd ( &(bzf->strm) );
1248 free ( bzf );
1261 bzFile* bzf = NULL;
1276 bzf = malloc ( sizeof(bzFile) );
1277 if (bzf == NULL)
1282 bzf->initialisedOk = False;
1283 bzf->handle = f;
1284 bzf->bufN = 0;
1285 bzf->writing = False;
1286 bzf->strm.bzalloc = NULL;
1287 bzf->strm.bzfree = NULL;
1288 bzf->strm.opaque = NULL;
1291 bzf->buf[bzf->bufN] = *((UChar*)(unused)); bzf->bufN++;
1296 ret = BZ2_bzDecompressInit ( &(bzf->strm), verbosity, small );
1298 { BZ_SETERR(ret); free(bzf); return NULL; };
1300 bzf->strm.avail_in = bzf->bufN;
1301 bzf->strm.next_in = bzf->buf;
1303 bzf->initialisedOk = True;
1304 return bzf;
1311 bzFile* bzf = (bzFile*)b;
1314 if (bzf == NULL)
1317 if (bzf->writing)
1320 if (bzf->initialisedOk)
1321 (void) BZ2_bzDecompressEnd ( &(bzf->strm) );
1322 free ( bzf );
1334 bzFile* bzf = (bzFile*)b;
1338 if (bzf == NULL || buf == NULL || len < 0)
1341 if (bzf->writing)
1347 bzf->strm.avail_out = len;
1348 bzf->strm.next_out = buf;
1352 if (ferror(bzf->handle))
1355 if (bzf->strm.avail_in == 0 && !myfeof(bzf->handle)) {
1356 n = fread ( bzf->buf, sizeof(UChar),
1357 BZ_MAX_UNUSED, bzf->handle );
1358 if (ferror(bzf->handle))
1360 bzf->bufN = n;
1361 bzf->strm.avail_in = bzf->bufN;
1362 bzf->strm.next_in = bzf->buf;
1365 ret = BZ2_bzDecompress ( &(bzf->strm) );
1370 if (ret == BZ_OK && myfeof(bzf->handle) &&
1371 bzf->strm.avail_in == 0 && bzf->strm.avail_out > 0)
1376 return len - bzf->strm.avail_out; };
1377 if (bzf->strm.avail_out == 0)
1393 bzFile* bzf = (bzFile*)b;
1394 if (bzf == NULL)
1396 if (bzf->lastErr != BZ_STREAM_END)
1402 *nUnused = bzf->strm.avail_in;
1403 *unused = bzf->strm.next_in;