email.c File Reference

Representation of an email. More...

#include "config.h"
#include <stdbool.h>
#include "mutt/lib.h"
#include "email.h"
#include "body.h"
#include "envelope.h"
#include "tags.h"

Include dependency graph for email.c:

Go to the source code of this file.

Functions
void	nm_edata_free (void **ptr)
	Free data attached to an Email. More...
void	email_free (struct Email **ptr)
	Free an Email. More...
struct Email *	email_new (void)
	Create a new Email. More...
bool	email_cmp_strict (const struct Email *e1, const struct Email *e2)
	Strictly compare message emails. More...
size_t	email_size (const struct Email *e)
	compute the size of an email More...
void	emaillist_clear (struct EmailList *el)
	Drop a private list of Emails. More...
int	emaillist_add_email (struct EmailList *el, struct Email *e)
	Add an Email to a list. More...
struct ListNode *	header_find (const struct ListHead *hdrlist, const char *header)
	Find a header, matching on its field, in a list of headers. More...
struct ListNode *	header_add (struct ListHead *hdrlist, const char *header)
	Add a header to a list. More...
struct ListNode *	header_update (struct ListNode *hdr, const char *header)
	Update an existing header. More...
struct ListNode *	header_set (struct ListHead *hdrlist, const char *header)
	Set a header value in a list. More...
void	header_free (struct ListHead *hdrlist, struct ListNode *target)
	Free and remove a header from a header list. More...

Detailed Description

Representation of an email.

Authors

• Michael R. Elkins

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 email.c.

Function Documentation

nm_edata_free()

void nm_edata_free

(

void **

ptr

)

Free data attached to an Email.

Parameters

[out]

ptr

Email data

Each email has an attached NmEmailData, which contains things like the tags (labels).

Definition at line 251 of file notmuch.c.

{
  if (!ptr || !*ptr)
    return;

  struct NmEmailData *edata = *ptr;

  mutt_debug(LL_DEBUG2, "nm: freeing email %p\n", (void *) edata);
  FREE(&edata->folder);
  FREE(&edata->oldpath);
  FREE(&edata->virtual_id);

  FREE(ptr);
}

Here is the caller graph for this function:

email_free()

void email_free

(

struct Email **

ptr

)

Free an Email.

Parameters

[out]

ptr

Email to free

Definition at line 43 of file email.c.

{
  if (!ptr || !*ptr)
    return;

  struct Email *e = *ptr;

  if (e->edata && e->edata_free)
    e->edata_free(&e->edata);

  mutt_env_free(&e->env);
  mutt_body_free(&e->body);
  FREE(&e->tree);
  FREE(&e->path);
#ifdef MIXMASTER
  mutt_list_free(&e->chain);
#endif
#ifdef USE_NOTMUCH
  nm_edata_free(&e->nm_edata);
#endif
  driver_tags_free(&e->tags);

  FREE(ptr);
}

Here is the call graph for this function:

Here is the caller graph for this function:

email_new()

struct Email* email_new

(

void

)

Create a new Email.

Return values

ptr	Newly created Email

Definition at line 72 of file email.c.

{
  static size_t sequence = 0;

  struct Email *e = mutt_mem_calloc(1, sizeof(struct Email));
#ifdef MIXMASTER
  STAILQ_INIT(&e->chain);
#endif
  STAILQ_INIT(&e->tags);
  e->visible = true;
  e->sequence = sequence++;
  return e;
}

Here is the call graph for this function:

Here is the caller graph for this function:

email_cmp_strict()

bool email_cmp_strict	(	const struct Email *	e1,
		const struct Email *	e2
	)

Strictly compare message emails.

Parameters

e1	First Email
e2	Second Email

Return values

true	Emails are strictly identical

Definition at line 92 of file email.c.

