#include <h/mh.h>
#include <h/tws.h>
+#include "h/done.h"
#include <h/utils.h>
#include "sbr/m_maildir.h"
/*
* sort a list of pointers to our "messages to be sorted".
*/
- dlist = (struct smsg **) mh_xmalloc ((nmsgs+1) * sizeof(*dlist));
+ dlist = mh_xmalloc ((nmsgs+1) * sizeof(*dlist));
for (i = 0; i < nmsgs; i++)
dlist[i] = &smsgs[i];
dlist[nmsgs] = 0;
}
/* first sort by date, or by subject-major, date-minor */
- qsort ((char *) dlist, nmsgs, sizeof(*dlist),
+ qsort (dlist, nmsgs, sizeof(*dlist),
(qsort_comp) (submajor && subjsort ? txtsort : dsort));
/*
struct smsg **slist, **flist;
struct smsg ***il, **fp, **dp;
- slist = (struct smsg **) mh_xmalloc ((nmsgs+1) * sizeof(*slist));
- memcpy((char *)slist, (char *)dlist, (nmsgs+1)*sizeof(*slist));
- qsort((char *)slist, nmsgs, sizeof(*slist), (qsort_comp) subsort);
+ slist = mh_xmalloc ((nmsgs+1) * sizeof(*slist));
+ memcpy(slist, dlist, (nmsgs+1)*sizeof(*slist));
+ qsort(slist, nmsgs, sizeof(*slist), (qsort_comp) subsort);
/*
* make an inversion list so we can quickly find
* make up the final list, chronological but with
* all the same subjects grouped together.
*/
- flist = (struct smsg **) mh_xmalloc ((nmsgs+1) * sizeof(*flist));
+ flist = mh_xmalloc ((nmsgs+1) * sizeof(*flist));
fp = flist;
for (dp = dlist; *dp;) {
struct smsg **s = il[(*dp++)->s_msg];
}
}
s->s_msg = 0;
- return(s - smsgs);
+ return s - smsgs;
}
if ((in = fopen (msgnam = m_name (msg), "r")) == NULL) {
admonish (msgnam, "unable to read message");
- return (0);
+ return 0;
}
gstate = m_getfld_state_init(in);
for (compnum = 1;;) {
free(datecomp);
free(subjcomp);
fclose (in);
- return (0);
+ return 0;
default:
adios (NULL, "internal error -- you lose");
fclose (in);
free(datecomp);
- return (1);
+ return 1;
}
/*
dsort (struct smsg **a, struct smsg **b)
{
if ((*a)->s_clock < (*b)->s_clock)
- return (-1);
+ return -1;
if ((*a)->s_clock > (*b)->s_clock)
- return (1);
+ return 1;
if ((*a)->s_msg < (*b)->s_msg)
- return (-1);
- return (1);
+ return -1;
+ return 1;
}
/*
int i;
if ((i = strcmp ((*a)->s_subj, (*b)->s_subj)))
- return (i);
+ return i;
- return (dsort (a, b));
+ return dsort(a, b);
}
static int
int i;
if ((i = strcmp ((*a)->s_subj, (*b)->s_subj)))
- return (i);
+ return i;
if ((*a)->s_msg < (*b)->s_msg)
- return (-1);
- return (1);
+ return -1;
+ return 1;
}
static void