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 - 2017 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 const *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 const **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
, /* TODO Vector */
213 char **np
, char *string
){
217 if((idx
= PTR2SIZE(np
- *namelist
)) >= *nmlsize
){
218 *namelist
= srealloc(*namelist
, (*nmlsize
+= 8) * sizeof *np
);
219 np
= &(*namelist
)[idx
];
227 a_message_markall(char const *buf
, int f
){
228 struct message
*mp
, *mx
;
229 enum a_message_idfield idfield
;
231 char const *id
, *bufp
;
232 char **np
, **nq
, **namelist
, *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 for(i
= msgCount
; i
-- > 0;){
255 mf
= (mp
= &message
[i
])->m_flag
;
264 /* Strip all leading WS from user buffer */
265 while(blankspacechar(*buf
))
267 /* If there is no input buffer, we are done! */
274 n_UNINIT(idfield
, a_MESSAGE_ID_REFERENCES
);
275 a_message_threadflag
= FAL0
;
276 a_message_lexstr
.s
= ac_alloc(a_message_lexstr
.l
= 2 * strlen(buf
) +1);
277 np
= namelist
= smalloc((nmlsize
= 8) * sizeof *namelist
); /* TODO vector */
279 valdot
= (int)PTR2SIZE(dot
- message
+ 1);
282 flags
= a_ALLOC
| (mb
.mb_threaded
? a_THREADED
: 0);
284 while((tok
= a_message_scan(&bufp
)) != a_MESSAGE_T_EOL
){
285 if((a_message_threadflag
= (tok
< 0)))
289 case a_MESSAGE_T_NUMBER
:
290 n_pstate
|= n_PS_MSGLIST_GABBY
;
292 if(!a_message_check(a_message_lexno
, f
))
298 if(!(flags
& a_THREADED
)){
299 if(beg
< a_message_lexno
)
303 a_message_lexno
= beg
;
306 for(; i
<= a_message_lexno
; ++i
){
307 mp
= &message
[i
- 1];
308 if(!(mp
->m_flag
& MHIDDEN
) &&
309 (f
== MDELETED
|| !(mp
->m_flag
& MDELETED
))){
315 /* TODO threaded ranges are a mess */
323 if(beg
< a_message_lexno
)
327 a_message_lexno
= beg
;
334 mp
= &message
[i
- 1];
335 if(!(mp
->m_flag
& MHIDDEN
) &&
336 (f
== MDELETED
|| !(mp
->m_flag
& MDELETED
))){
343 /* We may have reached the endpoint. If we were still
344 * detecting the direction to search for it, restart.
345 * Otherwise finished */
346 if(i
== a_message_lexno
){ /* XXX */
355 mx
= (tf
& a_T_DIR_PREV
) ? prev_in_thread(mp
)
356 : next_in_thread(mp
);
358 /* We anyway have failed to reach the endpoint in this
359 * direction; if we already switched that, report error */
360 if(!(tf
& a_T_DIR_PREV
)){
365 id
= N_("Range crosses multiple threads\n");
368 i
= (int)PTR2SIZE(mx
- message
+ 1);
374 /* Could be an inclusive range? */
377 beg
= a_message_lexno
;
380 mark(a_message_lexno
, f
);
385 case a_MESSAGE_T_PLUS
:
386 n_pstate
&= ~n_PS_MSGLIST_DIRECT
;
387 n_pstate
|= n_PS_MSGLIST_GABBY
;
390 if(flags
& a_THREADED
){
391 mx
= next_in_thread(&message
[i
- 1]);
392 i
= mx
? (int)PTR2SIZE(mx
- message
+ 1) : msgCount
+ 1;
396 id
= N_("Referencing beyond last message\n");
399 }while(message
[i
- 1].m_flag
== MHIDDEN
||
400 (message
[i
- 1].m_flag
& MDELETED
) != (unsigned)f
);
403 case a_MESSAGE_T_MINUS
:
404 n_pstate
&= ~n_PS_MSGLIST_DIRECT
;
405 n_pstate
|= n_PS_MSGLIST_GABBY
;
408 if(flags
& a_THREADED
){
409 mx
= prev_in_thread(&message
[i
- 1]);
410 i
= mx
? (int)PTR2SIZE(mx
- message
+ 1) : 0;
414 id
= N_("Referencing before first message\n");
417 }while(message
[i
- 1].m_flag
== MHIDDEN
||
418 (message
[i
- 1].m_flag
& MDELETED
) != (unsigned)f
);
421 case a_MESSAGE_T_STRING
:
422 n_pstate
&= ~n_PS_MSGLIST_DIRECT
;
426 /* This may be a colon modifier */
427 if((cp
= a_message_lexstr
.s
)[0] != ':')
428 np
= a_message_add_to_namelist(&namelist
, &nmlsize
, np
,
429 savestr(a_message_lexstr
.s
));
431 while(*++cp
!= '\0'){
432 colresult
= a_message_evalcol(*cp
);
434 n_err(_("Unknown colon modifier: %s\n"), a_message_lexstr
.s
);
437 if(colresult
== a_MESSAGE_S_DELETED
){
438 a_message_list_saw_d
= TRU1
;
445 case a_MESSAGE_T_OPEN
:
446 n_pstate
&= ~n_PS_MSGLIST_DIRECT
;
451 #ifdef HAVE_IMAP_SEARCH
455 if((ires
= imap_search(a_message_lexstr
.s
, f
)) >= 0){
462 n_err(_("Optional selector is not available: %s\n"),
466 case a_MESSAGE_T_DOLLAR
:
468 case a_MESSAGE_T_SEMI
:
469 n_pstate
|= n_PS_MSGLIST_GABBY
;
471 case a_MESSAGE_T_DOT
: /* Don't set _GABBY for dot, to _allow_ history.. */
472 n_pstate
&= ~n_PS_MSGLIST_DIRECT
;
473 a_message_lexno
= a_message_metamess(a_message_lexstr
.s
[0], f
);
474 if(a_message_lexno
== -1)
477 case a_MESSAGE_T_BACK
:
478 n_pstate
&= ~n_PS_MSGLIST_DIRECT
;
483 for(i
= 0; i
< msgCount
; ++i
){
484 if((mp
= &message
[i
])->m_flag
& MHIDDEN
)
486 if((mp
->m_flag
& MDELETED
) != (unsigned)f
){
487 if(!a_message_list_last_saw_d
)
489 a_message_list_saw_d
= TRU1
;
491 if(mp
->m_flag
& MOLDMARK
){
498 case a_MESSAGE_T_ASTER
:
499 n_pstate
&= ~n_PS_MSGLIST_DIRECT
;
504 case a_MESSAGE_T_COMMA
:
505 n_pstate
&= ~n_PS_MSGLIST_DIRECT
;
506 n_pstate
|= n_PS_MSGLIST_GABBY
;
511 if((cp
= hfield1("in-reply-to", dot
)) != NULL
)
512 idfield
= a_MESSAGE_ID_IN_REPLY_TO
;
513 else if((cp
= hfield1("references", dot
)) != NULL
){
516 if((enp
= extract(cp
, GREF
)) != NULL
){
517 while(enp
->n_flink
!= NULL
)
520 idfield
= a_MESSAGE_ID_REFERENCES
;
528 id
= N_("Message-ID of parent of \"dot\" is indeterminable\n");
531 }else if(!(n_pstate
& n_PS_HOOK
) && (n_poption
& n_PO_D_V
))
532 n_err(_("Ignoring redundant specification of , selector\n"));
534 case a_MESSAGE_T_ERROR
:
535 n_pstate
&= ~n_PS_MSGLIST_DIRECT
;
536 n_pstate
|= n_PS_MSGLIST_GABBY
;
540 /* Explicitly disallow invalid ranges for future safety */
541 if(bufp
[0] == '-' && !(flags
& a_RANGE
)){
542 if(!(n_pstate
& n_PS_HOOK
))
543 n_err(_("Ignoring invalid range before: %s\n"), bufp
);
548 id
= N_("Missing second range argument\n");
552 np
= a_message_add_to_namelist(&namelist
, &nmlsize
, np
, NULL
);
555 /* * is special at this point, after we have parsed the entire line */
557 for(i
= 0; i
< msgCount
; ++i
){
558 if((mp
= &message
[i
])->m_flag
& MHIDDEN
)
560 if(!a_message_list_saw_d
&& (mp
->m_flag
& MDELETED
) != (unsigned)f
)
570 /* If any names were given, add any messages which match */
571 if(np
> namelist
|| id
!= NULL
){
572 struct search_expr
*sep
= NULL
;
574 /* The @ search works with struct search_expr, so build an array.
575 * To simplify array, i.e., regex_t destruction, and optimize for the
576 * common case we walk the entire array even in case of errors */
578 sep
= scalloc(PTR2SIZE(np
- namelist
), sizeof(*sep
));
579 for(j
= 0, nq
= namelist
; *nq
!= NULL
; ++j
, ++nq
){
582 sep
[j
].ss_sexpr
= x
= *nq
;
583 if(*x
!= '@' || (flags
& a_ERROR
))
586 for(y
= &x
[1];; ++y
){
587 if(*y
== '\0' || !fieldnamechar(*y
)){
596 sep
[j
].ss_where
= (x
== NULL
|| x
- 1 == *nq
)
597 ? "subject" : savestrbuf(&(*nq
)[1], PTR2SIZE(x
- *nq
) - 1);
599 x
= (x
== NULL
? *nq
: x
) + 1;
600 if(*x
== '\0'){ /* XXX Simply remove from list instead? */
601 n_err(_("Empty [@..]@ search expression\n"));
606 if(n_is_maybe_regex(x
)){
609 sep
[j
].ss_sexpr
= NULL
;
610 if((s
= regcomp(&sep
[j
].ss_regex
, x
,
611 REG_EXTENDED
| REG_ICASE
| REG_NOSUB
)) != 0){
612 if(!(n_pstate
& n_PS_HOOK
))
613 n_err(_("Invalid regular expression: %s: %s\n"),
614 n_shexp_quote_cp(x
, FAL0
),
615 n_regex_err_to_doc(&sep
[j
].ss_regex
, s
));
624 goto jnamesearch_sepfree
;
627 /* Iterate the entire message array */
631 for(i
= 0; i
< msgCount
; ++i
){
632 if((mp
= &message
[i
])->m_flag
& (MMARK
| MHIDDEN
))
634 if(!a_message_list_saw_d
&& (mp
->m_flag
& MDELETED
) != (unsigned)f
)
639 for(nq
= namelist
; *nq
!= NULL
; ++nq
){
641 if(a_message_match_at(mp
, sep
+ PTR2SIZE(nq
- namelist
))){
645 }else if(**nq
== '/'){
646 if(a_message_match_dash(mp
, *nq
)){
650 }else if(a_message_match_sender(mp
, *nq
, (flags
& a_ALLNET
))){
656 if(!(flags
& a_TMP
) &&
657 id
!= NULL
&& a_message_match_mid(mp
, id
, idfield
))
671 for(j
= PTR2SIZE(np
- namelist
); j
-- != 0;)
672 if(sep
[j
].ss_sexpr
== NULL
)
673 regfree(&sep
[j
].ss_regex
);
681 /* If any colon modifiers were given, go through and mark any messages which
682 * do satisfy the modifiers */
684 for(i
= 0; i
< msgCount
; ++i
){
685 struct a_message_coltab
const *colp
;
687 if((mp
= &message
[i
])->m_flag
& (MMARK
| MHIDDEN
))
689 if(!a_message_list_saw_d
&& (mp
->m_flag
& MDELETED
) != (unsigned)f
)
692 for(colp
= a_message_coltabs
;
693 PTRCMP(colp
, <, &a_message_coltabs
[n_NELEM(a_message_coltabs
)]);
695 if((colp
->mco_bit
& colmod
) &&
696 ((mp
->m_flag
& colp
->mco_mask
) == (unsigned)colp
->mco_equal
)){
704 /* It shall be an error if ` didn't match anything, and nothing else did */
705 if((flags
& (a_TBACK
| a_ANY
)) == a_TBACK
){
706 id
= N_("No previously marked messages\n");
708 }else if(!(flags
& a_ANY
))
711 assert(!(flags
& a_ERROR
));
715 ac_free(a_message_lexstr
.s
);
718 return (flags
& a_ERROR
) ? -1 : 0;
721 id
= N_("Invalid range endpoint\n");
724 id
= N_("No applicable messages\n");
726 if(!(n_pstate
& n_PS_HOOK_MASK
))
734 a_message_evalcol(int col
){
735 struct a_message_coltab
const *colp
;
740 for(colp
= a_message_coltabs
;
741 PTRCMP(colp
, <, &a_message_coltabs
[n_NELEM(a_message_coltabs
)]);
743 if(colp
->mco_char
== col
){
752 a_message_check(int mno
, int f
){
756 if(mno
< 1 || mno
> msgCount
){
757 n_err(_("%d: Invalid message number\n"), mno
);
759 }else if(((mp
= &message
[mno
- 1])->m_flag
& MHIDDEN
) ||
760 (f
!= MDELETED
&& (mp
->m_flag
& MDELETED
) != 0))
761 n_err(_("%d: inappropriate message\n"), mno
);
769 a_message_scan(char const **sp
)
771 struct a_message_lex
const *lp
;
774 int rv
, c
, inquote
, quotec
;
777 rv
= a_MESSAGE_T_EOL
;
780 cp2
= a_message_lexstr
.s
;
783 /* strip away leading white space */
787 /* If no characters remain, we are at end of line, so report that */
793 /* Select members of a message thread */
795 if(*cp
== '\0' || spacechar(*cp
)){
796 a_message_lexstr
.s
[0] = '.';
797 a_message_lexstr
.s
[1] = '\0';
799 rv
= a_MESSAGE_T_DOT
| INT_MIN
;
806 /* If the leading character is a digit, scan the number and convert it
807 * on the fly. Return a_MESSAGE_T_NUMBER when done */
811 a_message_lexno
= (a_message_lexno
* 10) + c
- '0';
813 }while((c
= *cp
++, digitchar(c
)));
816 rv
|= a_MESSAGE_T_NUMBER
;
820 /* An IMAP SEARCH list. Note that a_MESSAGE_T_OPEN has always been included
821 * in singles[] in Mail and mailx. Thus although there is no formal
822 * definition for (LIST) lists, they do not collide with historical
823 * practice because a subject string (LIST) could never been matched
830 if ((c
= *cp
++&0377) == '\0') {
832 n_err(_("Missing )\n"));
833 rv
= a_MESSAGE_T_ERROR
;
836 if (inquote
&& c
== '\\') {
849 else if (spacechar(c
)) {
850 /* Replace unquoted whitespace by single space characters, to make
851 * the string IMAP SEARCH conformant */
857 } while (c
!= ')' || level
> 0);
860 rv
|= a_MESSAGE_T_OPEN
;
864 /* Check for single character tokens; return such if found */
865 for(lp
= a_message_singles
;
866 PTRCMP(lp
, <, &a_message_singles
[n_NELEM(a_message_singles
)]); ++lp
)
867 if(c
== lp
->ml_char
){
868 a_message_lexstr
.s
[0] = c
;
869 a_message_lexstr
.s
[1] = '\0';
875 /* We've got a string! Copy all the characters of the string into
876 * a_message_lexstr, until we see a null, space, or tab. If the lead
877 * character is a " or ', save it and scan until you get another */
879 if (c
== '\'' || c
== '"') {
884 if (quotec
== 0 && c
== '\\' && *cp
!= '\0')
890 if (quotec
== 0 && blankchar(c
))
892 if (PTRCMP(cp2
- a_message_lexstr
.s
, <, a_message_lexstr
.l
))
896 if (quotec
&& c
== 0) {
897 n_err(_("Missing %c\n"), quotec
);
898 rv
= a_MESSAGE_T_ERROR
;
903 rv
|= a_MESSAGE_T_STRING
;
910 a_message_match_sender(struct message
*mp
, char const *str
, bool_t allnet
){
911 char const *str_base
, *np_base
, *np
;
916 /* Empty string doesn't match */
917 if(*(str_base
= str
) == '\0'){
922 /* *allnet* is POSIX and, since it explicitly mentions login and user names,
923 * most likely case-sensitive. XXX Still allow substr matching, though
924 * XXX possibly the first letter should be case-insensitive, then? */
926 for(np_base
= np
= nameof(mp
, 0);;){
927 if((sc
= *str
++) == '@')
929 if((nc
= *np
++) == '@' || nc
== '\0' || sc
== '\0')
938 /* TODO POSIX says ~"match any address as shown in header overview",
939 * TODO but a normalized match would be more sane i guess.
940 * TODO struct name should gain a comparison method, normalize realname
941 * TODO content (in TODO) and thus match as likewise
942 * TODO "Buddy (Today) <here>" and "(Now) Buddy <here>" */
943 char const *real_base
;
946 real_base
= name1(mp
, 0);
947 again
= ok_blook(showname
);
949 np_base
= np
= again
? realname(real_base
) : skin(real_base
);
953 if((nc
= *np
++) == '\0' || sc
== '\0')
963 /* And really if i want to match 'on@' then i want it to match even if
964 * *showname* is set! */
965 if(!(rv
= (sc
== '\0')) && again
){
976 a_message_match_mid(struct message
*mp
, char const *id
,
977 enum a_message_idfield idfield
){
984 if((cp
= hfield1("message-id", mp
)) != NULL
){
986 case a_MESSAGE_ID_REFERENCES
:
987 if(!msgidcmp(id
, cp
))
990 case a_MESSAGE_ID_IN_REPLY_TO
:{
993 if((np
= extract(id
, GREF
)) != NULL
)
995 if(!msgidcmp(np
->n_name
, cp
)){
999 }while((np
= np
->n_flink
) != NULL
);
1009 a_message_match_dash(struct message
*mp
, char const *str
){
1010 static char lastscan
[128];
1013 char *hfield
, *hbody
;
1022 n_strscpy(lastscan
, str
, sizeof lastscan
); /* XXX use new n_str object! */
1024 /* Now look, ignoring case, for the word in the string */
1025 if(ok_blook(searchheaders
) && (hfield
= strchr(str
, ':'))){
1028 l
= PTR2SIZE(hfield
- str
);
1029 hfield
= ac_alloc(l
+1);
1030 memcpy(hfield
, str
, l
);
1032 hbody
= hfieldX(hfield
, mp
);
1034 hfield
= n_UNCONST(str
+ l
+ 1);
1036 hfield
= n_UNCONST(str
);
1037 hbody
= hfield1("subject", mp
);
1042 in
.l
= strlen(in
.s
= hbody
);
1043 mime_fromhdr(&in
, &out
, TD_ICONV
);
1044 rv
= substr(out
.s
, hfield
);
1052 a_message_match_at(struct message
*mp
, struct search_expr
*sep
){
1060 nfield
= savestr(sep
->ss_where
);
1062 while((cfield
= n_strsep(&nfield
, ',', TRU1
)) != NULL
){
1063 if(!asccasecmp(cfield
, "body") ||
1064 (cfield
[1] == '\0' && cfield
[0] == '>')){
1067 if((rv
= message_match(mp
, sep
, rv
)))
1070 }else if(!asccasecmp(cfield
, "text") ||
1071 (cfield
[1] == '\0' && cfield
[0] == '=')){
1076 if(!asccasecmp(cfield
, "header") ||
1077 (cfield
[1] == '\0' && cfield
[0] == '<')){
1078 if((rv
= header_match(mp
, sep
)))
1083 /* This is not a special name, so take care for the "skin" prefix !
1084 * and possible abbreviations */
1089 if((doskin
= (*cfield
== '~')))
1091 if(cfield
[0] != '\0' && cfield
[1] == '\0'){
1092 char const x
[][8] = {"from", "to", "cc", "bcc", "subject"};
1096 c1
= lowerconv(cfield
[0]);
1097 for(i
= 0; i
< n_NELEM(x
); ++i
){
1104 if((in
.s
= hfieldX(cfield
, mp
)) == NULL
)
1107 /* Shall we split into address list and match the addresses only? */
1109 np
= lextract(in
.s
, GSKIN
);
1115 in
.l
= strlen(in
.s
);
1116 mime_fromhdr(&in
, &out
, TD_ICONV
);
1121 if(sep
->ss_sexpr
== NULL
)
1122 rv
= (regexec(&sep
->ss_regex
, out
.s
, 0,NULL
, 0) != REG_NOMATCH
);
1125 rv
= substr(out
.s
, sep
->ss_sexpr
);
1130 if(np
!= NULL
&& (np
= np
->n_flink
) != NULL
){
1141 a_message_unmark(int mesg
){
1146 if(i
< 1 || UICMP(z
, i
, >, msgCount
))
1147 n_panic(_("Bad message number to unmark"));
1148 message
[--i
].m_flag
&= ~MMARK
;
1153 a_message_metamess(int meta
, int f
)
1161 case '^': /* First 'good' message left */
1162 mp
= mb
.mb_threaded
? threadroot
: message
;
1163 while (PTRCMP(mp
, <, message
+ msgCount
)) {
1164 if (!(mp
->m_flag
& MHIDDEN
) && (mp
->m_flag
& MDELETED
) == (ui32_t
)f
) {
1165 c
= (int)PTR2SIZE(mp
- message
+ 1);
1168 if (mb
.mb_threaded
) {
1169 mp
= next_in_thread(mp
);
1175 if (!(n_pstate
& n_PS_HOOK_MASK
))
1176 n_err(_("No applicable messages\n"));
1179 case '$': /* Last 'good message left */
1181 ? this_in_thread(threadroot
, -1) : message
+ msgCount
- 1;
1182 while (mp
>= message
) {
1183 if (!(mp
->m_flag
& MHIDDEN
) && (mp
->m_flag
& MDELETED
) == (ui32_t
)f
) {
1184 c
= (int)PTR2SIZE(mp
- message
+ 1);
1187 if (mb
.mb_threaded
) {
1188 mp
= prev_in_thread(mp
);
1194 if (!(n_pstate
& n_PS_HOOK_MASK
))
1195 n_err(_("No applicable messages\n"));
1199 /* Current message */
1200 m
= dot
- message
+ 1;
1201 if ((dot
->m_flag
& MHIDDEN
) || (dot
->m_flag
& MDELETED
) != (ui32_t
)f
) {
1202 n_err(_("%d: inappropriate message\n"), m
);
1209 /* Previously current message */
1210 if (prevdot
== NULL
) {
1211 n_err(_("No previously current message\n"));
1214 m
= prevdot
- message
+ 1;
1215 if ((prevdot
->m_flag
& MHIDDEN
) ||
1216 (prevdot
->m_flag
& MDELETED
) != (ui32_t
)f
) {
1217 n_err(_("%d: inappropriate message\n"), m
);
1224 n_err(_("Unknown selector: %c\n"), c
);
1236 a_message__threadmark(struct message
*self
, int f
){
1238 if(!(self
->m_flag
& MHIDDEN
) &&
1239 (f
== MDELETED
|| !(self
->m_flag
& MDELETED
) || a_message_list_saw_d
))
1240 self
->m_flag
|= MMARK
;
1242 if((self
= self
->m_child
) != NULL
){
1244 while((self
= self
->m_younger
) != NULL
)
1245 if(self
->m_child
!= NULL
)
1247 a_message__threadmark(self
, f
);
1249 self
->m_flag
|= MMARK
;
1255 setinput(struct mailbox
*mp
, struct message
*m
, enum needspec need
){
1265 ok
= (m
->m_content_info
& CI_HAVE_HEADER
) ? OKAY
1266 : a_message_get_header(m
);
1269 ok
= (m
->m_content_info
& CI_HAVE_BODY
) ? OKAY
: get_body(m
);
1279 if(fseek(mp
->mb_itf
, (long)mailx_positionof(m
->m_block
, m
->m_offset
),
1281 n_perr(_("fseek"), 0);
1282 n_panic(_("temporary file seek"));
1291 get_body(struct message
*mp
){
1316 message_reset(void){
1318 if(message
!= NULL
){
1323 a_message_mem_space
= 0;
1328 message_append(struct message
*mp
){
1330 if(UICMP(z
, msgCount
+ 1, >=, a_message_mem_space
)){
1331 /* XXX remove _mem_space magics (or use s_Vector) */
1332 a_message_mem_space
= ((a_message_mem_space
>= 128 &&
1333 a_message_mem_space
<= 1000000)
1334 ? a_message_mem_space
<< 1 : a_message_mem_space
+ 64);
1335 message
= srealloc(message
, a_message_mem_space
* sizeof(*message
));
1339 message
[msgCount
- 1] = *mp
;
1341 memset(&message
[msgCount
- 1], 0, sizeof *message
);
1347 message_append_null(void){
1350 message_append(NULL
);
1352 message
[msgCount
].m_size
= 0;
1353 message
[msgCount
].m_lines
= 0;
1358 message_match(struct message
*mp
, struct search_expr
const *sep
,
1359 bool_t with_headers
){
1361 size_t *linesize
, cnt
;
1368 if((fp
= Ftmp(NULL
, "mpmatch", OF_RDWR
| OF_UNLINK
| OF_REGISTER
)) == NULL
)
1371 if(sendmp(mp
, fp
, NULL
, NULL
, SEND_TOSRCH
, NULL
) < 0)
1376 line
= &termios_state
.ts_linebuf
; /* XXX line pool */
1377 linesize
= &termios_state
.ts_linesize
; /* XXX line pool */
1380 while(fgetline(line
, linesize
, &cnt
, NULL
, fp
, 0))
1384 while(fgetline(line
, linesize
, &cnt
, NULL
, fp
, 0)){
1386 if(sep
->ss_sexpr
== NULL
){
1387 if(regexec(&sep
->ss_regex
, *line
, 0,NULL
, 0) == REG_NOMATCH
)
1391 if(!substr(*line
, sep
->ss_sexpr
))
1405 setdot(struct message
*mp
){
1409 n_pstate
&= ~n_PS_DID_PRINT_DOT
;
1412 uncollapse1(dot
, 0);
1418 touch(struct message
*mp
){
1420 mp
->m_flag
|= MTOUCH
;
1421 if(!(mp
->m_flag
& MREAD
))
1422 mp
->m_flag
|= MREAD
| MSTATUS
;
1427 getmsglist(char const *buf
, int *vector
, int flags
)
1433 n_pstate
&= ~n_PS_ARGLIST_MASK
;
1434 a_message_list_last_saw_d
= a_message_list_saw_d
;
1435 a_message_list_saw_d
= FAL0
;
1443 n_pstate
|= n_PS_MSGLIST_DIRECT
;
1445 if(a_message_markall(buf
, flags
) < 0){
1451 if(n_pstate
& n_PS_HOOK_NEWMAIL
){
1453 for(mp
= message
; mp
< &message
[msgCount
]; ++mp
)
1454 if(mp
->m_flag
& MMARK
){
1455 if(!(mp
->m_flag
& MNEWEST
))
1456 a_message_unmark((int)PTR2SIZE(mp
- message
+ 1));
1466 if(mb
.mb_threaded
== 0){
1467 for(mp
= message
; mp
< &message
[msgCount
]; ++mp
)
1468 if(mp
->m_flag
& MMARK
)
1469 *ip
++ = (int)PTR2SIZE(mp
- message
+ 1);
1471 for(mp
= threadroot
; mp
!= NULL
; mp
= next_in_thread(mp
))
1472 if(mp
->m_flag
& MMARK
)
1473 *ip
++ = (int)PTR2SIZE(mp
- message
+ 1);
1476 mc
= (int)PTR2SIZE(ip
- vector
);
1478 n_pstate
&= ~n_PS_MSGLIST_DIRECT
;
1491 if (msgCount
== 0) {
1499 mb
.mb_threaded
? (mp
!= NULL
) : PTRCMP(mp
, <, message
+ msgCount
);
1500 mb
.mb_threaded
? (mp
= next_in_thread(mp
)) : ++mp
) {
1501 if (!(mp
->m_flag
& MHIDDEN
) && (mp
->m_flag
& m
) == (ui32_t
)f
) {
1502 rv
= (int)PTR2SIZE(mp
- message
+ 1);
1507 if (dot
> message
) {
1508 for (mp
= dot
- 1; (mb
.mb_threaded
? (mp
!= NULL
) : (mp
>= message
));
1509 mb
.mb_threaded
? (mp
= prev_in_thread(mp
)) : --mp
) {
1510 if (!(mp
->m_flag
& MHIDDEN
) && (mp
->m_flag
& m
) == (ui32_t
)f
) {
1511 rv
= (int)PTR2SIZE(mp
- message
+ 1);
1523 mark(int mno
, int f
){
1529 if(i
< 1 || i
> msgCount
)
1530 n_panic(_("Bad message number to mark"));
1533 if(mb
.mb_threaded
== 1 && a_message_threadflag
)
1534 a_message__threadmark(mp
, f
);
1536 assert(!(mp
->m_flag
& MHIDDEN
));
1537 mp
->m_flag
|= MMARK
;