{
  if (e1 && e2)
  {
    if ((e1->received != e2->received) || (e1->date_sent != e2->date_sent) ||
        (e1->body->length != e2->body->length) || (e1->lines != e2->lines) ||
        (e1->zhours != e2->zhours) || (e1->zminutes != e2->zminutes) ||
        (e1->zoccident != e2->zoccident) || (e1->mime != e2->mime) ||
        !mutt_env_cmp_strict(e1->env, e2->env) || !mutt_body_cmp_strict(e1->body, e2->body))
    {
      return false;
    }
    return true;
  }
  else
  {
    return (!e1 && !e2);
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

email_size()

size_t email_size

(

const struct Email *

e

)

compute the size of an email

Parameters

e

Email

Return values

num	Size of the email, in bytes

Definition at line 117 of file email.c.

{
  if (!e || !e->body)
    return 0;
  return e->body->length + e->body->offset - e->body->hdr_offset;
}

Here is the caller graph for this function:

emaillist_clear()

void emaillist_clear

(

struct EmailList *

el

)

Drop a private list of Emails.

Parameters

el	EmailList to empty

The Emails are not freed.

Definition at line 130 of file email.c.

{
  if (!el)
    return;

  struct EmailNode *en = NULL, *tmp = NULL;
  STAILQ_FOREACH_SAFE(en, el, entries, tmp)
  {
    STAILQ_REMOVE(el, en, EmailNode, entries);
    FREE(&en);
  }
  STAILQ_INIT(el);
}

Here is the caller graph for this function:

emaillist_add_email()

int emaillist_add_email	(	struct EmailList *	el,
		struct Email *	e
	)

Add an Email to a list.

Parameters

e	Email to add
el	EmailList to add to

Return values

0	Success
-1	Error

Definition at line 151 of file email.c.

{
  if (!el || !e)
    return -1;

  struct EmailNode *en = mutt_mem_calloc(1, sizeof(*en));
  en->email = e;
  STAILQ_INSERT_TAIL(el, en, entries);

  return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

header_find()

struct ListNode* header_find	(	const struct ListHead *	hdrlist,
		const char *	header
	)

Find a header, matching on its field, in a list of headers.

Parameters

hdrlist	List of headers to search
header	The header to search for

Return values

node	The node in the list matching the header
NULL	If no matching header is found

The header should either of the form "X-Header:" or "X-Header: value"

Definition at line 172 of file email.c.

{
  const char *key_end = strchr(header, ':');
  if (!key_end)
    return NULL;

  const int keylen = key_end - header + 1;

  struct ListNode *n = NULL;
  STAILQ_FOREACH(n, hdrlist, entries)
  {
    if (mutt_istrn_equal(n->data, header, keylen))
      return n;
  }
  return n;
}

Here is the call graph for this function:

Here is the caller graph for this function:

header_add()

struct ListNode* header_add	(	struct ListHead *	hdrlist,
		const char *	header
	)

Add a header to a list.

Parameters

hdrlist	List of headers to search
header	String to set as the header

Return values

node	The created header

Definition at line 195 of file email.c.

{
  struct ListNode *n = mutt_list_insert_tail(hdrlist, NULL);
  n->data = mutt_str_dup(header);

  return n;
}

Here is the call graph for this function:

Here is the caller graph for this function:

header_update()

struct ListNode* header_update	(	struct ListNode *	hdr,
		const char *	header
	)

Update an existing header.

Parameters

hdr	The header to update
header	String to update the header with

Return values

node	The updated header

Definition at line 209 of file email.c.

{
  FREE(&hdr->data);
  hdr->data = mutt_str_dup(header);

  return hdr;
}

Here is the call graph for this function:

Here is the caller graph for this function:

header_set()

struct ListNode* header_set	(	struct ListHead *	hdrlist,
		const char *	header
	)

Set a header value in a list.

Parameters

hdrlist	List of headers to search
header	String to set the value of the header to

Return values

node	The updated or created header

If a header exists with the same field, update it, otherwise add a new header.

Definition at line 225 of file email.c.

{
  struct ListNode *n = header_find(hdrlist, header);

  return n ? header_update(n, header) : header_add(hdrlist, header);
}

Here is the call graph for this function:

Here is the caller graph for this function:

header_free()

void header_free	(	struct ListHead *	hdrlist,
		struct ListNode *	target
	)

Free and remove a header from a header list.

Parameters

hdrlist	List to free the header from
target	The header to free

Definition at line 237 of file email.c.

{
  STAILQ_REMOVE(hdrlist, target, ListNode, entries);
  FREE(&target->data);
  FREE(&target);
}

Here is the caller graph for this function: