group.c File Reference

Handling for email address groups. More...

#include "config.h"
#include <stdbool.h>
#include <stdlib.h>
#include "group.h"
#include "address.h"

Include dependency graph for group.c:

Go to the source code of this file.

Functions
static void	group_free (struct Group **ptr)
	Free an Address Group.
static struct Group *	group_new (const char *name)
	Create a new Address Group.
static void	group_hash_free (int type, void *obj, intptr_t data)
	Free our hash table data - Implements hash_hdata_free_t -.
static void	group_remove (struct HashTable *groups, struct Group *g)
	Remove a Group from the Hash Table.
static bool	group_is_empty (struct Group *g)
	Is a Group empty?
static void	group_add_addrlist (struct Group *g, const struct AddressList *al)
	Add an Address List to a Group.
static int	group_add_regex (struct Group *g, const char *str, uint16_t flags, struct Buffer *err)
	Add a Regex to a Group.
static int	group_remove_regex (struct Group *g, const char *str)
	Remove a Regex from a Group.
bool	group_match (struct Group *g, const char *str)
	Does a string match an entry in a Group?
void	grouplist_add_group (struct GroupList *gl, struct Group *g)
	Add a Group to a GroupList.
void	grouplist_destroy (struct GroupList *gl)
	Free a GroupList.
void	grouplist_add_addrlist (struct GroupList *gl, struct AddressList *al)
	Add Address list to a GroupList.
int	grouplist_add_regex (struct GroupList *gl, const char *str, uint16_t flags, struct Buffer *err)
	Add matching Addresses to a GroupList.
struct HashTable *	groups_new (void)
	Create a HashTable for the Address Groups.
void	groups_free (struct HashTable **pptr)
	Free Address Groups HashTable.
struct Group *	groups_get_group (struct HashTable *groups, const char *name)
	Get a Group by its name.
void	groups_remove_grouplist (struct HashTable *groups, struct GroupList *gl)
	Clear a GroupList.
int	groups_remove_addrlist (struct HashTable *groups, struct GroupList *gl, struct AddressList *al)
	Remove an AddressList from a GroupList.
int	groups_remove_regex (struct HashTable *groups, struct GroupList *gl, const char *str)
	Remove matching addresses from a GroupList.

Detailed Description

Handling for email address groups.

Authors

• Richard Russon
• Bo Yu
• Pietro Cerutti
• Federico Kircheis

Copyright

This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 2 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

Definition in file group.c.

Function Documentation

group_free()

void group_free ( struct Group ** ptr )

static

Free an Address Group.

Parameters

ptr	Group to free

Definition at line 42 of file group.c.

{
  if (!ptr || !*ptr)
    return;
 
  struct Group *g = *ptr;
 
  mutt_addrlist_clear(&g->al);
  mutt_regexlist_free(&g->rs);
  FREE(&g->name);
 
  FREE(ptr);
}

Here is the call graph for this function:

Here is the caller graph for this function:

group_new()

struct Group * group_new ( const char * name )

static

Create a new Address Group.

Parameters

name	Group name

Return values

ptr	New Address Group

Note

The pattern will be copied

Definition at line 63 of file group.c.

{
  struct Group *g = MUTT_MEM_CALLOC(1, struct Group);
 
  g->name = mutt_str_dup(name);
  STAILQ_INIT(&g->rs);
  TAILQ_INIT(&g->al);
 
  return g;
}

Here is the call graph for this function:

Here is the caller graph for this function:

group_remove()

void group_remove ( struct HashTable * groups, struct Group * g )

static

Remove a Group from the Hash Table.

Parameters

groups	Groups HashTable
g	Group to remove

Definition at line 88 of file group.c.

{
  if (!groups || !g)
    return;
  mutt_hash_delete(groups, g->name, g);
}

Here is the call graph for this function:

Here is the caller graph for this function:

group_is_empty()

bool group_is_empty ( struct Group * g )

static

Is a Group empty?

Parameters

g	Group to test

Return values

true	The Group is empty

Definition at line 100 of file group.c.

{
  if (!g)
    return true;
  return TAILQ_EMPTY(&g->al) && STAILQ_EMPTY(&g->rs);
}

Here is the caller graph for this function:

group_add_addrlist()

