/external/pdfium/core/src/fxcrt/ |
H A D | fx_basic_plex.cpp | 15 p->pNext = pHead;
24 CFX_Plex* pNext = p->pNext;
local 26 p = pNext;
|
H A D | fx_basic_list.cpp | 24 m_pNodeTail->pNext = pNewNode;
49 CNode* pNewNode = NewNode(pOldNode, pOldNode->pNext);
51 if (pOldNode->pNext != NULL) {
52 pOldNode->pNext->pPrev = pNewNode;
56 pOldNode->pNext = pNewNode;
63 m_pNodeHead = pOldNode->pNext;
65 pOldNode->pPrev->pNext = pOldNode->pNext;
70 pOldNode->pNext->pPrev = pOldNode->pPrev;
76 pNode->pNext 91 NewNode(CFX_PtrList::CNode* pPrev, CFX_PtrList::CNode* pNext) argument [all...] |
H A D | plex.h | 8 CFX_Plex* pNext;
member in struct:CFX_Plex
|
H A D | fx_basic_maps.cpp | 61 if ((pAssocNext = pAssocRet->pNext) == NULL) {
101 pAssoc->pNext = m_pHashTable[nHash];
114 for (pAssoc = m_pHashTable[nHash]; pAssoc != NULL; pAssoc = pAssoc->pNext) {
129 pAssoc->pNext = m_pFreeList;
135 m_pFreeList = m_pFreeList->pNext;
167 for (pAssoc = *ppAssocPrev; pAssoc != NULL; pAssoc = pAssoc->pNext) {
169 *ppAssocPrev = pAssoc->pNext;
173 ppAssocPrev = &pAssoc->pNext;
179 pAssoc->pNext = m_pFreeList;
204 pAssoc = pAssoc->pNext) {
[all...] |
/external/libnfc-nxp/Linux_x86/ |
H A D | phDal4Nfc_messageQueueLib.c | 47 struct phDal4Nfc_message_queue_item * pNext; member in struct:phDal4Nfc_message_queue_item 109 while(p->pNext != NULL) { p = p->pNext; } 113 phOsalNfc_FreeMemory(p->pNext); 114 p->pNext = NULL; 161 while(p->pNext != NULL) { p = p->pNext; } 162 p->pNext = pNew; 207 p = pQueue->pItems->pNext;
|
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | test_fuzzer.c | 126 fuzzer_rule *pNext; /* Next rule in order of increasing rCost */ member in struct:fuzzer_rule 151 fuzzer_stem *pNext; /* Next stem in rCost order */ member in struct:fuzzer_stem 219 p->pRule = pRule->pNext; 242 pTail->pNext = pA; 244 pA = pA->pNext; 246 pTail->pNext = pB; 248 pB = pB->pNext; 252 pTail->pNext = pB; 254 pTail->pNext = pA; 256 return head.pNext; 299 fuzzer_stem *pNext = pStem->pNext; local [all...] |
H A D | test_wsd.c | 35 ProcessLocalVar *pNext; member in struct:ProcessLocalVar 66 for(pVar=pGlobal->aData[iHash]; pVar && pVar->pKey!=K; pVar=pVar->pNext); 74 pVar->pNext = pGlobal->aData[iHash];
|
H A D | btmutex.c | 61 ** by all database connections. The p->pNext is a list of other 64 ** p, then first unlock all of the others on p->pNext, then wait 72 ** connected by pNext and pPrev should be in sorted order by 75 assert( p->pNext==0 || p->pNext->pBt>p->pBt ); 77 assert( p->pNext==0 || p->pNext->db==p->db ); 79 assert( p->sharable || (p->pNext==0 && p->pPrev==0) ); 111 for(pLater=p->pNext; pLater; pLater=pLater->pNext){ [all...] |
H A D | memjournal.c | 44 FileChunk *pNext; /* Next chunk in the journal */ member in struct:FileChunk 91 pChunk=pChunk->pNext 107 } while( nRead>=0 && (pChunk=pChunk->pNext)!=0 && nRead>0 ); 144 pNew->pNext = 0; 147 pChunk->pNext = pNew; 175 pChunk = pChunk->pNext;
|
H A D | os.c | 266 for(pVfs = vfsList; pVfs; pVfs=pVfs->pNext){ 282 vfsList = pVfs->pNext; 285 while( p->pNext && p->pNext!=pVfs ){ 286 p = p->pNext; 288 if( p->pNext==pVfs ){ 289 p->pNext = pVfs->pNext; 309 pVfs->pNext = vfsList; 312 pVfs->pNext [all...] |
H A D | test_btree.c | 35 for(pBt=GLOBAL(BtShared*,sqlite3SharedCacheList); pBt; pBt=pBt->pNext){ 52 for(pCur=pBt->pCursor; pCur; pCur=pCur->pNext){
|
H A D | pcache1.c | 98 PgHdr1 *pNext; /* Next in hash table chain */ member in struct:PgHdr1 109 PgFreeslot *pNext; /* Next free slot */ member in struct:PgFreeslot 191 p->pNext = pcache1.pFree; 216 pcache1.pFree = pcache1.pFree->pNext; 250 pSlot->pNext = pcache1.pFree; 392 PgHdr1 *pNext = p->apHash[i]; local 393 while( (pPage = pNext)!=0 ){ 395 pNext = pPage->pNext; 396 pPage->pNext [all...] |
H A D | mem2.c | 57 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */ member in struct:MemBlockHdr 260 pHdr->pNext = 0; 263 mem.pLast->pNext = pHdr; 312 assert( pHdr->pPrev->pNext==pHdr ); 313 pHdr->pPrev->pNext = pHdr->pNext; 316 mem.pFirst = pHdr->pNext; 318 if( pHdr->pNext ){ 319 assert( pHdr->pNext->pPrev==pHdr ); 320 pHdr->pNext [all...] |
H A D | btreeInt.h | 314 BtLock *pNext; /* Next in BtShared.pLock list */ member in struct:BtLock 350 Btree *pNext; /* List of other sharable Btrees from the same db */ member in struct:Btree 379 ** mutex, except for nRef and pNext which are accessed under the 433 BtShared *pNext; /* Next on a list of sharable BtShared structs */ member in struct:BtShared 487 BtCursor *pNext, *pPrev; /* Forms a linked list of all cursors */ member in struct:BtCursor
|
H A D | callback.c | 293 assert( pOther!=pDef && pOther->pNext!=pDef ); 294 pDef->pNext = pOther->pNext; 295 pOther->pNext = pDef; 297 pDef->pNext = 0; 351 p = p->pNext; 376 p = p->pNext;
|
H A D | test_quota.c | 81 quotaGroup *pNext, **ppPrev; /* Doubly linked list of all quota objects */ member in struct:quotaGroup 98 quotaFile *pNext, **ppPrev; /* Linked list of files in the same group */ member in struct:quotaFile 173 *pGroup->ppPrev = pGroup->pNext; 174 if( pGroup->pNext ) pGroup->pNext->ppPrev = pGroup->ppPrev; 267 p=p->pNext){} 323 pFile=pFile->pNext){} 335 pFile->pNext = pGroup->pFiles; 336 if( pGroup->pFiles ) pGroup->pFiles->ppPrev = &pFile->pNext; 371 if( pFile->pNext ) pFil [all...] |
H A D | test_onefile.c | 105 fs_real_file *pNext; member in struct:fs_real_file 188 0, /* pNext */ 386 *pReal->ppThis = pReal->pNext; 387 if( pReal->pNext ){ 388 pReal->pNext->ppThis = pReal->ppThis; 611 for(; pReal && strncmp(pReal->zName, zName, nName); pReal=pReal->pNext); 656 pReal->pNext = pFsVfs->pFileList; 657 if( pReal->pNext ){ 658 pReal->pNext->ppThis = &pReal->pNext; [all...] |
H A D | test6.c | 123 WriteBuffer *pNext; /* Next in CrashGlobal.pWriteList */ member in struct:WriteBuffer 205 for(pWrite=g.pWriteList; pWrite; pWrite=pWrite->pNext){ 213 for(pWrite=g.pWriteList; pWrite; pWrite=pWrite->pNext) nWrite++; 216 for(pWrite=g.pWriteList; iFinal>0; pWrite=pWrite->pNext) iFinal--; 285 *ppPtr = pWrite->pNext; 297 ppPtr = &pWrite->pNext; 334 ppPtr = &pWrite->pNext; 349 for(pWrite=g.pWriteList; pWrite && pWrite->pNext; pWrite=pWrite->pNext); 383 g.pWriteListEnd->pNext [all...] |
/external/mdnsresponder/mDNSShared/ |
H A D | GenLinkedList.c | 143 void *pNext; local 145 pNext = pList->Head; 152 if ( pNext) { 153 ASSIGNLINK( pNext, elem, pList->BackLinkOffset); 164 void *pNext, *pPrev; local 166 pNext = GETLINK( elem, pList->FwdLinkOffset); 171 ASSIGNLINK( pPrev, pNext, pList->FwdLinkOffset); 173 pList->Head = pNext; 176 if ( pNext) 177 ASSIGNLINK( pNext, pPre [all...] |
/external/libnfc-nxp/src/ |
H A D | phFriNfc_LlcpUtils.c | 221 uint8_t * pNext; local 225 pNext = (uint8_t*)pUtilFifo->pIn+1; 227 if(pNext > pUtilFifo->pBuffEnd) 230 pNext = pUtilFifo->pBuffStart; 239 if(pNext == pUtilFifo->pOut) 246 *pNext = *pData++; 247 pUtilFifo->pIn = pNext; 261 uint8_t * pNext; local 277 pNext = pUtilFifo->pBuffStart; 281 pNext [all...] |
/external/pdfium/core/src/fpdfdoc/ |
H A D | doc_bookmark.cpp | 24 CPDF_Dictionary *pNext = This.m_pDict->GetDict("Next");
local 25 return pNext == This.m_pDict ? NULL : pNext;
|
H A D | doc_action.cpp | 247 CPDF_Object* pNext = m_pDict->GetElementValue("Next");
local 248 if (!pNext) {
251 int iObjType = pNext->GetType();
256 return ((CPDF_Array*)pNext)->GetCount();
265 CPDF_Object* pNext = m_pDict->GetElementValue("Next");
local 266 int iObjType = pNext->GetType();
269 return (CPDF_Dictionary*)pNext;
273 return ((CPDF_Array*)pNext)->GetDict(iIndex);
|
/external/qemu/distrib/sdl-1.2.15/src/joystick/darwin/ |
H A D | SDL_sysjoystick.c | 73 struct recElement * pNext; /* next element in list */ member in struct:recElement 97 struct joystick_hwdata* pNext; /* next device */ member in struct:joystick_hwdata 364 elementCurrent = elementPrevious->pNext; 366 elementPrevious->pNext = element; 368 element->pNext = NULL; 530 recElement *pElementNext = pElement->pNext; 548 pDeviceNext = (*ppDevice)->pNext; 664 lastDevice->pNext = device; 676 device = device->pNext; 688 device = device->pNext; [all...] |
/external/chromium_org/third_party/sqlite/src/ext/async/ |
H A D | sqlite3async.c | 461 AsyncWrite *pNext; /* Next write operation (to any file) */ member in struct:AsyncWrite 489 AsyncLock *pNext; /* Next in linked list headed by async.pLock */ member in struct:AsyncLock 500 AsyncFileLock *pNext; member in struct:AsyncFileLock 545 assert( !pWrite->pNext ); 548 async.pQueueLast->pNext = pWrite; 612 p->pNext = 0; 702 for(pWrite=async.pQueueFirst; pWrite; pWrite = pWrite->pNext){ 784 for(pWrite=async.pQueueFirst; pWrite; pWrite = pWrite->pNext){ 819 for(pIter=pLock->pList; pIter; pIter=pIter->pNext){ 852 p = p->pNext; [all...] |
/external/pdfium/fpdfsdk/src/javascript/ |
H A D | JS_Runtime.cpp | 246 m_pFieldEventPath->pNext = NULL;
260 p = p->pNext;
267 pNew->pNext = NULL;
269 pLast->pNext = pNew;
289 p = p->pNext;
300 pLast->pNext = NULL;
311 p = pOld->pNext;
|