Home
last modified time | relevance | path

Searched refs:p1 (Results 1 – 25 of 75) sorted by relevance

123

/sqlite-3.40.0/test/
H A Dfkey8.test28 1 1 "DELETE FROM p1" {
33 2.1 0 "DELETE FROM p1" {
37 2.2 0 "DELETE FROM p1" {
41 2.3 1 "DELETE FROM p1" {
46 3 1 "DELETE FROM p1" {
50 INSERT INTO p1 VALUES('x');
54 4 1 "DELETE FROM p1" {
60 5.1 0 "DELETE FROM p1" {
65 5.2 0 "DELETE FROM p1" {
70 5.3 1 "DELETE FROM p1" {
[all …]
H A De_totalchanges.test129 CREATE TABLE p1(c PRIMARY KEY, d);
134 INSERT INTO p1 VALUES(1, 'one');
135 INSERT INTO p1 VALUES(2, 'two');
136 INSERT INTO p1 VALUES(3, 'three');
137 INSERT INTO p1 VALUES(4, 'four');
145 do_tc_test 3.1.2 { DELETE FROM p1 WHERE c=1; } {9}
146 do_tc_test 3.1.3 { DELETE FROM p1 WHERE c=2; } {11}
159 INSERT INTO p1 VALUES(1, 'one');
160 INSERT INTO p1 VALUES(2, 'two');
161 INSERT INTO p1 VALUES(3, 'three');
[all …]
H A Dshell6.test25 CREATE TABLE p1(a PRIMARY KEY, b);
26 CREATE TABLE c1(x, y REFERENCES p1);
28 CREATE INDEX 'c1_y' ON 'c1'('y'); --> p1(a)
32 CREATE TABLE p1(a PRIMARY KEY, b);
33 CREATE TABLE c2(x REFERENCES p1, y REFERENCES p1);
35 CREATE INDEX 'c2_y' ON 'c2'('y'); --> p1(a)
47 CREATE TABLE p1(a, 'b b b' PRIMARY KEY);
48 CREATE TABLE c1('x y z' REFERENCES p1);
54 CREATE TABLE p1(a, 'b b b' PRIMARY KEY);
55 CREATE TABLE c1('x y z' REFERENCES p1);
[all …]
H A De_changes.test144 CREATE TABLE p1(one PRIMARY KEY, two);
146 CREATE TRIGGER tr_ai AFTER INSERT ON p1 BEGIN
149 CREATE TRIGGER tr_bd BEFORE DELETE ON p1 BEGIN
152 CREATE TRIGGER tr_au AFTER UPDATE ON p1 BEGIN
159 INSERT INTO p1 VALUES('a', 'A'), ('b', 'B'), ('c', 'C');
162 UPDATE p1 SET two = two||two;
165 DELETE FROM p1 WHERE one IN ('a', 'c');
173 DELETE FROM p1;
174 INSERT INTO p1 VALUES('a', 'A'), ('b', 'B'), ('c', 'C');
183 INSERT INTO p1 VALUES('d', 'D'), ('e', 'E'), ('f', 'F');
[all …]
H A Dfkey6.test126 CREATE TABLE p1(a PRIMARY KEY);
127 INSERT INTO p1 VALUES('one'), ('two');
128 CREATE TABLE c1(x REFERENCES p1);
135 DELETE FROM p1;
143 DROP TABLE p1;
152 DELETE FROM p1;
159 DROP TABLE p1;
160 CREATE TABLE p1(a PRIMARY KEY);
161 INSERT INTO p1 VALUES('one'), ('two');
162 CREATE TABLE c1(x REFERENCES p1);
H A Dfkey5.test34 CREATE TABLE p1(a INTEGER PRIMARY KEY); INSERT INTO p1 VALUES(88),(89);
50 CREATE TABLE c5(x INT references p1);
54 CREATE TABLE c9(x TEXT UNIQUE references p1);
81 } {c1 87 p1 0 c1 90 p1 0}
86 } {c1 87 p1 0 c1 90 p1 0}
96 } {c1 87 p1 0 c1 90 p1 0}
136 } {c5 1 p1 0 c5 3 p1 0}
141 } {c5 1 p1 0 c5 3 p1 0}
149 } {0 0 p1 x {} {NO ACTION} {NO ACTION} NONE}
157 } {c9 1 p1 0 c9 3 p1 0}
[all …]
H A Dsnapshot.test426 # Compare snapshots $p1 and $p2, checking that the result is $r.
428 proc do_snapshot_cmp_test {tn p1 p2 r} {
429 uplevel [list do_test $tn.1 [list snapshot_cmp $p1 $p2] $r]
431 uplevel [list do_test $tn.3 [list snapshot_cmp $p1 $p1] 0]
445 set p1 [snapshot_get db main]
455 do_snapshot_cmp_test $tn.7.1.3 $p1 $p2 -1
456 snapshot_free $p1
467 set p1 [snapshot_get db main]
479 do_snapshot_cmp_test $tn.7.2.3 $p1 $p2 -1
492 do_snapshot_cmp_test $tn.7.3.2 $p1 $p2 -1
[all …]
H A Dfordelete.test46 set csr $R(p1)
61 set csr $R(p1)
167 CREATE TABLE p1(one PRIMARY KEY, two);
169 CREATE TRIGGER tr_bd BEFORE DELETE ON p1 BEGIN
172 INSERT INTO p1 VALUES('a', 'A'), ('b', 'B'), ('c', 'C');
173 DELETE FROM p1 WHERE one = 'a';
H A Dupfrom3.test225 CREATE TABLE p1(a INTEGER PRIMARY KEY, b) %WO%;
226 CREATE TABLE c1(x PRIMARY KEY, y REFERENCES p1 ON UPDATE CASCADE) %WO%;
229 INSERT INTO p1 VALUES(1, 'one');
230 INSERT INTO p1 VALUES(11, 'eleven');
231 INSERT INTO p1 VALUES(111, 'eleventyone');
251 UPDATE p1 SET a=t FROM map WHERE b=f;
H A Dalterdropcol.test213 CREATE TABLE p1(a PRIMARY KEY, b UNIQUE);
214 CREATE TABLE c1(x, y, z REFERENCES p1(c));
215 CREATE TABLE c2(x, y, z, w REFERENCES p1(b));
223 {CREATE TABLE c2(x, y, w REFERENCES p1(b))}
227 CREATE VIEW v1 AS SELECT d, e FROM p1
242 INSERT INTO p1 VALUES(new.y, new.xyz);
251 INSERT INTO p1 VALUES(new.y, new.z);
/sqlite-3.40.0/src/
H A Dvdbe.c1423 assert( pOp->p1>0 && pOp->p1<=p->nVar ); in sqlite3VdbeExec()
1453 p1 = pOp->p1; in sqlite3VdbeExec()
1456 assert( p1+n<=p2 || p2+n<=p1 ); in sqlite3VdbeExec()
2345 p1 = pOp->p1; in sqlite3VdbeExec()
2362 REGISTER_TRACE(p1+idx, &aMem[p1+idx]); in sqlite3VdbeExec()
2539 if( p->aOp[0].p1==pOp->p1 ){ in sqlite3VdbeExec()
2545 pOp->p1 = p->aOp[0].p1; in sqlite3VdbeExec()
3611 p1 = pOp->p1; in sqlite3VdbeExec()
4701 assert( pOp[1].p1==pOp[0].p1 ); in sqlite3VdbeExec()
7871 int p1 = pOp->p1; in sqlite3VdbeExec() local
[all …]
H A Dfunc.c320 i64 p1, p2; in substrFunc() local
340 if( p1<0 ){ in substrFunc()
352 if( p1==0 ) p1 = 1; /* <rdar://problem/6778339> */ in substrFunc()
363 if( p1<0 ){ in substrFunc()
364 p1 += len; in substrFunc()
365 if( p1<0 ){ in substrFunc()
368 p1 = 0; in substrFunc()
371 p1--; in substrFunc()
376 p1 -= p2; in substrFunc()
379 p1 = 0; in substrFunc()
[all …]
H A Dvdbesort.c811 const u8 * const v1 = &p1[ p1[0] ]; /* Pointer to value 1 */ in vdbeSorterCompareText()
855 const u8 * const v1 = &p1[ p1[0] ]; /* Pointer to value 1 */ in vdbeSorterCompareInt()
1359 pTask, &bCached, SRVAL(p1), p1->nVal, SRVAL(p2), p2->nVal in vdbeSorterMerge()
1363 *pp = p1; in vdbeSorterMerge()
1364 pp = &p1->u.pNext; in vdbeSorterMerge()
1365 p1 = p1->u.pNext; in vdbeSorterMerge()
1366 if( p1==0 ){ in vdbeSorterMerge()
1376 *pp = p1; in vdbeSorterMerge()
2039 PmaReader *p1; in vdbeMergeEngineCompare() local
2055 if( p1->pFd==0 ){ in vdbeMergeEngineCompare()
[all …]
/sqlite-3.40.0/ext/recover/
H A Dsqlite3recover.c1661 if( pTbl->nCol>p1->nMax ) p1->nMax = pTbl->nCol; in recoverWriteDataInit()
1707 memset(p1, 0, sizeof(*p1)); in recoverWriteDataCleanup()
1748 p1->nVal = 0; in recoverWriteDataStep()
1765 int bNewCell = (p1->iPrevPage!=iPage || p1->iPrevCell!=iCell); in recoverWriteDataStep()
1768 assert( bNewCell || iField==p1->nVal || p1->nVal==pTab->nCol ); in recoverWriteDataStep()
1773 if( p1->pInsert==0 || p1->nVal!=p1->nInsert ){ in recoverWriteDataStep()
1775 p1->pInsert = recoverInsertStmt(p, pTab, p1->nVal); in recoverWriteDataStep()
1776 p1->nInsert = p1->nVal; in recoverWriteDataStep()
1808 p1->nVal = -1; in recoverWriteDataStep()
1816 p1->nVal = 0; in recoverWriteDataStep()
[all …]
/sqlite-3.40.0/ext/rtree/util/
H A Drandomshape.tcl14 proc randomenclosure {cx cy p1 p2 p3 p4} {
34 set p1 [expr {rand()*0.1}]
38 return [randomenclosure $cx $cy $p1 $p2 $p3 $p4]
43 set p1 [expr {rand()*0.1}]
47 return [randomenclosure $cx $cy $p1 $p2 $p3 $p4]
52 set p1 [expr {rand()*0.05}]
56 return [randomenclosure $cx $cy $p1 $p2 $p3 $p4]
/sqlite-3.40.0/ext/session/
H A Dsession9.test32 CREATE TABLE p1(a PRIMARY KEY, b);
33 CREATE TABLE c1(a PRIMARY KEY, b REFERENCES p1);
35 b REFERENCES p1 DEFERRABLE INITIALLY DEFERRED
38 INSERT INTO p1 VALUES(1, 'one');
39 INSERT INTO p1 VALUES(2, 'two');
40 INSERT INTO p1 VALUES(3, 'three');
41 INSERT INTO p1 VALUES(4, 'four');
87 execsql { DELETE FROM p1 WHERE a=($delrow+0) }
230 CREATE TABLE p1(x PRIMARY KEY, y);
231 CREATE TABLE c1(a PRIMARY KEY, b REFERENCES p1);
[all …]
/sqlite-3.40.0/ext/fts3/
H A Dfts3.c2257 p1 += n; in fts3PoslistMerge()
2297 *pp1 = p1 + 1; in fts3PoslistMerge()
2344 p1++; in fts3PoslistPhraseMerge()
2345 p1 += fts3GetVarint32(p1, &iCol1); in fts3PoslistPhraseMerge()
2397 p1++; in fts3PoslistPhraseMerge()
2398 p1 += fts3GetVarint32(p1, &iCol1); in fts3PoslistPhraseMerge()
2411 p1++; in fts3PoslistPhraseMerge()
2412 p1 += fts3GetVarint32(p1, &iCol1); in fts3PoslistPhraseMerge()
2423 *pp1 = p1; in fts3PoslistPhraseMerge()
2466 *pp1 = p1; in fts3PoslistNearMerge()
[all …]
H A Dfts3_tokenizer.c429 const sqlite3_tokenizer_module *p1; in intTestFunc() local
437 sqlite3Fts3SimpleTokenizerModule(&p1); in intTestFunc()
440 assert( p1==p2 ); in intTestFunc()
448 rc = registerTokenizer(db, "nosuchtokenizer", p1); in intTestFunc()
452 assert( p2==p1 ); in intTestFunc()
/sqlite-3.40.0/ext/fts5/
H A Dfts5_hash.c398 Fts5HashEntry *p1 = pLeft; in fts5HashEntryMerge() local
403 while( p1 || p2 ){ in fts5HashEntryMerge()
404 if( p1==0 ){ in fts5HashEntryMerge()
408 *ppOut = p1; in fts5HashEntryMerge()
409 p1 = 0; in fts5HashEntryMerge()
412 char *zKey1 = fts5EntryKey(p1); in fts5HashEntryMerge()
423 *ppOut = p1; in fts5HashEntryMerge()
424 ppOut = &p1->pScanNext; in fts5HashEntryMerge()
425 p1 = p1->pScanNext; in fts5HashEntryMerge()
H A Dfts5_index.c2588 Fts5SegIter *p1, in fts5AssertComparisonResult() argument
2596 if( p1->pLeaf==0 ){ in fts5AssertComparisonResult()
4952 *p1 = *p2; in fts5BufferSwap()
5194 fts5BufferFree(p1); in fts5MergePrefixLists()
5197 *p1 = out; in fts5MergePrefixLists()
5251 Fts5SegIter *pSeg = &p1->aSeg[ p1->aFirst[1].iFirst ]; in fts5SetupPrefixIter()
5252 p1->xSetOutputs(p1, pSeg); in fts5SetupPrefixIter()
5254 xAppend(p, (u64)p1->base.iRowid-(u64)iLastRowid, p1, &doclist); in fts5SetupPrefixIter()
5268 Fts5SegIter *pSeg = &p1->aSeg[ p1->aFirst[1].iFirst ]; in fts5SetupPrefixIter()
5271 p1->xSetOutputs(p1, pSeg); in fts5SetupPrefixIter()
[all …]
H A Dfts5_expr.c397 Fts5Expr *p1 = *pp1; in sqlite3Fts5ExprAnd() local
400 p1->pRoot = sqlite3Fts5ParseNode(&sParse, FTS5_AND, p1->pRoot, p2->pRoot,0); in sqlite3Fts5ExprAnd()
415 p1->nPhrase = nPhrase; in sqlite3Fts5ExprAnd()
416 p1->apExprPhrase = ap; in sqlite3Fts5ExprAnd()
1010 Fts5ExprNode *p1, in fts5NodeCompare() argument
1014 if( p1->bEof ) return +1; in fts5NodeCompare()
1246 assert( p1->bEof || fts5RowidCmp(pExpr, p1->iRowid, iLast)>=0 ); in fts5ExprNodeNext_OR()
1247 if( p1->bEof==0 ){ in fts5ExprNodeNext_OR()
1353 pNode->bEof = p1->bEof; in fts5ExprNodeTest_NOT()
1355 pNode->iRowid = p1->iRowid; in fts5ExprNodeTest_NOT()
[all …]
/sqlite-3.40.0/ext/rtree/
H A Dgeopoly.c818 if( p1==0 ) return; in geopolyContainsPointFunc()
820 v = pointBeneathLine(x0,y0,GeoX(p1,ii), GeoY(p1,ii), in geopolyContainsPointFunc()
821 GeoX(p1,ii+1),GeoY(p1,ii+1)); in geopolyContainsPointFunc()
826 v = pointBeneathLine(x0,y0,GeoX(p1,ii), GeoY(p1,ii), in geopolyContainsPointFunc()
827 GeoX(p1,0), GeoY(p1,0)); in geopolyContainsPointFunc()
836 sqlite3_free(p1); in geopolyContainsPointFunc()
857 if( p1 && p2 ){ in geopolyWithinFunc()
865 sqlite3_free(p1); in geopolyWithinFunc()
1077 geopolyAddSegments(p, p1, 1); in geopolyOverlap()
1187 if( p1 && p2 ){ in geopolyOverlapFunc()
[all …]
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5af.test168 CREATE VIRTUAL TABLE p1 USING fts5(a, b, detail=%DETAIL%);
169 INSERT INTO p1 VALUES(
175 SELECT snippet(p1, 0, '[', ']', '...', 6) FROM p1('x');
179 SELECT snippet(p1, 0, '[', ']', NULL, 6) FROM p1('x');
182 SELECT snippet(p1, 0, NULL, ']', '...', 6) FROM p1('x');
185 SELECT snippet(p1, 0, '[', NULL, '...', 6) FROM p1('x');
188 SELECT snippet(p1, 0, '[', NULL, '...', 6) FROM p1('x OR ""');
191 SELECT snippet(p1, 0, '[', NULL, '...', 6) FROM p1('x OR ' || x'DB');
/sqlite-3.40.0/ext/fts2/
H A Dfts2_tokenizer.c297 const sqlite3_tokenizer_module *p1; in intTestFunc() local
302 sqlite3Fts2SimpleTokenizerModule(&p1); in intTestFunc()
305 assert( p1==p2 ); in intTestFunc()
312 rc = registerTokenizer(db, "nosuchtokenizer", p1); in intTestFunc()
316 assert( p2==p1 ); in intTestFunc()
/sqlite-3.40.0/ext/expert/
H A Dsqlite3expert.c698 sqlite3_stmt *p1 = 0; in idxGetTableInfo() local
712 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(p1) ){ in idxGetTableInfo()
726 nPk += (sqlite3_column_int(p1, 5)>0); in idxGetTableInfo()
728 rc2 = sqlite3_reset(p1); in idxGetTableInfo()
742 while( rc==SQLITE_OK && SQLITE_ROW==sqlite3_step(p1) ){ in idxGetTableInfo()
766 idxFinalize(&rc, p1); in idxGetTableInfo()
1063 IdxConstraint *p1 = 0; in idxCreateFromWhere() local
1070 pCon->pLink = p1; in idxCreateFromWhere()
1071 p1 = pCon; in idxCreateFromWhere()
1077 rc = idxCreateFromCons(p, pScan, p1, pTail); in idxCreateFromWhere()
[all …]

123