blob: db3c4d43ddb1f81be771393c6a04807d9e03ac2a (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
#ifndef _REMAILER_H
#define _REMAILER_H
/*
* Copyright (C) 1999-2000 Thomas Roessler <roessler@does-not-exist.org>
*
* 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, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
/*
* Mixmaster support for Mutt
*/
#ifdef MIXMASTER
#define MIX_CAP_COMPRESS (1 << 0)
#define MIX_CAP_MIDDLEMAN (1 << 1)
#define MIX_CAP_NEWSPOST (1 << 2)
#define MIX_CAP_NEWSMAIL (1 << 3)
/* Mixmaster's maximum chain length. Don't change this. */
#define MAXMIXES 19
struct type2
{
int num;
char *shortname;
char *addr;
char *ver;
int caps;
};
typedef struct type2 REMAILER;
struct mixchain
{
size_t cl;
int ch[MAXMIXES];
};
typedef struct mixchain MIXCHAIN;
int mix_send_message (LIST *, const char *);
int mix_check_message (HEADER *msg);
void mix_make_chain (LIST **);
#endif /* MIXMASTER */
#endif /* _REMAILER_H */
|
