Lines Matching refs:n
321 int speedtest1_numbername(unsigned int n, char *zOut, int nOut){ in speedtest1_numbername() argument
330 if( n>=1000000000 ){ in speedtest1_numbername()
331 i += speedtest1_numbername(n/1000000000, zOut+i, nOut-i); in speedtest1_numbername()
334 n = n % 1000000000; in speedtest1_numbername()
336 if( n>=1000000 ){ in speedtest1_numbername()
338 i += speedtest1_numbername(n/1000000, zOut+i, nOut-i); in speedtest1_numbername()
341 n = n % 1000000; in speedtest1_numbername()
343 if( n>=1000 ){ in speedtest1_numbername()
345 i += speedtest1_numbername(n/1000, zOut+i, nOut-i); in speedtest1_numbername()
348 n = n % 1000; in speedtest1_numbername()
350 if( n>=100 ){ in speedtest1_numbername()
352 sqlite3_snprintf(nOut-i, zOut+i, "%s hundred", ones[n/100]); in speedtest1_numbername()
354 n = n % 100; in speedtest1_numbername()
356 if( n>=20 ){ in speedtest1_numbername()
358 sqlite3_snprintf(nOut-i, zOut+i, "%s", tens[n/10]); in speedtest1_numbername()
360 n = n % 10; in speedtest1_numbername()
362 if( n>0 ){ in speedtest1_numbername()
364 sqlite3_snprintf(nOut-i, zOut+i, "%s", ones[n]); in speedtest1_numbername()
381 int n = (int)strlen(zTestName); in speedtest1_begin_test() local
388 n = (int)strlen(zName); in speedtest1_begin_test()
389 if( n>NAMEWIDTH ){ in speedtest1_begin_test()
391 n = NAMEWIDTH; in speedtest1_begin_test()
394 fprintf(g.pScript,"-- begin test %d %.*s\n", iTestNumber, n, zName) in speedtest1_begin_test()
399 printf("/* %4d - %s%.*s */\n", iTestNum, zName, NAMEWIDTH-n, zDots); in speedtest1_begin_test()
401 printf("%4d - %s%.*s ", iTestNum, zName, NAMEWIDTH-n, zDots); in speedtest1_begin_test()
458 int n = (int)strlen(zSql); in printSql() local
459 while( n>0 && (zSql[n-1]==';' || ISSPACE(zSql[n-1])) ){ n--; } in printSql()
461 printf("%.*s;\n", n, zSql); in printSql()
470 printf("%.*s;\n", n, zSql); in printSql()
563 int i, n, len; in speedtest1_run() local
573 n = sqlite3_column_count(g.pStmt); in speedtest1_run()
574 for(i=0; i<n; i++){ in speedtest1_run()
635 int n = (int)strlen(zSql); in traceCallback() local
636 while( n>0 && (zSql[n-1]==';' || ISSPACE(zSql[n-1])) ) n--; in traceCallback()
637 fprintf(stderr,"%.*s;\n", n, zSql); in traceCallback()
655 int n; in est_square_root() local
656 for(n=0; y0>0 && n<10; n++){ in est_square_root()
675 static void groupAppend(struct groupConcat *p, const char *z, int n){ in groupAppend() argument
676 if( p->nUsed+n >= p->nAlloc ){ in groupAppend()
677 int n2 = (p->nAlloc+n+1)*2; in groupAppend()
683 memcpy(p->z+p->nUsed, z, n); in groupAppend()
684 p->nUsed += n; in groupAppend()
731 int n; /* iteration count */ in testset_main() local
738 sz = n = g.szTest*500; in testset_main()
741 speedtest1_begin_test(100, "%d INSERTs into table with no index", n); in testset_main()
745 speedtest1_prepare("INSERT INTO z1 VALUES(?1,?2,?3); -- %d times", n); in testset_main()
746 for(i=1; i<=n; i++){ in testset_main()
758 n = sz; in testset_main()
759 speedtest1_begin_test(110, "%d ordered INSERTS with one index/PK", n); in testset_main()
764 speedtest1_prepare("INSERT INTO z2 VALUES(?1,?2,?3); -- %d times", n); in testset_main()
765 for(i=1; i<=n; i++){ in testset_main()
777 n = sz; in testset_main()
778 speedtest1_begin_test(120, "%d unordered INSERTS with one index/PK", n); in testset_main()
783 speedtest1_prepare("INSERT INTO t3 VALUES(?1,?2,?3); -- %d times", n); in testset_main()
784 for(i=1; i<=n; i++){ in testset_main()
800 n = 25; in testset_main()
801 speedtest1_begin_test(130, "%d SELECTS, numeric BETWEEN, unindexed", n); in testset_main()
805 " WHERE b BETWEEN ?1 AND ?2; -- %d times", n in testset_main()
807 for(i=1; i<=n; i++){ in testset_main()
820 n = 10; in testset_main()
821 speedtest1_begin_test(140, "%d SELECTS, LIKE, unindexed", n); in testset_main()
825 " WHERE c LIKE ?1; -- %d times", n in testset_main()
827 for(i=1; i<=n; i++){ in testset_main()
842 n = 10; in testset_main()
843 speedtest1_begin_test(142, "%d SELECTS w/ORDER BY, unindexed", n); in testset_main()
847 " ORDER BY a; -- %d times", n in testset_main()
849 for(i=1; i<=n; i++){ in testset_main()
863 n = 10; /* g.szTest/5; */ in testset_main()
864 speedtest1_begin_test(145, "%d SELECTS w/ORDER BY and LIMIT, unindexed", n); in testset_main()
868 " ORDER BY a LIMIT 10; -- %d times", n in testset_main()
870 for(i=1; i<=n; i++){ in testset_main()
896 n = sz/5; in testset_main()
897 speedtest1_begin_test(160, "%d SELECTS, numeric BETWEEN, indexed", n); in testset_main()
901 " WHERE b BETWEEN ?1 AND ?2; -- %d times", n in testset_main()
903 for(i=1; i<=n; i++){ in testset_main()
916 n = sz/5; in testset_main()
917 speedtest1_begin_test(161, "%d SELECTS, numeric BETWEEN, PK", n); in testset_main()
921 " WHERE a BETWEEN ?1 AND ?2; -- %d times", n in testset_main()
923 for(i=1; i<=n; i++){ in testset_main()
936 n = sz/5; in testset_main()
937 speedtest1_begin_test(170, "%d SELECTS, text BETWEEN, indexed", n); in testset_main()
941 " WHERE c BETWEEN ?1 AND (?1||'~'); -- %d times", n in testset_main()
943 for(i=1; i<=n; i++){ in testset_main()
954 n = sz; in testset_main()
955 speedtest1_begin_test(180, "%d INSERTS with three indexes", n); in testset_main()
970 n = sz; in testset_main()
971 speedtest1_begin_test(190, "DELETE and REFILL one table", n); in testset_main()
988 n = sz/5; in testset_main()
989 speedtest1_begin_test(230, "%d UPDATES, numeric BETWEEN, indexed", n); in testset_main()
992 "UPDATE z2 SET d=b*2 WHERE b BETWEEN ?1 AND ?2; -- %d times", n in testset_main()
994 for(i=1; i<=n; i++){ in testset_main()
1005 n = sz; in testset_main()
1006 speedtest1_begin_test(240, "%d UPDATES of individual rows", n); in testset_main()
1009 "UPDATE z2 SET d=b*3 WHERE a=?1; -- %d times", n in testset_main()
1011 for(i=1; i<=n; i++){ in testset_main()
1030 n = sz/5; in testset_main()
1031 speedtest1_begin_test(270, "%d DELETEs, numeric BETWEEN, indexed", n); in testset_main()
1034 "DELETE FROM z2 WHERE b BETWEEN ?1 AND ?2; -- %d times", n in testset_main()
1036 for(i=1; i<=n; i++){ in testset_main()
1047 n = sz; in testset_main()
1048 speedtest1_begin_test(280, "%d DELETEs of individual rows", n); in testset_main()
1051 "DELETE FROM t3 WHERE a=?1; -- %d times", n in testset_main()
1053 for(i=1; i<=n; i++){ in testset_main()
1076 n = sz/5; in testset_main()
1077 speedtest1_begin_test(310, "%d four-ways joins", n); in testset_main()
1086 for(i=1; i<=n; i++){ in testset_main()
1096 speedtest1_begin_test(320, "subquery in result set", n); in testset_main()
1106 sz = n = g.szTest*700; in testset_main()
1109 speedtest1_begin_test(400, "%d REPLACE ops on an IPK", n); in testset_main()
1113 speedtest1_prepare("REPLACE INTO t5 VALUES(?1,?2); -- %d times",n); in testset_main()
1114 for(i=1; i<=n; i++){ in testset_main()
1123 speedtest1_begin_test(410, "%d SELECTS on an IPK", n); in testset_main()
1133 speedtest1_prepare("SELECT b FROM t5 WHERE a=?1; -- %d times",n); in testset_main()
1134 for(i=1; i<=n; i++){ in testset_main()
1144 sz = n = g.szTest*700; in testset_main()
1147 speedtest1_begin_test(500, "%d REPLACE on TEXT PK", n); in testset_main()
1152 speedtest1_prepare("REPLACE INTO t6 VALUES(?1,?2); -- %d times",n); in testset_main()
1153 for(i=1; i<=n; i++){ in testset_main()
1162 speedtest1_begin_test(510, "%d SELECTS on a TEXT PK", n); in testset_main()
1167 speedtest1_prepare("SELECT b FROM t6 WHERE a=?1; -- %d times",n); in testset_main()
1168 for(i=1; i<=n; i++){ in testset_main()
1178 speedtest1_begin_test(520, "%d SELECT DISTINCT", n); in testset_main()
1365 int n; in testset_fp() local
1370 n = g.szTest*5000; in testset_fp()
1371 speedtest1_begin_test(100, "Fill a table with %d FP values", n*2); in testset_fp()
1375 speedtest1_prepare("INSERT INTO z1 VALUES(?1,?2); -- %d times", n); in testset_fp()
1376 for(i=1; i<=n; i++){ in testset_fp()
1386 n = g.szTest/25 + 2; in testset_fp()
1387 speedtest1_begin_test(110, "%d range queries", n); in testset_fp()
1389 for(i=1; i<=n; i++){ in testset_fp()
1406 n = g.szTest/3 + 2; in testset_fp()
1407 speedtest1_begin_test(130, "%d indexed range queries", n); in testset_fp()
1409 for(i=1; i<=n; i++){ in testset_fp()
1418 n = g.szTest*5000; in testset_fp()
1419 speedtest1_begin_test(140, "%d calls to round()", n); in testset_fp()
1424 speedtest1_begin_test(150, "%d printf() calls", n*4); in testset_fp()
1482 unsigned i, n; in testset_rtree() local
1490 mxRowid = n = g.szTest*500; in testset_rtree()
1491 speedtest1_begin_test(100, "%d INSERTs into an r-tree", n); in testset_rtree()
1496 for(i=1; i<=n; i++){ in testset_rtree()
1517 n = g.szTest*200; in testset_rtree()
1518 speedtest1_begin_test(110, "%d one-dimensional intersect slice queries", n); in testset_rtree()
1520 iStep = mxCoord/n; in testset_rtree()
1521 for(i=0; i<n; i++){ in testset_rtree()
1530 n = g.szTest*200; in testset_rtree()
1533 iStep = mxCoord/n; in testset_rtree()
1534 for(i=0; i<n; i++){ in testset_rtree()
1546 n = g.szTest*200; in testset_rtree()
1547 speedtest1_begin_test(120, "%d one-dimensional overlap slice queries", n); in testset_rtree()
1549 iStep = mxCoord/n; in testset_rtree()
1550 for(i=0; i<n; i++){ in testset_rtree()
1559 n = g.szTest*200; in testset_rtree()
1562 iStep = mxCoord/n; in testset_rtree()
1563 for(i=0; i<n; i++){ in testset_rtree()
1576 n = g.szTest*200; in testset_rtree()
1577 speedtest1_begin_test(125, "%d custom geometry callback queries", n); in testset_rtree()
1580 iStep = mxCoord/n; in testset_rtree()
1581 for(i=0; i<n; i++){ in testset_rtree()
1592 n = g.szTest*400; in testset_rtree()
1593 speedtest1_begin_test(130, "%d three-dimensional intersect box queries", n); in testset_rtree()
1596 iStep = mxCoord/n; in testset_rtree()
1597 for(i=0; i<n; i++){ in testset_rtree()
1605 n = g.szTest*500; in testset_rtree()
1606 speedtest1_begin_test(140, "%d rowid queries", n); in testset_rtree()
1608 for(i=1; i<=n; i++){ in testset_rtree()
1614 n = g.szTest*50; in testset_rtree()
1615 speedtest1_begin_test(150, "%d UPDATEs using rowid", n); in testset_rtree()
1617 for(i=1; i<=n; i++){ in testset_rtree()
1623 n = g.szTest*5; in testset_rtree()
1624 speedtest1_begin_test(155, "%d UPDATEs using one-dimensional overlap", n); in testset_rtree()
1627 iStep = mxCoord/n; in testset_rtree()
1628 for(i=0; i<n; i++){ in testset_rtree()
1635 n = g.szTest*50; in testset_rtree()
1636 speedtest1_begin_test(160, "%d DELETEs using rowid", n); in testset_rtree()
1638 for(i=1; i<=n; i++){ in testset_rtree()
1645 n = g.szTest*5; in testset_rtree()
1646 speedtest1_begin_test(165, "%d DELETEs using one-dimensional overlap", n); in testset_rtree()
1648 iStep = mxCoord/n; in testset_rtree()
1649 for(i=0; i<n; i++){ in testset_rtree()
1667 unsigned i, j, n; in testset_orm() local
1675 nRow = n = g.szTest*250; in testset_orm()
1676 speedtest1_begin_test(100, "Fill %d rows", n); in testset_orm()
1852 for(i=0; i<n; i++){ in testset_orm()
1878 n = g.szTest*250; in testset_orm()
1879 speedtest1_begin_test(110, "Query %d rows by rowid", n); in testset_orm()
1923 for(i=0; i<n; i++){ in testset_orm()
2136 unsigned i, n; in testset_debug1() local
2140 n = g.szTest; in testset_debug1()
2141 for(i=1; i<=n; i++){ in testset_debug1()
2142 x1 = swizzle(i, n); in testset_debug1()
2143 x2 = swizzle(x1, n); in testset_debug1()
2177 int n = (int)strlen(aTrans[i].zPattern); in displayLinuxIoStats() local
2178 if( strncmp(aTrans[i].zPattern, z, n)==0 ){ in displayLinuxIoStats()
2179 fprintf(out, "-- %-28s %s", aTrans[i].zDesc, &z[n]); in displayLinuxIoStats()