upstream/mercurial-mirror Files · contrib/python-zstandard/zstd/compress/zstd_lazy.h

revlog: using two new functions in C capsule from Rust code...

revlog: using two new functions in C capsule from Rust code We expose `index_length` and `index_node` in the C capsule, so that the Rust representation of the C index can implement the `RevlogIndex` trait. Because our `Node` is actually a one-field struct, we have to decorate it for direct FFI exchange with the C `char*` It would be a good thing to get a length from the C layer, but doing so right now would probably interfere with the upcoming changes that will happen there for the hash length. Differential Revision: https://phab.mercurial-scm.org/D8152

Gregory Szorc - - Load All Authors

File last commit:

r43207:69de49c4 default


                r44989:16634951

default

Download file

             zstd_lazy.h
        
                    67 lines
            
             | 2.7 KiB
            
                | text/x-c
            
             |
                CLexer
            
             / contrib / python-zstandard / zstd / compress / zstd_lazy.h
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      /*

       * Copyright (c) 2016-present, Yann Collet, Facebook, Inc.

       * All rights reserved.

       *

       * This source code is licensed under both the BSD-style license (found in the

       * LICENSE file in the root directory of this source tree) and the GPLv2 (found

       * in the COPYING file in the root directory of this source tree).

       * You may select, at your option, one of the above-listed licenses.

       */

      #ifndef ZSTD_LAZY_H

      #define ZSTD_LAZY_H

      #if defined (__cplusplus)

      extern "C" {

      #endif

      #include "zstd_compress_internal.h"

      U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip);

      void ZSTD_preserveUnsortedMark (U32* const table, U32 const size, U32 const reducerValue);  /*! used in ZSTD_reduceIndex(). preemptively increase value of ZSTD_DUBT_UNSORTED_MARK */

      size_t ZSTD_compressBlock_btlazy2(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy2(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_greedy(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_btlazy2_dictMatchState(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy2_dictMatchState(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy_dictMatchState(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_greedy_dictMatchState(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_greedy_extDict(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy_extDict(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_lazy2_extDict(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      size_t ZSTD_compressBlock_btlazy2_extDict(

              ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],

              void const* src, size_t srcSize);

      #if defined (__cplusplus)

      }

      #endif

      #endif /* ZSTD_LAZY_H */

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				/*
				* Copyright (c) 2016-present, Yann Collet, Facebook, Inc.
				* All rights reserved.
				*
				* This source code is licensed under both the BSD-style license (found in the
				* LICENSE file in the root directory of this source tree) and the GPLv2 (found
				* in the COPYING file in the root directory of this source tree).
				* You may select, at your option, one of the above-listed licenses.
				*/

				#ifndef ZSTD_LAZY_H
				#define ZSTD_LAZY_H

				#if defined (__cplusplus)
				extern "C" {
				#endif

				#include "zstd_compress_internal.h"

				U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip);

				void ZSTD_preserveUnsortedMark (U32* const table, U32 const size, U32 const reducerValue); /! used in ZSTD_reduceIndex(). preemptively increase value of ZSTD_DUBT_UNSORTED_MARK /

				size_t ZSTD_compressBlock_btlazy2(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy2(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_greedy(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);

				size_t ZSTD_compressBlock_btlazy2_dictMatchState(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy2_dictMatchState(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy_dictMatchState(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_greedy_dictMatchState(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);

				size_t ZSTD_compressBlock_greedy_extDict(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy_extDict(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_lazy2_extDict(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);
				size_t ZSTD_compressBlock_btlazy2_extDict(
				ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM],
				void const* src, size_t srcSize);

				#if defined (__cplusplus)
				}
				#endif

				#endif /* ZSTD_LAZY_H */