HomeSort by: relevance | last modified time | path
    Searched defs:sequences (Results 1 - 25 of 30) sorted by relevancy

1 2

  /src/external/bsd/zstd/dist/lib/common/
zstd_internal.h 296 seqDef* sequences; /* ptr to end of sequences */ member in struct:__anon6256
319 * Returns the ZSTD_sequenceLength for the given sequences. It handles the decoding of long sequences
zstd_internal.h 296 seqDef* sequences; /* ptr to end of sequences */ member in struct:__anon6256
319 * Returns the ZSTD_sequenceLength for the given sequences. It handles the decoding of long sequences
zstd_internal.h 296 seqDef* sequences; /* ptr to end of sequences */ member in struct:__anon6256
319 * Returns the ZSTD_sequenceLength for the given sequences. It handles the decoding of long sequences
  /src/external/bsd/zstd/dist/doc/educational_decoder/
zstd_decompress.c 333 /// sequences. The high-level functions roughly follow the outline of the
355 // Decode the sequences part of a block
357 sequence_command_t **const sequences);
359 // Execute the decoded sequences on the literals block
363 const sequence_command_t *const sequences,
675 // Part 2: decode the sequences block
676 sequence_command_t *sequences = NULL; local
678 decode_sequences(ctx, in, &sequences);
681 execute_sequences(ctx, out, literals, literals_size, sequences,
684 free(sequences);
    [all...]
zstd_decompress.c 333 /// sequences. The high-level functions roughly follow the outline of the
355 // Decode the sequences part of a block
357 sequence_command_t **const sequences);
359 // Execute the decoded sequences on the literals block
363 const sequence_command_t *const sequences,
675 // Part 2: decode the sequences block
676 sequence_command_t *sequences = NULL; local
678 decode_sequences(ctx, in, &sequences);
681 execute_sequences(ctx, out, literals, literals_size, sequences,
684 free(sequences);
    [all...]
zstd_decompress.c 333 /// sequences. The high-level functions roughly follow the outline of the
355 // Decode the sequences part of a block
357 sequence_command_t **const sequences);
359 // Execute the decoded sequences on the literals block
363 const sequence_command_t *const sequences,
675 // Part 2: decode the sequences block
676 sequence_command_t *sequences = NULL; local
678 decode_sequences(ctx, in, &sequences);
681 execute_sequences(ctx, out, literals, literals_size, sequences,
684 free(sequences);
    [all...]
  /src/external/bsd/zstd/dist/lib/decompress/
zstd_decompress_block.c 724 "extraneous data present in the Sequences section");
830 * should be fast for a single long sequence, but can be slow for several short sequences.
903 * to be optimized for many small sequences, since those fall into ZSTD_execSequence().
1516 /* If there are more sequences, they will need to read literals from litExtraBuffer; copy over the remainder from dst and update litPtr and litEnd */
1519 DEBUGLOG(6, "There are %i sequences left, and %zu/%zu literals left in buffer", nbSeq, leftoverLit, sequence.litLength);
1632 /* Regen sequences */
1750 /* Regen sequences */
1755 seq_t sequences[STORED_SEQS]; local
1776 sequences[seqNb] = sequence;
1783 if (dctx->litBufferLocation == ZSTD_split && litPtr + sequences[(seqNb - ADVANCED_SEQS) & STORED_SEQS_MASK].litLength > dctx->litBufferEnd)
    [all...]
zstd_decompress_block.c 724 "extraneous data present in the Sequences section");
830 * should be fast for a single long sequence, but can be slow for several short sequences.
903 * to be optimized for many small sequences, since those fall into ZSTD_execSequence().
1516 /* If there are more sequences, they will need to read literals from litExtraBuffer; copy over the remainder from dst and update litPtr and litEnd */
1519 DEBUGLOG(6, "There are %i sequences left, and %zu/%zu literals left in buffer", nbSeq, leftoverLit, sequence.litLength);
1632 /* Regen sequences */
1750 /* Regen sequences */
1755 seq_t sequences[STORED_SEQS]; local
1776 sequences[seqNb] = sequence;
1783 if (dctx->litBufferLocation == ZSTD_split && litPtr + sequences[(seqNb - ADVANCED_SEQS) & STORED_SEQS_MASK].litLength > dctx->litBufferEnd)
    [all...]
zstd_decompress_block.c 724 "extraneous data present in the Sequences section");
830 * should be fast for a single long sequence, but can be slow for several short sequences.
903 * to be optimized for many small sequences, since those fall into ZSTD_execSequence().
1516 /* If there are more sequences, they will need to read literals from litExtraBuffer; copy over the remainder from dst and update litPtr and litEnd */
1519 DEBUGLOG(6, "There are %i sequences left, and %zu/%zu literals left in buffer", nbSeq, leftoverLit, sequence.litLength);
1632 /* Regen sequences */
1750 /* Regen sequences */
1755 seq_t sequences[STORED_SEQS]; local
1776 sequences[seqNb] = sequence;
1783 if (dctx->litBufferLocation == ZSTD_split && litPtr + sequences[(seqNb - ADVANCED_SEQS) & STORED_SEQS_MASK].litLength > dctx->litBufferEnd)
    [all...]
  /src/external/bsd/zstd/dist/tests/
