Lines Matching refs:pB
11822 ** if( rc==SQLITE_OK ) rc = sqlite3changegroup_add(pGrp, nB, pB);
11836 int nB, /* Number of bytes in buffer pB */
11837 void *pB, /* Pointer to buffer containing changeset B */
53341 static PgHdr *pcacheMergeDirtyList(PgHdr *pA, PgHdr *pB){
53344 assert( pA!=0 && pB!=0 );
53346 if( pA->pgno<pB->pgno ){
53351 pTail->pDirty = pB;
53355 pTail->pDirty = pB;
53356 pTail = pB;
53357 pB = pB->pDirty;
53358 if( pB==0 ){
55060 struct RowSetEntry *pB /* Second sorted list to be merged */
55066 assert( pA!=0 && pB!=0 );
55069 assert( pB->pRight==0 || pB->v<=pB->pRight->v );
55070 if( pA->v<=pB->v ){
55071 if( pA->v<pB->v ) pTail = pTail->pRight = pA;
55074 pTail->pRight = pB;
55078 pTail = pTail->pRight = pB;
55079 pB = pB->pRight;
55080 if( pB==0 ){
82654 ** This happens after pB was previously run and returned
82656 ** This routine transfers the new bytecode in pA over to pB
82657 ** so that pB can be run again. The old pB byte code is
82661 SQLITE_PRIVATE void sqlite3VdbeSwap(Vdbe *pA, Vdbe *pB){
82664 assert( pA->db==pB->db );
82666 *pA = *pB;
82667 *pB = tmp;
82669 pA->pVNext = pB->pVNext;
82670 pB->pVNext = pTmp;
82672 pA->ppVPrev = pB->ppVPrev;
82673 pB->ppVPrev = ppTmp;
82675 pA->zSql = pB->zSql;
82676 pB->zSql = zTmp;
82679 pA->zNormSql = pB->zNormSql;
82680 pB->zNormSql = zTmp;
82682 pB->expmask = pA->expmask;
82683 pB->prepFlags = pA->prepFlags;
82684 memcpy(pB->aCounter, pA->aCounter, sizeof(pB->aCounter));
82685 pB->aCounter[SQLITE_STMTSTATUS_REPREPARE]++;
111376 ** If any subelement of pB has Expr.iTable==(-1) then it is allowed
111379 ** The pA side might be using TK_REGISTER. If that is the case and pB is
111393 ** pParse->pReprepare can be matched against literals in pB. The
111397 ** pB causes a return value of 2.
111402 const Expr *pB,
111406 if( pA==0 || pB==0 ){
111407 return pB==pA ? 0 : 2;
111409 if( pParse && pA->op==TK_VARIABLE && exprCompareVariable(pParse, pA, pB) ){
111412 combinedFlags = pA->flags | pB->flags;
111414 if( (pA->flags&pB->flags&EP_IntValue)!=0 && pA->u.iValue==pB->u.iValue ){
111419 if( pA->op!=pB->op || pA->op==TK_RAISE ){
111420 if( pA->op==TK_COLLATE && sqlite3ExprCompare(pParse, pA->pLeft,pB,iTab)<2 ){
111423 if( pB->op==TK_COLLATE && sqlite3ExprCompare(pParse, pA,pB->pLeft,iTab)<2 ){
111426 if( pA->op==TK_AGG_COLUMN && pB->op==TK_COLUMN
111427 && pB->iTable<0 && pA->iTable==iTab
111435 assert( !ExprHasProperty(pB, EP_IntValue) );
111438 if( sqlite3StrICmp(pA->u.zToken,pB->u.zToken)!=0 ) return 2;
111440 assert( pA->op==pB->op );
111441 if( ExprHasProperty(pA,EP_WinFunc)!=ExprHasProperty(pB,EP_WinFunc) ){
111445 if( sqlite3WindowCompare(pParse, pA->y.pWin, pB->y.pWin, 1)!=0 ){
111453 if( sqlite3_stricmp(pA->u.zToken,pB->u.zToken)!=0 ) return 2;
111455 if( pB->u.zToken!=0
111458 && strcmp(pA->u.zToken,pB->u.zToken)!=0
111464 != (pB->flags & (EP_Distinct|EP_Commuted)) ) return 2;
111468 && sqlite3ExprCompare(pParse, pA->pLeft, pB->pLeft, iTab) ) return 2;
111469 if( sqlite3ExprCompare(pParse, pA->pRight, pB->pRight, iTab) ) return 2;
111470 if( sqlite3ExprListCompare(pA->x.pList, pB->x.pList, iTab) ) return 2;
111475 if( pA->iColumn!=pB->iColumn ) return 2;
111476 if( pA->op2!=pB->op2 && pA->op==TK_TRUTH ) return 2;
111477 if( pA->op!=TK_IN && pA->iTable!=pB->iTable && pA->iTable!=iTab ){
111490 ** If any subelement of pB has Expr.iTable==(-1) then it is allowed
111501 SQLITE_PRIVATE int sqlite3ExprListCompare(const ExprList *pA, const ExprList *pB, int iTab){
111503 if( pA==0 && pB==0 ) return 0;
111504 if( pA==0 || pB==0 ) return 1;
111505 if( pA->nExpr!=pB->nExpr ) return 1;
111509 Expr *pExprB = pB->a[i].pExpr;
111510 if( pA->a[i].fg.sortFlags!=pB->a[i].fg.sortFlags ) return 1;
111520 SQLITE_PRIVATE int sqlite3ExprCompareSkip(Expr *pA,Expr *pB, int iTab){
111523 sqlite3ExprSkipCollateAndLikely(pB),
138422 ** pA pB pC Return Value
138465 SQLITE_PRIVATE int sqlite3JoinType(Parse *pParse, Token *pA, Token *pB, Token *pC){
138486 apAll[1] = pB;
138510 if( pB==0 ){ zSp1++; }
138513 "%T%s%T%s%T", pA, zSp1, pB, zSp2, pC);
202348 const RtreeSearchPoint *pB
202350 if( pA->rScore<pB->rScore ) return -1;
202351 if( pA->rScore>pB->rScore ) return +1;
202352 if( pA->iLevel<pB->iLevel ) return -1;
202353 if( pA->iLevel>pB->iLevel ) return +1;