void group_add_addrlist ( struct Group * g, const struct AddressList * al )

static

Add an Address List to a Group.

Parameters

g	Group to add to
al	Address List

Definition at line 112 of file group.c.

{
  if (!g || !al)
    return;
 
  struct AddressList al_new = TAILQ_HEAD_INITIALIZER(al_new);
  mutt_addrlist_copy(&al_new, al, false);
  mutt_addrlist_remove_xrefs(&g->al, &al_new);
  struct Address *a = NULL;
  struct Address *tmp = NULL;
  TAILQ_FOREACH_SAFE(a, &al_new, entries, tmp)
  {
    TAILQ_REMOVE(&al_new, a, entries);
    mutt_addrlist_append(&g->al, a);
  }
  ASSERT(TAILQ_EMPTY(&al_new));
}

Here is the call graph for this function:

Here is the caller graph for this function:

group_add_regex()

int group_add_regex ( struct Group * g, const char * str, uint16_t flags, struct Buffer * err )

static

Add a Regex to a Group.

Parameters

g	Group to add to
str	Regex string to add
flags	Flags, e.g. REG_ICASE
err	Buffer for error message

Return values

0	Success
-1	Error

Definition at line 139 of file group.c.

{
  return mutt_regexlist_add(&g->rs, str, flags, err);
}

Here is the call graph for this function:

Here is the caller graph for this function:

group_remove_regex()

int group_remove_regex ( struct Group * g, const char * str )

static

Remove a Regex from a Group.

Parameters

g	Group to modify
str	Regex string to match

Return values

0	Success
-1	Error

Definition at line 151 of file group.c.

{
  return mutt_regexlist_remove(&g->rs, str);
}

Here is the call graph for this function:

Here is the caller graph for this function:

group_match()

bool group_match	(	struct Group *	g,
		const char *	str )

Does a string match an entry in a Group?

Parameters

g	Group to match against
str	String to match

Return values

true	There's a match

Definition at line 162 of file group.c.

{
  if (!g || !str)
    return false;
 
  if (mutt_regexlist_match(&g->rs, str))
    return true;
  struct Address *a = NULL;
  TAILQ_FOREACH(a, &g->al, entries)
  {
    if (a->mailbox && mutt_istr_equal(str, buf_string(a->mailbox)))
      return true;
  }
 
  return false;
}

Here is the call graph for this function:

Here is the caller graph for this function:

grouplist_add_group()

void grouplist_add_group	(	struct GroupList *	gl,
		struct Group *	g )

Add a Group to a GroupList.

Parameters

gl	GroupList to add to
g	Group to add

Definition at line 184 of file group.c.

{
  if (!gl || !g)
    return;
 
  struct GroupNode *np = NULL;
  STAILQ_FOREACH(np, gl, entries)
  {
    if (np->group == g)
      return;
  }
  np = MUTT_MEM_CALLOC(1, struct GroupNode);
  np->group = g;
  STAILQ_INSERT_TAIL(gl, np, entries);
}

Here is the caller graph for this function:

grouplist_destroy()

void grouplist_destroy

(

struct GroupList *

gl

)

Free a GroupList.

Parameters

gl	GroupList to free

Definition at line 204 of file group.c.

{
  if (!gl)
    return;
 
  struct GroupNode *np = STAILQ_FIRST(gl);
  struct GroupNode *next = NULL;
  while (np)
  {
    next = STAILQ_NEXT(np, entries);
    FREE(&np);
    np = next;
  }
  STAILQ_INIT(gl);
}

Here is the caller graph for this function:

grouplist_add_addrlist()

void grouplist_add_addrlist	(	struct GroupList *	gl,
		struct AddressList *	al )

Add Address list to a GroupList.

Parameters

gl	GroupList to add to
al	Address list to add

Definition at line 225 of file group.c.

