/external/chromium_org/third_party/sqlite/src/src/ |
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 | 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 | pcache.c | 413 PgHdr *pNext; local 414 for(p=pCache->pDirty; p; p=pNext){ 415 pNext = p->pDirtyNext;
|
H A D | test_server.c | 230 SqlMessage *pNext; /* Next message in the queue */ member in struct:SqlMessage 281 pMsg->pNext = g.pQueueHead; 410 pMsg->pPrev->pNext = 0;
|
H A D | vdbe.h | 85 SubProgram *pNext; /* Next sub-program already visited */ member in struct:SubProgram
|
H A D | backup.c | 46 sqlite3_backup *pNext; /* Next backup associated with source pager */ member in struct:sqlite3_backup 318 p->pNext = *pp; 561 pp = &(*pp)->pNext; 563 *pp = p->pNext; 618 for(p=pBackup; p; p=p->pNext){ 651 for(p=pBackup; p; p=p->pNext){
|
H A D | malloc.c | 40 struct ScratchFreeslot *pNext; /* Next unused scratch buffer */ member in struct:ScratchFreeslot 175 pSlot->pNext = (ScratchFreeslot*)(sz+(char*)pSlot); 176 pSlot = pSlot->pNext; 178 pSlot->pNext = 0; 356 mem0.pScratchFree = mem0.pScratchFree->pNext; 404 pSlot->pNext = mem0.pScratchFree; 493 pBuf->pNext = db->lookaside.pFree; 625 db->lookaside.pFree = pBuf->pNext;
|
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 | fkey.c | 225 for(pIdx=pParent->pIndex; pIdx; pIdx=pIdx->pNext){ 1155 FKey *pNext; /* Copy of pFKey->pNextFrom */ local 1158 for(pFKey=pTab->pFKey; pFKey; pFKey=pNext){ 1185 pNext = pFKey->pNextFrom;
|
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 | 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_journal.c | 130 jt_file *pNext; /* All files are stored in a linked list */ member in struct:jt_file 170 0, /* pNext */ 257 for(pp=&g.pList; *pp!=p; pp=&(*pp)->pNext); 258 *pp = p->pNext; 294 for(pMain=g.pList; pMain; pMain=pMain->pNext){ 708 p->pNext = 0; 713 p->pNext = g.pList;
|
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 | vtab.c | 107 for(pVtab=pTab->pVTable; pVtab && pVtab->db!=db; pVtab=pVtab->pNext); 154 VTable *pNext = pVTable->pNext; local 159 pRet->pNext = 0; 161 pVTable->pNext = db2->pDisconnect; 164 pVTable = pNext; 202 VTable *pNext = p->pNext; local 204 p = pNext; 489 pVTable->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 | 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...] |
H A D | test_multiplex.c | 107 multiplexGroup *pNext, *pPrev; /* Doubly linked list of all group objects */ member in struct:multiplexGroup 368 pGroup->pNext = gMultiplex.pGroups; 484 if( pGroup->pNext ) pGroup->pNext->pPrev = pGroup->pPrev; 486 pGroup->pPrev->pNext = pGroup->pNext; 488 gMultiplex.pGroups = pGroup->pNext; 1064 for(pGroup=gMultiplex.pGroups; pGroup; pGroup=pGroup->pNext){
|
/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/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/chromium/third_party/libjingle/source/talk/xmllite/ |
H A D | xmlelement.cc | 336 XmlElement::InsertChildAfter(XmlChild * pPredecessor, XmlChild * pNext) { argument 338 pNext->pNextChild_ = pFirstChild_; 339 pFirstChild_ = pNext; 342 pNext->pNextChild_ = pPredecessor->pNextChild_; 343 pPredecessor->pNextChild_ = pNext; 349 XmlChild * pNext; local 352 pNext = pFirstChild_; 353 pFirstChild_ = pNext->pNextChild_; 356 pNext = pPredecessor->pNextChild_; 357 pPredecessor->pNextChild_ = pNext [all...] |
/external/chromium_org/third_party/libva/va/ |
H A D | va_backend.h | 442 VADisplayContextP pNext; member in struct:VADisplayContext
|
/external/libnfc-nci/src/nfc/ndef/ |
H A D | ndef_utils.c | 1454 UINT8 *pNext, *pPrev; local 1463 if ((pNext = NDEF_MsgGetRecByIndex(p_msg, 1)) != NULL) 1465 *pNext |= NDEF_MB_MASK; 1467 *p_cur_size -= (UINT32)(pNext - p_msg); 1469 shiftup (p_msg, pNext, *p_cur_size); 1494 if ((pNext = NDEF_MsgGetNextRec (p_rec)) == NULL) 1497 /* We are removing p_rec, so shift from pNext to the end */ 1498 shiftup (p_rec, pNext, (UINT32)(*p_cur_size - (pNext - p_msg))); 1500 *p_cur_size -= (UINT32)(pNext [all...] |
/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...] |