/external/chromium_org/components/policy/core/common/ |
H A D | policy_loader_win.cc | 522 policy_object; policy_object = policy_object->pNext) {
|
H A D | policy_loader_win_unittest.cc | 740 gpo->pNext = next;
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | uloc_tag.c | 2081 char *pSubtag, *pNext, *pLastGoodPosition; local 2158 pNext = pLastGoodPosition = tagBuf; 2164 while (pNext) { 2167 pSubtag = pNext; 2179 pNext = NULL; 2181 pNext = pSep + 1; 2354 if (pNext == NULL) { 2359 pPrivuseVal = pNext; 2362 while (pNext) { 2363 pSubtag = pNext; [all...] |
/external/chromium_org/third_party/libva/va/ |
H A D | va_backend.h | 520 VADisplayContextP pNext; member in struct:VADisplayContext
|
/external/chromium_org/third_party/libvpx/source/libvpx/third_party/libwebm/ |
H A D | mkvparser.cpp | 2551 CuePoint* const pNext = pp[index]; 2552 assert(pNext); 2554 pNext->Load(m_pSegment->m_pReader); 2568 CuePoint* const pNext = pp[index]; local 2569 assert(pNext); 2570 assert(pNext->GetTimeCode() >= 0); 2573 return pNext; 2973 Cluster* const pNext = m_clusters[idx]; local 2974 assert(pNext); 2975 assert(pNext 3112 Cluster* const pNext = Cluster::Create(this, -1, off_next); local 3470 Cluster* const pNext = Cluster::Create(this, local [all...] |
H A D | mkvparser.hpp | 360 long GetNext(const BlockEntry* pCurr, const BlockEntry*& pNext) const; 877 long ParseNext(const Cluster* pCurr, const Cluster*& pNext, long long& pos,
|
/external/chromium_org/third_party/sqlite/amalgamation/ |
H A D | sqlite3.c | 1322 ** the pNext pointer. The [sqlite3_vfs_register()] 1326 ** implementation should use the pNext pointer. 1328 ** The pNext field is the only field in the sqlite3_vfs 1463 sqlite3_vfs *pNext; /* Next registered VFS */ member in struct:sqlite3_vfs 7955 SubProgram *pNext; /* Next sub-program already visited */ member in struct:SubProgram 9106 LookasideSlot *pNext; /* Next buffer in the list of free buffers */ member in struct:LookasideSlot 9325 FuncDef *pNext; /* Next function with same name */ member in struct:FuncDef 9411 Savepoint *pNext; /* Parent savepoint (if any) */ member in struct:Savepoint 9580 VTable *pNext; /* Next in linked list (see above) */ member in struct:VTable 9826 Index *pNext; /* Th member in struct:Index 10352 NameContext *pNext; /* Next outer name context. NULL for outermost */ member in struct:NameContext 10386 Select *pNext; /* Next select to the left in a compound */ member in struct:Select 10449 AutoincInfo *pNext; /* Next info block in a list of them all */ member in struct:AutoincInfo 10485 TriggerPrg *pNext; /* Next entry in Parse.pTriggerPrg list */ member in struct:TriggerPrg 10655 Trigger *pNext; /* Next trigger associated with the table */ member in struct:Trigger 10715 TriggerStep *pNext; /* Next in the link-list */ member in struct:TriggerStep 12499 Vdbe *pPrev,*pNext; /* Linked list of VDBEs with the same Vdbe.db */ member in struct:Vdbe 14635 struct MemBlockHdr *pNext, *pPrev; /* Linked list of all unfreed memory */ member in struct:MemBlockHdr 17745 struct ScratchFreeslot *pNext; /* Next unused scratch buffer */ member in struct:ScratchFreeslot 22778 os2ShmNode *pNext; /* Next in list of all os2ShmNode objects */ member in struct:os2ShmNode 22808 os2ShmLink *pNext; /* Next os2Shm with the same os2ShmNode */ member in struct:os2ShmLink 24131 UnixUnusedFd *pNext; /* Next unused file descriptor on same file */ member in struct:UnixUnusedFd 24843 struct vxworksFileId *pNext; /* Next in a list of them all */ member in struct:vxworksFileId 25084 unixInodeInfo *pNext; /* List of all unixInodeInfo objects */ member in struct:unixInodeInfo 25196 UnixUnusedFd *pNext; local 27739 unixShm *pNext; /* Next unixShm with the same unixShmNode */ member in struct:unixShm 32408 winShmNode *pNext; /* Next in list of all winShmNode objects */ member in struct:winShmNode 32436 winShm *pNext; /* Next winShm with the same winShmNode */ member in struct:winShm 34738 PgHdr *pNext; local 35012 PgHdr1 *pNext; /* Next in hash table chain */ member in struct:PgHdr1 35023 PgFreeslot *pNext; /* Next free slot */ member in struct:PgFreeslot 35306 PgHdr1 *pNext = p->apHash[i]; local 39368 PgHdr *pNext = pList->pDirty; local 46516 BtLock *pNext; /* Next in BtShared.pLock list */ member in struct:BtLock 46552 Btree *pNext; /* List of other sharable Btrees from the same db */ member in struct:Btree 46635 BtShared *pNext; /* Next on a list of sharable BtShared structs */ member in struct:BtShared 46689 BtCursor *pNext, *pPrev; /* Forms a linked list of all cursors */ member in struct:BtCursor 55309 sqlite3_backup *pNext; /* Next backup associated with source pager */ member in struct:sqlite3_backup 59522 SubProgram *pSub, *pNext; local 61641 sqlite3_stmt *pNext; local 69180 FileChunk *pNext; /* Next chunk in the journal */ member in struct:FileChunk 77348 Index *pIndex, *pNext; local 84447 FKey *pNext; /* Copy of pFKey->pNextFrom */ local 96866 VTable *pNext = pVTable->pNext; local 96914 VTable *pNext = p->pNext; local 107989 FuncDef *pNext, *pHash, *p; local 119981 Fts3DeferredToken *pNext; /* Next in list of deferred tokens */ member in struct:Fts3DeferredToken 120830 char *pNext; /* Cursor variable */ local 122448 Fts3DeferredToken *pNext; local 124531 RtreeNode *pNext; /* Next node in this hash chain */ member in struct:RtreeNode 126389 RtreeCell *pNext; local [all...] |
H A D | sqlite3.h | 779 ** the pNext pointer. The [sqlite3_vfs_register()] 783 ** implementation should use the pNext pointer. 785 ** The pNext field is the only field in the sqlite3_vfs 920 sqlite3_vfs *pNext; /* Next registered VFS */ member in struct:sqlite3_vfs
|
/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/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/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...] |
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | alter.c | 310 for(pTrig=sqlite3TriggerList(pParse, pTab); pTrig; pTrig=pTrig->pNext){ 348 for(pTrig=sqlite3TriggerList(pParse, pTab); pTrig; pTrig=pTrig->pNext){
|
H A D | analyze.c | 165 for(pIdx=pTab->pIndex; pIdx; pIdx=pIdx->pNext){
|
H A D | attach.c | 368 0, /* pNext */ 390 0, /* pNext */ 539 pStep = pStep->pNext;
|
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 | 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 | 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 | 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 | build.c | 382 pIndex->pTable->pIndex = pIndex->pNext; 388 while( ALWAYS(p) && p->pNext!=pIndex ){ p = p->pNext; } 389 if( ALWAYS(p && p->pNext==pIndex) ){ 390 p->pNext = pIndex->pNext; 509 Index *pIndex, *pNext; local 518 for(pIndex = pTable->pIndex; pIndex; pIndex=pNext){ 519 pNext = pIndex->pNext; [all...] |
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 | 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 | expr.c | 1485 for(pIdx=pTab->pIndex; pIdx && eType==0 && affinity_ok; pIdx=pIdx->pNext){
|
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 | 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 | main.c | 487 p->pNext = db->lookaside.pFree; 650 db->pSavepoint = pTmp->pNext; 744 FuncDef *pNext, *pHash, *p; local 749 pNext = p->pNext; 751 p = pNext;
|