]> diplodocus.org Git - nmh/blob - sbr/seq_read.c
pending-release-notes: add mhshow's "-prefer", and mh-format's %(kibi/kilo)
[nmh] / sbr / seq_read.c
1
2 /*
3 * seq_read.c -- read the .mh_sequence file and
4 * -- initialize sequence information
5 *
6 * This code is Copyright (c) 2002, by the authors of nmh. See the
7 * COPYRIGHT file in the root directory of the nmh distribution for
8 * complete copyright information.
9 */
10
11 #include <h/mh.h>
12 #include <h/utils.h>
13
14 /*
15 * static prototypes
16 */
17 static int seq_init (struct msgs *, char *, char *);
18 static int seq_public (struct msgs *, int, int *);
19 static void seq_private (struct msgs *);
20
21
22 /*
23 * Get the sequence information for this folder from
24 * .mh_sequences (or equivalent specified in .mh_profile)
25 * or context file (for private sequences).
26 */
27
28 int
29 seq_read (struct msgs *mp, int lockflag)
30 {
31 int failed_to_lock = 0;
32
33 /*
34 * Initialize the list of sequence names. Go ahead and
35 * add the "cur" sequence to the list of sequences.
36 */
37 svector_push_back (mp->msgattrs, getcpy (current));
38 make_all_public (mp); /* initially, make all public */
39
40 /* If folder is empty, don't scan for sequence information */
41 if (mp->nummsg == 0)
42 return OK;
43
44 /* Initialize the public sequences */
45 if (seq_public (mp, lockflag, &failed_to_lock) == NOTOK) {
46 if (failed_to_lock) return NOTOK;
47 }
48
49 /* Initialize the private sequences */
50 seq_private (mp);
51
52 return OK;
53 }
54
55
56 /*
57 * read folder's sequences file for public sequences
58 */
59
60 static int
61 seq_public (struct msgs *mp, int lockflag, int *failed_to_lock)
62 {
63 int state;
64 char *cp, seqfile[PATH_MAX];
65 char name[NAMESZ], field[BUFSIZ];
66 FILE *fp;
67 m_getfld_state_t gstate = 0;
68
69 /*
70 * If mh_seq == NULL or if *mh_seq == '\0' (the user has defined
71 * the "mh-sequences" profile entry, but left it empty),
72 * then just return, and do not initialize any public sequences.
73 */
74 if (mh_seq == NULL || *mh_seq == '\0')
75 return OK;
76
77 /* get filename of sequence file */
78 snprintf (seqfile, sizeof(seqfile), "%s/%s", mp->foldpath, mh_seq);
79
80 if ((fp = lkfopendata (seqfile, lockflag ? "r+" : "r", failed_to_lock))
81 == NULL)
82 return NOTOK;
83
84 /* Use m_getfld to scan sequence file */
85 for (;;) {
86 int fieldsz = sizeof field;
87 switch (state = m_getfld (&gstate, name, field, &fieldsz, fp)) {
88 case FLD:
89 case FLDPLUS:
90 if (state == FLDPLUS) {
91 cp = getcpy (field);
92 while (state == FLDPLUS) {
93 fieldsz = sizeof field;
94 state = m_getfld (&gstate, name, field, &fieldsz, fp);
95 cp = add (field, cp);
96 }
97 seq_init (mp, getcpy (name), trimcpy (cp));
98 free (cp);
99 } else {
100 seq_init (mp, getcpy (name), trimcpy (field));
101 }
102 continue;
103
104 case BODY:
105 lkfclosedata (fp, seqfile);
106 adios (NULL, "no blank lines are permitted in %s", seqfile);
107 /* fall */
108
109 case FILEEOF:
110 break;
111
112 default:
113 lkfclosedata (fp, seqfile);
114 adios (NULL, "%s is poorly formatted", seqfile);
115 }
116 break; /* break from for loop */
117 }
118 m_getfld_state_destroy (&gstate);
119
120 if (lockflag) {
121 mp->seqhandle = fp;
122 mp->seqname = getcpy(seqfile);
123 } else {
124 lkfclosedata (fp, seqfile);
125 }
126
127 return OK;
128 }
129
130
131 /*
132 * Scan profile/context list for private sequences.
133 *
134 * We search the context list for all keys that look like
135 * "atr-seqname-folderpath", and add them as private sequences.
136 */
137
138 static void
139 seq_private (struct msgs *mp)
140 {
141 int i, j, alen, plen;
142 char *cp;
143 struct node *np;
144
145 alen = strlen ("atr-");
146 plen = strlen (mp->foldpath) + 1;
147
148 for (np = m_defs; np; np = np->n_next) {
149 if (ssequal ("atr-", np->n_name)
150 && (j = strlen (np->n_name) - plen) > alen
151 && *(np->n_name + j) == '-'
152 && strcmp (mp->foldpath, np->n_name + j + 1) == 0) {
153 cp = getcpy (np->n_name + alen);
154 *(cp + j - alen) = '\0';
155 if ((i = seq_init (mp, cp, getcpy (np->n_field))) != -1)
156 make_seq_private (mp, i);
157 }
158 }
159 }
160
161
162 /*
163 * Add the name of sequence to the list of folder sequences.
164 * Then parse the list of message ranges for this
165 * sequence, and setup the various bit flags for each
166 * message in the sequence.
167 *
168 * Return internal index for the sequence if successful.
169 * Return -1 on error.
170 */
171
172 static int
173 seq_init (struct msgs *mp, char *name, char *field)
174 {
175 unsigned int i;
176 int j, k, is_current;
177 char *cp, **ap;
178
179 /*
180 * Check if this is "cur" sequence,
181 * so we can do some special things.
182 */
183 is_current = !strcmp (current, name);
184
185 /*
186 * Search for this sequence name to see if we've seen
187 * it already. If we've seen this sequence before,
188 * then clear the bit for this sequence from all the
189 * mesages in this folder.
190 */
191 for (i = 0; i < svector_size (mp->msgattrs); i++) {
192 if (!strcmp (svector_at (mp->msgattrs, i), name)) {
193 for (j = mp->lowmsg; j <= mp->hghmsg; j++)
194 clear_sequence (mp, i, j);
195 break;
196 }
197 }
198
199 /*
200 * If we've already seen this sequence name, just free the
201 * name string. Else add it to the list of sequence names.
202 */
203 if (svector_at (mp->msgattrs, i)) {
204 free (name);
205 } else {
206 svector_push_back (mp->msgattrs, name);
207 }
208
209 /*
210 * Split up the different message ranges at whitespace
211 */
212 for (ap = brkstring (field, " ", "\n"); *ap; ap++) {
213 if ((cp = strchr(*ap, '-')))
214 *cp++ = '\0';
215 if ((j = m_atoi (*ap)) > 0) {
216 k = cp ? m_atoi (cp) : j;
217
218 /*
219 * Keep mp->curmsg and "cur" sequence in synch. Unlike
220 * other sequences, this message doesn't need to exist.
221 * Think about the series of command (rmm; next) to
222 * understand why this can be the case. But if it does
223 * exist, we will still set the bit flag for it like
224 * other sequences.
225 */
226 if (is_current)
227 mp->curmsg = j;
228 /*
229 * We iterate through messages in this range
230 * and flip on bit for this sequence.
231 */
232 for (; j <= k; j++) {
233 if (j >= mp->lowmsg && j <= mp->hghmsg && does_exist(mp, j))
234 add_sequence (mp, i, j);
235 }
236 }
237 }
238
239 free (field); /* free string containing message ranges */
240 return i;
241 }