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>.
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
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
36 #define n_FILE message
38 #ifndef HAVE_AMALGAMATION
42 /* Token values returned by the scanner used for argument lists.
43 * Also, sizes of scanner-related things */
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
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 : */
83 int mco_bit
; /* Associated modifier bit */
84 int mco_mask
; /* m_status bits to mask */
85 int mco_equal
; /* ... must equal this */
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
,
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
);
187 a_message_get_header(struct message
*mp
){
199 rv
= pop3_header(mp
);
212 a_message_add_to_namelist(char ***namelist
, size_t *nmlsize
, char **np
,
217 if((idx
= PTR2SIZE(np
- *namelist
)) >= *nmlsize
){
218 *namelist
= srealloc(*namelist
, (*nmlsize
+= 8) * sizeof *np
);
219 np
= &(*namelist
)[idx
];
227 a_message_markall(char *buf
, int f
){
228 struct message
*mp
, *mx
;
229 enum a_message_idfield idfield
;
232 char **np
, **nq
, **namelist
, *bufp
, *cp
;
233 int i
, valdot
, beg
, colmod
, tok
, colresult
;
236 a_ALLNET
= 1u<<0, /* Must be TRU1 */
237 a_ALLOC
= 1u<<1, /* Have allocated something */
240 a_ANY
= 1u<<4, /* Have marked just ANY */
241 a_RANGE
= 1u<<5, /* Seen dash, await close */
243 a_TOPEN
= 1u<<9, /* ( used (and didn't match) */
244 a_TBACK
= 1u<<10, /* ` used (and didn't match) */
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;){
256 mf
= (mp
= &message
[i
])->m_flag
;
265 /* Strip all leading WS from user buffer */
266 while(blankspacechar(*buf
))
268 /* If there is no input buffer, we are done! */
275 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 */
280 valdot
= (int)PTR2SIZE(dot
- message
+ 1);
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)))
290 case a_MESSAGE_T_NUMBER
:
291 pstate
|= PS_MSGLIST_GABBY
;
293 if(!a_message_check(a_message_lexno
, f
))
299 if(!(flags
& a_THREADED
)){
300 if(beg
< 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
))){
316 /* TODO threaded ranges are a mess */
324 if(beg
< a_message_lexno
)
328 a_message_lexno
= beg
;
335 mp
= &message
[i
- 1];
336 if(!(mp
->m_flag
& MHIDDEN
) &&
337 (f
== MDELETED
|| !(mp
->m_flag
& MDELETED
))){
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 */
356 mx
= (tf
& a_T_DIR_PREV
) ? prev_in_thread(mp
)
357 : next_in_thread(mp
);
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
)){
366 id
= N_("Range crosses multiple threads\n");
369 i
= (int)PTR2SIZE(mx
- message
+ 1);
375 /* Could be an inclusive range? */
378 beg
= a_message_lexno
;
381 mark(a_message_lexno
, f
);
386 case a_MESSAGE_T_PLUS
:
387 pstate
&= ~PS_MSGLIST_DIRECT
;
388 pstate
|= PS_MSGLIST_GABBY
;
391 if(flags
& a_THREADED
){
392 mx
= next_in_thread(&message
[i
- 1]);
393 i
= mx
? (int)PTR2SIZE(mx
- message
+ 1) : msgCount
+ 1;
397 id
= N_("Referencing beyond last message\n");
400 }while(message
[i
- 1].m_flag
== MHIDDEN
||
401 (message
[i
- 1].m_flag
& MDELETED
) != (unsigned)f
);
404 case a_MESSAGE_T_MINUS
:
405 pstate
&= ~PS_MSGLIST_DIRECT
;
406 pstate
|= PS_MSGLIST_GABBY
;
409 if(flags
& a_THREADED
){
410 mx
= prev_in_thread(&message
[i
- 1]);
411 i
= mx
? (int)PTR2SIZE(mx
- message
+ 1) : 0;
415 id
= N_("Referencing before first message\n");
418 }while(message
[i
- 1].m_flag
== MHIDDEN
||
419 (message
[i
- 1].m_flag
& MDELETED
) != (unsigned)f
);
422 case a_MESSAGE_T_STRING
:
423 pstate
&= ~PS_MSGLIST_DIRECT
;
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
));
432 while(*++cp
!= '\0'){
433 colresult
= a_message_evalcol(*cp
);
435 n_err(_("Unknown colon modifier: %s\n"), a_message_lexstr
.s
);
438 if(colresult
== a_MESSAGE_S_DELETED
){
439 a_message_list_saw_d
= TRU1
;
446 case a_MESSAGE_T_OPEN
:
447 pstate
&= ~PS_MSGLIST_DIRECT
;
452 #ifdef HAVE_IMAP_SEARCH
456 if((ires
= imap_search(a_message_lexstr
.s
, f
)) >= 0){
463 n_err(_("Optional selector is not available: %s\n"),
467 case a_MESSAGE_T_DOLLAR
:
469 case a_MESSAGE_T_SEMI
:
470 pstate
|= PS_MSGLIST_GABBY
;
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)
478 case a_MESSAGE_T_BACK
:
479 pstate
&= ~PS_MSGLIST_DIRECT
;
484 for(i
= 0; i
< msgCount
; ++i
){
485 if((mp
= &message
[i
])->m_flag
& MHIDDEN
)
487 if((mp
->m_flag
& MDELETED
) != (unsigned)f
){
488 if(!a_message_list_last_saw_d
)
490 a_message_list_saw_d
= TRU1
;
492 if(mp
->m_flag
& MOLDMARK
){
499 case a_MESSAGE_T_ASTER
:
500 pstate
&= ~PS_MSGLIST_DIRECT
;
505 case a_MESSAGE_T_COMMA
:
506 pstate
&= ~PS_MSGLIST_DIRECT
;
507 pstate
|= PS_MSGLIST_GABBY
;
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
){
517 if((enp
= extract(cp
, GREF
)) != NULL
){
518 while(enp
->n_flink
!= NULL
)
521 idfield
= a_MESSAGE_ID_REFERENCES
;
529 id
= N_("Message-ID of parent of \"dot\" is indeterminable\n");
532 }else if(!(pstate
& PS_HOOK
) && (options
& OPT_D_V
))
533 n_err(_("Ignoring redundant specification of , selector\n"));
535 case a_MESSAGE_T_ERROR
:
536 pstate
&= ~PS_MSGLIST_DIRECT
;
537 pstate
|= PS_MSGLIST_GABBY
;
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
);
549 id
= N_("Missing second range argument\n");
553 np
= a_message_add_to_namelist(&namelist
, &nmlsize
, np
, NULL
);
556 /* * is special at this point, after we have parsed the entire line */
558 for(i
= 0; i
< msgCount
; ++i
){
559 if((mp
= &message
[i
])->m_flag
& MHIDDEN
)
561 if(!a_message_list_saw_d
&& (mp
->m_flag
& MDELETED
) != (unsigned)f
)
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 */
579 sep
= scalloc(PTR2SIZE(np
- namelist
), sizeof(*sep
));
580 for(j
= 0, nq
= namelist
; *nq
!= NULL
; ++j
, ++nq
){
583 sep
[j
].ss_sexpr
= x
= *nq
;
584 if(*x
!= '@' || (flags
& a_ERROR
))
587 for(y
= &x
[1];; ++y
){
588 if(*y
== '\0' || !fieldnamechar(*y
)){
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"));
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
);
621 goto jnamesearch_sepfree
;
624 /* Iterate the entire message array */
628 for(i
= 0; i
< msgCount
; ++i
){
629 if((mp
= &message
[i
])->m_flag
& (MMARK
| MHIDDEN
))
631 if(!a_message_list_saw_d
&& (mp
->m_flag
& MDELETED
) != (unsigned)f
)
636 for(nq
= namelist
; *nq
!= NULL
; ++nq
){
638 if(a_message_match_at(mp
, sep
+ PTR2SIZE(nq
- namelist
))){
642 }else if(**nq
== '/'){
643 if(a_message_match_dash(mp
, *nq
)){
647 }else if(a_message_match_sender(mp
, *nq
, (flags
& a_ALLNET
))){
653 if(!(flags
& a_TMP
) &&
654 id
!= NULL
&& a_message_match_mid(mp
, id
, idfield
))
668 for(j
= PTR2SIZE(np
- namelist
); j
-- != 0;)
669 if(sep
[j
].ss_sexpr
== NULL
)
670 regfree(&sep
[j
].ss_regex
);
678 /* If any colon modifiers were given, go through and mark any messages which
679 * do satisfy the modifiers */
681 for(i
= 0; i
< msgCount
; ++i
){
682 struct a_message_coltab
const *colp
;
684 if((mp
= &message
[i
])->m_flag
& (MMARK
| MHIDDEN
))
686 if(!a_message_list_saw_d
&& (mp
->m_flag
& MDELETED
) != (unsigned)f
)
689 for(colp
= a_message_coltabs
;
690 PTRCMP(colp
, <, &a_message_coltabs
[NELEM(a_message_coltabs
)]);
692 if((colp
->mco_bit
& colmod
) &&
693 ((mp
->m_flag
& colp
->mco_mask
) == (unsigned)colp
->mco_equal
)){
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");
705 }else if(!(flags
& a_ANY
))
708 assert(!(flags
& a_ERROR
));
712 ac_free(a_message_lexstr
.s
);
715 return (flags
& a_ERROR
) ? -1 : 0;
718 id
= N_("Invalid range endpoint\n");
721 id
= N_("No applicable messages\n");
723 if(!(pstate
& PS_HOOK_MASK
))
731 a_message_evalcol(int col
){
732 struct a_message_coltab
const *colp
;
737 for(colp
= a_message_coltabs
;
738 PTRCMP(colp
, <, &a_message_coltabs
[NELEM(a_message_coltabs
)]); ++colp
)
739 if(colp
->mco_char
== col
){
748 a_message_check(int mno
, int f
){
752 if(mno
< 1 || mno
> msgCount
){
753 n_err(_("%d: Invalid message number\n"), mno
);
755 }else if(((mp
= &message
[mno
- 1])->m_flag
& MHIDDEN
) ||
756 (f
!= MDELETED
&& (mp
->m_flag
& MDELETED
) != 0))
757 n_err(_("%d: inappropriate message\n"), mno
);
765 a_message_scan(char **sp
)
768 struct a_message_lex
const *lp
;
769 int rv
, c
, inquote
, quotec
;
772 rv
= a_MESSAGE_T_EOL
;
775 cp2
= a_message_lexstr
.s
;
778 /* strip away leading white space */
782 /* If no characters remain, we are at end of line, so report that */
788 /* Select members of a message thread */
790 if(*cp
== '\0' || spacechar(*cp
)){
791 a_message_lexstr
.s
[0] = '.';
792 a_message_lexstr
.s
[1] = '\0';
794 rv
= a_MESSAGE_T_DOT
| INT_MIN
;
801 /* If the leading character is a digit, scan the number and convert it
802 * on the fly. Return a_MESSAGE_T_NUMBER when done */
806 a_message_lexno
= (a_message_lexno
* 10) + c
- '0';
808 }while((c
= *cp
++, digitchar(c
)));
811 rv
|= a_MESSAGE_T_NUMBER
;
815 /* An IMAP SEARCH list. Note that a_MESSAGE_T_OPEN has always been included
816 * in singles[] in Mail and mailx. Thus although there is no formal
817 * definition for (LIST) lists, they do not collide with historical
818 * practice because a subject string (LIST) could never been matched
825 if ((c
= *cp
++&0377) == '\0') {
827 n_err(_("Missing )\n"));
828 rv
= a_MESSAGE_T_ERROR
;
831 if (inquote
&& c
== '\\') {
844 else if (spacechar(c
)) {
845 /* Replace unquoted whitespace by single space characters, to make
846 * the string IMAP SEARCH conformant */
852 } while (c
!= ')' || level
> 0);
855 rv
|= a_MESSAGE_T_OPEN
;
859 /* Check for single character tokens; return such if found */
860 for(lp
= a_message_singles
;
861 PTRCMP(lp
, <, &a_message_singles
[NELEM(a_message_singles
)]); ++lp
)
862 if(c
== lp
->ml_char
){
863 a_message_lexstr
.s
[0] = c
;
864 a_message_lexstr
.s
[1] = '\0';
870 /* We've got a string! Copy all the characters of the string into
871 * a_message_lexstr, until we see a null, space, or tab. If the lead
872 * character is a " or ', save it and scan until you get another */
874 if (c
== '\'' || c
== '"') {
879 if (quotec
== 0 && c
== '\\' && *cp
!= '\0')
885 if (quotec
== 0 && blankchar(c
))
887 if (PTRCMP(cp2
- a_message_lexstr
.s
, <, a_message_lexstr
.l
))
891 if (quotec
&& c
== 0) {
892 n_err(_("Missing %c\n"), quotec
);
893 rv
= a_MESSAGE_T_ERROR
;
898 rv
|= a_MESSAGE_T_STRING
;
905 a_message_match_sender(struct message
*mp
, char const *str
, bool_t allnet
){
906 char const *str_base
, *np_base
, *np
;
911 /* Empty string doesn't match */
912 if(*(str_base
= str
) == '\0'){
917 /* *allnet* is POSIX and, since it explicitly mentions login and user names,
918 * most likely case-sensitive. XXX Still allow substr matching, though
919 * XXX possibly the first letter should be case-insensitive, then? */
921 for(np_base
= np
= nameof(mp
, 0);;){
922 if((sc
= *str
++) == '@')
924 if((nc
= *np
++) == '@' || nc
== '\0' || sc
== '\0')
933 /* TODO POSIX says ~"match any address as shown in header overview",
934 * TODO but a normalized match would be more sane i guess.
935 * TODO struct name should gain a comparison method, normalize realname
936 * TODO content (in TODO) and thus match as likewise
937 * TODO "Buddy (Today) <here>" and "(Now) Buddy <here>" */
938 char const *real_base
;
941 real_base
= name1(mp
, 0);
942 again
= ok_blook(showname
);
944 np_base
= np
= again
? realname(real_base
) : skin(real_base
);
948 if((nc
= *np
++) == '\0' || sc
== '\0')
958 /* And really if i want to match 'on@' then i want it to match even if
959 * *showname* is set! */
960 if(!(rv
= (sc
== '\0')) && again
){
971 a_message_match_mid(struct message
*mp
, char const *id
,
972 enum a_message_idfield idfield
){
979 if((cp
= hfield1("message-id", mp
)) != NULL
){
981 case a_MESSAGE_ID_REFERENCES
:
982 if(!msgidcmp(id
, cp
))
985 case a_MESSAGE_ID_IN_REPLY_TO
:{
988 if((np
= extract(id
, GREF
)) != NULL
)
990 if(!msgidcmp(np
->n_name
, cp
)){
994 }while((np
= np
->n_flink
) != NULL
);
1004 a_message_match_dash(struct message
*mp
, char const *str
){
1005 static char lastscan
[128];
1008 char *hfield
, *hbody
;
1017 n_strscpy(lastscan
, str
, sizeof lastscan
); /* XXX use new n_str object! */
1019 /* Now look, ignoring case, for the word in the string */
1020 if(ok_blook(searchheaders
) && (hfield
= strchr(str
, ':'))){
1023 l
= PTR2SIZE(hfield
- str
);
1024 hfield
= ac_alloc(l
+1);
1025 memcpy(hfield
, str
, l
);
1027 hbody
= hfieldX(hfield
, mp
);
1029 hfield
= UNCONST(str
+ l
+ 1);
1031 hfield
= UNCONST(str
);
1032 hbody
= hfield1("subject", mp
);
1037 in
.l
= strlen(in
.s
= hbody
);
1038 mime_fromhdr(&in
, &out
, TD_ICONV
);
1039 rv
= substr(out
.s
, hfield
);
1047 a_message_match_at(struct message
*mp
, struct search_expr
*sep
){
1055 nfield
= savestr(sep
->ss_where
);
1057 while((cfield
= n_strsep(&nfield
, ',', TRU1
)) != NULL
){
1058 if(!asccasecmp(cfield
, "body") ||
1059 (cfield
[1] == '\0' && cfield
[0] == '>')){
1062 if((rv
= message_match(mp
, sep
, rv
)))
1065 }else if(!asccasecmp(cfield
, "text") ||
1066 (cfield
[1] == '\0' && cfield
[0] == '=')){
1071 if(!asccasecmp(cfield
, "header") ||
1072 (cfield
[1] == '\0' && cfield
[0] == '<')){
1073 if((rv
= header_match(mp
, sep
)))
1078 /* This is not a special name, so take care for the "skin" prefix !
1079 * and possible abbreviations */
1084 if((doskin
= (*cfield
== '~')))
1086 if(cfield
[0] != '\0' && cfield
[1] == '\0'){
1087 char const x
[][8] = {"from", "to", "cc", "bcc", "subject"};
1091 c1
= lowerconv(cfield
[0]);
1092 for(i
= 0; i
< NELEM(x
); ++i
){
1099 if((in
.s
= hfieldX(cfield
, mp
)) == NULL
)
1102 /* Shall we split into address list and match the addresses only? */
1104 np
= lextract(in
.s
, GSKIN
);
1110 in
.l
= strlen(in
.s
);
1111 mime_fromhdr(&in
, &out
, TD_ICONV
);
1116 if(sep
->ss_sexpr
== NULL
)
1117 rv
= (regexec(&sep
->ss_regex
, out
.s
, 0,NULL
, 0) != REG_NOMATCH
);
1120 rv
= substr(out
.s
, sep
->ss_sexpr
);
1125 if(np
!= NULL
&& (np
= np
->n_flink
) != NULL
){
1136 a_message_unmark(int mesg
){
1141 if(i
< 1 || UICMP(z
, i
, >, msgCount
))
1142 n_panic(_("Bad message number to unmark"));
1143 message
[--i
].m_flag
&= ~MMARK
;
1148 a_message_metamess(int meta
, int f
)
1156 case '^': /* First 'good' message left */
1157 mp
= mb
.mb_threaded
? threadroot
: message
;
1158 while (PTRCMP(mp
, <, message
+ msgCount
)) {
1159 if (!(mp
->m_flag
& MHIDDEN
) && (mp
->m_flag
& MDELETED
) == (ui32_t
)f
) {
1160 c
= (int)PTR2SIZE(mp
- message
+ 1);
1163 if (mb
.mb_threaded
) {
1164 mp
= next_in_thread(mp
);
1170 if (!(pstate
& PS_HOOK_MASK
))
1171 n_err(_("No applicable messages\n"));
1174 case '$': /* Last 'good message left */
1176 ? this_in_thread(threadroot
, -1) : message
+ msgCount
- 1;
1177 while (mp
>= message
) {
1178 if (!(mp
->m_flag
& MHIDDEN
) && (mp
->m_flag
& MDELETED
) == (ui32_t
)f
) {
1179 c
= (int)PTR2SIZE(mp
- message
+ 1);
1182 if (mb
.mb_threaded
) {
1183 mp
= prev_in_thread(mp
);
1189 if (!(pstate
& PS_HOOK_MASK
))
1190 n_err(_("No applicable messages\n"));
1194 /* Current message */
1195 m
= dot
- message
+ 1;
1196 if ((dot
->m_flag
& MHIDDEN
) || (dot
->m_flag
& MDELETED
) != (ui32_t
)f
) {
1197 n_err(_("%d: inappropriate message\n"), m
);
1204 /* Previously current message */
1205 if (prevdot
== NULL
) {
1206 n_err(_("No previously current message\n"));
1209 m
= prevdot
- message
+ 1;
1210 if ((prevdot
->m_flag
& MHIDDEN
) ||
1211 (prevdot
->m_flag
& MDELETED
) != (ui32_t
)f
) {
1212 n_err(_("%d: inappropriate message\n"), m
);
1219 n_err(_("Unknown selector: %c\n"), c
);
1231 a_message__threadmark(struct message
*self
, int f
){
1233 if(!(self
->m_flag
& MHIDDEN
) &&
1234 (f
== MDELETED
|| !(self
->m_flag
& MDELETED
) || a_message_list_saw_d
))
1235 self
->m_flag
|= MMARK
;
1237 if((self
= self
->m_child
) != NULL
){
1239 while((self
= self
->m_younger
) != NULL
)
1240 if(self
->m_child
!= NULL
)
1242 a_message__threadmark(self
, f
);
1244 self
->m_flag
|= MMARK
;
1250 setinput(struct mailbox
*mp
, struct message
*m
, enum needspec need
){
1260 ok
= (m
->m_have
& HAVE_HEADER
) ? OKAY
: a_message_get_header(m
);
1263 ok
= (m
->m_have
& HAVE_BODY
) ? OKAY
: get_body(m
);
1273 if(fseek(mp
->mb_itf
, (long)mailx_positionof(m
->m_block
, m
->m_offset
),
1275 n_perr(_("fseek"), 0);
1276 n_panic(_("temporary file seek"));
1285 get_body(struct message
*mp
){
1310 message_reset(void){
1312 if(message
!= NULL
){
1317 a_message_mem_space
= 0;
1322 message_append(struct message
*mp
){
1324 if(UICMP(z
, msgCount
+ 1, >=, a_message_mem_space
)){
1325 /* XXX remove _mem_space magics (or use s_Vector) */
1326 a_message_mem_space
= ((a_message_mem_space
>= 128 &&
1327 a_message_mem_space
<= 1000000)
1328 ? a_message_mem_space
<< 1 : a_message_mem_space
+ 64);
1329 message
= srealloc(message
, a_message_mem_space
* sizeof(*message
));
1333 message
[msgCount
- 1] = *mp
;
1335 memset(&message
[msgCount
- 1], 0, sizeof *message
);
1341 message_append_null(void){
1344 message_append(NULL
);
1346 message
[msgCount
].m_size
= 0;
1347 message
[msgCount
].m_lines
= 0;
1352 message_match(struct message
*mp
, struct search_expr
const *sep
,
1353 bool_t with_headers
){
1355 size_t *linesize
, cnt
;
1362 if((fp
= Ftmp(NULL
, "mpmatch", OF_RDWR
| OF_UNLINK
| OF_REGISTER
)) == NULL
)
1365 if(sendmp(mp
, fp
, NULL
, NULL
, SEND_TOSRCH
, NULL
) < 0)
1370 line
= &termios_state
.ts_linebuf
; /* XXX line pool */
1371 linesize
= &termios_state
.ts_linesize
; /* XXX line pool */
1374 while(fgetline(line
, linesize
, &cnt
, NULL
, fp
, 0))
1378 while(fgetline(line
, linesize
, &cnt
, NULL
, fp
, 0)){
1380 if(sep
->ss_sexpr
== NULL
){
1381 if(regexec(&sep
->ss_regex
, *line
, 0,NULL
, 0) == REG_NOMATCH
)
1385 if(!substr(*line
, sep
->ss_sexpr
))
1399 setdot(struct message
*mp
){
1403 pstate
&= ~PS_DID_PRINT_DOT
;
1406 uncollapse1(dot
, 0);
1412 touch(struct message
*mp
){
1414 mp
->m_flag
|= MTOUCH
;
1415 if(!(mp
->m_flag
& MREAD
))
1416 mp
->m_flag
|= MREAD
| MSTATUS
;
1421 getmsglist(char *buf
, int *vector
, int flags
)
1427 pstate
&= ~PS_ARGLIST_MASK
;
1428 a_message_list_last_saw_d
= a_message_list_saw_d
;
1429 a_message_list_saw_d
= FAL0
;
1437 pstate
|= PS_MSGLIST_DIRECT
;
1439 if(a_message_markall(buf
, flags
) < 0){
1445 if(pstate
& PS_HOOK_NEWMAIL
){
1447 for(mp
= message
; mp
< &message
[msgCount
]; ++mp
)
1448 if(mp
->m_flag
& MMARK
){
1449 if(!(mp
->m_flag
& MNEWEST
))
1450 a_message_unmark((int)PTR2SIZE(mp
- message
+ 1));
1460 if(mb
.mb_threaded
== 0){
1461 for(mp
= message
; mp
< &message
[msgCount
]; ++mp
)
1462 if(mp
->m_flag
& MMARK
)
1463 *ip
++ = (int)PTR2SIZE(mp
- message
+ 1);
1465 for(mp
= threadroot
; mp
!= NULL
; mp
= next_in_thread(mp
))
1466 if(mp
->m_flag
& MMARK
)
1467 *ip
++ = (int)PTR2SIZE(mp
- message
+ 1);
1470 mc
= (int)PTR2SIZE(ip
- vector
);
1472 pstate
&= ~PS_MSGLIST_DIRECT
;
1485 if (msgCount
== 0) {
1493 mb
.mb_threaded
? (mp
!= NULL
) : PTRCMP(mp
, <, message
+ msgCount
);
1494 mb
.mb_threaded
? (mp
= next_in_thread(mp
)) : ++mp
) {
1495 if (!(mp
->m_flag
& MHIDDEN
) && (mp
->m_flag
& m
) == (ui32_t
)f
) {
1496 rv
= (int)PTR2SIZE(mp
- message
+ 1);
1501 if (dot
> message
) {
1502 for (mp
= dot
- 1; (mb
.mb_threaded
? (mp
!= NULL
) : (mp
>= message
));
1503 mb
.mb_threaded
? (mp
= prev_in_thread(mp
)) : --mp
) {
1504 if (!(mp
->m_flag
& MHIDDEN
) && (mp
->m_flag
& m
) == (ui32_t
)f
) {
1505 rv
= (int)PTR2SIZE(mp
- message
+ 1);
1517 mark(int mno
, int f
){
1523 if(i
< 1 || i
> msgCount
)
1524 n_panic(_("Bad message number to mark"));
1527 if(mb
.mb_threaded
== 1 && a_message_threadflag
)
1528 a_message__threadmark(mp
, f
);
1530 assert(!(mp
->m_flag
& MHIDDEN
));
1531 mp
->m_flag
|= MMARK
;