Searched refs:pETEchase (Results 1 – 1 of 1) sorted by relevance
321 EdgeTableEntry *pETEchase; in miInsertionSort() local329 pETEchase = AET; in miInsertionSort()330 while (pETEchase->back->bres.minor > AET->bres.minor) in miInsertionSort()331 pETEchase = pETEchase->back; in miInsertionSort()334 if (pETEchase != pETEinsert) { in miInsertionSort()335 pETEchaseBackTMP = pETEchase->back; in miInsertionSort()339 pETEinsert->next = pETEchase; in miInsertionSort()340 pETEchase->back->next = pETEinsert; in miInsertionSort()341 pETEchase->back = pETEinsert; in miInsertionSort()