remailer.h File Reference

Mixmaster Remailer. More...

#include <stdint.h>
#include "mutt/lib.h"

Include dependency graph for remailer.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	Remailer
	A Mixmaster remailer. More...

Macros
#define	MIX_CAP_NO_FLAGS   0
	No flags are set.
#define	MIX_CAP_COMPRESS   (1 << 0)
	Accepts compressed messages.
#define	MIX_CAP_MIDDLEMAN   (1 << 1)
	Must be a middle-man (not at the end of a chain)
#define	MIX_CAP_NEWSPOST   (1 << 2)
	Supports direct posting to Usenet.
#define	MIX_CAP_NEWSMAIL   (1 << 3)
	Supports posting to Usenet through a mail-to-news gateway.

Typedefs
typedef uint8_t	MixCapFlags
	Flags, e.g. MIX_CAP_NO_FLAGS.

Functions
	ARRAY_HEAD (RemailerArray, struct Remailer *)
void	remailer_free (struct Remailer **ptr)
	Free a Remailer.
struct Remailer *	remailer_new (void)
	Create a new Remailer.
void	remailer_clear_hosts (struct RemailerArray *ra)
	Clear a Remailer List.
struct RemailerArray	remailer_get_hosts (void)
	Parse the type2.list as given by mixmaster -T.

Detailed Description

Mixmaster Remailer.

Authors

• Richard Russon

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 remailer.h.

Macro Definition Documentation

MIX_CAP_NO_FLAGS

#define MIX_CAP_NO_FLAGS   0

No flags are set.

Definition at line 30 of file remailer.h.

MIX_CAP_COMPRESS

#define MIX_CAP_COMPRESS   (1 << 0)

Accepts compressed messages.

Definition at line 31 of file remailer.h.

MIX_CAP_MIDDLEMAN

#define MIX_CAP_MIDDLEMAN   (1 << 1)

Must be a middle-man (not at the end of a chain)

Definition at line 32 of file remailer.h.

MIX_CAP_NEWSPOST

#define MIX_CAP_NEWSPOST   (1 << 2)

Supports direct posting to Usenet.

Definition at line 33 of file remailer.h.

MIX_CAP_NEWSMAIL

#define MIX_CAP_NEWSMAIL   (1 << 3)

Supports posting to Usenet through a mail-to-news gateway.

Definition at line 34 of file remailer.h.

Typedef Documentation

MixCapFlags

typedef uint8_t MixCapFlags

Flags, e.g. MIX_CAP_NO_FLAGS.

Definition at line 29 of file remailer.h.

Function Documentation

ARRAY_HEAD()

ARRAY_HEAD	(	RemailerArray	,
		struct Remailer *
	)

remailer_free()

void remailer_free

(

struct Remailer **

ptr

)

Free a Remailer.

Parameters

ptr	Remailer to free

Definition at line 45 of file remailer.c.

{
  if (!ptr || !*ptr)
    return;
 
  struct Remailer *r = *ptr;
  FREE(&r->shortname);
  FREE(&r->addr);
  FREE(&r->ver);
 
  FREE(ptr);
}

Here is the caller graph for this function:

remailer_new()

struct Remailer * remailer_new

(

void

)

Create a new Remailer.

Return values

ptr	Newly allocated Remailer

Definition at line 62 of file remailer.c.

{
  return mutt_mem_calloc(1, sizeof(struct Remailer));
}

Here is the call graph for this function:

Here is the caller graph for this function:

remailer_clear_hosts()

void remailer_clear_hosts

(

struct RemailerArray *

ra

)

Clear a Remailer List.

Parameters

ra	Array of Remailer hosts to clear

Note

The empty array is not freed

Definition at line 205 of file remailer.c.

{
  struct Remailer **r = NULL;
  ARRAY_FOREACH(r, ra)
  {
    remailer_free(r);
  }
 
  ARRAY_FREE(ra);
}

Here is the call graph for this function:

Here is the caller graph for this function:

remailer_get_hosts()

struct RemailerArray remailer_get_hosts

(

void

)

Parse the type2.list as given by mixmaster -T.

Return values

obj	Array of Remailer Hosts

Definition at line 114 of file remailer.c.

{
  struct RemailerArray ra = ARRAY_HEAD_INITIALIZER;
  FILE *fp = NULL;
  char line[8192] = { 0 };
  char *t = NULL;
  struct Remailer *p = NULL;
 
  const char *const c_mixmaster = cs_subset_string(NeoMutt->sub, "mixmaster");
  if (!c_mixmaster)
    return ra;
 
  int fd_null = open("/dev/null", O_RDWR);
  if (fd_null == -1)
    return ra;
 
  struct Buffer *cmd = buf_pool_get();
  buf_printf(cmd, "%s -T", c_mixmaster);
 
  pid_t mm_pid = filter_create_fd(buf_string(cmd), NULL, &fp, NULL, fd_null, -1,
                                  fd_null, EnvList);
  window_invalidate_all();
  if (mm_pid == -1)
  {
    buf_pool_release(&cmd);
    close(fd_null);
    return ra;
  }
 
  buf_pool_release(&cmd);
 
  /* first, generate the "random" remailer */
 
  p = remailer_new();
  p->shortname = mutt_str_dup(_("<random>"));
  p->num = 0;
  ARRAY_ADD(&ra, p);
 
  while (fgets(line, sizeof(line), fp))
  {
    p = remailer_new();
 
    t = strtok(line, " \t\n");
    if (!t)
      goto problem;
 
    p->shortname = mutt_str_dup(t);
 
    t = strtok(NULL, " \t\n");
    if (!t)
      goto problem;
 
    p->addr = mutt_str_dup(t);
 
    t = strtok(NULL, " \t\n");
    if (!t)
      goto problem;
 
    t = strtok(NULL, " \t\n");
    if (!t)
      goto problem;
 
    p->ver = mutt_str_dup(t);
 
    t = strtok(NULL, " \t\n");
    if (!t)
      goto problem;
 
    p->caps = mix_get_caps(t);
 
    p->num = ARRAY_SIZE(&ra);
    ARRAY_ADD(&ra, p);
    continue;
 
  problem:
    remailer_free(&p);
  }
 
  filter_wait(mm_pid);
 
  close(fd_null);
 
  return ra;
}

Here is the call graph for this function:

Here is the caller graph for this function: