Lines Matching defs:smallerPtr
18467 U32* smallerPtr = bt + 2*(current&btMask);
18468 U32* largerPtr = smallerPtr + 1;
18469 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) */
18515 *smallerPtr = matchIndex; /* update smaller idx */
18517 if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */
18520 smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */
18533 *smallerPtr = *largerPtr = 0;
18687 U32* smallerPtr = bt + 2*(current&btMask);
18728 *smallerPtr = matchIndex; /* update smaller idx */
18730 if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */
18731 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */
18742 *smallerPtr = *largerPtr = 0;
20537 U32* smallerPtr = bt + 2*(current&btMask);
20538 U32* largerPtr = smallerPtr + 1;
20566 *smallerPtr = matchIndex;
20567 if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */
20568 smallerPtr = nextPtr+1; /* new "smaller" => larger of match */
20606 *smallerPtr = matchIndex; /* update smaller idx */
20608 if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop searching */
20609 smallerPtr = nextPtr+1; /* new "candidate" => larger than match, which was smaller than target */
20620 *smallerPtr = *largerPtr = 0;
20685 U32* smallerPtr = bt + 2*(current&btMask);
20826 *smallerPtr = matchIndex; /* update smaller idx */
20828 if (matchIndex <= btLow) { smallerPtr=&dummy32; break; } /* beyond tree size, stop the search */
20829 smallerPtr = nextPtr+1; /* new candidate => larger than match, which was smaller than current */
20839 *smallerPtr = *largerPtr = 0;