Lines Matching refs:total
192 /* check input structure correctness and calculate total memory size needed for
1109 // int j, total = s->total;
1111 // for( j = 0; j < total; j += b->count, b = b->next )
1287 int j, total = s->total;
1289 for( j = 0; j < total; j += b->count, b = b->next )
1307 for( i = 0; i < seq->total; i++ )
1343 for( i = 0; i < seq->total; i++ )
1401 if( bseq->total > 0 )
1404 for( i = 0; i < bseq->total; i++ )
1447 for( i = 0; i < seq->total; i++ )
1469 for( i = 0; i < seq->total; i++ )
1503 for( i = 0; i < seq2->total; i++ )
1508 for( j = 0; j < seq2->total; j++ )
1532 for( i = 0; i < seq2->total; i++ )
