From cdbac47f9d811eb077c405ceecc6f84a0f8504af Mon Sep 17 00:00:00 2001 From: Matthias Andree Date: Mon, 24 May 2010 22:29:53 +0200 Subject: UIDL database speedup with Patricia trees. Import Rainer Weikusat's code that uses Patricia trees instead of linear lists. Snapshot Rainer's patch 2010-05-24 19:30:42 --- fetchmail.h | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) (limited to 'fetchmail.h') diff --git a/fetchmail.h b/fetchmail.h index f14d51d4..98f07742 100644 --- a/fetchmail.h +++ b/fetchmail.h @@ -39,6 +39,8 @@ struct addrinfo; # include "trio/trio.h" #endif +#include "uid_db.h" + /* We need this for strstr */ #if !defined(HAVE_STRSTR) && !defined(strstr) char *strstr(const char *, const char *); @@ -389,8 +391,7 @@ struct query int smtp_socket; /* socket descriptor for SMTP connection */ unsigned int uid; /* UID of user to deliver to */ struct idlist *skipped; /* messages skipped on the mail server */ - struct idlist *oldsaved, *newsaved; - struct idlist **oldsavedend; + struct uid_db oldsaved, newsaved; char lastdigest[DIGESTLEN]; /* last MD5 hash seen on this connection */ char *folder; /* folder currently being polled */ -- cgit v1.2.3