Home | History | Annotate | Download | only in dist

Lines Matching refs:pTree

59358   struct RowSetEntry *p, *pTree;
59374 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){
59375 ppPrevTree = &pTree->pRight;
59376 if( pTree->pLeft==0 ){
59377 pTree->pLeft = rowSetListToTree(p);
59381 rowSetTreeToList(pTree->pLeft, &pAux, &pTail);
59382 pTree->pLeft = 0;
59386 if( pTree==0 ){
59387 *ppPrevTree = pTree = rowSetEntryAlloc(pRowSet);
59388 if( pTree ){
59389 pTree->v = 0;
59390 pTree->pRight = 0;
59391 pTree->pLeft = rowSetListToTree(p);
59404 for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){
59405 p = pTree->pLeft;
204166 SegmentNode *pTree; /* Pointer to interior tree structure */
206032 SegmentNode *pTree = *ppTree;
206039 if( pTree ){
206040 int nData = pTree->nData; /* Current size of node in bytes */
206045 nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm);
206054 if( nReq<=p->nNodeSize || !pTree->zTerm ){
206064 assert( pTree->aData==(char *)&pTree[1] );
206065 pTree->aData = (char *)sqlite3_malloc64(nReq);
206066 if( !pTree->aData ){
206071 if( pTree->zTerm ){
206073 nData += sqlite3Fts3PutVarint(&pTree->aData[nData], nPrefix);
206076 nData += sqlite3Fts3PutVarint(&pTree->aData[nData], nSuffix);
206077 memcpy(&pTree->aData[nData], &zTerm[nPrefix], nSuffix);
206078 pTree->nData = nData + nSuffix;
206079 pTree->nEntry++;
206082 if( pTree->nMalloc<nTerm ){
206083 char *zNew = sqlite3_realloc64(pTree->zMalloc, (i64)nTerm*2);
206087 pTree->nMalloc = nTerm*2;
206088 pTree->zMalloc = zNew;
206090 pTree->zTerm = pTree->zMalloc;
206091 memcpy(pTree->zTerm, zTerm, nTerm);
206092 pTree->nTerm = nTerm;
206094 pTree->zTerm = (char *)zTerm;
206095 pTree->nTerm = nTerm;
206106 ** now. Instead, the term is inserted into the parent of pTree. If pTree
206117 if( pTree ){
206118 SegmentNode *pParent = pTree->pParent;
206120 if( pTree->pParent==0 ){
206121 pTree->pParent = pParent;
206123 pTree->pRight = pNew;
206124 pNew->pLeftmost = pTree->pLeftmost;
206126 pNew->zMalloc = pTree->zMalloc;
206127 pNew->nMalloc = pTree->nMalloc;
206128 pTree->zMalloc = 0;
206142 SegmentNode *pTree,
206149 pTree->aData[nStart] = (char)iHeight;
206150 sqlite3Fts3PutVarint(&pTree->aData[nStart+1], iLeftChild);
206155 ** Write the buffer for the segment node pTree and all of its peers to the
206157 ** pTree and its peers to the database.
206159 ** Except, if pTree is a root node, do not write it to the database. Instead,
206169 SegmentNode *pTree, /* SegmentNode handle */
206179 if( !pTree->pParent ){
206181 int nStart = fts3TreeFinishNode(pTree, iHeight, iLeaf);
206183 *pnRoot = pTree->nData - nStart;
206184 *paRoot = &pTree->aData[nStart];
206189 for(pIter=pTree->pLeftmost; pIter && rc==SQLITE_OK; pIter=pIter->pRight){
206200 p, pTree->pParent, iHeight+1, iFree, iNextFree, piLast, paRoot, pnRoot
206209 ** Free all memory allocations associated with the tree pTree.
206211 static void fts3NodeFree(SegmentNode *pTree){
206212 if( pTree ){
206213 SegmentNode *p = pTree->pLeftmost;
206315 rc = fts3NodeAddTerm(p, &pWriter->pTree, isCopyTerm, zTerm, nPrefix+1);
206394 if( pWriter->pTree ){
206403 rc = fts3NodeWrite(p, pWriter->pTree, 1,
206427 fts3NodeFree(pWriter->pTree);