tree = tree->next;
*max_depth = 0;
- FOREVER {
+ for (;;) {
if (depth > *max_depth)
*max_depth = depth;
/* now fix up for the OPTHIDETOP* options if necessary */
if (hide_top_limited || hide_top_missing) {
tree = ctx->tree;
- FOREVER {
+ for (;;) {
if (!tree->visible && tree->deep && tree->subtree_visible < 2
&& ((tree->message && hide_top_limited)
|| (!tree->message && hide_top_missing)))
LIST *curlist, *oldlist, *newlist, *subjects = NULL;
int rc = 0;
- FOREVER {
+ for (;;) {
while (!cur->message)
cur = cur->child;
insert_message (&parent->child, parent, cur);
parent->sort_children = 1;
tmp = cur;
- FOREVER {
+ for (;;) {
while (!tmp->message)
tmp = tmp->child;
while (reverse && cur->next)
cur = cur->next;
- FOREVER {
+ for (;;) {
if (cur->message && cur->message->virtual >= 0)
return (cur->message);
return (min_unread);
}
- FOREVER {
+ for (;;) {
cur = thread->message;
if (cur) {