{
  if (!gl || !al)
    return;
 
  struct GroupNode *np = NULL;
  STAILQ_FOREACH(np, gl, entries)
  {
    group_add_addrlist(np->group, al);
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

grouplist_add_regex()

int grouplist_add_regex	(	struct GroupList *	gl,
		const char *	str,
		uint16_t	flags,
		struct Buffer *	err )

Add matching Addresses to a GroupList.

Parameters

gl	GroupList to add to
str	Address regex string to match
flags	Flags, e.g. REG_ICASE
err	Buffer for error message

Return values

0	Success
-1	Error

Definition at line 246 of file group.c.

{
  if (!gl || !str)
    return -1;
 
  int rc = 0;
 
  struct GroupNode *np = NULL;
  STAILQ_FOREACH(np, gl, entries)
  {
    rc = group_add_regex(np->group, str, flags, err);
    if (rc)
      return rc;
  }
  return rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

groups_new()

struct HashTable * groups_new

(

void

)

Create a HashTable for the Address Groups.

Return values

ptr	New Groups HashTable

Definition at line 268 of file group.c.

{
  struct HashTable *groups = mutt_hash_new(1031, MUTT_HASH_NONE);
 
  mutt_hash_set_destructor(groups, group_hash_free, 0);
 
  return groups;
}

Here is the call graph for this function:

Here is the caller graph for this function:

groups_free()

void groups_free

(

struct HashTable **

pptr

)

Free Address Groups HashTable.

Parameters

pptr	Groups HashTable to free

Definition at line 281 of file group.c.

{
  mutt_hash_free(pptr);
}

Here is the call graph for this function:

Here is the caller graph for this function:

groups_get_group()

struct Group * groups_get_group	(	struct HashTable *	groups,
		const char *	name )

Get a Group by its name.

Parameters

groups	Groups HashTable
name	Name to find

Return values

ptr	Matching Group, or new Group (if no match)

Definition at line 292 of file group.c.

{
  if (!groups || !name)
    return NULL;
 
  struct Group *g = mutt_hash_find(groups, name);
  if (!g)
  {
    mutt_debug(LL_DEBUG2, "Creating group %s\n", name);
    g = group_new(name);
    mutt_hash_insert(groups, g->name, g);
  }
 
  return g;
}

Here is the call graph for this function:

Here is the caller graph for this function:

groups_remove_grouplist()

void groups_remove_grouplist	(	struct HashTable *	groups,
		struct GroupList *	gl )

Clear a GroupList.

Parameters

groups	Groups HashTable
gl	GroupList to clear

Definition at line 313 of file group.c.

{
  if (!groups || !gl)
    return;
 
  struct GroupNode *np = STAILQ_FIRST(gl);
  struct GroupNode *next = NULL;
  while (np)
  {
    group_remove(groups, np->group);
    next = STAILQ_NEXT(np, entries);
    FREE(&np);
    np = next;
  }
  STAILQ_INIT(gl);
}

Here is the call graph for this function:

Here is the caller graph for this function:

groups_remove_addrlist()

int groups_remove_addrlist	(	struct HashTable *	groups,
		struct GroupList *	gl,
		struct AddressList *	al )

Remove an AddressList from a GroupList.

Parameters

groups	Groups HashTable
gl	GroupList to remove from
al	AddressList to remove

Return values

0	Success
-1	Error

Definition at line 338 of file group.c.

{
  if (!groups || !gl || !al)
    return -1;
 
  struct GroupNode *gnp = NULL;
  STAILQ_FOREACH(gnp, gl, entries)
  {
    struct Address *a = NULL;
    TAILQ_FOREACH(a, al, entries)
    {
      mutt_addrlist_remove(&gnp->group->al, buf_string(a->mailbox));
    }
    if (group_is_empty(gnp->group))
    {
      group_remove(groups, gnp->group);
    }
  }
 
  return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

groups_remove_regex()

int groups_remove_regex	(	struct HashTable *	groups,
		struct GroupList *	gl,
		const char *	str )

Remove matching addresses from a GroupList.

Parameters

groups	Groups HashTable
gl	GroupList to remove from
str	Regex string to match

Return values

0	Success
-1	Error

Definition at line 369 of file group.c.

{
  if (!groups || !gl || !str)
    return -1;
 
  int rc = 0;
  struct GroupNode *np = NULL;
  STAILQ_FOREACH(np, gl, entries)
  {
    rc = group_remove_regex(np->group, str);
    if (group_is_empty(np->group))
      group_remove(groups, np->group);
    if (rc != 0)
      return rc;
  }
  return rc;
}

Here is the call graph for this function:

Here is the caller graph for this function: