/external/chromium_org/third_party/sqlite/src/src/ |
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 | 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 | trigger.c | 22 pTriggerStep = pTriggerStep->pNext; 35 ** the table. The list is connected by Trigger.pNext pointers. 63 pTrig->pNext = (pList ? pList : pTab->pTrigger); 277 pStepList = pStepList->pNext; 321 pLink->pNext = pTab->pTrigger; 599 for(pp=&pTab->pTrigger; *pp!=pTrigger; pp=&((*pp)->pNext)); 600 *pp = (*pp)->pNext; 646 for(p=pList; p; p=p->pNext){ 704 for(pStep=pStepList; pStep; pStep=pStep->pNext){ 826 pPrg->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 | insert.c | 153 for(pIndex=pTab->pIndex; pIndex; pIndex=pIndex->pNext){ 202 while( pInfo && pInfo->pTab!=pTab ){ pInfo = pInfo->pNext; } 206 pInfo->pNext = pToplevel->pAinc; 237 for(p = pParse->pAinc; p; p = p->pNext){ 284 for(p = pParse->pAinc; p; p = p->pNext){ 1015 for(idx=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, idx++){ 1313 for(iCur=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, iCur++){ 1444 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){} 1499 for(i=1, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){ 1721 for(pDestIdx=pDest->pIndex; pDestIdx; pDestIdx=pDestIdx->pNext){ [all...] |
H A D | test_vfs.c | 59 TestvfsFd *pNext; /* Next handle opened on the same file */ member in struct:TestvfsFd 145 TestvfsBuffer *pNext; /* Next in linked list of all buffers */ member in struct:TestvfsBuffer 732 assert( pFd->pShmId && pFd->pShm==0 && pFd->pNext==0 ); 752 for(pBuffer=p->pBuffer; pBuffer; pBuffer=pBuffer->pNext){ 761 pBuffer->pNext = p->pBuffer; 766 pFd->pNext = pBuffer->pFile; 867 for(p2=pFd->pShm->pFile; p2; p2=p2->pNext){ 918 for(ppFd=&pBuffer->pFile; *ppFd!=pFd; ppFd=&((*ppFd)->pNext)); 920 *ppFd = pFd->pNext; 921 pFd->pNext [all...] |
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 | 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 | update.c | 178 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){ 239 for(nIdx=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, nIdx++){} 244 for(j=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, j++){ 348 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){ 355 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){ 528 for(i=0, pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext, i++){
|
H A D | os_os2.c | 751 ** pNext 766 os2ShmNode *pNext; /* Next in list of all os2ShmNode objects */ member in struct:os2ShmNode 796 os2ShmLink *pNext; /* Next os2Shm with the same os2ShmNode */ member in struct:os2ShmLink 909 pNode = pNode->pNext ) ; 944 pNode->pNext = os2ShmNodeList; 960 pLink->pNext = pNode->pFirst; 998 *ppNode = pNode->pNext; 1040 ppNode = &pNode->pNext; 1174 ppLink = &(*ppLink)->pNext ) ; 1179 *ppLink = pLink->pNext; [all...] |
H A D | delete.c | 301 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){ 357 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){ 418 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){ 594 for(i=1, pIdx=pTab->pIndex; pIdx; i++, pIdx=pIdx->pNext){
|
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){
|
H A D | os_unix.c | 195 UnixUnusedFd *pNext; /* Next unused file descriptor on same file */ member in struct:UnixUnusedFd 702 struct vxworksFileId *pNext; /* Next in a list of them all */ member in struct:vxworksFileId 780 for(pCandidate=vxworksFileList; pCandidate; pCandidate=pCandidate->pNext){ 794 pNew->pNext = vxworksFileList; 810 for(pp=&vxworksFileList; *pp && *pp!=pId; pp = &((*pp)->pNext)){} 812 *pp = pId->pNext; 943 unixInodeInfo *pNext; /* List of all unixInodeInfo objects */ member in struct:unixInodeInfo 1055 UnixUnusedFd *pNext; local 1056 for(p=pInode->pUnused; p; p=pNext){ 1057 pNext 3598 unixShm *pNext; /* Next unixShm with the same unixShmNode */ member in struct:unixShm [all...] |
H A D | tclsqlite.c | 76 SqlFunc *pNext; /* Next function on the list of them all */ member in struct:SqlFunc 87 SqlCollate *pNext; /* Next function on the list of them all */ member in struct:SqlCollate 96 SqlPreparedStmt *pNext; /* Next in linked list */ member in struct:SqlPreparedStmt 145 IncrblobChannel *pNext; /* Linked list of all open incrblob channels */ member in struct:IncrblobChannel 167 IncrblobChannel *pNext; local 169 for(p=pDb->pIncrblob; p; p=pNext){ 170 pNext = p->pNext; 189 if( p->pNext ){ 190 p->pNext [all...] |
H A D | resolve.c | 326 pNC = pNC->pNext; 397 pTopNC = pTopNC->pNext; 757 pSelect->pNext = 0; 759 pSelect->pPrior->pNext = pSelect; 803 pSelect = pSelect->pNext; 982 sNC.pNext = pOuterNC; 1043 sNC.pNext = 0;
|
H A D | os_win.c | 1262 ** pNext 1289 winShmNode *pNext; /* Next in list of all winShmNode objects */ member in struct:winShmNode 1317 winShm *pNext; /* Next winShm with the same winShmNode */ member in struct:winShm 1421 *pp = p->pNext; 1425 pp = &p->pNext; 1466 for(pShmNode = winShmNodeList; pShmNode; pShmNode=pShmNode->pNext){ 1478 pShmNode->pNext = winShmNodeList; 1530 p->pNext = pShmNode->pFirst; 1566 for(pp=&pShmNode->pFirst; (*pp)!=p; pp = &(*pp)->pNext){} 1567 *pp = p->pNext; [all...] |
H A D | pcache.c | 413 PgHdr *pNext; local 414 for(p=pCache->pDirty; p; p=pNext){ 415 pNext = p->pDirtyNext;
|
H A D | vdbeaux.c | 43 p->pNext = db->pVdbe; 81 pTmp = pA->pNext; 82 pA->pNext = pB->pNext; 83 pB->pNext = pTmp; 658 p->pNext = pVdbe->pProgram; 1936 p = p->pNext; 2397 SubProgram *pSub, *pNext; local 2401 for(pSub=p->pProgram; pSub; pSub=pNext){ 2402 pNext [all...] |
H A D | btree.c | 169 for(pLock=pBtree->pBt->pLock; pLock; pLock=pLock->pNext){ 204 for(p=pBtree->pBt->pCursor; p; p=p->pNext){ 251 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){ 315 for(pIter=pBt->pLock; pIter; pIter=pIter->pNext){ 332 pLock->pNext = pBt->pLock; 371 *ppIter = pLock->pNext; 377 ppIter = &pLock->pNext; 410 for(pLock=pBt->pLock; pLock; pLock=pLock->pNext){ 450 for(p=pBt->pCursor; p; p=p->pNext){ 476 for(p=pBt->pCursor; p; p=p->pNext){ [all...] |
H A D | status.c | 210 for(pVdbe=db->pVdbe; pVdbe; pVdbe=pVdbe->pNext){
|
/external/pdfium/fpdfsdk/include/javascript/ |
H A D | JS_Runtime.h | 15 CJS_FieldEvent* pNext;
member in class:CJS_FieldEvent
|
/external/chromium_org/third_party/sqlite/src/test/ |
H A D | threadtest3.c | 419 Statement *pNext; /* Next statement in linked-list */ member in struct:Statement 428 Thread *pNext; /* Next in this list of threads */ member in struct:Thread 532 Statement *pNext; local 533 for(pIter=pDb->pCache; pIter; pIter=pNext){ 534 pNext = pIter->pNext; 567 for(pRet=pDb->pCache; pRet; pRet=pRet->pNext){ 581 pRet->pNext = pDb->pCache; 749 p->pNext = pThreads->pThread; 760 Thread *pNext; local [all...] |
/external/chromium_org/third_party/sqlite/src/ext/fts3/ |
H A D | fts3_write.c | 64 Fts3DeferredToken *pNext; /* Next in list of deferred tokens */ member in struct:Fts3DeferredToken 913 char *pNext; /* Cursor variable */ local 918 pNext = pReader->aNode; 920 pNext = &pReader->aDoclist[pReader->nDoclist]; 923 if( !pNext || pNext>=&pReader->aNode[pReader->nNode] ){ 958 pNext = pReader->aNode; 964 pNext += sqlite3Fts3GetVarint32(pNext, &nPrefix); 965 pNext 2531 Fts3DeferredToken *pNext; local [all...] |
/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/chromium_org/third_party/sqlite/src/ext/rtree/ |
H A D | rtree.c | 157 ** RtreeNode.pNext. RtreeNode.iNode stores the depth of the sub-tree 263 RtreeNode *pNext; /* Next node in this hash chain */ member in struct:RtreeNode 412 for(p=pRtree->aHash[nodeHash(iNode)]; p && p->iNode!=iNode; p=p->pNext); 421 assert( pNode->pNext==0 ); 423 pNode->pNext = pRtree->aHash[iHash]; 434 for( ; (*pp)!=pNode; pp = &(*pp)->pNext){ assert(*pp); } 435 *pp = pNode->pNext; 436 pNode->pNext = 0; 502 pNode->pNext = 0; 2121 RtreeCell *pNext; local [all...] |