Home | History | Annotate | Download | only in orig

Lines Matching defs:pFrom

11028   Table *pFrom;     /* Table containing the REFERENCES clause (aka: Child) */
11029 pFrom. Next parent of pFrom */
11038 struct sColMap { /* Mapping of columns in pFrom to columns in zTo */
11039 int iFrom; /* Index of column in pFrom */
18409 sqlite3_mutex_methods const *pFrom;
18413 pFrom = sqlite3DefaultMutex();
18415 pFrom = sqlite3NoopMutex();
18417 memcpy(pTo, pFrom, offsetof(sqlite3_mutex_methods, xMutexAlloc));
18418 memcpy(&pTo->xMutexFree, &pFrom->xMutexFree,
18420 pTo->xMutexAlloc = pFrom->xMutexAlloc;
57550 ** on page pFrom to page pTo. If page pFrom was not a leaf page, then
57552 ** parent page stored in the pointer map is page pTo. If pFrom contained
57556 ** If pFrom is currently carrying any overflow cells (entries in the
57565 static void copyNodeContent(MemPage *pFrom, MemPage *pTo, int *pRC){
57567 BtShared * const pBt = pFrom->pBt;
57568 u8 * const aFrom = pFrom->aData;
57570 int const iFromHdr = pFrom->hdrOffset;
57576 assert( pFrom->isInit );
57577 assert( pFrom->nFree>=iToHdr );
57580 /* Copy the b-tree node content from page pFrom to page pTo. */
57583 memcpy(&aTo[iToHdr], &aFrom[iFromHdr], pFrom->cellOffset + 2*pFrom->nCell);
57588 ** page pFrom.
60769 SQLITE_PRIVATE int sqlite3BtreeCopyFile(Btree *pTo, Btree *pFrom){
60774 sqlite3BtreeEnter(pFrom);
60779 i64 nByte = sqlite3BtreeGetPageSize(pFrom)*(i64)sqlite3BtreeLastPage(pFrom);
60791 b.pSrcDb = pFrom->db;
60792 b.pSrc = pFrom;
60814 sqlite3BtreeLeave(pFrom);
61452 ** Make an shallow copy of pFrom into pTo. Prior contents of
61453 ** pTo are freed. The pFrom->z field is not duplicated. If
61454 ** pFrom->z is used, then pTo->z points to the same thing as pFrom->z
61457 SQLITE_PRIVATE void sqlite3VdbeMemShallowCopy(Mem *pTo, const Mem *pFrom, int srcType){
61458 assert( (pFrom->flags & MEM_RowSet)==0 );
61460 memcpy(pTo, pFrom, MEMCELLSIZE);
61462 if( (pFrom->flags&MEM_Static)==0 ){
61470 ** Make a full copy of pFrom into pTo. Prior contents of pTo are
61473 SQLITE_PRIVATE int sqlite3VdbeMemCopy(Mem *pTo, const Mem *pFrom){
61476 assert( (pFrom->flags & MEM_RowSet)==0 );
61478 memcpy(pTo, pFrom, MEMCELLSIZE);
61483 if( 0==(pFrom->flags&MEM_Static) ){
61493 ** Transfer the contents of pFrom to pTo. Any existing value in pTo is
61494 ** freed. If pFrom contains ephemeral data, a copy is made.
61496 ** pFrom contains an SQL NULL when this routine returns.
61498 SQLITE_PRIVATE void sqlite3VdbeMemMove(Mem *pTo, Mem *pFrom){
61499 assert( pFrom->db==0 || sqlite3_mutex_held(pFrom->db->mutex) );
61501 assert( pFrom->db==0 || pTo->db==0 || pFrom->db==pTo->db );
61504 memcpy(pTo, pFrom, sizeof(Mem));
61505 pFrom->flags = MEM_Null;
61506 pFrom->xDel = 0;
61507 pFrom->zMalloc = 0;
67506 Vdbe *pFrom = (Vdbe*)pFromStmt;
67509 assert( pTo->db==pFrom->db );
67510 assert( pTo->nVar==pFrom->nVar );
67512 for(i=0; i<pFrom->nVar; i++){
67513 sqlite3VdbeMemMove(&pTo->aVar[i], &pFrom->aVar[i]);
67533 Vdbe *pFrom = (Vdbe*)pFromStmt;
67535 if( pFrom->nVar!=pTo->nVar ){
67541 if( pFrom->isPrepareV2 && pFrom->expmask ){
67542 pFrom->expired = 1;
82867 zWhere = whereOrName(pParse->db, zWhere, p->pFrom->zName);
83153 Table *pFrom = p->pFrom;
83154 if( pFrom!=pTab ){
83155 reloadTableSchema(pParse, p->pFrom, pFrom->zName);
83749 ** Copy the contents of object (*pFrom) into (*pTo).
83752 static void sampleCopy(Stat4Accum *p, Stat4Sample *pTo, Stat4Sample *pFrom){
83753 pTo->isPSample = pFrom->isPSample;
83754 pTo->iCol = pFrom->iCol;
83755 pTo->iHash = pFrom->iHash;
83756 memcpy(pTo->anEq, pFrom->anEq, sizeof(tRowcnt)*p->nCol);
83757 memcpy(pTo->anLt, pFrom->anLt, sizeof(tRowcnt)*p->nCol);
83758 memcpy(pTo->anDLt, pFrom->anDLt, sizeof(tRowcnt)*p->nCol);
83759 if( pFrom->nRowid ){
83760 sampleSetRowid(p->db, pTo, pFrom->nRowid, pFrom->u.aRowid);
83762 sampleSetRowidInt64(p->db, pTo, pFrom->u.iRowid);
88649 pFKey->pFrom = p;
90929 SrcList *pFrom;
90933 pFrom = sqlite3SrcListAppend(db, 0, 0, 0);
90934 if( pFrom ){
90935 assert( pFrom->nSrc==1 );
90936 pFrom->a[0].zName = sqlite3DbStrDup(db, pView->zName);
90937 pFrom->a[0].zDatabase = sqlite3DbStrDup(db, db->aDb[iDb].zName);
90938 assert( pFrom->a[0].pOn==0 );
90939 assert( pFrom->a[0].pUsing==0 );
90941 pSel = sqlite3SelectNew(pParse, 0, pFrom, pWhere, 0, 0, 0, 0, 0, 0);
93702 pFKey->pFrom->zName, pFKey->zTo);
93790 if( pTab==pFKey->pFrom && nIncr==1 ){
93822 if( pTab==pFKey->pFrom && nIncr==1 ){
94000 zCol = pFKey->pFrom->aCol[iCol].zName;
94017 if( pTab==pFKey->pFrom && nIncr>0 ){
94402 pItem->pTab = pFKey->pFrom;
94403 pItem->zName = pFKey->pFrom->zName;
94570 tFromCol.z = pFKey->pFrom->aCol[iFromCol].zName;
94615 Expr *pDflt = pFKey->pFrom->aCol[iFromCol].pDflt;
94630 zFrom = pFKey->pFrom->zName;
105086 ** pFrom->pIndex and return SQLITE_OK.
105088 SQLITE_PRIVATE int sqlite3IndexedByLookup(Parse *pParse, struct SrcList_item *pFrom){
105089 if( pFrom->pTab && pFrom->zIndex ){
105090 Table *pTab = pFrom->pTab;
105091 char *zIndex = pFrom->zIndex;
105102 pFrom->pIndex = pIdx;
105226 ** This function checks if argument pFrom refers to a CTE declared by
105231 ** If pFrom falls into either of the two categories above, pFrom->pTab
105233 ** (pFrom->pTab!=0) to determine whether or not a successful match
105242 struct SrcList_item *pFrom
105249 assert( pFrom->pTab==0 );
105251 pCte = searchWith(pParse->pWith, pFrom, &pWith);
105269 assert( pFrom->pTab==0 );
105270 pFrom->pTab = pTab = sqlite3DbMallocZero(db, sizeof(Table));
105277 pFrom->pSelect = sqlite3SelectDup(db, pCte->pSelect, 0);
105279 assert( pFrom->pSelect );
105282 pSel = pFrom->pSelect;
105286 SrcList *pSrc = pFrom->pSelect->pSrc;
105395 struct SrcList_item *pFrom;
105420 for(i=0, pFrom=pTabList->a; i<pTabList->nSrc; i++, pFrom++){
105422 assert( pFrom->isRecursive==0 || pFrom->pTab );
105423 if( pFrom->isRecursive ) continue;
105424 if( pFrom->pTab!=0 ){
105434 if( withExpand(pWalker, pFrom) ) return WRC_Abort;
105435 if( pFrom->pTab ) {} else
105437 if( pFrom->zName==0 ){
105439 Select *pSel = pFrom->pSelect;
105442 assert( pFrom->pTab==0 );
105444 pFrom->pTab = pTab = sqlite3DbMallocZero(db, sizeof(Table));
105456 assert( pFrom->pTab==0 );
105457 pFrom->pTab = pTab = sqlite3LocateTableItem(pParse, 0, pFrom);
105462 pFrom->pTab = 0;
105470 assert( pFrom->pSelect==0 );
105471 pFrom->pSelect = sqlite3SelectDup(db, pTab->pSelect, 0);
105472 sqlite3WalkSelect(pWalker, pFrom->pSelect);
105478 if( sqlite3IndexedByLookup(pParse, pFrom) ){
105550 for(i=0, pFrom=pTabList->a; i<pTabList->nSrc; i++, pFrom++){
105551 Table *pTab = pFrom->pTab;
105552 Select *pSub = pFrom->pSelect;
105553 char *zTabName = pFrom->zAlias;
105592 if( (pFrom->jointype & JT_NATURAL)!=0
105599 if( sqlite3IdListIndex(pFrom->pUsing, zName)>=0 ){
105722 struct SrcList_item *pFrom;
105729 for(i=0, pFrom=pTabList->a; i<pTabList->nSrc; i++, pFrom++){
105730 Table *pTab = pFrom->pTab;
105733 Select *pSel = pFrom->pSelect;
107852 ** Parse context structure pFrom has just been used to create a sub-vdbe
107854 ** from pFrom to pTo.
107856 static void transferParseError(Parse *pTo, Parse *pFrom){
107857 assert( pFrom->zErrMsg==0 || pFrom->nErr );
107860 pTo->zErrMsg = pFrom->zErrMsg;
107861 pTo->nErr = pFrom->nErr;
107863 sqlite3DbFree(pFrom->db, pFrom->zErrMsg);
114783 static int whereLoopXfer(sqlite3 *db, WhereLoop *pTo, WhereLoop *pFrom){
114785 if( whereLoopResize(db, pTo, pFrom->nLTerm) ){
114789 memcpy(pTo, pFrom, WHERE_LOOP_XFER_SZ);
114790 memcpy(pTo->aLTerm, pFrom->aLTerm, pTo->nLTerm*sizeof(pTo->aLTerm[0]));
114791 if( pFrom->wsFlags & WHERE_VIRTUALTABLE ){
114792 pFrom->u.vtab.needFree = 0;
114793 }else if( (pFrom->wsFlags & WHERE_AUTO_INDEX)!=0 ){
114794 pFrom->u.btree.pIndex = 0;
116362 WherePath *pFrom; /* An element of aFrom[] that we are working on */
116400 for(ii=mxChoice*2, pFrom=aTo; ii>0; ii--, pFrom++, pX += nLoop){
116401 pFrom->aLoop = pX;
116439 for(ii=0, pFrom=aFrom; ii<nFrom; ii++, pFrom++){
116441 LogEst nOut; /* Rows visited by (pFrom+pWLoop) */
116442 LogEst rCost; /* Cost of path (pFrom+pWLoop) */
116443 LogEst rUnsorted; /* Unsorted cost of (pFrom+pWLoop) */
116444 i8 isOrdered = pFrom->isOrdered; /* isOrdered for (pFrom+pWLoop) */
116448 if( (pWLoop->prereq & ~pFrom->maskLoop)!=0 ) continue;
116449 if( (pWLoop->maskSelf & pFrom->maskLoop)!=0 ) continue;
116452 rUnsorted = sqlite3LogEstAdd(pWLoop->rSetup,pWLoop->rRun + pFrom->nRow);
116453 rUnsorted = sqlite3LogEstAdd(rUnsorted, pFrom->rUnsorted);
116454 nOut = pFrom->nRow + pWLoop->nOut;
116455 maskNew = pFrom->maskLoop | pWLoop->maskSelf;
116458 pWInfo->pOrderBy, pFrom, pWInfo->wctrlFlags,
116461 revMask = pFrom->revLoop;
116509 wherePathName(pFrom, iLoop, pWLoop), rCost, nOut,
116528 wherePathName(pFrom, iLoop, pWLoop), rCost, nOut,
116542 wherePathName(pFrom, iLoop, pWLoop), rCost, nOut,
116560 wherePathName(pFrom, iLoop, pWLoop), rCost, nOut,
116569 pTo->maskLoop = pFrom->maskLoop | pWLoop->maskSelf;
116575 memcpy(pTo->aLoop, pFrom->aLoop, sizeof(WhereLoop*)*iLoop);
116611 pFrom = aTo;
116613 aFrom = pFrom;
116623 /* Find the lowest cost path. pFrom will be left pointing to that path */
116624 pFrom = aFrom;
116626 if( pFrom->rCost>aFrom[ii].rCost ) pFrom = &aFrom[ii];
116632 pLevel->pWLoop = pWLoop = pFrom->aLoop[iLoop];
116642 int rc = wherePathSatisfiesOrderBy(pWInfo, pWInfo->pResultSet, pFrom,
116643 WHERE_DISTINCTBY, nLoop-1, pFrom->aLoop[nLoop-1], &notUsed);
116650 if( pFrom->isOrdered==pWInfo->pOrderBy->nExpr ){
116654 pWInfo->nOBSat = pFrom->isOrdered;
116656 pWInfo->revMask = pFrom->revLoop;
116663 pFrom, 0, nLoop-1, pFrom->aLoop[nLoop-1], &notUsed
116671 pWInfo->nRowOut = pFrom->nRow;
119858 SrcList *pFrom;
119861 pFrom = sqlite3SrcListAppendFromTerm(pParse,0,0,0,&x,pRhs,0,0);
119862 pRhs = sqlite3SelectNew(pParse,0,pFrom,0,0,0,0,0,0,0);
137969 static int fts3SegReaderRequire(Fts3SegReader *pReader, char *pFrom, int nByte){
137972 || (pFrom>=pReader->aNode && pFrom<&pReader->aNode[pReader->nNode])
137975 && (pFrom - pReader->aNode + nByte)>pReader->nPopulate