Lines Matching defs:dictSize
50 p->dictSize = p->mc = 0;
61 if (p->dictSize == 0) p->dictSize = (level <= 5 ? (1 << (level * 2 + 14)) : (level == 6 ? (1 << 25) : (1 << 26)));
62 if (p->dictSize > p->reduceSize)
67 if ((UInt32)p->reduceSize <= ((UInt32)2 << i)) { p->dictSize = ((UInt32)2 << i); break; }
68 if ((UInt32)p->reduceSize <= ((UInt32)3 << i)) { p->dictSize = ((UInt32)3 << i); break; }
92 return props.dictSize;
343 UInt32 dictSize;
409 props.dictSize > ((UInt32)1 << kDicLogSizeMaxCompress) || props.dictSize > ((UInt32)1 << 30))
411 p->dictSize = props.dictSize;
1935 p->matchFinderBase.bigHash = (p->dictSize > kBigHashDicLimit);
1937 if (beforeSize + p->dictSize < keepWindowSize)
1938 beforeSize = keepWindowSize - p->dictSize;
1943 RINOK(MatchFinderMt_Create(&p->matchFinderMt, p->dictSize, beforeSize, p->numFastBytes, LZMA_MATCH_LEN_MAX, allocBig));
1950 if (!MatchFinder_Create(&p->matchFinderBase, p->dictSize, beforeSize, p->numFastBytes, LZMA_MATCH_LEN_MAX, allocBig))
2035 if (p->dictSize <= ((UInt32)1 << i))
2205 UInt32 dictSize = p->dictSize;
2213 if (dictSize <= ((UInt32)2 << i))
2215 dictSize = (2 << i);
2218 if (dictSize <= ((UInt32)3 << i))
2220 dictSize = (3 << i);
2226 props[1 + i] = (Byte)(dictSize >> (8 * i));