decodecorpus.c 658 * number of sequences we can have */
701 /* including i+1 != numSequences because the last sequences has to adhere to predetermined contentSize */
815 const seqDef* const sequences = seqStorePtr->sequencesStart; local
826 /* Sequences Header */
940 /* Encoding Sequences */
954 BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, LL_bits[llCodeTable[nbSeq-1]]);
956 BIT_addBits(&blockStream, sequences[nbSeq-1].mlBase, ML_bits[mlCodeTable[nbSeq-1]]);
958 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase, ofCodeTable[nbSeq-1]);
976 BIT_addBits(&blockStream, sequences[n].litLength, llBits);
978 BIT_addBits(&blockStream, sequences[n].mlBase, mlBits)
    [all...]
zstreamtest.c 1658 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
1662 sequences[0].offset = 32;
1663 sequences[0].litLength = 32;
1664 sequences[0].matchLength = (1u << windowLog) - 32;
1665 sequences[0].rep = 0;
1669 sequences[i].offset = (1u << windowLog) - (FUZ_rand(&seed) % 8);
1670 sequences[i].litLength = FUZ_rand(&seed) & 7;
1671 sequences[i].matchLength = 10 - sequences[i].litLength;
1672 sequences[i].rep = 0
2176 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
2224 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
2256 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
2312 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
    [all...]
decodecorpus.c 658 * number of sequences we can have */
701 /* including i+1 != numSequences because the last sequences has to adhere to predetermined contentSize */
815 const seqDef* const sequences = seqStorePtr->sequencesStart; local
826 /* Sequences Header */
940 /* Encoding Sequences */
954 BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, LL_bits[llCodeTable[nbSeq-1]]);
956 BIT_addBits(&blockStream, sequences[nbSeq-1].mlBase, ML_bits[mlCodeTable[nbSeq-1]]);
958 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase, ofCodeTable[nbSeq-1]);
976 BIT_addBits(&blockStream, sequences[n].litLength, llBits);
978 BIT_addBits(&blockStream, sequences[n].mlBase, mlBits)
    [all...]
zstreamtest.c 1658 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
1662 sequences[0].offset = 32;
1663 sequences[0].litLength = 32;
1664 sequences[0].matchLength = (1u << windowLog) - 32;
1665 sequences[0].rep = 0;
1669 sequences[i].offset = (1u << windowLog) - (FUZ_rand(&seed) % 8);
1670 sequences[i].litLength = FUZ_rand(&seed) & 7;
1671 sequences[i].matchLength = 10 - sequences[i].litLength;
1672 sequences[i].rep = 0
2176 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
2224 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
2256 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
2312 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
    [all...]
decodecorpus.c 658 * number of sequences we can have */
701 /* including i+1 != numSequences because the last sequences has to adhere to predetermined contentSize */
815 const seqDef* const sequences = seqStorePtr->sequencesStart; local
826 /* Sequences Header */
940 /* Encoding Sequences */
954 BIT_addBits(&blockStream, sequences[nbSeq-1].litLength, LL_bits[llCodeTable[nbSeq-1]]);
956 BIT_addBits(&blockStream, sequences[nbSeq-1].mlBase, ML_bits[mlCodeTable[nbSeq-1]]);
958 BIT_addBits(&blockStream, sequences[nbSeq-1].offBase, ofCodeTable[nbSeq-1]);
976 BIT_addBits(&blockStream, sequences[n].litLength, llBits);
978 BIT_addBits(&blockStream, sequences[n].mlBase, mlBits)
    [all...]
zstreamtest.c 1658 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
1662 sequences[0].offset = 32;
1663 sequences[0].litLength = 32;
1664 sequences[0].matchLength = (1u << windowLog) - 32;
1665 sequences[0].rep = 0;
1669 sequences[i].offset = (1u << windowLog) - (FUZ_rand(&seed) % 8);
1670 sequences[i].litLength = FUZ_rand(&seed) & 7;
1671 sequences[i].matchLength = 10 - sequences[i].litLength;
1672 sequences[i].rep = 0
2176 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
2224 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
2256 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
2312 ZSTD_Sequence* sequences = malloc(sizeof(ZSTD_Sequence) * kNbSequences); local
    [all...]
  /src/external/bsd/zstd/dist/lib/compress/
zstd_compress.c 2223 /* reserve space for block-level external sequences */
2255 /* sequences storage */
2683 const seqDef* const sequences = seqStorePtr->sequencesStart; local
2687 U32 const nbSeq = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
2692 U32 const llv = sequences[u].litLength;
2693 U32 const ofCode = ZSTD_highbit32(sequences[u].offBase);
2694 U32 const mlv = sequences[u].mlBase;
2732 * and size of the sequences statistics
2871 * compresses both literals and sequences
2890 const seqDef* const sequences = seqStorePtr->sequencesStart local
    [all...]
