2 * pop3.c -- POP3 protocol methods
4 * Copyright 1998 by Eric S. Raymond.
5 * For license terms, see the file COPYING in this directory.
13 #if defined(HAVE_UNISTD_H)
16 #if defined(STDC_HEADERS)
20 #include "fetchmail.h"
26 #endif /* OPIE_ENABLE */
28 #ifndef strstr /* glibc-2.1 declares this as a macro */
29 extern char *strstr(); /* needed on sysV68 R3V7.1. */
36 #endif /* SDPS_ENABLE */
39 static char lastok[POPBUFSIZE+1];
40 #endif /* OPIE_ENABLE */
42 #define DOTLINE(s) (s[0] == '.' && (s[1]=='\r'||s[1]=='\n'||s[1]=='\0'))
44 int pop3_ok (int sock, char *argbuf)
45 /* parse command response */
48 char buf [POPBUFSIZE+1];
51 if ((ok = gen_recv(sock, buf, sizeof(buf))) == 0)
54 if (*bufp == '+' || *bufp == '-')
59 while (isalpha(*bufp))
65 if (strcmp(buf,"+OK") == 0)
69 #endif /* OPIE_ENABLE */
72 else if (strncmp(buf,"-ERR", 4) == 0)
74 if (stage > STAGE_GETAUTH)
77 * We're checking for "lock busy", "unable to lock",
78 * "already locked", "wait a few minutes" etc. here.
79 * This indicates that we have to wait for the server to
80 * unwedge itself before we can poll again.
82 * PS_LOCKBUSY check empirically verified with two recent
83 * versions of the Berkeley popper; QPOP (version 2.2) and
84 * QUALCOMM Pop server derived from UCB (version 2.1.4-R3)
85 * These are caught by the case-indifferent "lock" check.
86 * The "wait" catches "mail storage services unavailable,
87 * wait a few minutes and try again" on the InterMail server.
89 * If these aren't picked up on correctly, fetchmail will
90 * think there is an authentication failure and wedge the
91 * connection in order to prevent futile polls.
95 else if (strstr(bufp,"lock")
96 || strstr(bufp,"Lock")
97 || strstr(bufp,"LOCK")
98 || strstr(bufp,"wait")
99 /* these are blessed by RFC 2449 */
100 || strstr(bufp,"[IN-USE]")||strstr(bufp,"[LOGIN-DELAY]"))
105 * We always want to pass the user lock-busy messages, because
106 * they're red flags. Other stuff (like AUTH failures on non-
107 * RFC1734 servers) only if we're debugging.
109 if (*bufp && (ok == PS_LOCKBUSY || outlevel >= O_MONITOR))
110 report(stderr, "%s\n", bufp);
122 int pop3_getauth(int sock, struct query *ctl, char *greeting)
123 /* apply for connection authorization */
130 #endif /* OPIE_ENABLE */
134 * This needs to catch both demon.co.uk and demon.net.
135 * If we see either, and we're in multidrop mode, try to use
136 * the SDPS *ENV extension.
138 if (!(ctl->server.sdps) && MULTIDROP(ctl) && strstr(greeting, "demon."))
139 ctl->server.sdps = TRUE;
140 #endif /* SDPS_ENABLE */
142 switch (ctl->server.protocol) {
145 /* CompuServe POP3 Servers as of 990730 want AUTH first for RPA */
146 if (strstr(ctl->remotename, "@compuserve.com"))
148 /* AUTH command should return a list of available mechanisms */
149 if (gen_transact(sock, "AUTH") == 0)
152 flag has_rpa = FALSE;
154 while ((ok = gen_recv(sock, buffer, sizeof(buffer))) == 0)
158 if (strncasecmp(buffer, "rpa", 3) == 0)
161 if (has_rpa && !POP3_auth_rpa(ctl->remotename,
162 ctl->password, sock))
168 #endif /* RPA_ENABLE */
171 * CAPA command may return a list including available
172 * authentication mechanisms. if it doesn't, no harm done, we
173 * just fall back to a plain login. Note that this code
174 * latches the server's authentication type, so that in daemon mode
175 * the CAPA check only needs to be done once at start of run.
177 * APOP was introduced in RFC 1450, and CAPA not until
178 * RFC2449. So the < check is an easy way to prevent CAPA from
179 * being sent to the more primitive POP3 servers dating from
180 * RFC 1081 and RFC 1225, which seem more likely to choke on
181 * it. This certainly catches IMAP-2000's POP3 gateway.
183 * These authentication methods are blessed by RFC1734,
184 * describing the POP3 AUTHentication command.
186 if (ctl->server.authenticate == A_ANY
187 && strchr(greeting, '<')
188 && gen_transact(sock, "CAPA") == 0)
191 flag has_gssapi = FALSE;
192 #endif /* defined(GSSAPI) */
193 #if defined(KERBEROS_V4) || defined(KERBEROS_V5)
194 flag has_kerberos = FALSE;
195 #endif /* defined(KERBEROS_V4) || defined(KERBEROS_V5) */
196 flag has_cram = FALSE;
198 flag has_opie = FALSE;
199 #endif /* OPIE_ENABLE */
202 /* determine what authentication methods we have available */
203 while ((ok = gen_recv(sock, buffer, sizeof(buffer))) == 0)
208 if (strstr(buffer, "GSSAPI"))
210 #endif /* defined(GSSAPI) */
211 #if defined(KERBEROS_V4) || defined(KERBEROS_V5)
212 if (strstr(buffer, "KERBEROS_V4"))
214 #endif /* defined(KERBEROS_V4) || defined(KERBEROS_V5) */
216 if (strstr(buffer, "X-OTP"))
218 #endif /* OPIE_ENABLE */
219 if (strstr(buffer, "CRAM-MD5"))
224 * Here's where we set priorities. Note that we must do tests
225 * in *reverse* order of desirability.
228 ctl->server.authenticate = A_CRAM_MD5;
231 ctl->server.authenticate = A_OTP;
232 #endif /* OPIE_ENABLE */
235 ctl->server.authenticate = A_GSSAPI;
236 #endif /* defined(GSSAPI) */
237 #if defined(KERBEROS_V4) || defined(KERBEROS_V5)
239 ctl->server.authenticate = A_KERBEROS_V4;
240 #endif /* defined(KERBEROS_V4) || defined(KERBEROS_V5) */
244 * OK, we have an authentication type now.
246 #if defined(KERBEROS_V4) || defined(KERBEROS_V5)
247 if (ctl->server.authenticate == A_KERBEROS_V4
248 || ctl->server.authenticate == A_KERBEROS_V5)
249 return(do_rfc1731(sock, "AUTH", ctl->server.truename));
250 #endif /* defined(KERBEROS_V4) || defined(KERBEROS_V5) */
252 if (ctl->server.authenticate==A_GSSAPI))
253 return(do_gssauth(sock, "AUTH",
254 ctl->server.truename, ctl->remotename));
255 #endif /* defined(GSSAPI) */
257 if (ctl->server.authenticate == A_OTP)
258 do_otp(sock, "AUTH", ctl)
259 #endif /* OPIE_ENABLE */
260 if (ctl->server.authenticate == A_CRAM_MD5)
261 return(do_cram_md5(sock, "AUTH", ctl));
263 /* ordinary validation, no one-time password or RPA */
264 gen_transact(sock, "USER %s", ctl->remotename);
265 ok = gen_transact(sock, "PASS %s", ctl->password);
269 /* build MD5 digest from greeting timestamp + password */
270 /* find start of timestamp */
271 for (start = greeting; *start != 0 && *start != '<'; start++)
275 _("Required APOP timestamp not found in greeting\n"));
279 /* find end of timestamp */
280 for (end = start; *end != 0 && *end != '>'; end++)
282 if (*end == 0 || end == start + 1) {
284 _("Timestamp syntax error in greeting\n"));
290 /* copy timestamp and password into digestion buffer */
291 xalloca(msg, char *, (end-start+1) + strlen(ctl->password) + 1);
293 strcat(msg,ctl->password);
295 strcpy(ctl->digest, MD5Digest((unsigned char *)msg));
297 ok = gen_transact(sock, "APOP %s %s", ctl->remotename, ctl->digest);
301 if ((ok = gen_transact(sock,"USER %s", ctl->remotename)) == 0)
302 ok = gen_transact(sock, "RPOP %s", ctl->password);
306 report(stderr, _("Undefined protocol request in POP3_auth\n"));
312 /* maybe we detected a lock-busy condition? */
313 if (ok == PS_LOCKBUSY)
314 report(stderr, _("lock busy! Is another session active?\n"));
320 * Empirical experience shows some server/OS combinations
321 * may need a brief pause even after any lockfiles on the
322 * server are released, to give the server time to finish
323 * copying back very large mailfolders from the temp-file...
324 * this is only ever an issue with extremely large mailboxes.
326 sleep(3); /* to be _really_ safe, probably need sleep(5)! */
328 /* we're peek-capable if use of TOP is enabled */
329 peek_capable = !(ctl->fetchall || ctl->keep);
336 pop3_gettopid( int sock, int num , char *id)
340 char buf [POPBUFSIZE+1];
341 sprintf( buf, "TOP %d 1", num );
342 if ((ok = gen_transact(sock, buf )) != 0)
345 while ((ok = gen_recv(sock, buf, sizeof(buf))) == 0)
349 if ( ! got_it && ! strncasecmp("Message-Id:", buf, 11 )) {
351 /* prevent stack overflows */
353 sscanf( buf+12, "%s", id);
360 pop3_slowuidl( int sock, struct query *ctl, int *countp, int *newp)
362 /* This approach tries to get the message headers from the
363 * remote hosts and compares the message-id to the already known
365 * + if the first message containes a new id, all messages on
366 * the server will be new
367 * + if the first is known, try to estimate the last known message
368 * on the server and check. If this works you know the total number
369 * of messages to get.
370 * + Otherwise run a binary search to determine the last known message
372 int ok, nolinear = 0;
373 int first_nr, list_len, try_id, try_nr, add_id;
377 if( (ok = pop3_gettopid( sock, 1, id )) != 0 )
380 if( ( first_nr = str_nr_in_list(&ctl->oldsaved, id) ) == -1 ) {
381 /* the first message is unknown -> all messages are new */
386 /* check where we expect the latest known message */
387 list_len = count_list( &ctl->oldsaved );
388 try_id = list_len - first_nr; /* -1 + 1 */
390 if( try_id <= *countp ) {
391 if( (ok = pop3_gettopid( sock, try_id, id )) != 0 )
394 try_nr = str_nr_last_in_list(&ctl->oldsaved, id);
399 if( try_nr != list_len -1 ) {
400 /* some messages inbetween have been deleted... */
404 for( add_id = 1<<30; add_id > try_id-1; add_id >>= 1 )
406 for( ; add_id; add_id >>= 1 ) {
408 if( try_id - add_id <= 1 ) {
415 if( (ok = pop3_gettopid( sock, try_id, id )) != 0 )
417 try_nr = str_nr_in_list(&ctl->oldsaved, id);
424 _("Messages inserted into list on server. Cannot handle this.\n"));
429 /* the first try_id messages are known -> copy them to the newsaved list */
430 for( num = first_nr; num < list_len; num++ )
432 struct idlist *new = save_str(&ctl->newsaved,
433 str_from_nr_list(&ctl->oldsaved, num),
435 new->val.status.num = num - first_nr + 1;
439 free_str_list(&ctl->oldsaved);
444 *newp = *countp - try_id;
448 static int pop3_getrange(int sock,
451 int *countp, int *newp, int *bytes)
452 /* get range of messages to be fetched */
455 char buf [POPBUFSIZE+1];
457 /* Ensure that the new list is properly empty */
458 ctl->newsaved = (struct idlist *)NULL;
461 /* Alain Knaff suggests this, but it's not RFC standard */
463 if ((ok = gen_transact(sock, "MBOX %s", folder)))
467 /* get the total message count */
468 gen_send(sock, "STAT");
469 ok = pop3_ok(sock, buf);
471 sscanf(buf,"%d %d", countp, bytes);
476 * Newer, RFC-1725-conformant POP servers may not have the LAST command.
477 * We work as hard as possible to hide this ugliness, but it makes
478 * counting new messages intrinsically quadratic in the worst case.
482 if (*countp > 0 && !ctl->fetchall)
486 if (!ctl->server.uidl) {
487 gen_send(sock, "LAST");
488 ok = pop3_ok(sock, buf);
493 if (sscanf(buf, "%d", &last) == 0)
495 report(stderr, _("protocol error\n"));
498 *newp = (*countp - last);
502 /* grab the mailbox's UID list */
503 if ((ok = gen_transact(sock, "UIDL")) != 0)
505 /* don't worry, yet! do it the slow way */
506 if((ok = pop3_slowuidl( sock, ctl, countp, newp))!=0)
508 report(stderr, _("protocol error while fetching UIDLs\n"));
517 while ((ok = gen_recv(sock, buf, sizeof(buf))) == 0)
521 else if (sscanf(buf, "%d %s", &num, id) == 2)
525 new = save_str(&ctl->newsaved, id, UID_UNSEEN);
526 new->val.status.num = num;
528 if (str_in_list(&ctl->oldsaved, id, FALSE)) {
529 new->val.status.mark = UID_SEEN;
530 str_set_mark(&ctl->oldsaved, id, UID_SEEN);
543 static int pop3_getsizes(int sock, int count, int *sizes)
544 /* capture the sizes of all messages */
548 if ((ok = gen_transact(sock, "LIST")) != 0)
552 char buf [POPBUFSIZE+1];
554 while ((ok = gen_recv(sock, buf, sizeof(buf))) == 0)
560 else if (sscanf(buf, "%d %d", &num, &size) == 2)
561 sizes[num - 1] = size;
568 static int pop3_is_old(int sock, struct query *ctl, int num)
569 /* is the given message old? */
572 return (num <= last);
574 return (str_in_list(&ctl->oldsaved,
575 str_find(&ctl->newsaved, num), FALSE));
580 * We could use this to fetch headers only as we do for IMAP. The trouble
581 * is that there's no way to fetch the body only. So the following RETR
582 * would have to re-fetch the header. Enough messages have longer headers
583 * than bodies to make this a net loss.
585 static int pop_fetch_headers(int sock, struct query *ctl,int number,int *lenp)
586 /* request headers of nth message */
589 char buf[POPBUFSIZE+1];
591 gen_send(sock, "TOP %d 0", number);
592 if ((ok = pop3_ok(sock, buf)) != 0)
595 *lenp = -1; /* we got sizes from the LIST response */
601 static int pop3_fetch(int sock, struct query *ctl, int number, int *lenp)
602 /* request nth message */
605 char buf[POPBUFSIZE+1];
609 * See http://www.demon.net/services/mail/sdps-tech.html
610 * for a description of what we're parsing here.
612 if (ctl->server.sdps)
616 sdps_envfrom = (char *)NULL;
617 sdps_envto = (char *)NULL;
618 gen_send(sock, "*ENV %d", number);
620 if (gen_recv(sock, buf, sizeof(buf)))
627 /* No need to wrap envelope from address */
628 sdps_envfrom = xmalloc(strlen(buf)+1);
629 strcpy(sdps_envfrom,buf);
632 /* Wrap address with To: <> so nxtaddr() likes it */
633 sdps_envto = xmalloc(strlen(buf)+7);
634 sprintf(sdps_envto,"To: <%s>",buf);
638 (!(buf[0] == '.' && (buf[1] == '\r' || buf[1] == '\n' || buf[1] == '\0')));
640 #endif /* SDPS_ENABLE */
643 * Though the POP RFCs don't document this fact, on almost every
644 * POP3 server I know of messages are marked "seen" only at the
645 * time the OK response to a RETR is issued.
647 * This means we can use TOP to fetch the message without setting its
648 * seen flag. This is good! It means that if the protocol exchange
649 * craps out during the message, it will still be marked `unseen' on
650 * the server. (Exception: in early 1999 SpryNet's POP3 servers were
651 * reported to mark messages seen on a TOP fetch.)
653 * However...*don't* do this if we're using keep to suppress deletion!
654 * In that case, marking the seen flag is the only way to prevent the
655 * message from being re-fetched on subsequent runs.
657 * Also use RETR if fetchall is on. This gives us a workaround
658 * for servers like usa.net's that bungle TOP. It's pretty
659 * harmless because fetchall guarantees that any message dropped
660 * by an interrupted RETR will be picked up on the next poll of the
663 * We take advantage here of the fact that, according to all the
664 * POP RFCs, "if the number of lines requested by the POP3 client
665 * is greater than than the number of lines in the body, then the
666 * POP3 server sends the entire message.").
668 * The line count passed (99999999) is the maximum value CompuServe will
669 * accept; it's much lower than the natural value 2147483646 (the maximum
670 * twos-complement signed 32-bit integer minus 1) */
671 if (ctl->keep || ctl->fetchall)
672 gen_send(sock, "RETR %d", number);
674 gen_send(sock, "TOP %d 99999999", number);
675 if ((ok = pop3_ok(sock, buf)) != 0)
678 *lenp = -1; /* we got sizes from the LIST response */
683 static int pop3_delete(int sock, struct query *ctl, int number)
684 /* delete a given message */
686 /* actually, mark for deletion -- doesn't happen until QUIT time */
687 return(gen_transact(sock, "DELE %d", number));
690 static int pop3_logout(int sock, struct query *ctl)
691 /* send logout command */
695 ok = gen_transact(sock, "QUIT");
708 const static struct method pop3 =
710 "POP3", /* Post Office Protocol v3 */
712 "pop3", /* standard POP3 port */
713 "pop3s", /* ssl POP3 port */
714 #else /* INET6_ENABLE */
715 110, /* standard POP3 port */
716 995, /* ssl POP3 port */
717 #endif /* INET6_ENABLE */
718 FALSE, /* this is not a tagged protocol */
719 TRUE, /* this uses a message delimiter */
720 pop3_ok, /* parse command response */
721 NULL, /* no password canonicalization */
722 pop3_getauth, /* get authorization */
723 pop3_getrange, /* query range of messages */
724 pop3_getsizes, /* we can get a list of sizes */
725 pop3_is_old, /* how do we tell a message is old? */
726 pop3_fetch, /* request given message */
727 NULL, /* no way to fetch body alone */
728 NULL, /* no message trailer */
729 pop3_delete, /* how to delete a message */
730 pop3_logout, /* log out, we're done */
731 FALSE, /* no, we can't re-poll */
734 int doPOP3 (struct query *ctl)
735 /* retrieve messages using POP3 */
738 if (ctl->mailboxes->id) {
739 fprintf(stderr,_("Option --remote is not supported with POP3\n"));
743 peek_capable = !ctl->fetchall;
744 return(do_protocol(ctl, &pop3));
746 #endif /* POP3_ENABLE */
748 /* pop3.c ends here */