Add *r-option-implicit* (Felipe Gasper, Martin Neitzel)..
[s-mailx.git] / message.c
blob969135a47e380877d18cee7784b56cc6208343c9
1 /*@ S-nail - a mail user agent derived from Berkeley Mail.
2 *@ Message, message array, getmsglist(), and related operations.
4 * Copyright (c) 2000-2004 Gunnar Ritter, Freiburg i. Br., Germany.
5 * Copyright (c) 2012 - 2016 Steffen (Daode) Nurpmeso <steffen@sdaoden.eu>.
6 */
7 /*
8 * Copyright (c) 1980, 1993
9 * The Regents of the University of California. All rights reserved.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
13 * are met:
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
35 #undef n_FILE
36 #define n_FILE message
38 #ifndef HAVE_AMALGAMATION
39 # include "nail.h"
40 #endif
42 /* Token values returned by the scanner used for argument lists.
43 * Also, sizes of scanner-related things */
44 enum a_message_token{
45 a_MESSAGE_T_EOL, /* End of the command line */
46 a_MESSAGE_T_NUMBER, /* Message number */
47 a_MESSAGE_T_MINUS, /* - */
48 a_MESSAGE_T_STRING, /* A string (possibly containing -) */
49 a_MESSAGE_T_DOT, /* . */
50 a_MESSAGE_T_UP, /* ^ */
51 a_MESSAGE_T_DOLLAR, /* $ */
52 a_MESSAGE_T_ASTER, /* * */
53 a_MESSAGE_T_OPEN, /* ( */
54 a_MESSAGE_T_CLOSE, /* ) */
55 a_MESSAGE_T_PLUS, /* + */
56 a_MESSAGE_T_COMMA, /* , */
57 a_MESSAGE_T_SEMI, /* ; */
58 a_MESSAGE_T_BACK, /* ` */
59 a_MESSAGE_T_ERROR /* Lexical error */
62 enum a_message_idfield{
63 a_MESSAGE_ID_REFERENCES,
64 a_MESSAGE_ID_IN_REPLY_TO
67 enum a_message_state{
68 a_MESSAGE_S_NEW = 1<<0,
69 a_MESSAGE_S_OLD = 1<<1,
70 a_MESSAGE_S_UNREAD = 1<<2,
71 a_MESSAGE_S_DELETED = 1<<3,
72 a_MESSAGE_S_READ = 1<<4,
73 a_MESSAGE_S_FLAG = 1<<5,
74 a_MESSAGE_S_ANSWERED = 1<<6,
75 a_MESSAGE_S_DRAFT = 1<<7,
76 a_MESSAGE_S_SPAM = 1<<8,
77 a_MESSAGE_S_SPAMUNSURE = 1<<9
80 struct a_message_coltab{
81 char mco_char; /* What to find past : */
82 ui8_t mco__dummy[3];
83 int mco_bit; /* Associated modifier bit */
84 int mco_mask; /* m_status bits to mask */
85 int mco_equal; /* ... must equal this */
88 struct a_message_lex{
89 char ml_char;
90 ui8_t ml_token;
93 static struct a_message_coltab const a_message_coltabs[] = {
94 {'n', {0,}, a_MESSAGE_S_NEW, MNEW, MNEW},
95 {'o', {0,}, a_MESSAGE_S_OLD, MNEW, 0},
96 {'u', {0,}, a_MESSAGE_S_UNREAD, MREAD, 0},
97 {'d', {0,}, a_MESSAGE_S_DELETED, MDELETED, MDELETED},
98 {'r', {0,}, a_MESSAGE_S_READ, MREAD, MREAD},
99 {'f', {0,}, a_MESSAGE_S_FLAG, MFLAGGED, MFLAGGED},
100 {'a', {0,}, a_MESSAGE_S_ANSWERED, MANSWERED, MANSWERED},
101 {'t', {0,}, a_MESSAGE_S_DRAFT, MDRAFTED, MDRAFTED},
102 {'s', {0,}, a_MESSAGE_S_SPAM, MSPAM, MSPAM},
103 {'S', {0,}, a_MESSAGE_S_SPAMUNSURE, MSPAMUNSURE, MSPAMUNSURE}
106 static struct a_message_lex const a_message_singles[] = {
107 {'$', a_MESSAGE_T_DOLLAR},
108 {'.', a_MESSAGE_T_DOT},
109 {'^', a_MESSAGE_T_UP},
110 {'*', a_MESSAGE_T_ASTER},
111 {'-', a_MESSAGE_T_MINUS},
112 {'+', a_MESSAGE_T_PLUS},
113 {'(', a_MESSAGE_T_OPEN},
114 {')', a_MESSAGE_T_CLOSE},
115 {',', a_MESSAGE_T_COMMA},
116 {';', a_MESSAGE_T_SEMI},
117 {'`', a_MESSAGE_T_BACK}
120 /* Slots in ::message */
121 static size_t a_message_mem_space;
123 /* Mark entire threads */
124 static bool_t a_message_threadflag;
126 /* :d on its way HACK TODO */
127 static bool_t a_message_list_saw_d, a_message_list_last_saw_d;
129 /* String from a_MESSAGE_T_STRING, scan() */
130 static struct str a_message_lexstr;
131 /* Number of a_MESSAGE_T_NUMBER from scan() */
132 static int a_message_lexno;
134 /* Lazy load message header fields */
135 static enum okay a_message_get_header(struct message *mp);
137 /* Append, taking care of resizes TODO vector */
138 static char **a_message_add_to_namelist(char ***namelist, size_t *nmlsize,
139 char **np, char *string);
141 /* Mark all messages that the user wanted from the command line in the message
142 * structure. Return 0 on success, -1 on error */
143 static int a_message_markall(char *buf, int f);
145 /* Turn the character after a colon modifier into a bit value */
146 static int a_message_evalcol(int col);
148 /* Check the passed message number for legality and proper flags. Unless f is
149 * MDELETED the message has to be undeleted */
150 static bool_t a_message_check(int mno, int f);
152 /* Scan out a single lexical item and return its token number, updating the
153 * string pointer passed *sp. Also, store the value of the number or string
154 * scanned in a_message_lexno or a_message_lexstr as appropriate.
155 * In any event, store the scanned "thing" in a_message_lexstr.
156 * Returns the token as a negative number when we also saw & to mark a thread */
157 static int a_message_scan(char **sp);
159 /* See if the passed name sent the passed message */
160 static bool_t a_message_match_sender(struct message *mp, char const *str,
161 bool_t allnet);
163 /* Check whether the given message-id or references match */
164 static bool_t a_message_match_mid(struct message *mp, char const *id,
165 enum a_message_idfield idfield);
167 /* See if the given string matches.
168 * For the purpose of the scan, we ignore case differences.
169 * This is the engine behind the "/" search */
170 static bool_t a_message_match_dash(struct message *mp, char const *str);
172 /* See if the given search expression matches.
173 * For the purpose of the scan, we ignore case differences.
174 * This is the engine behind the "@[..@].." search */
175 static bool_t a_message_match_at(struct message *mp, struct search_expr *sep);
177 /* Unmark the named message */
178 static void a_message_unmark(int mesg);
180 /* Return the message number corresponding to the passed meta character */
181 static int a_message_metamess(int meta, int f);
183 /* Helper for mark(): self valid, threading enabled */
184 static void a_message__threadmark(struct message *self, int f);
186 static enum okay
187 a_message_get_header(struct message *mp){
188 enum okay rv;
189 NYD2_ENTER;
190 n_UNUSED(mp);
192 switch(mb.mb_type){
193 case MB_FILE:
194 case MB_MAILDIR:
195 rv = OKAY;
196 break;
197 #ifdef HAVE_POP3
198 case MB_POP3:
199 rv = pop3_header(mp);
200 break;
201 #endif
202 case MB_VOID:
203 default:
204 rv = STOP;
205 break;
207 NYD2_LEAVE;
208 return rv;
211 static char **
212 a_message_add_to_namelist(char ***namelist, size_t *nmlsize, char **np,
213 char *string){
214 size_t idx;
215 NYD2_ENTER;
217 if((idx = PTR2SIZE(np - *namelist)) >= *nmlsize){
218 *namelist = srealloc(*namelist, (*nmlsize += 8) * sizeof *np);
219 np = &(*namelist)[idx];
221 *np++ = string;
222 NYD2_LEAVE;
223 return np;
226 static int
227 a_message_markall(char *buf, int f){
228 struct message *mp, *mx;
229 enum a_message_idfield idfield;
230 size_t j, nmlsize;
231 char const *id;
232 char **np, **nq, **namelist, *bufp, *cp;
233 int i, valdot, beg, colmod, tok, colresult;
234 enum{
235 a_NONE = 0,
236 a_ALLNET = 1u<<0, /* Must be TRU1 */
237 a_ALLOC = 1u<<1, /* Have allocated something */
238 a_THREADED = 1u<<2,
239 a_ERROR = 1u<<3,
240 a_ANY = 1u<<4, /* Have marked just ANY */
241 a_RANGE = 1u<<5, /* Seen dash, await close */
242 a_ASTER = 1u<<8,
243 a_TOPEN = 1u<<9, /* ( used (and didn't match) */
244 a_TBACK = 1u<<10, /* ` used (and didn't match) */
245 a_TMP = 1u<<15
246 } flags;
247 NYD_ENTER;
248 n_LCTA((ui32_t)a_ALLNET == (ui32_t)TRU1,
249 "Constant is converted to bool_t via AND, thus");
251 /* Update message array: clear MMARK but remember its former state for `.
252 * An empty selector input is identical to * asterisk */
253 for(i = msgCount; i-- > 0;){
254 enum mflag mf;
256 mf = (mp = &message[i])->m_flag;
257 if(mf & MMARK)
258 mf |= MOLDMARK;
259 else
260 mf &= ~MOLDMARK;
261 mf &= ~MMARK;
262 mp->m_flag = mf;
265 /* Strip all leading WS from user buffer */
266 while(blankspacechar(*buf))
267 ++buf;
268 /* If there is no input buffer, we are done! */
269 if(buf[0] == '\0'){
270 flags = a_NONE;
271 goto jleave;
274 n_UNINIT(beg, 0);
275 n_UNINIT(idfield, a_MESSAGE_ID_REFERENCES);
276 a_message_threadflag = FAL0;
277 a_message_lexstr.s = ac_alloc(a_message_lexstr.l = 2 * strlen(buf) +1);
278 np = namelist = smalloc((nmlsize = 8) * sizeof *namelist); /* TODO vector */
279 bufp = buf;
280 valdot = (int)PTR2SIZE(dot - message + 1);
281 colmod = 0;
282 id = NULL;
283 flags = a_ALLOC | (mb.mb_threaded ? a_THREADED : 0);
285 while((tok = a_message_scan(&bufp)) != a_MESSAGE_T_EOL){
286 if((a_message_threadflag = (tok < 0)))
287 tok &= INT_MAX;
289 switch(tok){
290 case a_MESSAGE_T_NUMBER:
291 pstate |= PS_MSGLIST_GABBY;
292 jnumber:
293 if(!a_message_check(a_message_lexno, f))
294 goto jerr;
296 if(flags & a_RANGE){
297 flags ^= a_RANGE;
299 if(!(flags & a_THREADED)){
300 if(beg < a_message_lexno)
301 i = beg;
302 else{
303 i = a_message_lexno;
304 a_message_lexno = beg;
307 for(; i <= a_message_lexno; ++i){
308 mp = &message[i - 1];
309 if(!(mp->m_flag & MHIDDEN) &&
310 (f == MDELETED || !(mp->m_flag & MDELETED))){
311 mark(i, f);
312 flags |= a_ANY;
315 }else{
316 /* TODO threaded ranges are a mess */
317 enum{
318 a_T_NONE,
319 a_T_HOT = 1u<<0,
320 a_T_DIR_PREV = 1u<<1
321 } tf;
322 int i_base;
324 if(beg < a_message_lexno)
325 i = beg;
326 else{
327 i = a_message_lexno;
328 a_message_lexno = beg;
331 i_base = i;
332 tf = a_T_NONE;
333 jnumber__thr:
334 for(;;){
335 mp = &message[i - 1];
336 if(!(mp->m_flag & MHIDDEN) &&
337 (f == MDELETED || !(mp->m_flag & MDELETED))){
338 if(tf & a_T_HOT){
339 mark(i, f);
340 flags |= a_ANY;
344 /* We may have reached the endpoint. If we were still
345 * detecting the direction to search for it, restart.
346 * Otherwise finished */
347 if(i == a_message_lexno){ /* XXX */
348 if(!(tf & a_T_HOT)){
349 tf |= a_T_HOT;
350 i = i_base;
351 goto jnumber__thr;
353 break;
356 mx = (tf & a_T_DIR_PREV) ? prev_in_thread(mp)
357 : next_in_thread(mp);
358 if(mx == NULL){
359 /* We anyway have failed to reach the endpoint in this
360 * direction; if we already switched that, report error */
361 if(!(tf & a_T_DIR_PREV)){
362 tf |= a_T_DIR_PREV;
363 i = i_base;
364 goto jnumber__thr;
366 id = N_("Range crosses multiple threads\n");
367 goto jerrmsg;
369 i = (int)PTR2SIZE(mx - message + 1);
373 beg = 0;
374 }else{
375 /* Could be an inclusive range? */
376 if(bufp[0] == '-'){
377 ++bufp;
378 beg = a_message_lexno;
379 flags |= a_RANGE;
380 }else{
381 mark(a_message_lexno, f);
382 flags |= a_ANY;
385 break;
386 case a_MESSAGE_T_PLUS:
387 pstate &= ~PS_MSGLIST_DIRECT;
388 pstate |= PS_MSGLIST_GABBY;
389 i = valdot;
391 if(flags & a_THREADED){
392 mx = next_in_thread(&message[i - 1]);
393 i = mx ? (int)PTR2SIZE(mx - message + 1) : msgCount + 1;
394 }else
395 ++i;
396 if(i > msgCount){
397 id = N_("Referencing beyond last message\n");
398 goto jerrmsg;
400 }while(message[i - 1].m_flag == MHIDDEN ||
401 (message[i - 1].m_flag & MDELETED) != (unsigned)f);
402 a_message_lexno = i;
403 goto jnumber;
404 case a_MESSAGE_T_MINUS:
405 pstate &= ~PS_MSGLIST_DIRECT;
406 pstate |= PS_MSGLIST_GABBY;
407 i = valdot;
409 if(flags & a_THREADED){
410 mx = prev_in_thread(&message[i - 1]);
411 i = mx ? (int)PTR2SIZE(mx - message + 1) : 0;
412 }else
413 --i;
414 if(i <= 0){
415 id = N_("Referencing before first message\n");
416 goto jerrmsg;
418 }while(message[i - 1].m_flag == MHIDDEN ||
419 (message[i - 1].m_flag & MDELETED) != (unsigned)f);
420 a_message_lexno = i;
421 goto jnumber;
422 case a_MESSAGE_T_STRING:
423 pstate &= ~PS_MSGLIST_DIRECT;
424 if(flags & a_RANGE)
425 goto jebadrange;
427 /* This may be a colon modifier */
428 if((cp = a_message_lexstr.s)[0] != ':')
429 np = a_message_add_to_namelist(&namelist, &nmlsize, np,
430 savestr(a_message_lexstr.s));
431 else{
432 while(*++cp != '\0'){
433 colresult = a_message_evalcol(*cp);
434 if(colresult == 0){
435 n_err(_("Unknown colon modifier: %s\n"), a_message_lexstr.s);
436 goto jerr;
438 if(colresult == a_MESSAGE_S_DELETED){
439 a_message_list_saw_d = TRU1;
440 f |= MDELETED;
442 colmod |= colresult;
445 break;
446 case a_MESSAGE_T_OPEN:
447 pstate &= ~PS_MSGLIST_DIRECT;
448 if(flags & a_RANGE)
449 goto jebadrange;
450 flags |= a_TOPEN;
452 #ifdef HAVE_IMAP_SEARCH
453 /* C99 */{
454 ssize_t ires;
456 if((ires = imap_search(a_message_lexstr.s, f)) >= 0){
457 if(ires > 0)
458 flags |= a_ANY;
459 break;
462 #else
463 n_err(_("Optional selector is not available: %s\n"),
464 a_message_lexstr.s);
465 #endif
466 goto jerr;
467 case a_MESSAGE_T_DOLLAR:
468 case a_MESSAGE_T_UP:
469 case a_MESSAGE_T_SEMI:
470 pstate |= PS_MSGLIST_GABBY;
471 /* FALLTHRU */
472 case a_MESSAGE_T_DOT: /* Don't set _GABBY for dot, to _allow_ history.. */
473 pstate &= ~PS_MSGLIST_DIRECT;
474 a_message_lexno = a_message_metamess(a_message_lexstr.s[0], f);
475 if(a_message_lexno == -1)
476 goto jerr;
477 goto jnumber;
478 case a_MESSAGE_T_BACK:
479 pstate &= ~PS_MSGLIST_DIRECT;
480 if(flags & a_RANGE)
481 goto jebadrange;
483 flags |= a_TBACK;
484 for(i = 0; i < msgCount; ++i){
485 if((mp = &message[i])->m_flag & MHIDDEN)
486 continue;
487 if((mp->m_flag & MDELETED) != (unsigned)f){
488 if(!a_message_list_last_saw_d)
489 continue;
490 a_message_list_saw_d = TRU1;
492 if(mp->m_flag & MOLDMARK){
493 mark(i + 1, f);
494 flags &= ~a_TBACK;
495 flags |= a_ANY;
498 break;
499 case a_MESSAGE_T_ASTER:
500 pstate &= ~PS_MSGLIST_DIRECT;
501 if(flags & a_RANGE)
502 goto jebadrange;
503 flags |= a_ASTER;
504 break;
505 case a_MESSAGE_T_COMMA:
506 pstate &= ~PS_MSGLIST_DIRECT;
507 pstate |= PS_MSGLIST_GABBY;
508 if(flags & a_RANGE)
509 goto jebadrange;
511 if(id == NULL){
512 if((cp = hfield1("in-reply-to", dot)) != NULL)
513 idfield = a_MESSAGE_ID_IN_REPLY_TO;
514 else if((cp = hfield1("references", dot)) != NULL){
515 struct name *enp;
517 if((enp = extract(cp, GREF)) != NULL){
518 while(enp->n_flink != NULL)
519 enp = enp->n_flink;
520 cp = enp->n_name;
521 idfield = a_MESSAGE_ID_REFERENCES;
522 }else
523 cp = NULL;
526 if(cp != NULL)
527 id = savestr(cp);
528 else{
529 id = N_("Message-ID of parent of \"dot\" is indeterminable\n");
530 goto jerrmsg;
532 }else if(!(pstate & PS_HOOK) && (options & OPT_D_V))
533 n_err(_("Ignoring redundant specification of , selector\n"));
534 break;
535 case a_MESSAGE_T_ERROR:
536 pstate &= ~PS_MSGLIST_DIRECT;
537 pstate |= PS_MSGLIST_GABBY;
538 goto jerr;
541 /* Explicitly disallow invalid ranges for future safety */
542 if(bufp[0] == '-' && !(flags & a_RANGE)){
543 if(!(pstate & PS_HOOK))
544 n_err(_("Ignoring invalid range before: %s\n"), bufp);
545 ++bufp;
548 if(flags & a_RANGE){
549 id = N_("Missing second range argument\n");
550 goto jerrmsg;
553 np = a_message_add_to_namelist(&namelist, &nmlsize, np, NULL);
554 --np;
556 /* * is special at this point, after we have parsed the entire line */
557 if(flags & a_ASTER){
558 for(i = 0; i < msgCount; ++i){
559 if((mp = &message[i])->m_flag & MHIDDEN)
560 continue;
561 if(!a_message_list_saw_d && (mp->m_flag & MDELETED) != (unsigned)f)
562 continue;
563 mark(i + 1, f);
564 flags |= a_ANY;
566 if(!(flags & a_ANY))
567 goto jenoapp;
568 goto jleave;
571 /* If any names were given, add any messages which match */
572 if(np > namelist || id != NULL){
573 struct search_expr *sep = NULL;
575 /* The @ search works with struct search_expr, so build an array.
576 * To simplify array, i.e., regex_t destruction, and optimize for the
577 * common case we walk the entire array even in case of errors */
578 if(np > namelist){
579 sep = scalloc(PTR2SIZE(np - namelist), sizeof(*sep));
580 for(j = 0, nq = namelist; *nq != NULL; ++j, ++nq){
581 char *x, *y;
583 sep[j].ss_sexpr = x = *nq;
584 if(*x != '@' || (flags & a_ERROR))
585 continue;
587 for(y = &x[1];; ++y){
588 if(*y == '\0' || !fieldnamechar(*y)){
589 x = NULL;
590 break;
592 if(*y == '@'){
593 x = y;
594 break;
597 sep[j].ss_where = (x == NULL || x - 1 == *nq)
598 ? "subject" : savestrbuf(&(*nq)[1], PTR2SIZE(x - *nq) - 1);
600 x = (x == NULL ? *nq : x) + 1;
601 if(*x == '\0'){ /* XXX Simply remove from list instead? */
602 n_err(_("Empty [@..]@ search expression\n"));
603 flags |= a_ERROR;
604 continue;
606 #ifdef HAVE_REGEX
607 if(is_maybe_regex(x)){
608 sep[j].ss_sexpr = NULL;
609 if(regcomp(&sep[j].ss_regex, x,
610 REG_EXTENDED | REG_ICASE | REG_NOSUB) != 0){
611 if(!(pstate & PS_HOOK) && (options & OPT_D_V))
612 n_err(_("Invalid regular expression: >>> %s <<<\n"), x);
613 flags |= a_ERROR;
614 continue;
616 }else
617 #endif
618 sep[j].ss_sexpr = x;
620 if(flags & a_ERROR)
621 goto jnamesearch_sepfree;
624 /* Iterate the entire message array */
625 srelax_hold();
626 if(ok_blook(allnet))
627 flags |= a_ALLNET;
628 for(i = 0; i < msgCount; ++i){
629 if((mp = &message[i])->m_flag & (MMARK | MHIDDEN))
630 continue;
631 if(!a_message_list_saw_d && (mp->m_flag & MDELETED) != (unsigned)f)
632 continue;
634 flags &= ~a_TMP;
635 if(np > namelist){
636 for(nq = namelist; *nq != NULL; ++nq){
637 if(**nq == '@'){
638 if(a_message_match_at(mp, sep + PTR2SIZE(nq - namelist))){
639 flags |= a_TMP;
640 break;
642 }else if(**nq == '/'){
643 if(a_message_match_dash(mp, *nq)){
644 flags |= a_TMP;
645 break;
647 }else if(a_message_match_sender(mp, *nq, (flags & a_ALLNET))){
648 flags |= a_TMP;
649 break;
653 if(!(flags & a_TMP) &&
654 id != NULL && a_message_match_mid(mp, id, idfield))
655 flags |= a_TMP;
657 if(flags & a_TMP){
658 mark(i + 1, f);
659 flags |= a_ANY;
661 srelax();
663 srelax_rele();
665 jnamesearch_sepfree:
666 if(sep != NULL){
667 #ifdef HAVE_REGEX
668 for(j = PTR2SIZE(np - namelist); j-- != 0;)
669 if(sep[j].ss_sexpr == NULL)
670 regfree(&sep[j].ss_regex);
671 #endif
672 free(sep);
674 if(flags & a_ERROR)
675 goto jerr;
678 /* If any colon modifiers were given, go through and mark any messages which
679 * do satisfy the modifiers */
680 if(colmod != 0){
681 for(i = 0; i < msgCount; ++i){
682 struct a_message_coltab const *colp;
684 if((mp = &message[i])->m_flag & (MMARK | MHIDDEN))
685 continue;
686 if(!a_message_list_saw_d && (mp->m_flag & MDELETED) != (unsigned)f)
687 continue;
689 for(colp = a_message_coltabs;
690 PTRCMP(colp, <, &a_message_coltabs[n_NELEM(a_message_coltabs)]);
691 ++colp)
692 if((colp->mco_bit & colmod) &&
693 ((mp->m_flag & colp->mco_mask) == (unsigned)colp->mco_equal)){
694 mark(i + 1, f);
695 flags |= a_ANY;
696 break;
701 /* It shall be an error if ` didn't match anything, and nothing else did */
702 if((flags & (a_TBACK | a_ANY)) == a_TBACK){
703 id = N_("No previously marked messages\n");
704 goto jerrmsg;
705 }else if(!(flags & a_ANY))
706 goto jenoapp;
708 assert(!(flags & a_ERROR));
709 jleave:
710 if(flags & a_ALLOC){
711 free(namelist);
712 ac_free(a_message_lexstr.s);
714 NYD_LEAVE;
715 return (flags & a_ERROR) ? -1 : 0;
717 jebadrange:
718 id = N_("Invalid range endpoint\n");
719 goto jerrmsg;
720 jenoapp:
721 id = N_("No applicable messages\n");
722 jerrmsg:
723 if(!(pstate & PS_HOOK_MASK))
724 n_err(V_(id));
725 jerr:
726 flags |= a_ERROR;
727 goto jleave;
730 static int
731 a_message_evalcol(int col){
732 struct a_message_coltab const *colp;
733 int rv;
734 NYD2_ENTER;
736 rv = 0;
737 for(colp = a_message_coltabs;
738 PTRCMP(colp, <, &a_message_coltabs[n_NELEM(a_message_coltabs)]);
739 ++colp)
740 if(colp->mco_char == col){
741 rv = colp->mco_bit;
742 break;
744 NYD2_LEAVE;
745 return rv;
748 static bool_t
749 a_message_check(int mno, int f){
750 struct message *mp;
751 NYD2_ENTER;
753 if(mno < 1 || mno > msgCount){
754 n_err(_("%d: Invalid message number\n"), mno);
755 mno = 1;
756 }else if(((mp = &message[mno - 1])->m_flag & MHIDDEN) ||
757 (f != MDELETED && (mp->m_flag & MDELETED) != 0))
758 n_err(_("%d: inappropriate message\n"), mno);
759 else
760 mno = 0;
761 NYD2_LEAVE;
762 return (mno == 0);
765 static int
766 a_message_scan(char **sp)
768 char *cp, *cp2;
769 struct a_message_lex const *lp;
770 int rv, c, inquote, quotec;
771 NYD_ENTER;
773 rv = a_MESSAGE_T_EOL;
775 cp = *sp;
776 cp2 = a_message_lexstr.s;
777 c = *cp++;
779 /* strip away leading white space */
780 while(blankchar(c))
781 c = *cp++;
783 /* If no characters remain, we are at end of line, so report that */
784 if(c == '\0'){
785 *sp = --cp;
786 goto jleave;
789 /* Select members of a message thread */
790 if(c == '&'){
791 if(*cp == '\0' || spacechar(*cp)){
792 a_message_lexstr.s[0] = '.';
793 a_message_lexstr.s[1] = '\0';
794 *sp = cp;
795 rv = a_MESSAGE_T_DOT | INT_MIN;
796 goto jleave;
798 rv = INT_MIN;
799 c = *cp++;
802 /* If the leading character is a digit, scan the number and convert it
803 * on the fly. Return a_MESSAGE_T_NUMBER when done */
804 if(digitchar(c)){
805 a_message_lexno = 0;
807 a_message_lexno = (a_message_lexno * 10) + c - '0';
808 *cp2++ = c;
809 }while((c = *cp++, digitchar(c)));
810 *cp2 = '\0';
811 *sp = --cp;
812 rv |= a_MESSAGE_T_NUMBER;
813 goto jleave;
816 /* An IMAP SEARCH list. Note that a_MESSAGE_T_OPEN has always been included
817 * in singles[] in Mail and mailx. Thus although there is no formal
818 * definition for (LIST) lists, they do not collide with historical
819 * practice because a subject string (LIST) could never been matched
820 * this way */
821 if (c == '(') {
822 ui32_t level = 1;
823 inquote = 0;
824 *cp2++ = c;
825 do {
826 if ((c = *cp++&0377) == '\0') {
827 jmtop:
828 n_err(_("Missing )\n"));
829 rv = a_MESSAGE_T_ERROR;
830 goto jleave;
832 if (inquote && c == '\\') {
833 *cp2++ = c;
834 c = *cp++&0377;
835 if (c == '\0')
836 goto jmtop;
837 } else if (c == '"')
838 inquote = !inquote;
839 else if (inquote)
840 /*EMPTY*/;
841 else if (c == '(')
842 ++level;
843 else if (c == ')')
844 --level;
845 else if (spacechar(c)) {
846 /* Replace unquoted whitespace by single space characters, to make
847 * the string IMAP SEARCH conformant */
848 c = ' ';
849 if (cp2[-1] == ' ')
850 --cp2;
852 *cp2++ = c;
853 } while (c != ')' || level > 0);
854 *cp2 = '\0';
855 *sp = cp;
856 rv |= a_MESSAGE_T_OPEN;
857 goto jleave;
860 /* Check for single character tokens; return such if found */
861 for(lp = a_message_singles;
862 PTRCMP(lp, <, &a_message_singles[n_NELEM(a_message_singles)]); ++lp)
863 if(c == lp->ml_char){
864 a_message_lexstr.s[0] = c;
865 a_message_lexstr.s[1] = '\0';
866 *sp = cp;
867 rv |= lp->ml_token;
868 goto jleave;
871 /* We've got a string! Copy all the characters of the string into
872 * a_message_lexstr, until we see a null, space, or tab. If the lead
873 * character is a " or ', save it and scan until you get another */
874 quotec = 0;
875 if (c == '\'' || c == '"') {
876 quotec = c;
877 c = *cp++;
879 while (c != '\0') {
880 if (quotec == 0 && c == '\\' && *cp != '\0')
881 c = *cp++;
882 if (c == quotec) {
883 ++cp;
884 break;
886 if (quotec == 0 && blankchar(c))
887 break;
888 if (PTRCMP(cp2 - a_message_lexstr.s, <, a_message_lexstr.l))
889 *cp2++ = c;
890 c = *cp++;
892 if (quotec && c == 0) {
893 n_err(_("Missing %c\n"), quotec);
894 rv = a_MESSAGE_T_ERROR;
895 goto jleave;
897 *sp = --cp;
898 *cp2 = '\0';
899 rv |= a_MESSAGE_T_STRING;
900 jleave:
901 NYD_LEAVE;
902 return rv;
905 static bool_t
906 a_message_match_sender(struct message *mp, char const *str, bool_t allnet){
907 char const *str_base, *np_base, *np;
908 char sc, nc;
909 bool_t rv;
910 NYD2_ENTER;
912 /* Empty string doesn't match */
913 if(*(str_base = str) == '\0'){
914 rv = FAL0;
915 goto jleave;
918 /* *allnet* is POSIX and, since it explicitly mentions login and user names,
919 * most likely case-sensitive. XXX Still allow substr matching, though
920 * XXX possibly the first letter should be case-insensitive, then? */
921 if(allnet){
922 for(np_base = np = nameof(mp, 0);;){
923 if((sc = *str++) == '@')
924 sc = '\0';
925 if((nc = *np++) == '@' || nc == '\0' || sc == '\0')
926 break;
927 if(sc != nc){
928 np = ++np_base;
929 str = str_base;
932 rv = (sc == '\0');
933 }else{
934 /* TODO POSIX says ~"match any address as shown in header overview",
935 * TODO but a normalized match would be more sane i guess.
936 * TODO struct name should gain a comparison method, normalize realname
937 * TODO content (in TODO) and thus match as likewise
938 * TODO "Buddy (Today) <here>" and "(Now) Buddy <here>" */
939 char const *real_base;
940 bool_t again;
942 real_base = name1(mp, 0);
943 again = ok_blook(showname);
944 jagain:
945 np_base = np = again ? realname(real_base) : skin(real_base);
946 str = str_base;
947 for(;;){
948 sc = *str++;
949 if((nc = *np++) == '\0' || sc == '\0')
950 break;
951 sc = upperconv(sc);
952 nc = upperconv(nc);
953 if(sc != nc){
954 np = ++np_base;
955 str = str_base;
959 /* And really if i want to match 'on@' then i want it to match even if
960 * *showname* is set! */
961 if(!(rv = (sc == '\0')) && again){
962 again = FAL0;
963 goto jagain;
966 jleave:
967 NYD2_LEAVE;
968 return rv;
971 static bool_t
972 a_message_match_mid(struct message *mp, char const *id,
973 enum a_message_idfield idfield){
974 char const *cp;
975 bool_t rv;
976 NYD2_ENTER;
978 rv = FAL0;
980 if((cp = hfield1("message-id", mp)) != NULL){
981 switch(idfield){
982 case a_MESSAGE_ID_REFERENCES:
983 if(!msgidcmp(id, cp))
984 rv = TRU1;
985 break;
986 case a_MESSAGE_ID_IN_REPLY_TO:{
987 struct name *np;
989 if((np = extract(id, GREF)) != NULL)
991 if(!msgidcmp(np->n_name, cp)){
992 rv = TRU1;
993 break;
995 }while((np = np->n_flink) != NULL);
996 break;
1000 NYD2_LEAVE;
1001 return rv;
1004 static bool_t
1005 a_message_match_dash(struct message *mp, char const *str){
1006 static char lastscan[128];
1008 struct str in, out;
1009 char *hfield, *hbody;
1010 bool_t rv;
1011 NYD2_ENTER;
1013 rv = FAL0;
1015 if(*++str == '\0')
1016 str = lastscan;
1017 else
1018 n_strscpy(lastscan, str, sizeof lastscan); /* XXX use new n_str object! */
1020 /* Now look, ignoring case, for the word in the string */
1021 if(ok_blook(searchheaders) && (hfield = strchr(str, ':'))){
1022 size_t l;
1024 l = PTR2SIZE(hfield - str);
1025 hfield = ac_alloc(l +1);
1026 memcpy(hfield, str, l);
1027 hfield[l] = '\0';
1028 hbody = hfieldX(hfield, mp);
1029 ac_free(hfield);
1030 hfield = n_UNCONST(str + l + 1);
1031 }else{
1032 hfield = n_UNCONST(str);
1033 hbody = hfield1("subject", mp);
1035 if(hbody == NULL)
1036 goto jleave;
1038 in.l = strlen(in.s = hbody);
1039 mime_fromhdr(&in, &out, TD_ICONV);
1040 rv = substr(out.s, hfield);
1041 free(out.s);
1042 jleave:
1043 NYD2_LEAVE;
1044 return rv;
1047 static bool_t
1048 a_message_match_at(struct message *mp, struct search_expr *sep){
1049 struct str in, out;
1050 char *nfield;
1051 char const *cfield;
1052 bool_t rv;
1053 NYD2_ENTER;
1055 rv = FAL0;
1056 nfield = savestr(sep->ss_where);
1058 while((cfield = n_strsep(&nfield, ',', TRU1)) != NULL){
1059 if(!asccasecmp(cfield, "body") ||
1060 (cfield[1] == '\0' && cfield[0] == '>')){
1061 rv = FAL0;
1062 jmsg:
1063 if((rv = message_match(mp, sep, rv)))
1064 break;
1065 continue;
1066 }else if(!asccasecmp(cfield, "text") ||
1067 (cfield[1] == '\0' && cfield[0] == '=')){
1068 rv = TRU1;
1069 goto jmsg;
1072 if(!asccasecmp(cfield, "header") ||
1073 (cfield[1] == '\0' && cfield[0] == '<')){
1074 if((rv = header_match(mp, sep)))
1075 break;
1076 continue;
1079 /* This is not a special name, so take care for the "skin" prefix !
1080 * and possible abbreviations */
1081 /* C99 */{
1082 struct name *np;
1083 bool_t doskin;
1085 if((doskin = (*cfield == '~')))
1086 ++cfield;
1087 if(cfield[0] != '\0' && cfield[1] == '\0'){
1088 char const x[][8] = {"from", "to", "cc", "bcc", "subject"};
1089 size_t i;
1090 char c1;
1092 c1 = lowerconv(cfield[0]);
1093 for(i = 0; i < n_NELEM(x); ++i){
1094 if(c1 == x[i][0]){
1095 cfield = x[i];
1096 break;
1100 if((in.s = hfieldX(cfield, mp)) == NULL)
1101 continue;
1103 /* Shall we split into address list and match the addresses only? */
1104 if(doskin){
1105 np = lextract(in.s, GSKIN);
1106 if(np == NULL)
1107 continue;
1108 out.s = np->n_name;
1109 }else{
1110 np = NULL;
1111 in.l = strlen(in.s);
1112 mime_fromhdr(&in, &out, TD_ICONV);
1115 jnext_name:
1116 #ifdef HAVE_REGEX
1117 if(sep->ss_sexpr == NULL)
1118 rv = (regexec(&sep->ss_regex, out.s, 0,NULL, 0) != REG_NOMATCH);
1119 else
1120 #endif
1121 rv = substr(out.s, sep->ss_sexpr);
1122 if(np == NULL)
1123 free(out.s);
1124 if(rv)
1125 break;
1126 if(np != NULL && (np = np->n_flink) != NULL){
1127 out.s = np->n_name;
1128 goto jnext_name;
1132 NYD2_LEAVE;
1133 return rv;
1136 static void
1137 a_message_unmark(int mesg){
1138 size_t i;
1139 NYD2_ENTER;
1141 i = (size_t)mesg;
1142 if(i < 1 || UICMP(z, i, >, msgCount))
1143 n_panic(_("Bad message number to unmark"));
1144 message[--i].m_flag &= ~MMARK;
1145 NYD2_LEAVE;
1148 static int
1149 a_message_metamess(int meta, int f)
1151 int c, m;
1152 struct message *mp;
1153 NYD2_ENTER;
1155 c = meta;
1156 switch (c) {
1157 case '^': /* First 'good' message left */
1158 mp = mb.mb_threaded ? threadroot : message;
1159 while (PTRCMP(mp, <, message + msgCount)) {
1160 if (!(mp->m_flag & MHIDDEN) && (mp->m_flag & MDELETED) == (ui32_t)f) {
1161 c = (int)PTR2SIZE(mp - message + 1);
1162 goto jleave;
1164 if (mb.mb_threaded) {
1165 mp = next_in_thread(mp);
1166 if (mp == NULL)
1167 break;
1168 } else
1169 ++mp;
1171 if (!(pstate & PS_HOOK_MASK))
1172 n_err(_("No applicable messages\n"));
1173 goto jem1;
1175 case '$': /* Last 'good message left */
1176 mp = mb.mb_threaded
1177 ? this_in_thread(threadroot, -1) : message + msgCount - 1;
1178 while (mp >= message) {
1179 if (!(mp->m_flag & MHIDDEN) && (mp->m_flag & MDELETED) == (ui32_t)f) {
1180 c = (int)PTR2SIZE(mp - message + 1);
1181 goto jleave;
1183 if (mb.mb_threaded) {
1184 mp = prev_in_thread(mp);
1185 if (mp == NULL)
1186 break;
1187 } else
1188 --mp;
1190 if (!(pstate & PS_HOOK_MASK))
1191 n_err(_("No applicable messages\n"));
1192 goto jem1;
1194 case '.':
1195 /* Current message */
1196 m = dot - message + 1;
1197 if ((dot->m_flag & MHIDDEN) || (dot->m_flag & MDELETED) != (ui32_t)f) {
1198 n_err(_("%d: inappropriate message\n"), m);
1199 goto jem1;
1201 c = m;
1202 break;
1204 case ';':
1205 /* Previously current message */
1206 if (prevdot == NULL) {
1207 n_err(_("No previously current message\n"));
1208 goto jem1;
1210 m = prevdot - message + 1;
1211 if ((prevdot->m_flag & MHIDDEN) ||
1212 (prevdot->m_flag & MDELETED) != (ui32_t)f) {
1213 n_err(_("%d: inappropriate message\n"), m);
1214 goto jem1;
1216 c = m;
1217 break;
1219 default:
1220 n_err(_("Unknown selector: %c\n"), c);
1221 goto jem1;
1223 jleave:
1224 NYD2_LEAVE;
1225 return c;
1226 jem1:
1227 c = -1;
1228 goto jleave;
1231 static void
1232 a_message__threadmark(struct message *self, int f){
1233 NYD2_ENTER;
1234 if(!(self->m_flag & MHIDDEN) &&
1235 (f == MDELETED || !(self->m_flag & MDELETED) || a_message_list_saw_d))
1236 self->m_flag |= MMARK;
1238 if((self = self->m_child) != NULL){
1239 goto jcall;
1240 while((self = self->m_younger) != NULL)
1241 if(self->m_child != NULL)
1242 jcall:
1243 a_message__threadmark(self, f);
1244 else
1245 self->m_flag |= MMARK;
1247 NYD2_LEAVE;
1250 FL FILE *
1251 setinput(struct mailbox *mp, struct message *m, enum needspec need){
1252 FILE *rv;
1253 enum okay ok;
1254 NYD_ENTER;
1256 rv = NULL;
1257 ok = STOP;
1259 switch(need){
1260 case NEED_HEADER:
1261 ok = (m->m_content_info & CI_HAVE_HEADER) ? OKAY
1262 : a_message_get_header(m);
1263 break;
1264 case NEED_BODY:
1265 ok = (m->m_content_info & CI_HAVE_BODY) ? OKAY : get_body(m);
1266 break;
1267 case NEED_UNSPEC:
1268 ok = OKAY;
1269 break;
1271 if(ok != OKAY)
1272 goto jleave;
1274 fflush(mp->mb_otf);
1275 if(fseek(mp->mb_itf, (long)mailx_positionof(m->m_block, m->m_offset),
1276 SEEK_SET) == -1){
1277 n_perr(_("fseek"), 0);
1278 n_panic(_("temporary file seek"));
1280 rv = mp->mb_itf;
1281 jleave:
1282 NYD_LEAVE;
1283 return rv;
1286 FL enum okay
1287 get_body(struct message *mp){
1288 enum okay rv;
1289 NYD_ENTER;
1290 n_UNUSED(mp);
1292 switch(mb.mb_type){
1293 case MB_FILE:
1294 case MB_MAILDIR:
1295 rv = OKAY;
1296 break;
1297 #ifdef HAVE_POP3
1298 case MB_POP3:
1299 rv = pop3_body(mp);
1300 break;
1301 #endif
1302 case MB_VOID:
1303 default:
1304 rv = STOP;
1305 break;
1307 NYD_LEAVE;
1308 return rv;
1311 FL void
1312 message_reset(void){
1313 NYD_ENTER;
1314 if(message != NULL){
1315 free(message);
1316 message = NULL;
1318 msgCount = 0;
1319 a_message_mem_space = 0;
1320 NYD_LEAVE;
1323 FL void
1324 message_append(struct message *mp){
1325 NYD_ENTER;
1326 if(UICMP(z, msgCount + 1, >=, a_message_mem_space)){
1327 /* XXX remove _mem_space magics (or use s_Vector) */
1328 a_message_mem_space = ((a_message_mem_space >= 128 &&
1329 a_message_mem_space <= 1000000)
1330 ? a_message_mem_space << 1 : a_message_mem_space + 64);
1331 message = srealloc(message, a_message_mem_space * sizeof(*message));
1333 if(msgCount > 0){
1334 if(mp != NULL)
1335 message[msgCount - 1] = *mp;
1336 else
1337 memset(&message[msgCount - 1], 0, sizeof *message);
1339 NYD_LEAVE;
1342 FL void
1343 message_append_null(void){
1344 NYD_ENTER;
1345 if(msgCount == 0)
1346 message_append(NULL);
1347 setdot(message);
1348 message[msgCount].m_size = 0;
1349 message[msgCount].m_lines = 0;
1350 NYD_LEAVE;
1353 FL bool_t
1354 message_match(struct message *mp, struct search_expr const *sep,
1355 bool_t with_headers){
1356 char **line;
1357 size_t *linesize, cnt;
1358 FILE *fp;
1359 bool_t rv;
1360 NYD_ENTER;
1362 rv = FAL0;
1364 if((fp = Ftmp(NULL, "mpmatch", OF_RDWR | OF_UNLINK | OF_REGISTER)) == NULL)
1365 goto j_leave;
1367 if(sendmp(mp, fp, NULL, NULL, SEND_TOSRCH, NULL) < 0)
1368 goto jleave;
1369 fflush_rewind(fp);
1371 cnt = fsize(fp);
1372 line = &termios_state.ts_linebuf; /* XXX line pool */
1373 linesize = &termios_state.ts_linesize; /* XXX line pool */
1375 if(!with_headers)
1376 while(fgetline(line, linesize, &cnt, NULL, fp, 0))
1377 if (**line == '\n')
1378 break;
1380 while(fgetline(line, linesize, &cnt, NULL, fp, 0)){
1381 #ifdef HAVE_REGEX
1382 if(sep->ss_sexpr == NULL){
1383 if(regexec(&sep->ss_regex, *line, 0,NULL, 0) == REG_NOMATCH)
1384 continue;
1385 }else
1386 #endif
1387 if(!substr(*line, sep->ss_sexpr))
1388 continue;
1389 rv = TRU1;
1390 break;
1393 jleave:
1394 Fclose(fp);
1395 j_leave:
1396 NYD_LEAVE;
1397 return rv;
1400 FL struct message *
1401 setdot(struct message *mp){
1402 NYD_ENTER;
1403 if(dot != mp){
1404 prevdot = dot;
1405 pstate &= ~PS_DID_PRINT_DOT;
1407 dot = mp;
1408 uncollapse1(dot, 0);
1409 NYD_LEAVE;
1410 return dot;
1413 FL void
1414 touch(struct message *mp){
1415 NYD_ENTER;
1416 mp->m_flag |= MTOUCH;
1417 if(!(mp->m_flag & MREAD))
1418 mp->m_flag |= MREAD | MSTATUS;
1419 NYD_LEAVE;
1422 FL int
1423 getmsglist(char *buf, int *vector, int flags)
1425 int *ip, mc;
1426 struct message *mp;
1427 NYD_ENTER;
1429 pstate &= ~PS_ARGLIST_MASK;
1430 a_message_list_last_saw_d = a_message_list_saw_d;
1431 a_message_list_saw_d = FAL0;
1433 if(msgCount == 0){
1434 *vector = 0;
1435 mc = 0;
1436 goto jleave;
1439 pstate |= PS_MSGLIST_DIRECT;
1441 if(a_message_markall(buf, flags) < 0){
1442 mc = -1;
1443 goto jleave;
1446 ip = vector;
1447 if(pstate & PS_HOOK_NEWMAIL){
1448 mc = 0;
1449 for(mp = message; mp < &message[msgCount]; ++mp)
1450 if(mp->m_flag & MMARK){
1451 if(!(mp->m_flag & MNEWEST))
1452 a_message_unmark((int)PTR2SIZE(mp - message + 1));
1453 else
1454 ++mc;
1456 if(mc == 0){
1457 mc = -1;
1458 goto jleave;
1462 if(mb.mb_threaded == 0){
1463 for(mp = message; mp < &message[msgCount]; ++mp)
1464 if(mp->m_flag & MMARK)
1465 *ip++ = (int)PTR2SIZE(mp - message + 1);
1466 }else{
1467 for(mp = threadroot; mp != NULL; mp = next_in_thread(mp))
1468 if(mp->m_flag & MMARK)
1469 *ip++ = (int)PTR2SIZE(mp - message + 1);
1471 *ip = 0;
1472 mc = (int)PTR2SIZE(ip - vector);
1473 if(mc != 1)
1474 pstate &= ~PS_MSGLIST_DIRECT;
1475 jleave:
1476 NYD_LEAVE;
1477 return mc;
1480 FL int
1481 first(int f, int m)
1483 struct message *mp;
1484 int rv;
1485 NYD_ENTER;
1487 if (msgCount == 0) {
1488 rv = 0;
1489 goto jleave;
1492 f &= MDELETED;
1493 m &= MDELETED;
1494 for (mp = dot;
1495 mb.mb_threaded ? (mp != NULL) : PTRCMP(mp, <, message + msgCount);
1496 mb.mb_threaded ? (mp = next_in_thread(mp)) : ++mp) {
1497 if (!(mp->m_flag & MHIDDEN) && (mp->m_flag & m) == (ui32_t)f) {
1498 rv = (int)PTR2SIZE(mp - message + 1);
1499 goto jleave;
1503 if (dot > message) {
1504 for (mp = dot - 1; (mb.mb_threaded ? (mp != NULL) : (mp >= message));
1505 mb.mb_threaded ? (mp = prev_in_thread(mp)) : --mp) {
1506 if (!(mp->m_flag & MHIDDEN) && (mp->m_flag & m) == (ui32_t)f) {
1507 rv = (int)PTR2SIZE(mp - message + 1);
1508 goto jleave;
1512 rv = 0;
1513 jleave:
1514 NYD_LEAVE;
1515 return rv;
1518 FL void
1519 mark(int mno, int f){
1520 struct message *mp;
1521 int i;
1522 NYD_ENTER;
1524 i = mno;
1525 if(i < 1 || i > msgCount)
1526 n_panic(_("Bad message number to mark"));
1527 mp = &message[--i];
1529 if(mb.mb_threaded == 1 && a_message_threadflag)
1530 a_message__threadmark(mp, f);
1531 else{
1532 assert(!(mp->m_flag & MHIDDEN));
1533 mp->m_flag |= MMARK;
1535 NYD_LEAVE;
1538 /* s-it-mode */