Sorting API

Prototype for generic comparison function, compatible with qsort_r() More...

Functions
static int	alias_sort_alias (const void *a, const void *b, void *sdata)
	Compare two Aliases by their short names - Implements sort_t -.
static int	alias_sort_email (const void *a, const void *b, void *sdata)
	Compare two Aliases by their Email Addresses - Implements sort_t -.
static int	alias_sort_name (const void *a, const void *b, void *sdata)
	Compare two Aliases by their Names - Implements sort_t -.
static int	alias_sort_unsorted (const void *a, const void *b, void *sdata)
	Compare two Aliases by their original configuration position - Implements sort_t -.
static int	browser_sort_subject (const void *a, const void *b, void *sdata)
	Compare two browser entries by their subject - Implements sort_t -.
static int	browser_sort_unsorted (const void *a, const void *b, void *sdata)
	Compare two browser entries by their order - Implements sort_t -.
static int	browser_sort_desc (const void *a, const void *b, void *sdata)
	Compare two browser entries by their descriptions - Implements sort_t -.
static int	browser_sort_date (const void *a, const void *b, void *sdata)
	Compare two browser entries by their date - Implements sort_t -.
static int	browser_sort_size (const void *a, const void *b, void *sdata)
	Compare two browser entries by their size - Implements sort_t -.
static int	browser_sort_count (const void *a, const void *b, void *sdata)
	Compare two browser entries by their message count - Implements sort_t -.
static int	browser_sort_new (const void *a, const void *b, void *sdata)
	Compare two browser entries by their new count - Implements sort_t -.
static int	browser_sort_helper (const void *a, const void *b, void *sdata)
	Helper to sort the items in the browser - Implements sort_t -.
static int	envlist_sort (const void *a, const void *b, void *sdata)
	Compare two environment strings - Implements sort_t -.
static int	label_sort (const void *a, const void *b, void *sdata)
	Compare two label strings - Implements sort_t -.
int	elem_list_sort (const void *a, const void *b, void *sdata)
	Compare two HashElem pointers to config - Implements sort_t -.
static int	commands_sort (const void *a, const void *b, void *sdata)
	Compare two commands by name - Implements sort_t -.
static int	email_sort_shim (const void *a, const void *b, void *sdata)
	Helper to sort emails - Implements sort_t -.
int	mutt_compare_emails (const struct Email *a, const struct Email *b, enum MailboxType type, short sort, short sort_aux)
	Compare two emails using up to two sort methods -.
static int	imap_sort_email_uid (const void *a, const void *b, void *sdata)
	Compare two Emails by UID - Implements sort_t -.
int	imap_sort_uid (const void *a, const void *b, void *sdata)
	Compare two UIDs - Implements sort_t -.
static int	maildir_sort_inode (const void *a, const void *b, void *sdata)
	Compare two Maildirs by inode number - Implements sort_t -.
static int	maildir_sort_flags (const void *a, const void *b, void *sdata)
	Compare two flag characters - Implements sort_t -.
static int	mh_sort_path (const void *a, const void *b, void *sdata)
	Compare two Mh Mailboxes by path - Implements sort_t -.
int	mutt_str_inbox_cmp (const char *a, const char *b)
	Do two folders share the same path and one is an inbox -.
static int	compare_threads (const void *a, const void *b, void *sdata)
	Helper to sort email threads - Implements sort_t -.
static int	crypt_sort_address (const void *a, const void *b, void *sdata)
	Compare two keys by their addresses - Implements sort_t -.
static int	crypt_sort_keyid (const void *a, const void *b, void *sdata)
	Compare two keys by their IDs - Implements sort_t -.
static int	crypt_sort_date (const void *a, const void *b, void *sdata)
	Compare two keys by their dates - Implements sort_t -.
static int	crypt_sort_trust (const void *a, const void *b, void *sdata)
	Compare two keys by their trust levels - Implements sort_t -.
static int	pgp_sort_address (const void *a, const void *b, void *sdata)
	Compare two keys by their addresses - Implements sort_t -.
static int	pgp_sort_date (const void *a, const void *b, void *sdata)
	Compare two keys by their dates - Implements sort_t -.
static int	pgp_sort_keyid (const void *a, const void *b, void *sdata)
	Compare two keys by their IDs - Implements sort_t -.
