HomeSort by: relevance | last modified time | path
    Searched refs:matchIndex (Results 1 - 7 of 7) sorted by relevancy

  /src/external/bsd/zstd/dist/contrib/externalSequenceProducer/
sequence_producer.c 47 U32 const matchIndex = hashTable[hash];
50 if (matchIndex != BADIDX) {
51 const BYTE* const match = istart + matchIndex;
  /src/external/bsd/zstd/dist/lib/compress/
zstd_opt.c 455 U32 matchIndex = hashTable[h];
489 for (; nbCompares && (matchIndex >= windowLow); --nbCompares) {
490 U32* const nextPtr = bt + 2*(matchIndex & btMask);
492 assert(matchIndex < curr);
495 const U32* predictPtr = bt + 2*((matchIndex-1) & btMask); /* written this way, as bt is a roll buffer */
496 if (matchIndex == predictedSmall) {
498 *smallerPtr = matchIndex;
499 if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */
501 matchIndex = nextPtr[1]; /* new matchIndex larger than previous (closer to current) *
    [all...]
zstd_lazy.c 54 U32 const matchIndex = hashTable[h];
61 *nextCandidatePtr = matchIndex; /* update BT like a chain */
94 U32 matchIndex = *smallerPtr; /* this candidate is unsorted : next sorted candidate is reached through *smallerPtr, while *largerPtr contains previous unsorted candidate (which is already saved and can be overwritten) */
106 for (; nbCompares && (matchIndex > windowLow); --nbCompares) {
107 U32* const nextPtr = bt + 2*(matchIndex & btMask);
109 assert(matchIndex < curr);
115 || (matchIndex+matchLength >= dictLimit) /* both in current segment*/
118 || (matchIndex+matchLength >= dictLimit)) ?
120 assert( (matchIndex+matchLength >= dictLimit) /* might be wrong if extDict is incorrectly set to 0 */
122 match = mBase + matchIndex;
    [all...]
zstd_double_fast.c 646 const U32 matchIndex = hashSmall[hSmall];
647 const BYTE* const matchBase = matchIndex < prefixStartIndex ? dictBase : base;
648 const BYTE* match = matchBase + matchIndex;
681 } else if ((matchIndex > dictStartIndex) && (MEM_read32(match) == MEM_read32(ip))) {
696 const BYTE* const matchEnd = matchIndex < prefixStartIndex ? dictEnd : iend;
697 const BYTE* const lowMatchPtr = matchIndex < prefixStartIndex ? dictStart : prefixStart;
699 offset = curr - matchIndex;
zstd_fast.c 550 U32 matchIndex = hashTable[hash0];
558 const BYTE* match = base + matchIndex;
582 /* To replicate extDict parse behavior, we only use dict matches when the normal matchIndex is invalid */
583 if (matchIndex <= prefixStartIndex) {
600 if (ZSTD_match4Found_cmov(ip0, match, matchIndex, prefixStartIndex)) {
619 matchIndex = hashTable[hash1];
  /src/external/bsd/zstd/dist/tests/
external_matchfinder.c 48 U32 const matchIndex = hashTable[hash];
51 if (matchIndex != BADIDX) {
52 const BYTE* const match = istart + matchIndex;
  /src/sys/external/isc/atheros_hal/dist/ar5416/
ar5416_reset.c 1703 int matchIndex = -1, lowIndex = -1;
1712 matchIndex = 0;
1716 matchIndex = i;
1725 if ((matchIndex == -1) && (lowIndex == -1)) {
1727 matchIndex = i - 1;
1731 if (matchIndex != -1) {
1732 OS_MEMCPY(pNewPower, &powInfo[matchIndex], sizeof(*pNewPower));
1763 int matchIndex = -1, lowIndex = -1;
1772 matchIndex = 0;
1776 matchIndex = i
    [all...]

Completed in 23 milliseconds