Searched refs:pETEchase (Results 1 - 3 of 3) sorted by path

/xsrc/external/mit/libX11/dist/src/
H A DPolyReg.c344 register EdgeTableEntry *pETEchase;
353 pETEchase = AET;
354 while (pETEchase->back->bres.minor_axis > AET->bres.minor_axis)
355 pETEchase = pETEchase->back;
358 if (pETEchase != pETEinsert)
360 pETEchaseBackTMP = pETEchase->back;
364 pETEinsert->next = pETEchase;
365 pETEchase->back->next = pETEinsert;
366 pETEchase
340 register EdgeTableEntry *pETEchase; local in function:InsertionSort
[all...]
/xsrc/external/mit/xorg-server.old/dist/mi/
H A Dmipolyutil.c346 EdgeTableEntry *pETEchase;
355 pETEchase = AET;
356 while (pETEchase->back->bres.minor > AET->bres.minor)
357 pETEchase = pETEchase->back;
360 if (pETEchase != pETEinsert)
362 pETEchaseBackTMP = pETEchase->back;
366 pETEinsert->next = pETEchase;
367 pETEchase->back->next = pETEinsert;
368 pETEchase
341 EdgeTableEntry *pETEchase; local in function:miInsertionSort
[all...]
/xsrc/external/mit/xorg-server/dist/mi/
H A Dmipoly.c321 EdgeTableEntry *pETEchase; local in function:miInsertionSort
329 pETEchase = AET;
330 while (pETEchase->back->bres.minor > AET->bres.minor)
331 pETEchase = pETEchase->back;
334 if (pETEchase != pETEinsert) {
335 pETEchaseBackTMP = pETEchase->back;
339 pETEinsert->next = pETEchase;
340 pETEchase->back->next = pETEinsert;
341 pETEchase
[all...]

Completed in 10 milliseconds