2 * Copyright (C) 1996-2000 Michael R. Elkins <me@mutt.org>
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License as published by
6 * the Free Software Foundation; either version 2 of the License, or
7 * (at your option) any later version.
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write to the Free Software
16 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA.
25 #include "mutt_idna.h"
32 #define SORTCODE(x) (Sort & SORT_REVERSE) ? -(x) : x
34 /* function to use as discriminator when normal sort method is equal */
35 static sort_t *AuxSort = NULL;
37 #define AUXSORT(code,a,b) if (!code && AuxSort && !option(OPTAUXSORT)) { \
38 set_option(OPTAUXSORT); \
39 code = AuxSort(a,b); \
40 unset_option(OPTAUXSORT); \
43 code = (*((HEADER **)a))->index - (*((HEADER **)b))->index;
45 int compare_score (const void *a, const void *b)
47 HEADER **pa = (HEADER **) a;
48 HEADER **pb = (HEADER **) b;
49 int result = (*pb)->score - (*pa)->score; /* note that this is reverse */
51 return (SORTCODE (result));
54 int compare_size (const void *a, const void *b)
56 HEADER **pa = (HEADER **) a;
57 HEADER **pb = (HEADER **) b;
58 int result = (*pa)->content->length - (*pb)->content->length;
60 return (SORTCODE (result));
63 int compare_date_sent (const void *a, const void *b)
65 HEADER **pa = (HEADER **) a;
66 HEADER **pb = (HEADER **) b;
67 int result = (*pa)->date_sent - (*pb)->date_sent;
69 return (SORTCODE (result));
72 int compare_subject (const void *a, const void *b)
74 HEADER **pa = (HEADER **) a;
75 HEADER **pb = (HEADER **) b;
78 if (!(*pa)->env->real_subj)
80 if (!(*pb)->env->real_subj)
81 rc = compare_date_sent (pa, pb);
85 else if (!(*pb)->env->real_subj)
88 rc = mutt_strcasecmp ((*pa)->env->real_subj, (*pb)->env->real_subj);
90 return (SORTCODE (rc));
93 const char *mutt_get_name (ADDRESS *a)
96 const char * name = "";
100 if (option (OPTREVALIAS) && (ali = alias_reverse_lookup (a)) && ali->personal)
101 name = ali->personal;
102 else if (a->personal)
105 name = (mutt_addr_for_display (a));
107 /* don't return NULL to avoid segfault when printing/comparing */
111 int compare_to (const void *a, const void *b)
113 HEADER **ppa = (HEADER **) a;
114 HEADER **ppb = (HEADER **) b;
119 /* mutt_get_name() will sometimes return a pointer to a static buffer.
120 * On the next call that pointer may get smashed so we copy the return value
121 * to our own memory space. */
123 strncpy(fa,mutt_get_name ((*ppa)->env->to),sizeof(fa));
124 fa[sizeof(fa)-1] = '\0';
126 strncpy(fb,mutt_get_name ((*ppb)->env->to),sizeof(fb));
127 fb[sizeof(fb)-1] = '\0';
129 result = mutt_strcasecmp (fa, fb);
131 return (SORTCODE (result));
134 int compare_from (const void *a, const void *b)
136 HEADER **ppa = (HEADER **) a;
137 HEADER **ppb = (HEADER **) b;
142 /* mutt_get_name() will sometimes return a pointer to a static buffer.
143 * On the next call that pointer may get smashed so we copy the return value
144 * to our own memory space. */
146 strncpy(fa,mutt_get_name ((*ppa)->env->from),sizeof(fa));
147 fa[sizeof(fa)-1] = '\0';
149 strncpy(fb,mutt_get_name ((*ppb)->env->from),sizeof(fb));
150 fb[sizeof(fb)-1] = '\0';
152 result = mutt_strcasecmp (fa, fb);
154 return (SORTCODE (result));
157 int compare_date_received (const void *a, const void *b)
159 HEADER **pa = (HEADER **) a;
160 HEADER **pb = (HEADER **) b;
161 int result = (*pa)->received - (*pb)->received;
163 return (SORTCODE (result));
166 int compare_order (const void *a, const void *b)
168 HEADER **ha = (HEADER **) a;
169 HEADER **hb = (HEADER **) b;
172 if ((*ha)->article_num && (*hb)->article_num)
174 int result = (*ha)->article_num - (*hb)->article_num;
176 return (SORTCODE (result));
180 /* no need to auxsort because you will never have equality here */
181 return (SORTCODE ((*ha)->index - (*hb)->index));
184 int compare_spam (const void *a, const void *b)
186 HEADER **ppa = (HEADER **) a;
187 HEADER **ppb = (HEADER **) b;
192 /* Firstly, require spam attributes for both msgs */
193 /* to compare. Determine which msgs have one. */
194 ahas = (*ppa)->env && (*ppa)->env->spam;
195 bhas = (*ppb)->env && (*ppb)->env->spam;
197 /* If one msg has spam attr but other does not, sort the one with first. */
199 return (SORTCODE(1));
201 return (SORTCODE(-1));
203 /* Else, if neither has a spam attr, presume equality. Fall back on aux. */
206 AUXSORT(result, a, b);
207 return (SORTCODE(result));
211 /* Both have spam attrs. */
213 /* preliminary numeric examination */
214 result = (strtoul((*ppa)->env->spam->data, &aptr, 10) -
215 strtoul((*ppb)->env->spam->data, &bptr, 10));
217 /* If either aptr or bptr is equal to data, there is no numeric */
218 /* value for that spam attribute. In this case, compare lexically. */
219 if ((aptr == (*ppa)->env->spam->data) || (bptr == (*ppb)->env->spam->data))
220 return (SORTCODE(strcmp(aptr, bptr)));
222 /* Otherwise, we have numeric value for both attrs. If these values */
223 /* are equal, then we first fall back upon string comparison, then */
224 /* upon auxiliary sort. */
227 result = strcmp(aptr, bptr);
229 AUXSORT(result, a, b);
232 return (SORTCODE(result));
235 sort_t *mutt_get_sort_func (int method)
237 switch (method & SORT_MASK)
240 return (compare_date_received);
242 return (compare_order);
244 return (compare_date_sent);
246 return (compare_subject);
248 return (compare_from);
250 return (compare_size);
254 return (compare_score);
256 return (compare_spam);
263 void mutt_sort_headers (CONTEXT *ctx, int init)
267 THREAD *thread, *top;
270 unset_option (OPTNEEDRESORT);
277 /* this function gets called by mutt_sync_mailbox(), which may have just
278 * deleted all the messages. the virtual message numbers are not updated
279 * in that routine, so we must make sure to zero the vcount member.
282 mutt_clear_threads (ctx);
283 return; /* nothing to do! */
287 mutt_message _("Sorting mailbox...");
289 if (option (OPTNEEDRESCORE) && option (OPTSCORE))
291 for (i = 0; i < ctx->msgcount; i++)
292 mutt_score_message (ctx, ctx->hdrs[i], 1);
294 unset_option (OPTNEEDRESCORE);
296 if (option (OPTRESORTINIT))
298 unset_option (OPTRESORTINIT);
302 if (init && ctx->tree)
303 mutt_clear_threads (ctx);
305 if ((Sort & SORT_MASK) == SORT_THREADS)
308 /* if $sort_aux changed after the mailbox is sorted, then all the
309 subthreads need to be resorted */
310 if (option (OPTSORTSUBTHREADS))
315 ctx->tree = mutt_sort_subthreads (ctx->tree, 1);
317 unset_option (OPTSORTSUBTHREADS);
319 mutt_sort_threads (ctx, init);
321 else if ((sortfunc = mutt_get_sort_func (Sort)) == NULL ||
322 (AuxSort = mutt_get_sort_func (SortAux)) == NULL)
324 mutt_error _("Could not find sorting function! [report this bug]");
329 qsort ((void *) ctx->hdrs, ctx->msgcount, sizeof (HEADER *), sortfunc);
331 /* adjust the virtual message numbers */
333 for (i = 0; i < ctx->msgcount; i++)
335 HEADER *cur = ctx->hdrs[i];
336 if (cur->virtual != -1 || (cur->collapsed && (!ctx->pattern || cur->limited)))
338 cur->virtual = ctx->vcount;
339 ctx->v2r[ctx->vcount] = i;
345 /* re-collapse threads marked as collapsed */
346 if ((Sort & SORT_MASK) == SORT_THREADS)
349 while ((thread = top) != NULL)
351 while (!thread->message)
352 thread = thread->child;
356 mutt_collapse_thread (ctx, h);
359 mutt_set_virtual (ctx);