static int	pgp_sort_trust (const void *a, const void *b, void *sdata)
	Compare two keys by their trust levels - Implements sort_t -.
static int	sb_sort_count (const void *a, const void *b, void *sdata)
	Compare two Sidebar entries by count - Implements sort_t -.
static int	sb_sort_desc (const void *a, const void *b, void *sdata)
	Compare two Sidebar entries by description - Implements sort_t -.
static int	sb_sort_flagged (const void *a, const void *b, void *sdata)
	Compare two Sidebar entries by flagged - Implements sort_t -.
static int	sb_sort_path (const void *a, const void *b, void *sdata)
	Compare two Sidebar entries by path - Implements sort_t -.
static int	sb_sort_unread (const void *a, const void *b, void *sdata)
	Compare two Sidebar entries by unread - Implements sort_t -.
static int	sb_sort_unsorted (const void *a, const void *b, void *sdata)
	Compare two Sidebar entries by order of creation - Implements sort_t -.

Detailed Description

Prototype for generic comparison function, compatible with qsort_r()

Parameters

a	First item
b	Second item
sdata	Private data

Return values

<0	a precedes b
0	a and b are identical
>0	b precedes a

Function Documentation

alias_sort_alias()

static int alias_sort_alias ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Aliases by their short names - Implements sort_t -.

Note

Non-visible Aliases are sorted to the end

Definition at line 46 of file sort.c.

