HomeSort by: relevance | last modified time | path
    Searched refs:available_in (Results 1 - 6 of 6) sorted by relevancy

  /xsrc/external/mit/brotli/dist/python/
_brotli.cc 96 size_t available_in = input_length; local
103 &available_in, &next_in,
114 if (available_in || BrotliEncoderHasMoreOutput(enc)) {
401 size_t available_in = input_length; local
409 &available_in, &next_in,
417 ok = result != BROTLI_DECODER_RESULT_ERROR && !available_in;
641 size_t available_in; local
666 available_in = input.len;
669 result = BrotliDecoderDecompressStream(state, &available_in, &next_in,
675 ok = result == BROTLI_DECODER_RESULT_SUCCESS && !available_in;
    [all...]
  /xsrc/external/mit/brotli/dist/c/include/brotli/
encode.h 79 * ::BROTLI_OPERATION_FLUSH operation until @p available_in becomes @c 0, and
96 * ::BROTLI_OPERATION_FINISH operation until @p available_in becomes @c 0, and
321 * The values @p *available_in and @p *available_out must specify the number of
325 * After each call, @p *available_in will be decremented by the amount of input
369 * @param[in, out] available_in @b in: amount of available input; \n
381 BrotliEncoderState* state, BrotliEncoderOperation op, size_t* available_in,
decode.h 211 * The values @p *available_in and @p *available_out must specify the number of
215 * After each call, @p *available_in will be decremented by the amount of input
224 * @note Input is never overconsumed, so @p next_in and @p available_in could be
228 * @param[in, out] available_in @b in: amount of available input; \n
247 BrotliDecoderState* state, size_t* available_in, const uint8_t** next_in,
  /xsrc/external/mit/brotli/dist/c/enc/
encode.c 1506 size_t available_in = input_size; local
1520 &available_in, &next_in, &available_out, &next_out, &total_out);
1598 BrotliEncoderState* s, BrotliEncoderOperation op, size_t* available_in,
1603 BROTLI_MIN(size_t, *available_in, block_size_limit));
1649 (*available_in != 0 || op != BROTLI_OPERATION_PROCESS)) {
1650 size_t block_size = BROTLI_MIN(size_t, block_size_limit, *available_in);
1652 (*available_in == block_size) && (op == BROTLI_OPERATION_FINISH);
1654 (*available_in == block_size) && (op == BROTLI_OPERATION_FLUSH);
1691 *available_in -= block_size;
1722 BrotliEncoderState* s, size_t* available_in, const uint8_t** next_in
    [all...]
  /xsrc/external/mit/brotli/dist/c/tools/
brotli.c 125 size_t available_in; member in struct:__anon5341
803 context->available_in = 0;
818 context->available_in =
820 context->total_in += context->available_in;
894 (context->available_in != 0) || (fgetc(context->fin) != EOF);
912 result = BrotliDecoderDecompressStream(s, &context->available_in,
947 if (context->available_in == 0 && !is_eof) {
954 &context->available_in, &context->next_in,
  /xsrc/external/mit/brotli/dist/c/dec/
decode.c 2041 size_t available_in = encoded_size; local
2049 &s, &available_in, &next_in, &available_out, &next_out, &total_out);
2070 BrotliDecoderState* s, size_t* available_in, const uint8_t** next_in,
2088 br->avail_in = *available_in;
2119 br->avail_in = *available_in;
2122 } else if (*available_in != 0) {
2130 (*available_in)--;
2139 *available_in = br->avail_in;
2140 while (*available_in) {
2144 (*available_in)--
    [all...]

Completed in 15 milliseconds