Home
last modified time | relevance | path

Searched refs:pRoot (Results 1 – 14 of 14) sorted by relevance

/sqlite-3.40.0/src/
H A Dtest_vfstrace.c663 rc = pRoot->xDelete(pRoot, zPath, dirSync); in vfstraceDelete()
718 return pRoot->xDlOpen(pRoot, zPath); in vfstraceDlOpen()
730 pRoot->xDlError(pRoot, nByte, zErrMsg); in vfstraceDlError()
741 return pRoot->xDlSym(pRoot, p, zSym); in vfstraceDlSym()
751 pRoot->xDlClose(pRoot, pHandle); in vfstraceDlClose()
762 return pRoot->xRandomness(pRoot, nByte, zBufOut); in vfstraceRandomness()
772 return pRoot->xSleep(pRoot, nMicro); in vfstraceSleep()
781 return pRoot->xCurrentTime(pRoot, pTimeOut); in vfstraceCurrentTime()
795 return pRoot->xGetLastError(pRoot, iErr, zErr); in vfstraceGetLastError()
816 return pRoot->xGetSystemCall(pRoot, zName); in vfstraceGetSystemCall()
[all …]
H A Djson.c1134 while( j<=pRoot->n ){ in jsonLookupStep()
1142 assert( pRoot->eU==2 ); in jsonLookupStep()
1143 iRoot += pRoot->u.iAppend; in jsonLookupStep()
1157 assert( pRoot->eU==0 ); in jsonLookupStep()
1160 VVA( pRoot->eU = 2 ); in jsonLookupStep()
1174 JsonNode *pBase = pRoot; in jsonLookupStep()
1212 while( j<=pRoot->n && (i>0 || (pRoot[j].jnFlags & JNODE_REMOVE)!=0) ){ in jsonLookupStep()
1217 assert( pRoot->eU==2 ); in jsonLookupStep()
1222 if( j<=pRoot->n ){ in jsonLookupStep()
1233 assert( pRoot->eU==0 ); in jsonLookupStep()
[all …]
H A Dmem3.c147 static void memsys3UnlinkFromList(u32 i, u32 *pRoot){ in memsys3UnlinkFromList() argument
152 *pRoot = next; in memsys3UnlinkFromList()
187 static void memsys3LinkIntoList(u32 i, u32 *pRoot){ in memsys3LinkIntoList() argument
189 mem3.aPool[i].u.list.next = *pRoot; in memsys3LinkIntoList()
191 if( *pRoot ){ in memsys3LinkIntoList()
192 mem3.aPool[*pRoot].u.list.prev = i; in memsys3LinkIntoList()
194 *pRoot = i; in memsys3LinkIntoList()
315 static void memsys3Merge(u32 *pRoot){ in memsys3Merge() argument
319 for(i=*pRoot; i>0; i=iNext){ in memsys3Merge()
324 memsys3UnlinkFromList(i, pRoot); in memsys3Merge()
H A Dbtree.c5343 MemPage *pRoot; in moveToRoot() local
5383 pRoot = pCur->pPage; in moveToRoot()
5396 assert( pRoot->intKey==1 || pRoot->intKey==0 ); in moveToRoot()
5397 if( pRoot->isInit==0 || (pCur->pKeyInfo==0)!=pRoot->intKey ){ in moveToRoot()
5406 if( pRoot->nCell>0 ){ in moveToRoot()
5411 subpage = get4byte(&pRoot->aData[pRoot->hdrOffset+8]); in moveToRoot()
8685 pRoot->nOverflow*sizeof(pRoot->aiOvfl[0])); in balance_deeper()
8687 pRoot->nOverflow*sizeof(pRoot->apOvfl[0])); in balance_deeper()
8692 put4byte(&pRoot->aData[pRoot->hdrOffset+8], pgnoChild); in balance_deeper()
9628 MemPage *pRoot; in btreeCreateTable() local
[all …]
H A Dvdbesort.c2369 MergeEngine *pRoot, /* Root of tree */ in vdbeSorterAddToTree() argument
2375 MergeEngine *p = pRoot; in vdbeSorterAddToTree()
2444 MergeEngine *pRoot = 0; /* Root node of tree for this task */ in vdbeSorterMergeTreeBuild() local
2449 rc = vdbeMergeEngineLevel0(pTask, pTask->nPMA, &iReadOff, &pRoot); in vdbeSorterMergeTreeBuild()
2453 pRoot = vdbeMergeEngineNew(SORTER_MAX_MERGE_COUNT); in vdbeSorterMergeTreeBuild()
2454 if( pRoot==0 ) rc = SQLITE_NOMEM_BKPT; in vdbeSorterMergeTreeBuild()
2462 rc = vdbeSorterAddToTree(pTask, nDepth, iSeq++, pRoot, pMerger); in vdbeSorterMergeTreeBuild()
2470 rc = vdbeIncrMergerNew(pTask, pRoot, &pMain->aReadr[iTask].pIncr); in vdbeSorterMergeTreeBuild()
2475 pMain = pRoot; in vdbeSorterMergeTreeBuild()
2478 vdbeMergeEngineFree(pRoot); in vdbeSorterMergeTreeBuild()
H A Dexpr.c905 Expr *pRoot, in sqlite3ExprAttachSubtrees() argument
909 if( pRoot==0 ){ in sqlite3ExprAttachSubtrees()
914 assert( ExprUseXList(pRoot) ); in sqlite3ExprAttachSubtrees()
915 assert( pRoot->x.pSelect==0 ); in sqlite3ExprAttachSubtrees()
917 pRoot->pRight = pRight; in sqlite3ExprAttachSubtrees()
920 pRoot->nHeight = pRight->nHeight+1; in sqlite3ExprAttachSubtrees()
922 pRoot->nHeight = 1; in sqlite3ExprAttachSubtrees()
926 pRoot->pLeft = pLeft; in sqlite3ExprAttachSubtrees()
927 pRoot->flags |= EP_Propagate & pLeft->flags; in sqlite3ExprAttachSubtrees()
929 if( pLeft->nHeight>=pRoot->nHeight ){ in sqlite3ExprAttachSubtrees()
[all …]
H A Dtrigger.c1270 Parse *pRoot = sqlite3ParseToplevel(pParse); in getRowTrigger() local
1279 for(pPrg=pRoot->pTriggerPrg; in getRowTrigger()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_expr.c45 Fts5ExprNode *pRoot; member
270 if( pNew->pRoot ){ in sqlite3Fts5ExprNew()
400 p1->pRoot = sqlite3Fts5ParseNode(&sParse, FTS5_AND, p1->pRoot, p2->pRoot,0); in sqlite3Fts5ExprAnd()
401 p2->pRoot = 0; in sqlite3Fts5ExprAnd()
1488 Fts5ExprNode *pRoot = p->pRoot; in sqlite3Fts5ExprFirst() local
1498 && 0==pRoot->bEof in sqlite3Fts5ExprFirst()
1520 Fts5ExprNode *pRoot = p->pRoot; in sqlite3Fts5ExprNext() local
1521 assert( pRoot->bEof==0 && pRoot->bNomatch==0 ); in sqlite3Fts5ExprNext()
1524 assert( pRoot->bNomatch==0 || (rc==SQLITE_OK && pRoot->bEof==0) ); in sqlite3Fts5ExprNext()
1527 pRoot->bEof = 1; in sqlite3Fts5ExprNext()
[all …]
/sqlite-3.40.0/ext/fts3/
H A Dfts3_expr.c827 pRoot = 0; in fts3ExprBalance()
897 pRoot = p; in fts3ExprBalance()
919 pRoot->pLeft = 0; in fts3ExprBalance()
920 pRoot->pRight = 0; in fts3ExprBalance()
934 pRoot->pLeft = pLeft; in fts3ExprBalance()
935 pLeft->pParent = pRoot; in fts3ExprBalance()
936 pRoot->pRight = pRight; in fts3ExprBalance()
937 pRight->pParent = pRoot; in fts3ExprBalance()
943 sqlite3Fts3ExprFree(pRoot); in fts3ExprBalance()
944 pRoot = 0; in fts3ExprBalance()
[all …]
H A Dfts3.c4897 pTC->pRoot = pRoot; in fts3EvalTokenCosts()
4910 **ppOr = pRoot; in fts3EvalTokenCosts()
4916 **ppOr = pRoot; in fts3EvalTokenCosts()
5025 if( aTC[ii].pRoot==pRoot ){ in fts3EvalSelectDeferred()
5065 if( aTC[iTC].pToken && aTC[iTC].pRoot==pRoot in fts3EvalSelectDeferred()
5796 pRoot = pExpr; in fts3EvalGatherStats()
5797 while( pRoot->pParent && pRoot->pParent->eType==FTSQUERY_NEAR ){ in fts3EvalGatherStats()
5798 pRoot = pRoot->pParent; in fts3EvalGatherStats()
5800 iDocid = pRoot->iDocid; in fts3EvalGatherStats()
5801 bEof = pRoot->bEof; in fts3EvalGatherStats()
[all …]
H A Dfts3_write.c4103 NodeWriter *pRoot; /* NodeWriter for root node */ in fts3IncrmergeRelease() local
4148 pRoot = &pWriter->aNodeWriter[iRoot]; in fts3IncrmergeRelease()
4169 pRoot->block.a, pRoot->block.n /* root */ in fts3IncrmergeRelease()
4172 sqlite3_free(pRoot->block.a); in fts3IncrmergeRelease()
4173 sqlite3_free(pRoot->key.a); in fts3IncrmergeRelease()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_tree.c567 pCsr->pRoot = &pDb->treehdr.root; in treeCursorInit()
930 pRoot->aiChildPtr[1] = iLeft; in treeInsert()
931 pRoot->aiChildPtr[2] = iRight; in treeInsert()
1532 pRoot->aiKeyPtr[1] = iTreeKey; in treeInsertEntry()
1979 TreeRoot *pRoot = pCsr->pRoot; in lsmTreeCursorSeek() local
1985 iNodePtr = pRoot->iRoot; in lsmTreeCursorSeek()
2069 TreeRoot *pRoot = pCsr->pRoot; in lsmTreeCursorNext() local
2070 const int iLeaf = pRoot->nHeight-1; in lsmTreeCursorNext()
2135 TreeRoot *pRoot = pCsr->pRoot; in lsmTreeCursorPrev() local
2203 TreeRoot *pRoot = pCsr->pRoot; in lsmTreeCursorEnd() local
[all …]
/sqlite-3.40.0/ext/rtree/
H A Drtree.c1839 RtreeNode *pRoot = 0; in rtreeFilter() local
1881 rc = nodeAcquire(pRtree, 1, 0, &pRoot); in rtreeFilter()
1939 pCsr->aNode[0] = pRoot; in rtreeFilter()
1940 pRoot = 0; in rtreeFilter()
1946 nodeRelease(pRtree, pRoot); in rtreeFilter()
3060 rc = nodeAcquire(pRtree, 1, 0, &pRoot); in rtreeDeleteRowid()
3104 i64 iChild = nodeGetRowid(pRtree, pRoot, 0); in rtreeDeleteRowid()
3113 writeInt16(pRoot->zData, pRtree->iDepth); in rtreeDeleteRowid()
3114 pRoot->isDirty = 1; in rtreeDeleteRowid()
3130 rc = nodeRelease(pRtree, pRoot); in rtreeDeleteRowid()
[all …]
H A Dgeopoly.c1349 RtreeNode *pRoot = 0; in geopolyFilter() local
1382 rc = nodeAcquire(pRtree, 1, 0, &pRoot); in geopolyFilter()
1447 pCsr->aNode[0] = pRoot; in geopolyFilter()
1448 pRoot = 0; in geopolyFilter()
1455 nodeRelease(pRtree, pRoot); in geopolyFilter()