Searched refs:pHead (Results 1 – 4 of 4) sorted by relevance
436 ListElem::ListElem(Face * pFace,ListElem * pHead) in ListElem() argument438 m_pNext = pHead; in ListElem()439 m_pPrev = pHead->m_pPrev; in ListElem()440 pHead->m_pPrev->m_pNext = this; in ListElem()441 pHead->m_pPrev = this; in ListElem()
303 ListElem(Face * pFace,ListElem * pHead);
22306 HashElem *pHead; /* First element already in pEntry */ in insertElement() local22308 pHead = pEntry->count ? pEntry->chain : 0; in insertElement()22312 pHead = 0; in insertElement()22314 if( pHead ){ in insertElement()22315 pNew->next = pHead; in insertElement()22316 pNew->prev = pHead->prev; in insertElement()22317 if( pHead->prev ){ pHead->prev->next = pNew; } in insertElement()22319 pHead->prev = pNew; in insertElement()38241 struct RowSetEntry *pHead, *pTail;38242 rowSetTreeToList(p->pTree, &pHead, &pTail);[all …]
22306 HashElem *pHead; /* First element already in pEntry */ in insertElement() local22308 pHead = pEntry->count ? pEntry->chain : 0; in insertElement()22312 pHead = 0; in insertElement()22314 if( pHead ){ in insertElement()22315 pNew->next = pHead; in insertElement()22316 pNew->prev = pHead->prev; in insertElement()22317 if( pHead->prev ){ pHead->prev->next = pNew; } in insertElement()22319 pHead->prev = pNew; in insertElement()38230 struct RowSetEntry *pHead, *pTail;38231 rowSetTreeToList(p->pTree, &pHead, &pTail);[all …]