Searched refs:smallerPtr (Results 1 – 4 of 4) sorted by relevance
| /freebsd/sys/contrib/openzfs/module/zstd/lib/compress/ |
| H A D | zstd_opt.c | 391 U32* smallerPtr = bt + 2*(current&btMask); in ZSTD_insertBt1() local
392 U32* largerPtr = smallerPtr + 1; in ZSTD_insertBt1()
420 *smallerPtr = matchIndex; in ZSTD_insertBt1()
421 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */ in ZSTD_insertBt1()
422 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */ in ZSTD_insertBt1()
460 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_insertBt1()
462 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */ in ZSTD_insertBt1()
463 …smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller t… in ZSTD_insertBt1()
474 *smallerPtr = *largerPtr = 0; in ZSTD_insertBt1()
539 U32* smallerPtr = bt + 2*(current&btMask); in ZSTD_insertBtAndGetAllMatches() local
[all …]
|
| H A D | zstd_lazy.c | 82 U32* smallerPtr = bt + 2*(current&btMask); in ZSTD_insertDUBT1() local
83 U32* largerPtr = smallerPtr + 1; in ZSTD_insertDUBT1()
84 …U32 matchIndex = *smallerPtr; /* this candidate is unsorted : next sorted candidate is reached t… in ZSTD_insertDUBT1()
130 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_insertDUBT1()
132 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */ in ZSTD_insertDUBT1()
135 …smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller t… in ZSTD_insertDUBT1()
148 *smallerPtr = *largerPtr = 0; in ZSTD_insertDUBT1()
302 U32* smallerPtr = bt + 2*(current&btMask); in ZSTD_DUBT_findBestMatch() local
343 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_DUBT_findBestMatch()
345 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */ in ZSTD_DUBT_findBestMatch()
[all …]
|
| /freebsd/sys/contrib/zstd/lib/compress/ |
| H A D | zstd_opt.c | 434 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertBt1() local
435 U32* largerPtr = smallerPtr + 1; in ZSTD_insertBt1()
467 *smallerPtr = matchIndex; in ZSTD_insertBt1()
468 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */ in ZSTD_insertBt1()
469 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */ in ZSTD_insertBt1()
507 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_insertBt1()
509 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */ in ZSTD_insertBt1()
510 …smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller t… in ZSTD_insertBt1()
521 *smallerPtr = *largerPtr = 0; in ZSTD_insertBt1()
586 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertBtAndGetAllMatches() local
[all …]
|
| H A D | zstd_lazy.c | 82 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_insertDUBT1() local
83 U32* largerPtr = smallerPtr + 1; in ZSTD_insertDUBT1()
84 …U32 matchIndex = *smallerPtr; /* this candidate is unsorted : next sorted candidate is reached t… in ZSTD_insertDUBT1()
130 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_insertDUBT1()
132 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */ in ZSTD_insertDUBT1()
135 …smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller t… in ZSTD_insertDUBT1()
148 *smallerPtr = *largerPtr = 0; in ZSTD_insertDUBT1()
303 U32* smallerPtr = bt + 2*(curr&btMask); in ZSTD_DUBT_findBestMatch() local
344 *smallerPtr = matchIndex; /* update smaller idx */ in ZSTD_DUBT_findBestMatch()
346 … if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */ in ZSTD_DUBT_findBestMatch()
[all …]
|