{
  const struct AliasView *av_a = a;
  const struct AliasView *av_b = b;
  const bool sort_reverse = *(bool *) sdata;
 
  if (av_a->is_visible != av_b->is_visible)
    return av_a->is_visible ? -1 : 1;
 
  if (!av_a->is_visible)
    return 0;
 
  int rc = mutt_str_coll(av_a->alias->name, av_b->alias->name);
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

alias_sort_email()

static int alias_sort_email ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Aliases by their Email Addresses - Implements sort_t -.

Note

Non-visible Aliases are sorted to the end

Definition at line 67 of file sort.c.

{
  const struct AliasView *av_a = a;
  const struct AliasView *av_b = b;
  const bool sort_reverse = *(bool *) sdata;
 
  const struct AddressList *al_a = &av_a->alias->addr;
  const struct AddressList *al_b = &av_b->alias->addr;
 
  if (av_a->is_visible != av_b->is_visible)
    return av_a->is_visible ? -1 : 1;
 
  if (!av_a->is_visible)
    return 0;
 
  int rc;
  if (al_a == al_b)
  {
    rc = 0;
  }
  else if (!al_a)
  {
    rc = -1;
  }
  else if (!al_b)
  {
    rc = 1;
  }
  else
  {
    const struct Address *addr_a = TAILQ_FIRST(al_a);
    const struct Address *addr_b = TAILQ_FIRST(al_b);
    if (addr_a && addr_a->mailbox)
    {
      if (addr_b && addr_b->mailbox)
        rc = buf_coll(addr_a->mailbox, addr_b->mailbox);
      else
        rc = 1;
    }
    else if (addr_b && addr_b->mailbox)
    {
      rc = -1;
    }
    else if (addr_a && addr_b)
    {
      rc = buf_coll(addr_a->personal, addr_b->personal);
    }
    else
    {
      rc = 0;
    }
  }
 
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

alias_sort_name()

static int alias_sort_name ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Aliases by their Names - Implements sort_t -.

Note

Non-visible Aliases are sorted to the end

Definition at line 128 of file sort.c.

{
  const struct AliasView *av_a = a;
  const struct AliasView *av_b = b;
  const bool sort_reverse = *(bool *) sdata;
 
  const struct AddressList *al_a = &av_a->alias->addr;
  const struct AddressList *al_b = &av_b->alias->addr;
 
  if (av_a->is_visible != av_b->is_visible)
    return av_a->is_visible ? -1 : 1;
 
  if (!av_a->is_visible)
    return 0;
 
  int rc;
  if (al_a == al_b)
  {
    rc = 0;
  }
  else if (!al_a)
  {
    rc = -1;
  }
  else if (!al_b)
  {
    rc = 1;
  }
  else
  {
    const struct Address *addr_a = TAILQ_FIRST(al_a);
    const struct Address *addr_b = TAILQ_FIRST(al_b);
    if (addr_a && addr_a->personal)
    {
      if (addr_b && addr_b->personal)
        rc = buf_coll(addr_a->personal, addr_b->personal);
      else
        rc = 1;
    }
    else if (addr_b && addr_b->personal)
    {
      rc = -1;
    }
    else if (addr_a && addr_b)
    {
      rc = buf_coll(addr_a->mailbox, addr_b->mailbox);
    }
    else
    {
      rc = 0;
    }
  }
 
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

alias_sort_unsorted()

static int alias_sort_unsorted ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Aliases by their original configuration position - Implements sort_t -.

Note

Non-visible Aliases are sorted to the end

Definition at line 189 of file sort.c.

{
  const struct AliasView *av_a = a;
  const struct AliasView *av_b = b;
  const bool sort_reverse = *(bool *) sdata;
 
  if (av_a->is_visible != av_b->is_visible)
    return av_a->is_visible ? -1 : 1;
 
  if (!av_a->is_visible)
    return 0;
 
  int rc = mutt_numeric_cmp(av_a->orig_seq, av_b->orig_seq);
  return sort_reverse ? -rc : rc;
}

Here is the caller graph for this function:

browser_sort_subject()

static int browser_sort_subject ( const void *  a, const void *  b, void *  sdata  )

static

Compare two browser entries by their subject - Implements sort_t -.

Definition at line 55 of file sort.c.

{
  const struct FolderFile *pa = (const struct FolderFile *) a;
  const struct FolderFile *pb = (const struct FolderFile *) b;
 
  /* inbox should be sorted ahead of its siblings */
  int rc = mutt_str_inbox_cmp(pa->name, pb->name);
  if (rc == 0)
    rc = mutt_str_coll(pa->name, pb->name);
 
  return rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

browser_sort_unsorted()

static int browser_sort_unsorted ( const void *  a, const void *  b, void *  sdata  )

static

Compare two browser entries by their order - Implements sort_t -.

Note

This only affects browsing mailboxes and is a no-op for folders.

Definition at line 73 of file sort.c.

{
  const struct FolderFile *pa = (const struct FolderFile *) a;
  const struct FolderFile *pb = (const struct FolderFile *) b;
 
  return mutt_numeric_cmp(pa->gen, pb->gen);
}

Here is the caller graph for this function:

browser_sort_desc()

static int browser_sort_desc ( const void *  a, const void *  b, void *  sdata  )

static

Compare two browser entries by their descriptions - Implements sort_t -.

Definition at line 84 of file sort.c.

{
  const struct FolderFile *pa = (const struct FolderFile *) a;
  const struct FolderFile *pb = (const struct FolderFile *) b;
 
  return mutt_str_coll(pa->desc, pb->desc);
}

Here is the call graph for this function:

Here is the caller graph for this function:

browser_sort_date()

static int browser_sort_date ( const void *  a, const void *  b, void *  sdata  )

static

Compare two browser entries by their date - Implements sort_t -.

Definition at line 95 of file sort.c.

{
  const struct FolderFile *pa = (const struct FolderFile *) a;
  const struct FolderFile *pb = (const struct FolderFile *) b;
 
  return mutt_numeric_cmp(pa->mtime, pb->mtime);
}

Here is the caller graph for this function:

browser_sort_size()

static int browser_sort_size ( const void *  a, const void *  b, void *  sdata  )

static

Compare two browser entries by their size - Implements sort_t -.

Definition at line 106 of file sort.c.

{
  const struct FolderFile *pa = (const struct FolderFile *) a;
  const struct FolderFile *pb = (const struct FolderFile *) b;
 
  return mutt_numeric_cmp(pa->size, pb->size);
}

Here is the caller graph for this function:

browser_sort_count()

static int browser_sort_count ( const void *  a, const void *  b, void *  sdata  )

static

Compare two browser entries by their message count - Implements sort_t -.

Definition at line 117 of file sort.c.

{
  const struct FolderFile *pa = (const struct FolderFile *) a;
  const struct FolderFile *pb = (const struct FolderFile *) b;
 
  int rc = 0;
  if (pa->has_mailbox && pb->has_mailbox)
    rc = mutt_numeric_cmp(pa->msg_count, pb->msg_count);
  else if (pa->has_mailbox)
    rc = -1;
  else
    rc = 1;
 
  return rc;
}

Here is the caller graph for this function:

browser_sort_new()

static int browser_sort_new ( const void *  a, const void *  b, void *  sdata  )

static

Compare two browser entries by their new count - Implements sort_t -.

Definition at line 136 of file sort.c.

{
  const struct FolderFile *pa = (const struct FolderFile *) a;
  const struct FolderFile *pb = (const struct FolderFile *) b;
 
  int rc = 0;
  if (pa->has_mailbox && pb->has_mailbox)
    rc = mutt_numeric_cmp(pa->msg_unread, pb->msg_unread);
  else if (pa->has_mailbox)
    rc = -1;
  else
    rc = 1;
 
  return rc;
}

Here is the caller graph for this function:

browser_sort_helper()

static int browser_sort_helper ( const void *  a, const void *  b, void *  sdata  )

static

Helper to sort the items in the browser - Implements sort_t -.

Wild compare function that calls the others. It's useful because it provides a way to tell "../" is always on the top of the list, independently of the sort method. $browser_sort_dirs_first is also handled here.

Definition at line 159 of file sort.c.

{
  const struct FolderFile *pa = (const struct FolderFile *) a;
  const struct FolderFile *pb = (const struct FolderFile *) b;
  const struct CompareData *cd = (struct CompareData *) sdata;
 
  if ((mutt_str_coll(pa->desc, "../") == 0) || (mutt_str_coll(pa->desc, "..") == 0))
    return -1;
  if ((mutt_str_coll(pb->desc, "../") == 0) || (mutt_str_coll(pb->desc, "..") == 0))
    return 1;
 
  if (cd->sort_dirs_first)
    if (S_ISDIR(pa->mode) != S_ISDIR(pb->mode))
      return S_ISDIR(pa->mode) ? -1 : 1;
 
  int rc = cd->sort_fn(a, b, NULL);
 
  return cd->sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

envlist_sort()

static int envlist_sort ( const void *  a, const void *  b, void *  sdata  )

static

Compare two environment strings - Implements sort_t -.

Definition at line 910 of file commands.c.

{
  return strcmp(*(const char **) a, *(const char **) b);
}

Here is the caller graph for this function:

label_sort()

static int label_sort ( const void *  a, const void *  b, void *  sdata  )

static

Compare two label strings - Implements sort_t -.

Definition at line 298 of file helpers.c.

{
  return strcasecmp(*(const char **) a, *(const char **) b);
}

Here is the caller graph for this function:

elem_list_sort()

int elem_list_sort	(	const void *	a,
		const void *	b,
		void *	sdata
	)

Compare two HashElem pointers to config - Implements sort_t -.

Definition at line 63 of file subset.c.

{
  if (!a || !b)
    return 0;
 
  const struct HashElem *hea = *(struct HashElem const *const *) a;
  const struct HashElem *heb = *(struct HashElem const *const *) b;
 
  return mutt_istr_cmp(hea->key.strkey, heb->key.strkey);
}

Here is the call graph for this function:

Here is the caller graph for this function:

commands_sort()

static int commands_sort ( const void *  a, const void *  b, void *  sdata  )

static

Compare two commands by name - Implements sort_t -.

Definition at line 40 of file command.c.

{
  struct Command x = *(const struct Command *) a;
  struct Command y = *(const struct Command *) b;
 
  return mutt_str_cmp(x.name, y.name);
}

Here is the call graph for this function:

Here is the caller graph for this function:

email_sort_shim()

static int email_sort_shim ( const void *  a, const void *  b, void *  sdata  )

static

Helper to sort emails - Implements sort_t -.

Definition at line 69 of file sort.c.

{
  const struct Email *ea = *(struct Email const *const *) a;
  const struct Email *eb = *(struct Email const *const *) b;
  const struct EmailCompare *cmp = sdata;
  return mutt_compare_emails(ea, eb, cmp->type, cmp->sort, cmp->sort_aux);
}

Here is the call graph for this function:

Here is the caller graph for this function:

mutt_compare_emails()

int mutt_compare_emails	(	const struct Email *	a,
		const struct Email *	b,
		enum MailboxType	type,
		short	sort,
		short	sort_aux
	)

Compare two emails using up to two sort methods -.

Parameters

a	First email
b	Second email
type	Mailbox type
sort	Primary sort to use (generally $sort)
sort_aux	Secondary sort (generally $sort_aux or EMAIL_SORT_UNSORTED)

Return values

<0	a precedes b
0	a and b are identical (should not happen in practice)
>0	b precedes a

Definition at line 329 of file sort.c.

{
  sort_email_t func = get_sort_func(sort & SORT_MASK, type);
  int rc = func(a, b, (sort & SORT_REVERSE) != 0);
  if (rc == 0)
  {
    func = get_sort_func(sort_aux & SORT_MASK, type);
    rc = func(a, b, (sort_aux & SORT_REVERSE) != 0);
  }
  if (rc == 0)
  {
    /* Fallback of last resort to preserve stable order; will only
     * return 0 if a and b have the same index, which is probably a
     * bug in the code. */
    func = email_sort_unsorted;
    rc = func(a, b, false);
  }
  return rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

imap_sort_email_uid()

static int imap_sort_email_uid ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Emails by UID - Implements sort_t -.

Definition at line 899 of file imap.c.

{
  const struct Email *ea = *(struct Email const *const *) a;
  const struct Email *eb = *(struct Email const *const *) b;
 
  const unsigned int ua = imap_edata_get((struct Email *) ea)->uid;
  const unsigned int ub = imap_edata_get((struct Email *) eb)->uid;
 
  return mutt_numeric_cmp(ua, ub);
}

Here is the call graph for this function:

Here is the caller graph for this function:

imap_sort_uid()

int imap_sort_uid	(	const void *	a,
		const void *	b,
		void *	sdata
	)

Compare two UIDs - Implements sort_t -.

Definition at line 55 of file msg_set.c.

{
  unsigned int ua = *(unsigned int *) a;
  unsigned int ub = *(unsigned int *) b;
 
  return mutt_numeric_cmp(ua, ub);
}

Here is the caller graph for this function:

maildir_sort_inode()

static int maildir_sort_inode ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Maildirs by inode number - Implements sort_t -.

Definition at line 250 of file mailbox.c.

{
  const struct MdEmail *ma = *(struct MdEmail **) a;
  const struct MdEmail *mb = *(struct MdEmail **) b;
 
  return mutt_numeric_cmp(ma->inode, mb->inode);
}

Here is the caller graph for this function:

maildir_sort_flags()

static int maildir_sort_flags ( const void *  a, const void *  b, void *  sdata  )

static

Compare two flag characters - Implements sort_t -.

Definition at line 61 of file message.c.

{
  return mutt_numeric_cmp(*((const char *) a), *((const char *) b));
}

Here is the caller graph for this function:

mh_sort_path()

static int mh_sort_path ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Mh Mailboxes by path - Implements sort_t -.

Definition at line 496 of file mh.c.

{
  struct MhEmail const *pa = *(struct MhEmail const *const *) a;
  struct MhEmail const *pb = *(struct MhEmail const *const *) b;
  return mutt_str_cmp(pa->email->path, pb->email->path);
}

Here is the call graph for this function:

Here is the caller graph for this function:

mutt_str_inbox_cmp()

int mutt_str_inbox_cmp	(	const char *	a,
		const char *	b
	)

Do two folders share the same path and one is an inbox -.

Parameters

a	First path
b	Second path

Return values

-1	a is INBOX of b
0	None is INBOX
1	b is INBOX for a

This function compares two folder paths. It first looks for the position of the last common '/' character. If a valid position is found and it's not the last character in any of the two paths, the remaining parts of the paths are compared (case insensitively) with the string "INBOX" followed by a non alpha character, e.g., '.' or '/'. If only one of the two paths matches, it's reported as being less than the other and the function returns -1 (a < b) or 1 (a > b). If both or no paths match the requirements, the two paths are considered equivalent and this function returns 0.

Examples:

• mutt_str_inbox_cmp("/foo/bar", "/foo/baz") --> 0
• mutt_str_inbox_cmp("/foo/bar/", "/foo/bar/inbox") --> 0
• mutt_str_inbox_cmp("/foo/bar/sent", "/foo/bar/inbox") --> 1
• mutt_str_inbox_cmp("=INBOX", "=Drafts") --> -1
• mutt_str_inbox_cmp("=INBOX", "=INBOX.Foo") --> 0
• mutt_str_inbox_cmp("=INBOX.Foo", "=Drafts") --> -1

Definition at line 887 of file string.c.

{
#define IS_INBOX(s) (mutt_istrn_equal(s, "inbox", 5) && !isalnum((s)[5]))
#define CMP_INBOX(a, b) (IS_INBOX(b) - IS_INBOX(a))
 
  /* fast-track in case the paths have been mutt_pretty_mailbox'ified */
  if ((a[0] == '+') && (b[0] == '+'))
  {
    return CMP_INBOX(a + 1, b + 1);
  }
 
  const char *a_end = strrchr(a, '/');
  const char *b_end = strrchr(b, '/');
 
  /* If one path contains a '/', but not the other */
  if ((!a_end) ^ (!b_end))
    return 0;
 
  /* If neither path contains a '/' */
  if (!a_end)
    return 0;
 
  /* Compare the subpaths */
  size_t a_len = a_end - a;
  size_t b_len = b_end - b;
  size_t min = MIN(a_len, b_len);
  int same = (a[min] == '/') && (b[min] == '/') && (a[min + 1] != '\0') &&
             (b[min + 1] != '\0') && mutt_istrn_equal(a, b, min);
 
  if (!same)
    return 0;
 
  return CMP_INBOX(a + 1 + min, b + 1 + min);
 
#undef CMP_INBOX
#undef IS_INBOX
}

Here is the call graph for this function:

Here is the caller graph for this function:

compare_threads()

static int compare_threads ( const void *  a, const void *  b, void *  sdata  )

static

Helper to sort email threads - Implements sort_t -.

Definition at line 749 of file mutt_thread.c.

{
  const struct MuttThread *ta = *(struct MuttThread const *const *) a;
  const struct MuttThread *tb = *(struct MuttThread const *const *) b;
  const struct ThreadsContext *tctx = sdata;
  ASSERT(ta->parent == tb->parent);
 
  /* If c_sort ties, remember we are building the thread array in
   * reverse from the index the mails had in the mailbox.  */
  struct Mailbox *m = tctx->mailbox_view->mailbox;
  const enum MailboxType mtype = mx_type(m);
  if (ta->parent)
  {
    return mutt_compare_emails(ta->sort_aux_key, tb->sort_aux_key, mtype,
                               tctx->c_sort_aux, SORT_REVERSE | EMAIL_SORT_UNSORTED);
  }
  else
  {
    return mutt_compare_emails(ta->sort_thread_key, tb->sort_thread_key, mtype,
                               tctx->c_sort, SORT_REVERSE | EMAIL_SORT_UNSORTED);
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

crypt_sort_address()

static int crypt_sort_address ( const void *  a, const void *  b, void *  sdata  )

static

Compare two keys by their addresses - Implements sort_t -.

Definition at line 43 of file sort_gpgme.c.

{
  struct CryptKeyInfo *s = *(struct CryptKeyInfo **) a;
  struct CryptKeyInfo *t = *(struct CryptKeyInfo **) b;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = mutt_istr_cmp(s->uid, t->uid);
  if (rc != 0)
    goto done;
 
  rc = mutt_istr_cmp(crypt_fpr_or_lkeyid(s), crypt_fpr_or_lkeyid(t));
 
done:
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

crypt_sort_keyid()

static int crypt_sort_keyid ( const void *  a, const void *  b, void *  sdata  )

static

Compare two keys by their IDs - Implements sort_t -.

Definition at line 62 of file sort_gpgme.c.

{
  struct CryptKeyInfo *s = *(struct CryptKeyInfo **) a;
  struct CryptKeyInfo *t = *(struct CryptKeyInfo **) b;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = mutt_istr_cmp(crypt_fpr_or_lkeyid(s), crypt_fpr_or_lkeyid(t));
  if (rc != 0)
    goto done;
 
  rc = mutt_istr_cmp(s->uid, t->uid);
 
done:
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

crypt_sort_date()

static int crypt_sort_date ( const void *  a, const void *  b, void *  sdata  )

static

Compare two keys by their dates - Implements sort_t -.

Definition at line 81 of file sort_gpgme.c.

{
  struct CryptKeyInfo *s = *(struct CryptKeyInfo **) a;
  struct CryptKeyInfo *t = *(struct CryptKeyInfo **) b;
  const bool sort_reverse = *(bool *) sdata;
 
  unsigned long ts = 0;
  unsigned long tt = 0;
  int rc = 0;
 
  if (s->kobj->subkeys && (s->kobj->subkeys->timestamp > 0))
    ts = s->kobj->subkeys->timestamp;
  if (t->kobj->subkeys && (t->kobj->subkeys->timestamp > 0))
    tt = t->kobj->subkeys->timestamp;
 
  if (ts > tt)
  {
    rc = 1;
    goto done;
  }
 
  if (ts < tt)
  {
    rc = -1;
    goto done;
  }
 
  rc = mutt_istr_cmp(s->uid, t->uid);
 
done:
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

crypt_sort_trust()

static int crypt_sort_trust ( const void *  a, const void *  b, void *  sdata  )

static

Compare two keys by their trust levels - Implements sort_t -.

Definition at line 117 of file sort_gpgme.c.

{
  struct CryptKeyInfo *s = *(struct CryptKeyInfo **) a;
  struct CryptKeyInfo *t = *(struct CryptKeyInfo **) b;
  const bool sort_reverse = *(bool *) sdata;
 
  unsigned long ts = 0;
  unsigned long tt = 0;
 
  int rc = mutt_numeric_cmp(s->flags & KEYFLAG_RESTRICTIONS, t->flags & KEYFLAG_RESTRICTIONS);
  if (rc != 0)
    goto done;
 
  // Note: reversed
  rc = mutt_numeric_cmp(t->validity, s->validity);
  if (rc != 0)
    return rc;
 
  ts = 0;
  tt = 0;
  if (s->kobj->subkeys)
    ts = s->kobj->subkeys->length;
  if (t->kobj->subkeys)
    tt = t->kobj->subkeys->length;
 
  // Note: reversed
  rc = mutt_numeric_cmp(tt, ts);
  if (rc != 0)
    goto done;
 
  ts = 0;
  tt = 0;
  if (s->kobj->subkeys && (s->kobj->subkeys->timestamp > 0))
    ts = s->kobj->subkeys->timestamp;
  if (t->kobj->subkeys && (t->kobj->subkeys->timestamp > 0))
    tt = t->kobj->subkeys->timestamp;
 
  // Note: reversed
  rc = mutt_numeric_cmp(tt, ts);
  if (rc != 0)
    goto done;
 
  rc = mutt_istr_cmp(s->uid, t->uid);
  if (rc != 0)
    goto done;
 
  rc = mutt_istr_cmp(crypt_fpr_or_lkeyid(s), crypt_fpr_or_lkeyid(t));
 
done:
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

pgp_sort_address()

static int pgp_sort_address ( const void *  a, const void *  b, void *  sdata  )

static

Compare two keys by their addresses - Implements sort_t -.

Definition at line 43 of file sort_pgp.c.

{
  struct PgpUid const *s = *(struct PgpUid const *const *) a;
  struct PgpUid const *t = *(struct PgpUid const *const *) b;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = mutt_istr_cmp(s->addr, t->addr);
  if (rc != 0)
    goto done;
 
  rc = mutt_istr_cmp(pgp_fpr_or_lkeyid(s->parent), pgp_fpr_or_lkeyid(t->parent));
 
done:
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

pgp_sort_date()

static int pgp_sort_date ( const void *  a, const void *  b, void *  sdata  )

static

Compare two keys by their dates - Implements sort_t -.

Definition at line 62 of file sort_pgp.c.

{
  struct PgpUid const *s = *(struct PgpUid const *const *) a;
  struct PgpUid const *t = *(struct PgpUid const *const *) b;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = mutt_numeric_cmp(s->parent->gen_time, t->parent->gen_time);
  if (rc != 0)
    goto done;
 
  rc = mutt_istr_cmp(s->addr, t->addr);
 
done:
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

pgp_sort_keyid()

static int pgp_sort_keyid ( const void *  a, const void *  b, void *  sdata  )

static

Compare two keys by their IDs - Implements sort_t -.

Definition at line 81 of file sort_pgp.c.

{
  struct PgpUid const *s = *(struct PgpUid const *const *) a;
  struct PgpUid const *t = *(struct PgpUid const *const *) b;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = mutt_istr_cmp(pgp_fpr_or_lkeyid(s->parent), pgp_fpr_or_lkeyid(t->parent));
  if (rc != 0)
    goto done;
 
  rc = mutt_istr_cmp(s->addr, t->addr);
 
done:
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

pgp_sort_trust()

static int pgp_sort_trust ( const void *  a, const void *  b, void *  sdata  )

static

Compare two keys by their trust levels - Implements sort_t -.

Definition at line 100 of file sort_pgp.c.

{
  struct PgpUid const *s = *(struct PgpUid const *const *) a;
  struct PgpUid const *t = *(struct PgpUid const *const *) b;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = mutt_numeric_cmp(s->parent->flags & KEYFLAG_RESTRICTIONS,
                            t->parent->flags & KEYFLAG_RESTRICTIONS);
  if (rc != 0)
    goto done;
 
  // Note: reversed
  rc = mutt_numeric_cmp(t->trust, s->trust);
  if (rc != 0)
    goto done;
 
  // Note: reversed
  rc = mutt_numeric_cmp(t->parent->keylen, s->parent->keylen);
  if (rc != 0)
    goto done;
 
  // Note: reversed
  rc = mutt_numeric_cmp(t->parent->gen_time, s->parent->gen_time);
  if (rc != 0)
    goto done;
 
  rc = mutt_istr_cmp(s->addr, t->addr);
  if (rc != 0)
    goto done;
 
  rc = mutt_istr_cmp(pgp_fpr_or_lkeyid(s->parent), pgp_fpr_or_lkeyid(t->parent));
 
done:
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

sb_sort_count()

static int sb_sort_count ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Sidebar entries by count - Implements sort_t -.

Definition at line 44 of file sort.c.

{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = 0;
  if (m1->msg_count == m2->msg_count)
    rc = mutt_str_coll(mailbox_path(m1), mailbox_path(m2));
  else
    rc = mutt_numeric_cmp(m2->msg_count, m1->msg_count);
 
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

sb_sort_desc()

static int sb_sort_desc ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Sidebar entries by description - Implements sort_t -.

Definition at line 64 of file sort.c.

{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = mutt_str_cmp(m1->name, m2->name);
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

sb_sort_flagged()

static int sb_sort_flagged ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Sidebar entries by flagged - Implements sort_t -.

Definition at line 79 of file sort.c.

{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = 0;
  if (m1->msg_flagged == m2->msg_flagged)
    rc = mutt_str_coll(mailbox_path(m1), mailbox_path(m2));
  else
    rc = mutt_numeric_cmp(m2->msg_flagged, m1->msg_flagged);
 
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

sb_sort_path()

static int sb_sort_path ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Sidebar entries by path - Implements sort_t -.

Definition at line 99 of file sort.c.

{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = 0;
  rc = mutt_str_inbox_cmp(mailbox_path(m1), mailbox_path(m2));
  if (rc == 0)
    rc = mutt_str_coll(mailbox_path(m1), mailbox_path(m2));
 
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

sb_sort_unread()

static int sb_sort_unread ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Sidebar entries by unread - Implements sort_t -.

Definition at line 118 of file sort.c.

{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = 0;
  if (m1->msg_unread == m2->msg_unread)
    rc = mutt_str_coll(mailbox_path(m1), mailbox_path(m2));
  else
    rc = mutt_numeric_cmp(m2->msg_unread, m1->msg_unread);
 
  return sort_reverse ? -rc : rc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

sb_sort_unsorted()

static int sb_sort_unsorted ( const void *  a, const void *  b, void *  sdata  )

static

Compare two Sidebar entries by order of creation - Implements sort_t -.

Definition at line 138 of file sort.c.

{
  const struct SbEntry *sbe1 = *(struct SbEntry const *const *) a;
  const struct SbEntry *sbe2 = *(struct SbEntry const *const *) b;
  const struct Mailbox *m1 = sbe1->mailbox;
  const struct Mailbox *m2 = sbe2->mailbox;
  const bool sort_reverse = *(bool *) sdata;
 
  int rc = mutt_numeric_cmp(m1->gen, m2->gen);
  return sort_reverse ? -rc : rc;
}

Here is the caller graph for this function: