| 191 |
} |
} |
| 192 |
|
|
| 193 |
article_count = 0; |
article_count = 0; |
| 194 |
|
last_aid = 0; |
| 195 |
|
|
| 196 |
p_article = p_section[i]->p_article_head; |
p_article = p_section[i]->p_article_head; |
| 197 |
|
|
| 198 |
do |
do |
| 199 |
{ |
{ |
| 200 |
article_count++; |
article_count++; |
| 201 |
|
|
| 202 |
|
if (p_article->aid <= last_aid) |
| 203 |
|
{ |
| 204 |
|
printf("Non-ascending aid found %d <= %d\n", p_article->aid, last_aid); |
| 205 |
|
} |
| 206 |
|
last_aid = p_article->aid; |
| 207 |
|
|
| 208 |
p_article = p_article->p_next; |
p_article = p_article->p_next; |
| 209 |
} while (p_article != p_section[i]->p_article_head); |
} while (p_article != p_section[i]->p_article_head); |
| 210 |
|
|
| 239 |
} |
} |
| 240 |
|
|
| 241 |
article_count = 1; |
article_count = 1; |
| 242 |
|
last_aid = 0; |
| 243 |
|
|
| 244 |
do |
do |
| 245 |
{ |
{ |
| 246 |
|
if (p_article->aid <= last_aid) |
| 247 |
|
{ |
| 248 |
|
printf("Non-ascending aid found %d <= %d\n", p_article->aid, last_aid); |
| 249 |
|
} |
| 250 |
|
last_aid = p_article->aid; |
| 251 |
|
|
| 252 |
p_article = p_article->p_topic_next; |
p_article = p_article->p_topic_next; |
| 253 |
|
|
| 254 |
if (p_article == NULL) |
if (p_article == NULL) |
| 255 |
{ |
{ |
| 256 |
printf("NULL p_article found\n"); |
printf("NULL p_article found\n"); |
| 265 |
printf("Inconsistent tid %d != %d\n", last_aid, j + 1); |
printf("Inconsistent tid %d != %d\n", last_aid, j + 1); |
| 266 |
break; |
break; |
| 267 |
} |
} |
| 268 |
|
|
| 269 |
article_count++; |
article_count++; |
| 270 |
} while (1); |
} while (1); |
| 271 |
|
|