1 /******************************************************************************/
2 /* postlicyd: a postfix policy daemon with a lot of features */
4 /* ________________________________________________________________________ */
6 /* Redistribution and use in source and binary forms, with or without */
7 /* modification, are permitted provided that the following conditions */
10 /* 1. Redistributions of source code must retain the above copyright */
11 /* notice, this list of conditions and the following disclaimer. */
12 /* 2. Redistributions in binary form must reproduce the above copyright */
13 /* notice, this list of conditions and the following disclaimer in the */
14 /* documentation and/or other materials provided with the distribution. */
15 /* 3. The names of its contributors may not be used to endorse or promote */
16 /* products derived from this software without specific prior written */
19 /* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND */
20 /* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE */
21 /* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR */
22 /* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS */
23 /* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR */
24 /* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF */
25 /* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS */
26 /* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN */
27 /* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) */
28 /* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF */
29 /* THE POSSIBILITY OF SUCH DAMAGE. */
30 /******************************************************************************/
33 * Copyright © 2005-2007 Pierre Habouzit
44 #define MAX_SIZE 0x10000
46 static char **read_sfile(char *sfile)
58 if (stat(sfile, &stat_buf)) {
63 if (stat_buf.st_size > MAX_SIZE) {
64 fprintf(stderr, "the secret file is too big\n");
68 buf = (char *)malloc(stat_buf.st_size+1);
69 buf[stat_buf.st_size] = 0;
71 if ((fd = open(sfile, O_RDONLY)) < 0) {
77 if ((nb = read(fd, &(buf[pos]), stat_buf.st_size)) < 0) {
84 if (nb == 0 || pos == stat_buf.st_size) {
91 for ( nb = pos = 0; pos < stat_buf.st_size ; pos++)
93 if ( buf[pos] == '\n' ) {
99 res = p_new(char*, nb + 2);
102 while (pos < stat_buf.st_size)
104 len = strlen(&(buf[pos]));
106 res[nb++] = &(buf[pos]);
115 static char *encode(char * secret, char * sender, char * alias)
119 srs_t *srs = srs_new();
121 srs_add_secret(srs, secret);
122 err = srs_forward_alloc(srs, &res, sender, alias);
125 fprintf(stderr, "%s\n", srs_strerror(err));
132 static char * decode(char * secret, char * secrets[], char * sender)
136 srs_t * srs = srs_new();
139 srs_add_secret(srs, secret);
142 for (; secrets && secrets[err] != 0; err++) {
143 srs_add_secret(srs, secrets[err]);
146 err = srs_reverse_alloc(srs, &res, sender);
149 fprintf(stderr, "%s\n", srs_strerror(err));
156 static void help(void)
159 "Usage: srs-c [ -r | -d domain ] [ -s secret | -f sfile ] -e sender\n"
160 "Perform an SRS encoding / decoding\n"
162 " -r perform an SRS decoding\n"
163 " -d domain use that domain (required for encoding)\n"
165 " -s secret secret used in the encoding (sfile required if omitted)\n"
166 " -f sfile secret file for decoding. the first line is taken if -s omitted\n"
168 " -e sender the sender address we want to encode/decode\n"
173 int main(int argc, char * argv[])
185 while ((opt = getopt(argc, argv, "d:e:s:f:r")) != -1)
188 case 'd': domain = optarg; break;
189 case 'e': sender = optarg; break;
190 case 'f': sfile = optarg; break;
191 case 'r': rev = true; break;
192 case 's': secret = optarg; break;
196 if ( !sender || !(secret||sfile) || !(rev||domain) ) {
201 secr = read_sfile(sfile);
202 if (!secret && (!secr || !secr[0])) {
203 fprintf(stderr, "No secret given, and secret file is empty\n");
209 buf = decode(secret, secr, sender);
211 buf = encode((secret ? secret : secr[0]), sender, domain);