HEADER *h;
char *canon_fname;
unsigned header_parsed:1;
-#ifdef USE_INODESORT
- ino_t inode;
-#endif /* USE_INODESORT */
struct maildir *next;
};
entry = p_new(struct maildir, 1);
entry->h = h;
entry->header_parsed = (ctx->magic == M_MH);
-#ifdef USE_INODESORT
- entry->inode = inode;
-#endif /* USE_INODESORT */
**last = entry;
*last = &entry->next;
return r;
}
-#ifdef USE_INODESORT
-/*
- * Merge two maildir lists according to the inode numbers.
- */
-static struct maildir *maildir_merge_inode (struct maildir *left,
- struct maildir *right)
-{
- struct maildir *head;
- struct maildir *tail;
-
- if (left && right) {
- if (left->inode < right->inode) {
- head = left;
- left = left->next;
- }
- else {
- head = right;
- right = right->next;
- }
- }
- else {
- if (left)
- return left;
- else
- return right;
- }
-
- tail = head;
-
- while (left && right) {
- if (left->inode < right->inode) {
- tail->next = left;
- left = left->next;
- }
- else {
- tail->next = right;
- right = right->next;
- }
- tail = tail->next;
- }
-
- if (left) {
- tail->next = left;
- }
- else {
- tail->next = right;
- }
-
- return head;
-}
-
-/*
- * Sort maildir list according to inode.
- */
-static struct maildir *maildir_sort_inode (struct maildir *list)
-{
- struct maildir *left = list;
- struct maildir *right = list;
-
- if (!list || !list->next) {
- return list;
- }
-
- list = list->next;
- while (list && list->next) {
- right = right->next;
- list = list->next->next;
- }
-
- list = right;
- right = right->next;
- list->next = 0;
-
- left = maildir_sort_inode (left);
- right = maildir_sort_inode (right);
- return maildir_merge_inode (left, right);
-}
-#endif /* USE_INODESORT */
-
#ifdef USE_HCACHE
static size_t maildir_hcache_keylen (const char *fn)
{
mhs_free_sequences (&mhs);
}
-#ifdef USE_INODESORT
- md = maildir_sort_inode (md);
-#endif /* USE_INODESORT */
-
if (ctx->magic == M_MAILDIR)
maildir_delayed_parsing (ctx, md);