Home
last modified time | relevance | path

Searched refs:p2 (Results 1 – 25 of 61) sorted by relevance

123

/sqlite-3.40.0/src/
H A Dvdbe.c1037 assert( pOp->p2>=0 && pOp->p2<p->nOp ); in sqlite3VdbeExec()
1454 p2 = pOp->p2; in sqlite3VdbeExec()
1456 assert( p1+n<=p2 || p2+n<=p1 ); in sqlite3VdbeExec()
2346 p2 = pOp->p2; in sqlite3VdbeExec()
2810 p2 = (u32)pOp->p2; in sqlite3VdbeExec()
3887 assert( pOp->p2>=0 && pOp->p2<=2 ); in sqlite3VdbeExec()
4179 p2 = (u32)pOp->p2; in sqlite3VdbeExec()
4702 assert( pOp[1].p2==pOp[0].p2 ); in sqlite3VdbeExec()
4881 assert( pOp[1].p2==aOp[pOp->p2-1].p2 ); in sqlite3VdbeExec()
6144 assert( pOp->p2>0 && pOp->p2<p->nOp ); in sqlite3VdbeExec()
[all …]
H A Dnotify.c61 sqlite3 *p2; in checkListProperties() local
67 for(p2=sqlite3BlockedList; p2!=p; p2=p2->pNextBlocked){ in checkListProperties()
68 if( p2->xUnlockNotify==p->xUnlockNotify ) seen = 1; in checkListProperties()
69 assert( p2->xUnlockNotify==p->xUnlockNotify || !seen ); in checkListProperties()
H A Dvdbesort.c812 const u8 * const v2 = &p2[ p2[0] ]; /* Pointer to value 2 */ in vdbeSorterCompareText()
856 const u8 * const v2 = &p2[ p2[0] ]; /* Pointer to value 2 */ in vdbeSorterCompareInt()
1359 pTask, &bCached, SRVAL(p1), p1->nVal, SRVAL(p2), p2->nVal in vdbeSorterMerge()
1367 *pp = p2; in vdbeSorterMerge()
1371 *pp = p2; in vdbeSorterMerge()
1372 pp = &p2->u.pNext; in vdbeSorterMerge()
1373 p2 = p2->u.pNext; in vdbeSorterMerge()
1375 if( p2==0 ){ in vdbeSorterMerge()
2040 PmaReader *p2; in vdbeMergeEngineCompare() local
2057 }else if( p2->pFd==0 ){ in vdbeMergeEngineCompare()
[all …]
H A Dfunc.c320 i64 p1, p2; in substrFunc() local
356 if( p2<0 ){ in substrFunc()
357 p2 = -p2; in substrFunc()
366 p2 += p1; in substrFunc()
367 if( p2<0 ) p2 = 0; in substrFunc()
373 p2--; in substrFunc()
376 p1 -= p2; in substrFunc()
378 p2 += p1; in substrFunc()
388 for(z2=z; *z2 && p2; p2--){ in substrFunc()
395 p2 = len-p1; in substrFunc()
[all …]
H A Dvdbeaux.c249 return growOp3(p, op, p1, p2, p3); in sqlite3VdbeAddOp3()
258 pOp->p2 = p2; in sqlite3VdbeAddOp3()
422 return pOp->p2; in sqlite3VdbeExplainParent()
849 assert( pOp->p2>=0 ); in resolveP2Values()
854 if( pOp->p2>nMaxArgs ) nMaxArgs = pOp->p2; in resolveP2Values()
868 if( pOp->p2<0 ){ in resolveP2Values()
874 pOp->p2 = aLabel[ADDR(pOp->p2)]; in resolveP2Values()
1078 pOut->p2 = aOp->p2; in sqlite3VdbeAddOpList()
1079 assert( aOp->p2>=0 ); in sqlite3VdbeAddOpList()
1081 pOut->p2 += p->nOp; in sqlite3VdbeAddOpList()
[all …]
H A Dtest_tclvar.c252 Tcl_Obj *p2; in tclvarColumn() local
259 Tcl_ListObjIndex(interp, pCur->pList2, pCur->i2, &p2); in tclvarColumn()
261 if( p2 ){ in tclvarColumn()
262 z2 = Tcl_GetString(p2); in tclvarColumn()
280 if( p2 ){ in tclvarColumn()
H A Dinsert.c189 sqlite3VdbeAddOp3(v, OP_MakeRecord, pPrev->p1, pPrev->p2, pPrev->p3); in sqlite3TableAffinity()
238 Pgno tnum = pOp->p2; in readsTable()
490 aOp[0].p2 = memId; in sqlite3AutoincrementBegin()
496 aOp[4].p2 = memId+1; in sqlite3AutoincrementBegin()
499 aOp[7].p2 = memId+2; in sqlite3AutoincrementBegin()
501 aOp[10].p2 = memId; in sqlite3AutoincrementBegin()
555 aOp[1].p2 = memId+1; in autoIncrementEnd()
558 aOp[3].p2 = iRec; in autoIncrementEnd()
2420 p2 = lblRecheckOk; in sqlite3GenerateConstraintChecks()
2422 p2 = x.p2; in sqlite3GenerateConstraintChecks()
[all …]
H A Dtest_vfs.c983 TestvfsFd *p2; in tvfsShmLock() local
984 for(p2=pFd->pShm->pFile; p2; p2=p2->pNext){ in tvfsShmLock()
985 if( p2==pFd ) continue; in tvfsShmLock()
986 if( (p2->excllock&mask) || (isExcl && p2->sharedlock&mask) ){ in tvfsShmLock()
/sqlite-3.40.0/test/
H A Dfkey6.test179 CREATE TABLE p2(a PRIMARY KEY, b);
181 INSERT INTO p2 VALUES(1, 'one');
182 INSERT INTO p2 VALUES(2, 'two');
188 UPDATE p2 SET a=a-1;
195 UPDATE p2 SET a=a-1;
202 UPDATE p2 SET a=a-1;
210 CREATE TRIGGER p2t AFTER DELETE ON p2 BEGIN
211 INSERT INTO p2 VALUES(old.a, 'deleted!');
216 DELETE FROM p2 WHERE a=1;
223 DELETE FROM p2 WHERE a=1;
[all …]
H A Dsnapshot.test428 proc do_snapshot_cmp_test {tn p1 p2 r} {
432 uplevel [list do_test $tn.4 [list snapshot_cmp $p2 $p2] 0]
451 set p2 [snapshot_get db main]
455 do_snapshot_cmp_test $tn.7.1.3 $p1 $p2 -1
457 snapshot_free $p2
475 set p2 [snapshot_get db main]
479 do_snapshot_cmp_test $tn.7.2.3 $p1 $p2 -1
480 snapshot_free $p2
488 set p2 [snapshot_get db main]
492 do_snapshot_cmp_test $tn.7.3.2 $p1 $p2 -1
[all …]
H A Dfkey5.test35 CREATE TABLE p2(a INT PRIMARY KEY); INSERT INTO p2 VALUES(77),(78);
47 CREATE TABLE c2(x INTEGER PRIMARY KEY references p2);
51 CREATE TABLE c6(x INT references p2);
55 CREATE TABLE c10(x TEXT UNIQUE references p2);
175 } {c2 76 p2 0 c2 79 p2 0}
180 } {c2 76 p2 0 c2 79 p2 0}
187 } {c6 1 p2 0 c6 3 p2 0}
192 } {c6 1 p2 0 c6 3 p2 0}
199 } {c10 1 p2 0 c10 3 p2 0}
204 } {c10 1 p2 0 c10 3 p2 0}
H A Daltertab2.test59 ALTER TABLE p1 RENAME TO p2;
62 {CREATE TABLE c1(x REFERENCES "p2")}
63 {CREATE TABLE c2(x, FOREIGN KEY (x) REFERENCES "p2")}
64 {CREATE TABLE c3(x, FOREIGN KEY (x) REFERENCES "p2"(a))}
69 ALTER TABLE p2 RENAME TO p3;
72 {CREATE TABLE c1(x REFERENCES "p2")}
73 {CREATE TABLE c2(x, FOREIGN KEY (x) REFERENCES "p2")}
74 {CREATE TABLE c3(x, FOREIGN KEY (x) REFERENCES "p2"(a))}
78 ALTER TABLE p3 RENAME TO p2;
80 ALTER TABLE p2 RENAME TO p3;
H A Dfunc2.test98 # p1 is 1-indexed, p2 length to return
130 # if p1<0, start from right, p2 length to return
177 # p1 is 1-indexed, p2 length to return, p2<0 return p2 chars before p1
H A Dwindow4.tcl188 min(c) OVER ($p2 $o2 $r2)
193 sum(c) OVER ($p2 $o2 $r2)
201 foreach p1 $lPart { foreach p2 $lPart {
210 set p2 [lindex $lPart 0]
225 set p2 [lindex $lPart 0]
/sqlite-3.40.0/ext/fts5/
H A Dfts5_hash.c193 Fts5HashEntry *p2 in fts5HashAddPoslistSize() argument
197 u8 *pPtr = p2 ? (u8*)p2 : (u8*)p; in fts5HashAddPoslistSize()
223 if( p2==0 ){ in fts5HashAddPoslistSize()
399 Fts5HashEntry *p2 = pRight; in fts5HashEntryMerge() local
403 while( p1 || p2 ){ in fts5HashEntryMerge()
405 *ppOut = p2; in fts5HashEntryMerge()
406 p2 = 0; in fts5HashEntryMerge()
407 }else if( p2==0 ){ in fts5HashEntryMerge()
418 *ppOut = p2; in fts5HashEntryMerge()
419 ppOut = &p2->pScanNext; in fts5HashEntryMerge()
[all …]
H A Dfts5_config.c309 const char *p2 = fts5ConfigSkipWhitespace(p); in fts5ConfigParseSpecial() local
310 if( *p2=='\'' ){ in fts5ConfigParseSpecial()
311 p = fts5ConfigSkipLiteral(p2); in fts5ConfigParseSpecial()
313 p = fts5ConfigSkipBareword(p2); in fts5ConfigParseSpecial()
316 memcpy(pSpace, p2, p-p2); in fts5ConfigParseSpecial()
319 pSpace += (p - p2) + 1; in fts5ConfigParseSpecial()
H A Dfts5_expr.c401 p2->pRoot = 0; in sqlite3Fts5ExprAnd()
412 for(i=0; i<p2->nPhrase; i++){ in sqlite3Fts5ExprAnd()
413 ap[i] = p2->apExprPhrase[i]; in sqlite3Fts5ExprAnd()
419 sqlite3_free(p2->apExprPhrase); in sqlite3Fts5ExprAnd()
420 sqlite3_free(p2); in sqlite3Fts5ExprAnd()
422 *pp1 = p2; in sqlite3Fts5ExprAnd()
1011 Fts5ExprNode *p2 in fts5NodeCompare() argument
1013 if( p2->bEof ) return -1; in fts5NodeCompare()
1340 Fts5ExprNode *p2 = pNode->apChild[1]; in fts5ExprNodeTest_NOT() local
1350 if( cmp || p2->bNomatch ) break; in fts5ExprNodeTest_NOT()
[all …]
H A Dfts5_index.c2589 Fts5SegIter *p2, in fts5AssertComparisonResult() argument
2593 int i2 = p2 - pIter->aSeg; in fts5AssertComparisonResult()
2595 if( p1->pLeaf || p2->pLeaf ){ in fts5AssertComparisonResult()
2598 }else if( p2->pLeaf==0 ){ in fts5AssertComparisonResult()
2692 p2 = &pIter->aSeg[i2]; in fts5MultiIterDoCompare()
2705 if( p1->iRowid==p2->iRowid ){ in fts5MultiIterDoCompare()
2706 p1->bDel = p2->bDel; in fts5MultiIterDoCompare()
4952 *p1 = *p2; in fts5BufferSwap()
4953 *p2 = tmp; in fts5BufferSwap()
4982 Fts5Buffer *p2 = &aBuf[0]; in fts5MergeRowidLists() local
[all …]
/sqlite-3.40.0/ext/rtree/util/
H A Drandomshape.tcl14 proc randomenclosure {cx cy p1 p2 p3 p4} {
35 set p2 [expr {rand()*0.5+0.5}]
38 return [randomenclosure $cx $cy $p1 $p2 $p3 $p4]
44 set p2 [expr {rand()*0.5+0.5}]
47 return [randomenclosure $cx $cy $p1 $p2 $p3 $p4]
53 set p2 [expr {rand()*0.5+0.5}]
56 return [randomenclosure $cx $cy $p1 $p2 $p3 $p4]
/sqlite-3.40.0/ext/fts3/
H A Dfts3.c2258 p2 += n; in fts3PoslistMerge()
2348 p2++; in fts3PoslistPhraseMerge()
2349 p2 += fts3GetVarint32(p2, &iCol2); in fts3PoslistPhraseMerge()
2399 p2++; in fts3PoslistPhraseMerge()
2400 p2 += fts3GetVarint32(p2, &iCol2); in fts3PoslistPhraseMerge()
2416 p2++; in fts3PoslistPhraseMerge()
2417 p2 += fts3GetVarint32(p2, &iCol2); in fts3PoslistPhraseMerge()
2424 *pp2 = p2; in fts3PoslistPhraseMerge()
2467 *pp2 = p2; in fts3PoslistNearMerge()
4366 char *p2; in fts3EvalDeferredPhrase() local
[all …]
H A Dfts3_tokenizer.c430 const sqlite3_tokenizer_module *p2; in intTestFunc() local
438 rc = queryTokenizer(db, "simple", &p2); in intTestFunc()
440 assert( p1==p2 ); in intTestFunc()
441 rc = queryTokenizer(db, "nosuchtokenizer", &p2); in intTestFunc()
443 assert( p2==0 ); in intTestFunc()
450 rc = queryTokenizer(db, "nosuchtokenizer", &p2); in intTestFunc()
452 assert( p2==p1 ); in intTestFunc()
/sqlite-3.40.0/ext/fts2/
H A Dfts2_tokenizer.c298 const sqlite3_tokenizer_module *p2; in intTestFunc() local
303 rc = queryFts2Tokenizer(db, "simple", &p2); in intTestFunc()
305 assert( p1==p2 ); in intTestFunc()
306 rc = queryFts2Tokenizer(db, "nosuchtokenizer", &p2); in intTestFunc()
308 assert( p2==0 ); in intTestFunc()
314 rc = queryFts2Tokenizer(db, "nosuchtokenizer", &p2); in intTestFunc()
316 assert( p2==p1 ); in intTestFunc()
/sqlite-3.40.0/ext/wasm/
H A Dtester1.js524 .assert(asc[1]===p2);
1043 let p2 = P.alloc(7);
1046 .assert(24 === stack - p2)
1047 .assert(P.pointer === p2);
1060 .assert(p2 === p1 + 4)
1061 .assert(p3 === p2 + 4);
1073 .assert(p2 === p1 + 4)
1074 .assert(p3 === p2 + 4);
1075 [p1, p2, p3] = P.allocPtr(3);
1077 .assert(p2 === p1 + 8)
[all …]
/sqlite-3.40.0/ext/rtree/
H A Dgeopoly.c840 static int geopolyOverlap(GeoPoly *p1, GeoPoly *p2);
856 GeoPoly *p2 = geopolyFuncParam(context, argv[1], 0); in geopolyWithinFunc() local
857 if( p1 && p2 ){ in geopolyWithinFunc()
858 int x = geopolyOverlap(p1, p2); in geopolyWithinFunc()
866 sqlite3_free(p2); in geopolyWithinFunc()
1057 static int geopolyOverlap(GeoPoly *p1, GeoPoly *p2){ in geopolyOverlap() argument
1078 geopolyAddSegments(p, p2, 2); in geopolyOverlap()
1186 GeoPoly *p2 = geopolyFuncParam(context, argv[1], 0); in geopolyOverlapFunc() local
1187 if( p1 && p2 ){ in geopolyOverlapFunc()
1188 int x = geopolyOverlap(p1, p2); in geopolyOverlapFunc()
[all …]
/sqlite-3.40.0/tool/
H A Dmkopts.tcl14 if {![regexp {(([a-zA-Z]+)_)?([_a-zA-Z0-9]+)} $token all px p2 name]} continue
16 if {$px!=""} {set prefix $p2}

123