Home
last modified time | relevance | path

Searched refs:d2 (Results 1 – 17 of 17) sorted by relevance

/sqlite-3.40.0/ext/misc/
H A Dshathree.c86 u64 d0, d1, d2, d3, d4; in KeccakF1600Step() local
136 d2 = c1^ROL64(c3, 1); in KeccakF1600Step()
142 b2 = ROL64((a22^d2), 43); in KeccakF1600Step()
154 b4 = ROL64((a42^d2), 61); in KeccakF1600Step()
165 b1 = ROL64((a12^d2), 6); in KeccakF1600Step()
176 b3 = ROL64((a32^d2), 15); in KeccakF1600Step()
203 d2 = c1^ROL64(c3, 1); in KeccakF1600Step()
232 b1 = ROL64((a42^d2), 6); in KeccakF1600Step()
270 d2 = c1^ROL64(c3, 1); in KeccakF1600Step()
299 b1 = ROL64((a02^d2), 6); in KeccakF1600Step()
[all …]
/sqlite-3.40.0/test/
H A Drowvalue9.test152 CREATE TABLE d2(x BLOB, y BLOB);
159 INSERT INTO d2 VALUES (1, 1);
160 INSERT INTO d2 VALUES (2, '2');
161 INSERT INTO d2 VALUES ('3', 3);
162 INSERT INTO d2 VALUES ('4', '4');
174 CREATE INDEX idx1 ON d2(x, y);
179 CREATE UNIQUE INDEX idx2 ON d2(x, y) ;
184 CREATE UNIQUE INDEX idx2 ON d2(x);
207 SELECT x, y FROM d2 WHERE d2.rowid=d1.rowid
212 SELECT d1.rowid FROM d1, d2 WHERE a = y;
[all …]
H A Dselect2.test38 db eval $sql2 d2 {
39 lappend r $d2(f2)
52 db eval $sql2 d2 {
53 lappend r $d2(f2)
H A Drowvalue4.test220 CREATE TABLE d2(a, b, c);
221 CREATE INDEX d2ab ON d2(a, b);
222 CREATE INDEX d2c ON d2(c);
227 INSERT INTO d2 SELECT i/100, i%100, i/100 FROM i;
232 SELECT * FROM d2 WHERE
237 |--SEARCH d2 USING INDEX d2ab (a=? AND b=?)
H A De_select.test1652 CREATE TABLE d2(a, b);
1653 INSERT INTO d2 VALUES('gently', 'failings');
1654 INSERT INTO d2 VALUES('commercials', 'bathrobe');
1655 INSERT INTO d2 VALUES('iterate', 'sexton');
1656 INSERT INTO d2 VALUES('babied', 'charitableness');
1657 INSERT INTO d2 VALUES('solemnness', 'annexed');
1658 INSERT INTO d2 VALUES('rejoicing', 'liabilities');
1659 INSERT INTO d2 VALUES('pragmatist', 'guarded');
1660 INSERT INTO d2 VALUES('barked', 'interrupted');
1661 INSERT INTO d2 VALUES('reemphasizes', 'reply');
[all …]
H A Dshell8.test77 proc dir_compare {d1 d2} {
H A Djoin9.test325 JOIN dual AS d2 ON true
349 JOIN dual AS d2 ON true
H A DcorruptL.test779 | 64: ff d2 ff ff ff 00 f8 ff ff ff 00 00 00 00 00 00 ................
819 | 240: 44 45 58 20 63 20 64 32 20 4f 4e 20 74 32 28 0a DEX c d2 ON t2(.
1444 | 96: 00 00 00 00 0d 0f f8 00 04 0e d2 00 0f 08 0f d3 ................
1445 | 112: 0f ae 0e d2 00 00 00 00 00 00 00 00 00 00 00 00 ................
H A Dfts3corrupt4.test343 | 3744: 56 d2 06 46 f6 c6 f7 26 52 06 57 52 06 67 56 7c V..F...&R.WR.gV|
634 | 3744: 56 d2 06 46 f6 c6 f7 26 52 06 57 52 06 67 56 7c V..F...&R.WR.gV|
4087 | 3440: d2 73 74 61 74 09 07 03 00 01 03 00 01 03 00 01 .stat...........
4331 | 3440: d2 73 74 61 74 09 07 03 00 01 03 00 01 03 00 01 .stat...........
4785 | 3440: d2 73 74 61 74 09 07 03 00 01 03 00 01 03 00 01 .stat...........
5018 | 3440: d2 73 74 61 74 09 07 03 00 01 03 00 01 03 00 01 .stat...........
/sqlite-3.40.0/src/
H A Dtest_rtree.c128 double d2; in circle_geom() local
130 d2 = (x-pCircle->centerx)*(x-pCircle->centerx); in circle_geom()
131 d2 += (y-pCircle->centery)*(y-pCircle->centery); in circle_geom()
132 if( d2<(pCircle->radius*pCircle->radius) ){ in circle_geom()
264 double d2; in circle_query_func() local
266 d2 = (x-pCircle->centerx)*(x-pCircle->centerx); in circle_query_func()
267 d2 += (y-pCircle->centery)*(y-pCircle->centery); in circle_query_func()
268 if( d2<(pCircle->radius*pCircle->radius) ) nWithin++; in circle_query_func()
H A Dexpr.c5211 int d2 = sqlite3VdbeMakeLabel(pParse); in sqlite3ExprIfTrue() local
5213 sqlite3ExprIfFalse(pParse, pExpr->pLeft, d2, in sqlite3ExprIfTrue()
5216 sqlite3VdbeResolveLabel(v, d2); in sqlite3ExprIfTrue()
5389 int d2 = sqlite3VdbeMakeLabel(pParse); in sqlite3ExprIfFalse() local
5391 sqlite3ExprIfTrue(pParse, pExpr->pLeft, d2, in sqlite3ExprIfFalse()
5394 sqlite3VdbeResolveLabel(v, d2); in sqlite3ExprIfFalse()
H A Dbtree.c6433 int d2 = sqlite3AbsInt32(get4byte(&aData[8+i*4]) - nearby); in allocateBtreePage() local
6434 if( d2<dist ){ in allocateBtreePage()
6436 dist = d2; in allocateBtreePage()
10396 int depth = -1, d2; /* Depth of a subtree */ in checkTreePage() local
10541 d2 = checkTreePage(pCheck, pgno, &maxKey, maxKey); in checkTreePage()
10543 if( d2!=depth ){ in checkTreePage()
10545 depth = d2; in checkTreePage()
H A Dwherecode.c961 char d2[4]; in codeCursorHintIsOrFunction() local
962 if( 0==sqlite3IsLikeFunction(pWalker->pParse->db, pExpr, &d1, d2) ){ in codeCursorHintIsOrFunction()
/sqlite-3.40.0/ext/fts5/test/
H A Dfts5corrupt3.test427 | 96: 00 00 00 00 0d 00 00 00 07 0d d2 00 0f c4 0f 6d ...............m
428 | 112: 0f 02 0e ab 0e 4e 0d f6 0d d2 00 00 00 00 00 00 .....N..........
515 | 96: 00 2e 30 38 0d 00 00 00 07 0d d2 00 0f c4 0f 6d ..08...........m
516 | 112: 0f 02 0e ab 0e 4e 0d f6 0d d2 00 00 00 00 00 00 .....N..........
615 | 96: 00 00 00 00 0d 00 00 00 07 0d d2 00 0f c4 0f 6d ...............m
616 | 112: 0f 02 0e ab 0e 4e 0d f6 0d d2 00 00 00 00 00 00 .....N..........
701 | 96: 00 00 00 00 0d 00 00 00 07 0d d2 00 0f c4 0f 6d ...............m
702 | 112: 0f 02 0e ab 0e 4e 0d f6 0d d2 00 00 00 00 00 00 .....N..........
784 | 96: 00 2e 30 38 0d 00 00 00 07 0d d2 00 0f c4 0f 6d ..08...........m
12105 | 2496: 84 18 80 59 66 d2 c6 58 55 c0 5d 07 9f 69 d2 72 ...Yf..XU.]..i.r
[all …]
/sqlite-3.40.0/ext/recover/
H A Drecovercorrupt2.test205 | 3456: 85 7b ce d0 32 d2 54 61 62 63 30 00 00 00 00 00 ....2.Tabc0.....
251 | 3872: 32 d2 54 10 0b 03 06 09 5a 47 53 20 3b 48 8f c0 2.T.....ZGS ;H..
/sqlite-3.40.0/ext/fts1/
H A Dfulltext.c336 static int docListSplit(DocList *d, DocList *d2){ in docListSplit() argument
345 docListInit(d2, d->iType, reader.p, docListEnd(d) - reader.p); in docListSplit()
/sqlite-3.40.0/ext/rtree/
H A Drtreefuzz001.test74 | 208: 0b 05 0a 65 09 c5 09 25 08 85 0e 68 0d d2 0d 3c ...e...%...h...<
648 | 3184: 80 50 00 92 30 06 26 f7 47 46 f6 d2 06 56 46 76 .P..0.&.GF...VFv
1031 | 2624: 00 00 00 07 d2 00 00 00 02 00 00 00 04 00 00 00 ................