zstd_compress.c 2223 /* reserve space for block-level external sequences */
2255 /* sequences storage */
2683 const seqDef* const sequences = seqStorePtr->sequencesStart; local
2687 U32 const nbSeq = (U32)(seqStorePtr->sequences - seqStorePtr->sequencesStart);
2692 U32 const llv = sequences[u].litLength;
2693 U32 const ofCode = ZSTD_highbit32(sequences[u].offBase);
2694 U32 const mlv = sequences[u].mlBase;
2732 * and size of the sequences statistics
2871 * compresses both literals and sequences
2890 const seqDef* const sequences = seqStorePtr->sequencesStart local
    [all...]
  /src/external/gpl3/binutils/dist/bfd/
dwarf2.c 1819 struct line_sequence* sequences; member in struct:line_info_table
1913 struct line_sequence* seq = table->sequences;
1973 seq->prev_sequence = table->sequences;
1976 table->sequences = seq;
2375 /* Compare function for line sequences. */
2452 /* Sort the line sequences for quick lookup. */
2458 struct line_sequence *sequences; local
2467 /* Allocate space for an array of sequences. */
2469 sequences = (struct line_sequence *) bfd_alloc (table->abfd, amt);
2470 if (sequences == NULL
    [all...]
dwarf2.c 1819 struct line_sequence* sequences; member in struct:line_info_table
1913 struct line_sequence* seq = table->sequences;
1973 seq->prev_sequence = table->sequences;
1976 table->sequences = seq;
2375 /* Compare function for line sequences. */
2452 /* Sort the line sequences for quick lookup. */
2458 struct line_sequence *sequences; local
2467 /* Allocate space for an array of sequences. */
2469 sequences = (struct line_sequence *) bfd_alloc (table->abfd, amt);
2470 if (sequences == NULL
    [all...]
  /src/external/gpl3/binutils.old/dist/bfd/
dwarf2.c 1819 struct line_sequence* sequences; member in struct:line_info_table
1913 struct line_sequence* seq = table->sequences;
1973 seq->prev_sequence = table->sequences;
1976 table->sequences = seq;
2375 /* Compare function for line sequences. */
2452 /* Sort the line sequences for quick lookup. */
2458 struct line_sequence *sequences; local
2467 /* Allocate space for an array of sequences. */
2469 sequences = (struct line_sequence *) bfd_alloc (table->abfd, amt);
2470 if (sequences == NULL
    [all...]
dwarf2.c 1819 struct line_sequence* sequences; member in struct:line_info_table
1913 struct line_sequence* seq = table->sequences;
1973 seq->prev_sequence = table->sequences;
1976 table->sequences = seq;
2375 /* Compare function for line sequences. */
2452 /* Sort the line sequences for quick lookup. */
2458 struct line_sequence *sequences; local
2467 /* Allocate space for an array of sequences. */
2469 sequences = (struct line_sequence *) bfd_alloc (table->abfd, amt);
2470 if (sequences == NULL
    [all...]
  /src/external/gpl3/gdb/dist/bfd/
dwarf2.c 1819 struct line_sequence* sequences; member in struct:line_info_table
1913 struct line_sequence* seq = table->sequences;
1973 seq->prev_sequence = table->sequences;
1976 table->sequences = seq;
2375 /* Compare function for line sequences. */
2452 /* Sort the line sequences for quick lookup. */
2458 struct line_sequence *sequences; local
2467 /* Allocate space for an array of sequences. */
2469 sequences = (struct line_sequence *) bfd_alloc (table->abfd, amt);
2470 if (sequences == NULL
    [all...]
dwarf2.c 1819 struct line_sequence* sequences; member in struct:line_info_table
1913 struct line_sequence* seq = table->sequences;
1973 seq->prev_sequence = table->sequences;
1976 table->sequences = seq;
2375 /* Compare function for line sequences. */
2452 /* Sort the line sequences for quick lookup. */
2458 struct line_sequence *sequences; local
2467 /* Allocate space for an array of sequences. */
2469 sequences = (struct line_sequence *) bfd_alloc (table->abfd, amt);
2470 if (sequences == NULL
    [all...]
  /src/external/gpl3/gdb.old/dist/bfd/
dwarf2.c 1812 struct line_sequence* sequences; member in struct:line_info_table
1906 struct line_sequence* seq = table->sequences;
1966 seq->prev_sequence = table->sequences;
1969 table->sequences = seq;
2368 /* Compare function for line sequences. */
2445 /* Sort the line sequences for quick lookup. */
2451 struct line_sequence *sequences; local
2460 /* Allocate space for an array of sequences. */
2462 sequences = (struct line_sequence *) bfd_alloc (table->abfd, amt);
2463 if (sequences == NULL
    [all...]
dwarf2.c 1812 struct line_sequence* sequences; member in struct:line_info_table
1906 struct line_sequence* seq = table->sequences;
1966 seq->prev_sequence = table->sequences;
1969 table->sequences = seq;
2368 /* Compare function for line sequences. */
2445 /* Sort the line sequences for quick lookup. */
2451 struct line_sequence *sequences; local
2460 /* Allocate space for an array of sequences. */
2462 sequences = (struct line_sequence *) bfd_alloc (table->abfd, amt);
2463 if (sequences == NULL
    [all...]

Completed in 148 milliseconds

1 2