struct GroupNode *np = STAILQ_FIRST(head), *next = NULL;
while (np)
{
- group_remove(np->g);
+ group_remove(np->group);
next = STAILQ_NEXT(np, entries);
FREE(&np);
np = next;
struct GroupNode *np = NULL;
STAILQ_FOREACH(np, head, entries)
{
- if (np->g == group)
+ if (np->group == group)
return;
}
np = mutt_mem_calloc(1, sizeof(struct GroupNode));
- np->g = group;
+ np->group = group;
STAILQ_INSERT_TAIL(head, np, entries);
}
struct GroupNode *np = NULL;
STAILQ_FOREACH(np, head, entries)
{
- group_add_addrlist(np->g, a);
+ group_add_addrlist(np->group, a);
}
}
STAILQ_FOREACH(np, head, entries)
{
- rc = group_remove_addrlist(np->g, a);
- if (empty_group(np->g))
- group_remove(np->g);
+ rc = group_remove_addrlist(np->group, a);
+ if (empty_group(np->group))
+ group_remove(np->group);
if (rc)
return rc;
}
struct GroupNode *np = NULL;
STAILQ_FOREACH(np, head, entries)
{
- rc = group_add_regex(np->g, s, flags, err);
+ rc = group_add_regex(np->group, s, flags, err);
if (rc)
return rc;
}
struct GroupNode *np = NULL;
STAILQ_FOREACH(np, head, entries)
{
- rc = group_remove_regex(np->g, s);
- if (empty_group(np->g))
- group_remove(np->g);
+ rc = group_remove_regex(np->group, s);
+ if (empty_group(np->group))
+ group_remove(np->group);
if (rc)
return rc;
}