Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]
FreeBSD/Linux Kernel Cross Reference
sys/contrib/openzfs/module/zstd/lib/compress/zstd_lazy.h
Version:
- FREEBSD - FREEBSD-13-STABLE - FREEBSD-13-0 - FREEBSD-12-STABLE - FREEBSD-12-0 - FREEBSD-11-STABLE - FREEBSD-11-0 - FREEBSD-10-STABLE - FREEBSD-10-0 - FREEBSD-9-STABLE - FREEBSD-9-0 - FREEBSD-8-STABLE - FREEBSD-8-0 - FREEBSD-7-STABLE - FREEBSD-7-0 - FREEBSD-6-STABLE - FREEBSD-6-0 - FREEBSD-5-STABLE - FREEBSD-5-0 - FREEBSD-4-STABLE - FREEBSD-3-STABLE - FREEBSD22 - l41 - OPENBSD - linux-2.6 - MK84 - PLAN9 - xnu-8792
SearchContext: - none - 3 - 10
SearchContext: - none - 3 - 10
1 /* 2 * Copyright (c) 2016-2020, Yann Collet, Facebook, Inc. 3 * All rights reserved. 4 * 5 * This source code is licensed under both the BSD-style license (found in the 6 * LICENSE file in the root directory of this source tree) and the GPLv2 (found 7 * in the COPYING file in the root directory of this source tree). 8 * You may select, at your option, one of the above-listed licenses. 9 */ 10 11 #ifndef ZSTD_LAZY_H 12 #define ZSTD_LAZY_H 13 14 #if defined (__cplusplus) 15 extern "C" { 16 #endif 17 18 #include "zstd_compress_internal.h" 19 20 U32 ZSTD_insertAndFindFirstIndex(ZSTD_matchState_t* ms, const BYTE* ip); 21 22 void ZSTD_preserveUnsortedMark (U32* const table, U32 const size, U32 const reducerValue); /*! used in ZSTD_reduceIndex(). preemptively increase value of ZSTD_DUBT_UNSORTED_MARK */ 23 24 size_t ZSTD_compressBlock_btlazy2( 25 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 26 void const* src, size_t srcSize); 27 size_t ZSTD_compressBlock_lazy2( 28 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 29 void const* src, size_t srcSize); 30 size_t ZSTD_compressBlock_lazy( 31 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 32 void const* src, size_t srcSize); 33 size_t ZSTD_compressBlock_greedy( 34 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 35 void const* src, size_t srcSize); 36 37 size_t ZSTD_compressBlock_btlazy2_dictMatchState( 38 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 39 void const* src, size_t srcSize); 40 size_t ZSTD_compressBlock_lazy2_dictMatchState( 41 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 42 void const* src, size_t srcSize); 43 size_t ZSTD_compressBlock_lazy_dictMatchState( 44 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 45 void const* src, size_t srcSize); 46 size_t ZSTD_compressBlock_greedy_dictMatchState( 47 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 48 void const* src, size_t srcSize); 49 50 size_t ZSTD_compressBlock_greedy_extDict( 51 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 52 void const* src, size_t srcSize); 53 size_t ZSTD_compressBlock_lazy_extDict( 54 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 55 void const* src, size_t srcSize); 56 size_t ZSTD_compressBlock_lazy2_extDict( 57 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 58 void const* src, size_t srcSize); 59 size_t ZSTD_compressBlock_btlazy2_extDict( 60 ZSTD_matchState_t* ms, seqStore_t* seqStore, U32 rep[ZSTD_REP_NUM], 61 void const* src, size_t srcSize); 62 63 #if defined (__cplusplus) 64 } 65 #endif 66 67 #endif /* ZSTD_LAZY_H */
Cache object: 82c0efc67ba78466bf113f4c2ac3252d
[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]