]> diplodocus.org Git - nmh/blob - uip/ali.c
sbr/utils.c: Add HasSuffix(s, suffix).
[nmh] / uip / ali.c
1
2 /*
3 * ali.c -- list nmh mail aliases
4 *
5 * This code is Copyright (c) 2002, by the authors of nmh. See the
6 * COPYRIGHT file in the root directory of the nmh distribution for
7 * complete copyright information.
8 */
9
10 #include <h/mh.h>
11 #include <h/addrsbr.h>
12 #include <h/aliasbr.h>
13 #include <h/mts.h>
14 #include <h/utils.h>
15
16 #define ALI_SWITCHES \
17 X("alias aliasfile", 0, ALIASW) \
18 X("noalias", 0, NALIASW) \
19 X("list", 0, LISTSW) \
20 X("nolist", 0, NLISTSW) \
21 X("user", 0, USERSW) \
22 X("nouser", 0, NUSERSW) \
23 X("version", 0, VERSIONSW) \
24 X("help", 0, HELPSW) \
25
26 #define X(sw, minchars, id) id,
27 DEFINE_SWITCH_ENUM(ALI);
28 #undef X
29
30 #define X(sw, minchars, id) { sw, minchars, id },
31 DEFINE_SWITCH_ARRAY(ALI, switches);
32 #undef X
33
34 static int pos = 1;
35
36 extern struct aka *akahead;
37
38 /*
39 * prototypes
40 */
41 static void print_aka (char *, int, int);
42 static void print_usr (char *, int);
43
44
45 int
46 main (int argc, char **argv)
47 {
48 int i, vecp = 0, inverted = 0, list = 0;
49 int noalias = 0;
50 char *cp, **ap, **argp, buf[BUFSIZ];
51 /* Really only need to allocate for argc-1, but must allocate at least 1,
52 so go ahead and allocate for argc char pointers. */
53 char **vec = mh_xmalloc (argc * sizeof (char *)), **arguments;
54 struct aka *ak;
55
56 if (nmh_init(argv[0], 1)) { return 1; }
57
58 mts_init ();
59 arguments = getarguments (invo_name, argc, argv, 1);
60 argp = arguments;
61
62 while ((cp = *argp++)) {
63 if (*cp == '-') {
64 switch (smatch (++cp, switches)) {
65 case AMBIGSW:
66 ambigsw (cp, switches);
67 done (1);
68 case UNKWNSW:
69 adios (NULL, "-%s unknown", cp);
70
71 case HELPSW:
72 snprintf (buf, sizeof(buf), "%s [switches] aliases ...",
73 invo_name);
74 print_help (buf, switches, 1);
75 done (0);
76 case VERSIONSW:
77 print_version (invo_name);
78 done (0);
79
80 case ALIASW:
81 if (!(cp = *argp++) || *cp == '-')
82 adios (NULL, "missing argument to %s", argp[-2]);
83 if ((i = alias (cp)) != AK_OK)
84 adios (NULL, "aliasing error in %s - %s", cp, akerror (i));
85 continue;
86 case NALIASW:
87 noalias++;
88 continue;
89
90 case LISTSW:
91 list++;
92 continue;
93 case NLISTSW:
94 list = 0;
95 continue;
96
97 case USERSW:
98 inverted++;
99 continue;
100 case NUSERSW:
101 inverted = 0;
102 continue;
103 }
104 }
105
106 if (vecp < argc) {
107 vec[vecp++] = cp;
108 } else {
109 /* Should never happen, but try to protect against code changes
110 that could allow it. */
111 adios (NULL, "too many arguments");
112 }
113 }
114
115 if (!noalias) {
116 /* allow Aliasfile: profile entry */
117 if ((cp = context_find ("Aliasfile"))) {
118 char *dp = NULL;
119
120 for (ap = brkstring(dp = mh_xstrdup(cp), " ", "\n"); ap && *ap; ap++)
121 if ((i = alias (*ap)) != AK_OK)
122 adios (NULL, "aliasing error in %s - %s", *ap, akerror (i));
123 mh_xfree(dp);
124 }
125 alias (AliasFile);
126 }
127
128 /*
129 * If -user is specified
130 */
131 if (inverted) {
132 if (vecp == 0)
133 adios (NULL, "usage: %s -user addresses ... (you forgot the addresses)",
134 invo_name);
135
136 for (i = 0; i < vecp; i++)
137 print_usr (vec[i], list);
138 } else {
139 if (vecp) {
140 /* print specified aliases */
141 for (i = 0; i < vecp; i++)
142 print_aka (akvalue (vec[i]), list, 0);
143 } else {
144 /* print them all */
145 for (ak = akahead; ak; ak = ak->ak_next) {
146 printf ("%s: ", ak->ak_name);
147 pos += strlen (ak->ak_name) + 1;
148 print_aka (akresult (ak), list, pos);
149 }
150 }
151 }
152
153 free (vec);
154 done (0);
155 return 1;
156 }
157
158 static void
159 print_aka (char *p, int list, int margin)
160 {
161 char c;
162
163 if (p == NULL) {
164 printf ("<empty>\n");
165 return;
166 }
167
168 while ((c = *p++)) {
169 switch (c) {
170 case ',':
171 if (*p) {
172 if (list)
173 printf ("\n%*s", margin, "");
174 else {
175 if (pos >= 68) {
176 printf (",\n ");
177 pos = 2;
178 } else {
179 printf (", ");
180 pos += 2;
181 }
182 }
183 }
184
185 case 0:
186 break;
187
188 default:
189 pos++;
190 putchar (c);
191 }
192 }
193
194 putchar ('\n');
195 pos = 1;
196 }
197
198 static void
199 print_usr (char *s, int list)
200 {
201 char *cp, *pp, *vp;
202 struct aka *ak;
203 struct mailname *mp, *np;
204
205 if ((pp = getname (s)) == NULL)
206 adios (NULL, "no address in \"%s\"", s);
207 if ((mp = getm (pp, NULL, 0, NULL, 0)) == NULL)
208 adios (NULL, "bad address \"%s\"", s);
209 while (getname (""))
210 continue;
211
212 vp = NULL;
213 for (ak = akahead; ak; ak = ak->ak_next) {
214 pp = akresult (ak);
215 while ((cp = getname (pp))) {
216 if ((np = getm (cp, NULL, 0, NULL, 0)) == NULL)
217 continue;
218 if (!strcasecmp (mp->m_host ? mp->m_host : "",
219 np->m_host ? np->m_host : "") &&
220 !strcasecmp (mp->m_mbox ? mp->m_mbox : "",
221 np->m_mbox ? np->m_mbox : "")) {
222 vp = vp ? add (ak->ak_name, add (",", vp))
223 : getcpy (ak->ak_name);
224 mnfree (np);
225 while (getname (""))
226 continue;
227 break;
228 }
229 mnfree (np);
230 }
231 }
232 mnfree (mp);
233
234 print_aka (vp ? vp : s, list, 0);
235
236 mh_xfree(vp);
237 }