Home | History | Annotate | Download | only in bzip2

Lines Matching refs:bzf

889    if (bzf != NULL) bzf->lastErr = eee;   \
924 bzFile* bzf = NULL;
937 bzf = malloc ( sizeof(bzFile) );
938 if (bzf == NULL)
942 bzf->initialisedOk = False;
943 bzf->bufN = 0;
944 bzf->handle = f;
945 bzf->writing = True;
946 bzf->strm.bzalloc = NULL;
947 bzf->strm.bzfree = NULL;
948 bzf->strm.opaque = NULL;
951 ret = BZ2_bzCompressInit ( &(bzf->strm), blockSize100k,
954 { BZ_SETERR(ret); free(bzf); return NULL; };
956 bzf->strm.avail_in = 0;
957 bzf->initialisedOk = True;
958 return bzf;
971 bzFile* bzf = (bzFile*)b;
974 if (bzf == NULL || buf == NULL || len < 0)
976 if (!(bzf->writing))
978 if (ferror(bzf->handle))
984 bzf->strm.avail_in = len;
985 bzf->strm.next_in = buf;
988 bzf->strm.avail_out = BZ_MAX_UNUSED;
989 bzf->strm.next_out = bzf->buf;
990 ret = BZ2_bzCompress ( &(bzf->strm), BZ_RUN );
994 if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
995 n = BZ_MAX_UNUSED - bzf->strm.avail_out;
996 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
997 n, bzf->handle );
998 if (n != n2 || ferror(bzf->handle))
1002 if (bzf->strm.avail_in == 0)
1031 bzFile* bzf = (bzFile*)b;
1033 if (bzf == NULL)
1035 if (!(bzf->writing))
1037 if (ferror(bzf->handle))
1045 if ((!abandon) && bzf->lastErr == BZ_OK) {
1047 bzf->strm.avail_out = BZ_MAX_UNUSED;
1048 bzf->strm.next_out = bzf->buf;
1049 ret = BZ2_bzCompress ( &(bzf->strm), BZ_FINISH );
1053 if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
1054 n = BZ_MAX_UNUSED - bzf->strm.avail_out;
1055 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
1056 n, bzf->handle );
1057 bzf->handle))
1065 if ( !abandon && !ferror ( bzf->handle ) ) {
1066 fflush ( bzf->handle );
1067 if (ferror(bzf->handle))
1072 *nbytes_in_lo32 = bzf->strm.total_in_lo32;
1074 *nbytes_in_hi32 = bzf->strm.total_in_hi32;
1076 *nbytes_out_lo32 = bzf->strm.total_out_lo32;
1078 *nbytes_out_hi32 = bzf->strm.total_out_hi32;
1081 BZ2_bzCompressEnd ( &(bzf->strm) );
1082 free ( bzf );
1095 bzFile* bzf = NULL;
1110 bzf = malloc ( sizeof(bzFile) );
1111 if (bzf == NULL)
1116 bzf->initialisedOk = False;
1117 bzf->handle = f;
1118 bzf->bufN = 0;
1119 bzf->writing = False;
1120 bzf->strm.bzalloc = NULL;
1121 bzf->strm.bzfree = NULL;
1122 bzf->strm.opaque = NULL;
1125 bzf->buf[bzf->bufN] = *((UChar*)(unused)); bzf->bufN++;
1130 ret = BZ2_bzDecompressInit ( &(bzf->strm), verbosity, small );
1132 { BZ_SETERR(ret); free(bzf); return NULL; };
1134 bzf->strm.avail_in = bzf->bufN;
1135 bzf->strm.next_in = bzf->buf;
1137 bzf->initialisedOk = True;
1138 return bzf;
1145 bzFile* bzf = (bzFile*)b;
1148 if (bzf == NULL)
1151 if (bzf->writing)
1154 if (bzf->initialisedOk)
1155 (void)BZ2_bzDecompressEnd ( &(bzf->strm) );
1156 free ( bzf );
1168 bzFile* bzf = (bzFile*)b;
1172 if (bzf == NULL || buf == NULL || len < 0)
1175 if (bzf->writing)
1181 bzf->strm.avail_out = len;
1182 bzf->strm.next_out = buf;
1186 if (ferror(bzf->handle))
1189 if (bzf->strm.avail_in == 0 && !myfeof(bzf->handle)) {
1190 n = fread ( bzf->buf, sizeof(UChar),
1191 BZ_MAX_UNUSED, bzf->handle );
1192 if (ferror(bzf->handle))
1194 bzf->bufN = n;
1195 bzf->strm.avail_in = bzf->bufN;
1196 bzf->strm.next_in = bzf->buf;
1199 ret = BZ2_bzDecompress ( &(bzf->strm) );
1204 if (ret == BZ_OK && myfeof(bzf->handle) &&
1205 bzf->strm.avail_in == 0 && bzf->strm.avail_out > 0)
1210 return len - bzf->strm.avail_out; };
1211 if (bzf->strm.avail_out == 0)
1227 bzFile* bzf = (bzFile*)b;
1228 if (bzf == NULL)
1230 if (bzf->lastErr != BZ_STREAM_END)
1236 *nUnused = bzf->strm.avail_in;
1237 *unused = bzf->strm.next_in;