Home | History | Annotate | Download | only in orig

Lines Matching refs:pA

25792 ** the other 64-bit signed integer at *pA and store the result in *pA.
25794 ** overflow, leave *pA unchanged and return 1.
25796 SQLITE_PRIVATE int sqlite3AddInt64(i64 *pA, i64 iB){
25797 i64 iA = *pA;
25809 *pA += iB;
25812 SQLITE_PRIVATE int sqlite3SubInt64(i64 *pA, i64 iB){
25815 testcase( (*pA)==(-1) ); testcase( (*pA)==0 );
25816 if( (*pA)>=0 ) return 1;
25817 *pA -= iB;
25820 return sqlite3AddInt64(pA, -iB);
25825 SQLITE_PRIVATE int sqlite3MulInt64(i64 *pA, i64 iB){
25826 i64 iA = *pA;
25835 *pA *= iB;
25852 *pA = r;
40967 static PgHdr *pcacheMergeDirtyList(PgHdr *pA, PgHdr *pB){
40970 while( pA && pB ){
40971 if( pA->pgno<pB->pgno ){
40972 pTail->pDirty = pA;
40973 pTail = pA;
40974 pA = pA->pDirty;
40981 if( pA ){
40982 pTail->pDirty = pA;
42589 struct RowSetEntry *pA, /* First sorted list to be merged */
42596 while( pA && pB ){
42597 assert( pA->pRight==0 || pA->v<=pA->pRight->v );
42599 if( pA->v<pB->v ){
42600 pTail->pRight = pA;
42601 pA = pA->pRight;
42603 }else if( pB->v<pA->v ){
42608 pA = pA->pRight;
42611 if( pA ){
42612 assert( pA->pRight==0 || pA->v<=pA->pRight->v );
42613 pTail->pRight = pA;
66759 SQLITE_PRIVATE void sqlite3VdbeSwap(Vdbe *pA, Vdbe *pB){
66762 tmp = *pA;
66763 *pA = *pB;
66765 pTmp = pA->pNext;
66766 pA->pNext = pB->pNext;
66768 pTmp = pA->pPrev;
66769 pA->pPrev = pB->pPrev;
66771 zTmp = pA->zSql;
66772 pA->zSql = pB->zSql;
66774 pB->isPrepareV2 = pA->isPrepareV2;
88732 ** to compare equal to an equivalent element in pA with Expr.iTable==iTab.
88734 ** The pA side might be using TK_REGISTER. If that is the case and pB is
88747 SQLITE_PRIVATE int sqlite3ExprCompare(Expr *pA, Expr *pB, int iTab){
88749 if( pA==0 || pB==0 ){
88750 return pB==pA ? 0 : 2;
88752 combinedFlags = pA->flags | pB->flags;
88754 if( (pA->flags&pB->flags&EP_IntValue)!=0 && pA->u.iValue==pB->u.iValue ){
88759 if( pA->op!=pB->op ){
88760 if( pA->op==TK_COLLATE && sqlite3ExprCompare(pA->pLeft, pB, iTab)<2 ){
88763 if( pB->op==TK_COLLATE && sqlite3ExprCompare(pA, pB->pLeft, iTab)<2 ){
88768 if( pA->op!=TK_COLUMN && ALWAYS(pA->op!=TK_AGG_COLUMN) && pA->u.zToken ){
88769 if( pA->op==TK_FUNCTION ){
88770 if( sqlite3StrICmp(pA->u.zToken,pB->u.zToken)!=0 ) return 2;
88771 }else if( strcmp(pA->u.zToken,pB->u.zToken)!=0 ){
88772 return pA->op==TK_COLLATE ? 1 : 2;
88775 if( (pA->flags & EP_Distinct)!=(pB->flags & EP_Distinct) ) return 2;
88778 if( sqlite3ExprCompare(pA->pLeft, pB->pLeft, iTab) ) return 2;
88779 if( sqlite3ExprCompare(pA->pRight, pB->pRight, iTab) ) return 2;
88780 if( sqlite3ExprListCompare(pA->x.pList, pB->x.pList, iTab) ) return 2;
88781 if( ALWAYS((combinedFlags & EP_Reduced)==0) && pA->op!=TK_STRING ){
88782 if( pA->iColumn!=pB->iColumn ) return 2;
88783 if( pA->iTable!=pB->iTable
88784 && (pA->iTable!=iTab || NEVER(pB->iTable>=0)) ) return 2;
88795 ** to compare equal to an equivalent element in pA with Expr.iTable==iTab.
88805 SQLITE_PRIVATE int sqlite3ExprListCompare(ExprList *pA, ExprList *pB, int iTab){
88807 if( pA==0 && pB==0 ) return 0;
88808 if( pA==0 || pB==0 ) return 1;
88809 if( pA->nExpr!=pB->nExpr ) return 1;
88810 for(i=0; i<pA->nExpr; i++){
88811 Expr *pExprA = pA->a[i].pExpr;
88813 if( pA->a[i].sortOrder!=pB->a[i].sortOrder ) return 1;
108828 SQLITE_PRIVATE int sqlite3JoinType(Parse *pParse, Token *pA, Token *pB, Token *pC){
108848 apAll[0] = pA;
108874 "%T %T%s%T", pA, pB, zSp, pC);
126119 static void binaryToUnaryIfNull(Parse *pParse, Expr *pY, Expr *pA, int op){
126121 if( pY && pA && pY->op==TK_NULL ){
126122 pA->op = (u8)op;
126123 sqlite3ExprDelete(db, pA->pRight);
126124 pA->pRight = 0;
155148 const RtreeSearchPoint *pA,
155151 if( pA->rScore<pB->rScore ) return -1;
155152 if( pA->rScore>pB->rScore ) return +1;
155153 if( pA->iLevel<pB->iLevel ) return -1;
155154 if( pA->iLevel>pB->iLevel ) return +1;
170071 int *pbDel, /* OUT: Caller should sqlite3_free(*pa) */
170072 u8 **pa, int *pn
170110 *pa = (u8*)aIter[0].a;
170136 *pa = buf.p;
171989 static int sqlite3Fts5ExprPoslist(Fts5Expr *pExpr, int iPhrase, const u8 **pa){
171994 *pa = pPhrase->poslist.p;
171997 *pa = 0;
176518 ** IN/OUT parameter (*pa) points to a position list n bytes in size. If
176519 ** the position list contains entries for column iCol, then (*pa) is set
176525 const u8 **pa, /* IN/OUT: Pointer to poslist */
176530 const u8 *p = *pa;
176541 *pa = p++;
176551 return p - (*pa);
179816 static int fts5CsrPoslist(Fts5Cursor *pCsr, int iPhrase, const u8 **pa){
179822 *pa = &pSorter->aPoslist[i1];
179824 n = sqlite3Fts5ExprPoslist(pCsr->pExpr, iPhrase, pa);