| /dports/archivers/7-zip/7-zip-21.07/Asm/arm64/ |
| H A D | LzmaDecOpt.S | 162 #define probs r11 macro
450 add prm, probs, offs_R
542 mov probs, sym_R
552 PUP \prob, probs, 0
595 p2_add probs, sym_R
597 add probs, probs, sym_R, lsl 1
863 UPDATE_1 probs, 0, 0
867 UPDATE_1 probs, 0, 0
892 UPDATE_0 probs, 0, 0
893 p2_add probs, pbPos_R
[all …]
|
| /dports/archivers/7-zip/7-zip-21.07/Asm/x86/ |
| H A D | LzmaDecOpt.asm | 78 ; r11 probs
111 probs equ r11 define
366 PLOAD t0, probs + 3 * PMULT
373 PUP prob, probs + 1 * PMULT
396 sub sym2_R, probs
414 mov probs, sym_R
428 PUP prob, probs
445 add probs, sym_R
764 UPDATE_1 probs, 0, 0
768 UPDATE_1 probs, 0, 0
[all …]
|
| /dports/archivers/7-zip/7-zip-21.07/C/ |
| H A D | Bcj2.c | 29 for (i = 0; i < sizeof(p->probs) / sizeof(p->probs[0]); i++) in Bcj2Dec_Init()
30 p->probs[i] = kBitModelTotal >> 1; in Bcj2Dec_Init()
199 prob = p->probs + (unsigned)(b == 0xE8 ? 2 + (unsigned)prev : (b == 0xE9 ? 1 : 0)); in Bcj2Dec_Decode()
|
| H A D | Bcj2.h | 75 UInt16 probs[2 + 256]; member
128 UInt16 probs[2 + 256]; member
|
| H A D | Bcj2Enc.c | 51 for (i = 0; i < sizeof(p->probs) / sizeof(p->probs[0]); i++) in Bcj2Enc_Init()
52 p->probs[i] = kBitModelTotal >> 1; in Bcj2Enc_Init()
188 … CProb *prob = p->probs + (unsigned)(b == 0xE8 ? 2 + (unsigned)context : (b == 0xE9 ? 1 : 0)); in Bcj2Enc_Encode_2()
|
| H A D | LzmaDec.c | 31 #define TREE_GET_BIT(probs, i) { GET_BIT2(probs + i, i, ;, ;); } argument
46 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i) argument
50 TREE_GET_BIT(probs, i); \
51 TREE_GET_BIT(probs, i); \
52 TREE_GET_BIT(probs, i); \
53 TREE_GET_BIT(probs, i); \
54 TREE_GET_BIT(probs, i); \
55 TREE_GET_BIT(probs, i); \
991 CLzmaProb *probs = p->probs; in LzmaDec_DecodeToDic() local
1243 p->probs = NULL; in LzmaDec_FreeProbs()
[all …]
|
| H A D | LzmaDec.h | 57 CLzmaProb *probs; member
76 #define LzmaDec_Construct(p) { (p)->dic = NULL; (p)->probs = NULL; }
|
| H A D | LzmaEnc.c | 924 RC_BIT(rc, probs + m, bit); in RcTree_ReverseEncode()
945 CLzmaProb *probs = p->low; in LenEnc_Encode() local
947 RC_BIT_PRE(rc, probs); in LenEnc_Encode()
950 RC_BIT_1(rc, probs); in LenEnc_Encode()
951 probs += kLenNumLowSymbols; in LenEnc_Encode()
952 RC_BIT_PRE(rc, probs); in LenEnc_Encode()
955 RC_BIT_1(rc, probs); in LenEnc_Encode()
968 RC_BIT_0(rc, probs); in LenEnc_Encode()
2232 prob = probs[m]; in FillAlignPrices()
2440 CLzmaProb *probs; in LzmaEnc_CodeOneBlock() local
[all …]
|
| /dports/archivers/7-zip/7-zip-21.07/CPP/7zip/Compress/ |
| H A D | LzmsDecoder.h | 194 unsigned Decode(UInt32 *state, UInt32 numStates, struct CProbEntry *probs) in Decode()
197 CProbEntry *entry = &probs[st]; in Decode()
|
| /dports/archivers/bzip2/bzip2-1.0.8/ |
| H A D | CHANGES | 174 * Modified makefile-msc to fix minor build probs on Win2k.
|
| /dports/archivers/draco/draco-1.4.3/src/draco/compression/entropy/ |
| H A D | rans_symbol_encoder.h | 59 explicit ProbabilityLess(const std::vector<rans_sym> *probs) in ProbabilityLess()
60 : probabilities(probs) {} in ProbabilityLess()
|
| /dports/archivers/lrzip/lrzip-0.631/lzma/C/ |
| H A D | LzmaDec.c | 27 #define TREE_GET_BIT(probs, i) { GET_BIT((probs + i), i); } argument
34 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i) argument
38 TREE_GET_BIT(probs, i); \
39 TREE_GET_BIT(probs, i); \
40 TREE_GET_BIT(probs, i); \
41 TREE_GET_BIT(probs, i); \
42 TREE_GET_BIT(probs, i); \
133 CLzmaProb *probs = p->probs; in LzmaDec_DecodeReal() local
492 CLzmaProb *probs = p->probs; in LzmaDec_TryDummy() local
711 CLzmaProb *probs = p->probs; in LzmaDec_InitStateReal() local
[all …]
|
| H A D | LzmaDec.h | 53 CLzmaProb *probs; member
71 #define LzmaDec_Construct(p) { (p)->dic = 0; (p)->probs = 0; }
|
| H A D | LzmaEnc.c | 677 RangeEnc_EncodeBit(rc, probs + m, bit); in RcTree_Encode()
689 RangeEnc_EncodeBit(rc, probs + m, bit); in RcTree_ReverseEncode()
701 price += GET_PRICEa(probs[symbol >> 1], symbol & 1); in RcTree_GetPrice()
716 price += GET_PRICEa(probs[m], bit); in RcTree_ReverseGetPrice()
1018 LitEnc_GetPrice(probs, curByte, p->ProbPrices)); in GetOptimum()
1231 LitEnc_GetPrice(probs, curByte, p->ProbPrices)); in GetOptimum()
1784 CLzmaProb *probs; in LzmaEnc_CodeOneBlock() local
1790 probs = LIT_PROBS(nowPos32, *(data - 1)); in LzmaEnc_CodeOneBlock()
1792 LitEnc_Encode(&p->rc, probs, curByte); in LzmaEnc_CodeOneBlock()
1982 CLzmaProb *probs = p->posSlotEncoder[i]; in LzmaEnc_Init() local
[all …]
|
| /dports/archivers/lzma/lzma-19.00/Asm/x86/ |
| H A D | LzmaDecOpt.asm | 77 ; r11 probs
110 probs equ r11 define
395 sub sym2_R, probs
413 mov probs, sym_R
427 PUP prob, probs
444 add probs, sym_R
763 UPDATE_1 probs, 0, 0
767 UPDATE_1 probs, 0, 0
784 UPDATE_0 probs, 0, 0
785 add probs, pbPos_R
[all …]
|
| /dports/archivers/lzma/lzma-19.00/C/ |
| H A D | Bcj2.c | 29 for (i = 0; i < sizeof(p->probs) / sizeof(p->probs[0]); i++) in Bcj2Dec_Init()
30 p->probs[i] = kBitModelTotal >> 1; in Bcj2Dec_Init()
199 prob = p->probs + (unsigned)(b == 0xE8 ? 2 + (unsigned)prev : (b == 0xE9 ? 1 : 0)); in Bcj2Dec_Decode()
|
| H A D | Bcj2.h | 75 UInt16 probs[2 + 256]; member
128 UInt16 probs[2 + 256]; member
|
| H A D | Bcj2Enc.c | 51 for (i = 0; i < sizeof(p->probs) / sizeof(p->probs[0]); i++) in Bcj2Enc_Init()
52 p->probs[i] = kBitModelTotal >> 1; in Bcj2Enc_Init()
188 … CProb *prob = p->probs + (unsigned)(b == 0xE8 ? 2 + (unsigned)context : (b == 0xE9 ? 1 : 0)); in Bcj2Enc_Encode_2()
|
| H A D | LzmaDec.c | 29 #define TREE_GET_BIT(probs, i) { GET_BIT2(probs + i, i, ;, ;); } argument
44 #define TREE_6_DECODE(probs, i) TREE_DECODE(probs, (1 << 6), i) argument
48 TREE_GET_BIT(probs, i); \
49 TREE_GET_BIT(probs, i); \
50 TREE_GET_BIT(probs, i); \
51 TREE_GET_BIT(probs, i); \
52 TREE_GET_BIT(probs, i); \
53 TREE_GET_BIT(probs, i); \
906 CLzmaProb *probs = p->probs; in LzmaDec_DecodeToDic() local
1065 p->probs = NULL; in LzmaDec_FreeProbs()
[all …]
|
| H A D | LzmaDec.h | 57 CLzmaProb *probs; member
76 #define LzmaDec_Construct(p) { (p)->dic = NULL; (p)->probs = NULL; }
|
| H A D | LzmaEnc.c | 813 RC_BIT(rc, probs + m, bit); in RcTree_ReverseEncode()
834 CLzmaProb *probs = p->low; in LenEnc_Encode() local
836 RC_BIT_PRE(rc, probs); in LenEnc_Encode()
839 RC_BIT_1(rc, probs); in LenEnc_Encode()
840 probs += kLenNumLowSymbols; in LenEnc_Encode()
841 RC_BIT_PRE(rc, probs); in LenEnc_Encode()
844 RC_BIT_1(rc, probs); in LenEnc_Encode()
857 RC_BIT_0(rc, probs); in LenEnc_Encode()
2098 prob = probs[m]; in FillAlignPrices()
2300 CLzmaProb *probs; in LzmaEnc_CodeOneBlock() local
[all …]
|
| /dports/archivers/lzma/lzma-19.00/CPP/7zip/Bundles/LzmaSpec/ |
| H A D | LzmaSpec.cpp | 223 unsigned BitTreeReverseDecode(CProb *probs, unsigned numBits, CRangeDecoder *rc) in BitTreeReverseDecode() argument
229 unsigned bit = rc->DecodeBit(&probs[m]); in BitTreeReverseDecode()
380 CProb *probs = &LitProbs[(UInt32)0x300 * litState]; in DecodeLiteral() local
389 unsigned bit = RangeDec.DecodeBit(&probs[((1 + matchBit) << 8) + symbol]); in DecodeLiteral()
397 symbol = (symbol << 1) | RangeDec.DecodeBit(&probs[symbol]); in DecodeLiteral()
|
| /dports/archivers/lzma/lzma-19.00/Java/SevenZip/Compression/RangeCoder/ |
| H A D | Decoder.java | 54 public int DecodeBit(short []probs, int index) throws IOException in DecodeBit() argument
56 int prob = probs[index]; in DecodeBit()
61 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits)); in DecodeBit()
73 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits)); in DecodeBit()
83 public static void InitBitModels(short []probs) in InitBitModels() argument
85 for (int i = 0; i < probs.length; i++) in InitBitModels()
86 probs[i] = (kBitModelTotal >>> 1); in InitBitModels()
|
| H A D | Encoder.java | 96 public static void InitBitModels(short []probs) in InitBitModels() argument
98 for (int i = 0; i < probs.length; i++) in InitBitModels()
99 probs[i] = (kBitModelTotal >>> 1); in InitBitModels()
102 public void Encode(short []probs, int index, int symbol) throws IOException in Encode() argument
104 int prob = probs[index]; in Encode()
109 probs[index] = (short)(prob + ((kBitModelTotal - prob) >>> kNumMoveBits)); in Encode()
115 probs[index] = (short)(prob - ((prob) >>> kNumMoveBits)); in Encode()
|
| /dports/archivers/lzmalib/lzmalib-0.0.1/7zip/Compress/LZMA_C/ |
| H A D | LzmaDecode.c | 68 #define RangeDecoderBitTreeDecode(probs, numLevels, res) \ argument
70 do { CProb *p = probs + res; RC_GET_BIT(p, res) } while(--i != 0); \
|