| line |
true |
false |
branch |
|
37
|
0 |
0 |
if( argc==0 ) return; |
|
40
|
0 |
0 |
if( zBest==0 ) return; |
|
41
|
0 |
0 |
if( argv[1][0]=='n' ){ |
|
46
|
0 |
0 |
for(i=2; i
|
|
47
|
0 |
0 |
if( argv[i]==0 ) return; |
|
48
|
0 |
0 |
if( (xCompare(argv[i], zBest)^mask)<0 ){ |
|
72
|
0 |
0 |
if( z==0 ) return; |
|
74
|
0 |
0 |
for(len=0; *z; z++){ if( (0xc0&*z)!=0x80 ) len++; } |
|
|
0 |
0 |
for(len=0; *z; z++){ if( (0xc0&*z)!=0x80 ) len++; } |
|
88
|
0 |
0 |
if( z==0 ) return; |
|
89
|
0 |
0 |
if( z[0]=='-' && isdigit(z[1]) ) z++; |
|
|
0 |
0 |
if( z[0]=='-' && isdigit(z[1]) ) z++; |
|
105
|
0 |
0 |
if( z==0 ) return; |
|
109
|
0 |
0 |
for(len=0, z2=z; *z2; z2++){ if( (0xc0&*z2)!=0x80 ) len++; } |
|
|
0 |
0 |
for(len=0, z2=z; *z2; z2++){ if( (0xc0&*z2)!=0x80 ) len++; } |
|
113
|
0 |
0 |
if( p1<0 ){ |
|
115
|
0 |
0 |
if( p1<0 ){ |
|
119
|
0 |
0 |
}else if( p1>0 ){ |
|
122
|
0 |
0 |
if( p1+p2>len ){ |
|
126
|
0 |
0 |
for(i=0; i
|
|
|
0 |
0 |
for(i=0; i
|
|
127
|
0 |
0 |
if( (z[i]&0xc0)==0x80 ) p1++; |
|
129
|
0 |
0 |
while( z[i] && (z[i]&0xc0)==0x80 ){ i++; p1++; } |
|
|
0 |
0 |
while( z[i] && (z[i]&0xc0)==0x80 ){ i++; p1++; } |
|
130
|
0 |
0 |
for(; i
|
|
|
0 |
0 |
for(; i
|
|
131
|
0 |
0 |
if( (z[i]&0xc0)==0x80 ) p2++; |
|
133
|
0 |
0 |
while( z[i] && (z[i]&0xc0)==0x80 ){ i++; p2++; } |
|
|
0 |
0 |
while( z[i] && (z[i]&0xc0)==0x80 ){ i++; p2++; } |
|
135
|
0 |
0 |
if( p2<0 ) p2 = 0; |
|
147
|
0 |
0 |
if( argv[0]==0 || (argc==2 && argv[1]==0) ) return; |
|
|
0 |
0 |
if( argv[0]==0 || (argc==2 && argv[1]==0) ) return; |
|
|
0 |
0 |
if( argv[0]==0 || (argc==2 && argv[1]==0) ) return; |
|
148
|
0 |
0 |
n = argc==2 ? atoi(argv[1]) : 0; |
|
149
|
0 |
0 |
if( n>30 ) n = 30; |
|
150
|
0 |
0 |
if( n<0 ) n = 0; |
|
162
|
20 |
0 |
if( argc<1 || argv[0]==0 ) return; |
|
|
0 |
20 |
if( argc<1 || argv[0]==0 ) return; |
|
164
|
0 |
20 |
if( z==0 ) return; |
|
165
|
100 |
20 |
for(i=0; z[i]; i++){ |
|
166
|
100 |
0 |
if( islower(z[i]) ) z[i] = toupper(z[i]); |
|
172
|
0 |
0 |
if( argc<1 || argv[0]==0 ) return; |
|
|
0 |
0 |
if( argc<1 || argv[0]==0 ) return; |
|
174
|
0 |
0 |
if( z==0 ) return; |
|
175
|
0 |
0 |
for(i=0; z[i]; i++){ |
|
176
|
0 |
0 |
if( isupper(z[i]) ) z[i] = tolower(z[i]); |
|
187
|
0 |
0 |
for(i=0; i
|
|
188
|
0 |
0 |
if( argv[i] ){ |
|
242
|
26 |
0 |
if( argv[0]==0 || argv[1]==0 ) return; |
|
|
0 |
26 |
if( argv[0]==0 || argv[1]==0 ) return; |
|
258
|
0 |
0 |
if( argv[0]==0 || argv[1]==0 ) return; |
|
|
0 |
0 |
if( argv[0]==0 || argv[1]==0 ) return; |
|
270
|
0 |
0 |
if( argv[0]!=0 && sqliteCompare(argv[0],argv[1])!=0 ){ |
|
|
0 |
0 |
if( argv[0]!=0 && sqliteCompare(argv[0],argv[1])!=0 ){ |
|
295
|
0 |
0 |
if( argc<1 ) return; |
|
296
|
0 |
0 |
if( argv[0]==0 ){ |
|
298
|
0 |
0 |
}else if( sqliteIsNumber(argv[0]) ){ |
|
303
|
0 |
0 |
for(i=n=0; argv[0][i]; i++){ if( argv[0][i]=='\'' ) n++; } |
|
|
0 |
0 |
for(i=n=0; argv[0][i]; i++){ if( argv[0][i]=='\'' ) n++; } |
|
305
|
0 |
0 |
if( z==0 ) return; |
|
307
|
0 |
0 |
for(i=0, j=1; argv[0][i]; i++){ |
|
309
|
0 |
0 |
if( argv[0][i]=='\'' ){ |
|
418
|
0 |
0 |
if( argc<1 ) return; |
|
420
|
0 |
0 |
if( p && argv[0] ){ |
|
|
0 |
0 |
if( p && argv[0] ){ |
|
428
|
0 |
0 |
sqlite_set_result_double(context, p ? p->sum : 0.0); |
|
433
|
0 |
0 |
if( p && p->cnt>0 ){ |
|
|
0 |
0 |
if( p && p->cnt>0 ){ |
|
491
|
0 |
0 |
if( (argc==0 || argv[0]) && p ){ |
|
|
0 |
0 |
if( (argc==0 || argv[0]) && p ){ |
|
|
0 |
0 |
if( (argc==0 || argv[0]) && p ){ |
|
498
|
0 |
0 |
sqlite_set_result_int(context, p ? p->n : 0); |
|
520
|
0 |
0 |
if( argv[0]==0 ) return; /* Ignore NULL values */ |
|
521
|
0 |
0 |
if( argv[1][0]=='n' ){ |
|
529
|
0 |
0 |
if( p==0 || argc<1 ) return; |
|
|
0 |
0 |
if( p==0 || argc<1 ) return; |
|
530
|
0 |
0 |
if( p->z==0 || (xCompare(argv[0],p->z)^mask)<0 ){ |
|
|
0 |
0 |
if( p->z==0 || (xCompare(argv[0],p->z)^mask)<0 ){ |
|
532
|
0 |
0 |
if( p->zBuf[0] ){ |
|
536
|
0 |
0 |
if( len < sizeof(p->zBuf)-1 ){ |
|
542
|
0 |
0 |
if( p->z==0 ) return; |
|
550
|
0 |
0 |
if( p && p->z && p->zBuf[0]<2 ){ |
|
|
0 |
0 |
if( p && p->z && p->zBuf[0]<2 ){ |
|
|
0 |
0 |
if( p && p->z && p->zBuf[0]<2 ){ |
|
553
|
0 |
0 |
if( p && p->zBuf[0] ){ |
|
|
0 |
0 |
if( p && p->zBuf[0] ){ |
|
625
|
625 |
25 |
for(i=0; i
|
|
634
|
525 |
100 |
if( aFuncs[i].xFunc ){ |
|
638
|
150 |
25 |
for(i=0; i
|
|
649
|
75 |
25 |
for(i=0; i
|
|
652
|
175 |
75 |
while( p ){ |