| line |
true |
false |
branch |
|
17
|
0 |
90 |
if (bytes * 8 / ysize < xsize-1) { /* this is kind of rough */ |
|
40
|
87327 |
0 |
if (x<0 || x>btm->xsize-1 || y<0 || y>btm->ysize-1) return 0; |
|
|
86064 |
1263 |
if (x<0 || x>btm->xsize-1 || y<0 || y>btm->ysize-1) return 0; |
|
|
86064 |
0 |
if (x<0 || x>btm->xsize-1 || y<0 || y>btm->ysize-1) return 0; |
|
|
0 |
86064 |
if (x<0 || x>btm->xsize-1 || y<0 || y>btm->ysize-1) return 0; |
|
48
|
20291 |
0 |
if (x<0 || x>btm->xsize-1 || y<0 || y>btm->ysize-1) abort(); |
|
|
20291 |
0 |
if (x<0 || x>btm->xsize-1 || y<0 || y>btm->ysize-1) abort(); |
|
|
20291 |
0 |
if (x<0 || x>btm->xsize-1 || y<0 || y>btm->ysize-1) abort(); |
|
|
0 |
20291 |
if (x<0 || x>btm->xsize-1 || y<0 || y>btm->ysize-1) abort(); |
|
120
|
674 |
2346 |
if (l->t == NULL) { |
|
125
|
0 |
2346 |
if (l->t->fill >= l->multip) { |
|
133
|
0 |
3020 |
if (llist_llink_push(l,l->t,data)) { |
|
153
|
0 |
3020 |
if (l->t == NULL) return 0; |
|
158
|
674 |
2346 |
if (!l->t->fill) { /* This link empty */ |
|
159
|
674 |
0 |
if (l->t->p == NULL) { /* and it's the only link */ |
|
177
|
0 |
0 |
while(lnk != NULL) { |
|
178
|
0 |
0 |
for(j=0;jfill;j++) { |
|
199
|
0 |
90 |
while( lnk != NULL ) { |
|
224
|
0 |
674 |
if (l->p != NULL) { l->p->n=NULL; } |
|
237
|
0 |
3020 |
if (lnk->fill == lst->multip) return 1; |
|
257
|
12304 |
1538 |
for(i=0;i<8;i++) t->t[i]=NULL; |
|
275
|
451888 |
56486 |
for(i=7;i>-1;i--) { |
|
277
|
207336 |
244552 |
ci=((!!(r&cm))<<2)+((!!(g&cm))<<1)+!!(b&cm); |
|
|
147999 |
303889 |
ci=((!!(r&cm))<<2)+((!!(g&cm))<<1)+!!(b&cm); |
|
279
|
1524 |
450364 |
if (c->t[ci] == NULL) { |
|
293
|
1524 |
10780 |
for(i=0;i<8;i++) if (ct->t[i] != NULL) octt_delete(ct->t[i]); /* do not free instance here because it will free itself */ |
|
|
12304 |
1538 |
for(i=0;i<8;i++) if (ct->t[i] != NULL) octt_delete(ct->t[i]); /* do not free instance here because it will free itself */ |
|
302
|
0 |
0 |
for(i=0;i<8;i++) |
|
303
|
0 |
0 |
if (ct->t[i] != NULL) |
|
305
|
0 |
0 |
for(i=0;i<8;i++) |
|
306
|
0 |
0 |
if (ct->t[i] != NULL) |
|
318
|
0 |
0 |
if (!(*overflow)) return; |
|
319
|
0 |
0 |
for(i=0;i<8;i++) if (ct->t[i]!=NULL) { |
|
|
0 |
0 |
for(i=0;i<8;i++) if (ct->t[i]!=NULL) { |
|
323
|
0 |
0 |
if (!c) (*tot)++; |
|
324
|
0 |
0 |
if ( (*tot) > (*overflow) ) *overflow=0; |
|
334
|
568 |
71 |
for(i = 0; i < 8; i++) |
|
335
|
67 |
501 |
if (ct->t[i] != NULL) { |
|
339
|
9 |
62 |
if (!c) { |