Lines Matching refs:pTree

57832   struct RowSetEntry *p, *pTree;  local
57848       for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){
57849         ppPrevTree = &pTree->pRight;
57850         if( pTree->pLeft==0 ){
57851           pTree->pLeft = rowSetListToTree(p);
57855           rowSetTreeToList(pTree->pLeft, &pAux, &pTail);
57856           pTree->pLeft = 0;
57860       if( pTree==0 ){
57861         *ppPrevTree = pTree = rowSetEntryAlloc(pRowSet);
57862         if( pTree ){
57863           pTree->v = 0;
57864           pTree->pRight = 0;
57865           pTree->pLeft = rowSetListToTree(p);
57878   for(pTree = pRowSet->pForest; pTree; pTree=pTree->pRight){
57879     p = pTree->pLeft;
199624   SegmentNode *pTree;             /* Pointer to interior tree structure */
201468   SegmentNode *pTree = *ppTree;
201475   if( pTree ){
201476     int nData = pTree->nData;     /* Current size of node in bytes */
201481     nPrefix = fts3PrefixCompress(pTree->zTerm, pTree->nTerm, zTerm, nTerm);
201490     if( nReq<=p->nNodeSize || !pTree->zTerm ){
201500         assert( pTree->aData==(char *)&pTree[1] );
201501         pTree->aData = (char *)sqlite3_malloc64(nReq);
201502         if( !pTree->aData ){
201507       if( pTree->zTerm ){
201509         nData += sqlite3Fts3PutVarint(&pTree->aData[nData], nPrefix);
201512       nData += sqlite3Fts3PutVarint(&pTree->aData[nData], nSuffix);
201513       memcpy(&pTree->aData[nData], &zTerm[nPrefix], nSuffix);
201514       pTree->nData = nData + nSuffix;
201515       pTree->nEntry++;
201518         if( pTree->nMalloc<nTerm ){
201519           char *zNew = sqlite3_realloc64(pTree->zMalloc, (i64)nTerm*2);
201523           pTree->nMalloc = nTerm*2;
201524           pTree->zMalloc = zNew;
201526         pTree->zTerm = pTree->zMalloc;
201527         memcpy(pTree->zTerm, zTerm, nTerm);
201528         pTree->nTerm = nTerm;
201530         pTree->zTerm = (char *)zTerm;
201531         pTree->nTerm = nTerm;
201553   if( pTree ){
201554     SegmentNode *pParent = pTree->pParent;
201556     if( pTree->pParent==0 ){
201557       pTree->pParent = pParent;
201559     pTree->pRight = pNew;
201560     pNew->pLeftmost = pTree->pLeftmost;
201562     pNew->zMalloc = pTree->zMalloc;
201563     pNew->nMalloc = pTree->nMalloc;
201564     pTree->zMalloc = 0;
201578   SegmentNode *pTree,
201585   pTree->aData[nStart] = (char)iHeight;
201586   sqlite3Fts3PutVarint(&pTree->aData[nStart+1], iLeftChild);
201605   SegmentNode *pTree,             /* SegmentNode handle */
201615   if( !pTree->pParent ){
201617     int nStart = fts3TreeFinishNode(pTree, iHeight, iLeaf);
201619     *pnRoot = pTree->nData - nStart;
201620     *paRoot = &pTree->aData[nStart];
201625     for(pIter=pTree->pLeftmost; pIter && rc==SQLITE_OK; pIter=pIter->pRight){
201636           p, pTree->pParent, iHeight+1, iFree, iNextFree, piLast, paRoot, pnRoot
201647 static void fts3NodeFree(SegmentNode *pTree){
201648   if( pTree ){
201649     SegmentNode *p = pTree->pLeftmost;
201751     rc = fts3NodeAddTerm(p, &pWriter->pTree, isCopyTerm, zTerm, nPrefix+1);
201830   if( pWriter->pTree ){
201839       rc = fts3NodeWrite(p, pWriter->pTree, 1,
201863     fts3NodeFree(pWriter->pTree);