Lines Matching refs:t2
50076 u64 t2 = t1;
50077 swapMixedEndianFloat(t2);
50078 assert( sizeof(r1)==sizeof(t2) && memcmp(&r1, &t2, sizeof(r1))==0 );
64349 ** sqlite_rename_parent('CREATE TABLE t1(a REFERENCES t2)', 't2', 't3')
73375 ** CREATE TABLE t2(b REFERENCES t1(a);
73379 ** "t2". Calling this function with "t2" as the argument would return a
73380 ** NULL pointer (as there are no FK constraints for which t2 is the parent
79526 ** SELECT * FROM t1 LEFT JOIN t2 ON t1.a=t2.b AND t1.x=5
79529 ** term until after the t2 loop of the join. In that way, a
79530 ** NULL t2 row will be inserted whenever t1.x!=5. If we do not
80688 ** SELECT a FROM t1 UNION SELECT b FROM t2 UNION SELECT c FROM t3
80694 ** `-----> SELECT b FROM t2
80700 ** pPrior will be the t2 query. p->op will be TK_UNION in this case.
81875 ** t1 LEFT OUTER JOIN (t2 JOIN t3)
81879 ** (t1 LEFT OUTER JOIN t2) JOIN t3
81888 ** t1 LEFT OUTER JOIN (SELECT * FROM t2 WHERE t2.x>0)
81892 ** (t1 LEFT OUTER JOIN t2) WHERE t2.x>0
81894 ** But the t2.x>0 test will always fail on a NULL row of t2, which
84418 ** INSERT OR REPLACE INTO t2 VALUES(new.a, new.b);
84421 ** INSERT INTO t1 ... ; -- insert into t2 uses REPLACE policy
84422 ** INSERT OR IGNORE INTO t1 ... ; -- insert into t2 uses IGNORE policy
87535 ** (A) t1.x=t2.y OR t1.x=t2.z OR t1.y=15 OR t1.z=t3.a+5
87537 ** (C) t1.x=t2.y OR (t1.x=t2.z AND t1.y=15)
87733 /* This term must be of the form t1.a==t2.b where t2 is in the
87735 ** or follwed by an inverted copy (t2.b==t1.a). Skip this term
89312 ** Consider the term t2.z='ok' in the following queries:
89314 ** (1) SELECT * FROM t1 LEFT JOIN t2 ON t1.a=t2.x WHERE t2.z='ok'
89315 ** (2) SELECT * FROM t1 LEFT JOIN t2 ON t1.a=t2.x AND t2.z='ok'
89316 ** (3) SELECT * FROM t1, t2 WHERE t1.a=t2.x AND t2.z='ok'
89318 ** The t2.z='ok' is disabled in the in (2) because it originates
89481 ** SELECT ... FROM t1 AS t2, t1 WHERE t1.a = t2.b;
89484 ** the right hand side of the equality constraint (t2.b) has NONE affinity,
89485 ** no conversion should be attempted before using a t2.b value as part of
90234 ** SELECT * FROM t1, t2, t3 WHERE ...;
90239 ** foreach row2 in t2 do |-- by sqlite3WhereBegin()
90253 ** number pTabList->a[0].iCursor. t2 uses the cursor pTabList->a[1].iCursor.
90278 ** An outer join of tables t1 and t2 is conceptally coded as follows:
90282 ** foreach row2 in t2 do
90489 ** CREATE TABLE t2(c, d);
90490 ** SELECT * FROM t2, t1 WHERE t2.rowid = t1.a;
90494 ** However, since the cost of a linear scan through table t2 is the same
90496 ** algorithm may choose to use t2 for the outer loop, which is a much
