Alias Function API

Prototype for a Alias Function. More...

Collaboration diagram for Alias Function API:

Functions
static int	op_create_alias (struct AliasMenuData *mdata, int op)
	create an alias from a message sender - Implements alias_function_t -
static int	op_delete (struct AliasMenuData *mdata, int op)
	delete the current entry - Implements alias_function_t -
static int	op_exit (struct AliasMenuData *mdata, int op)
	exit this menu - Implements alias_function_t -
static int	op_generic_select_entry (struct AliasMenuData *mdata, int op)
	select the current entry - Implements alias_function_t -
static int	op_main_limit (struct AliasMenuData *mdata, int op)
	show only messages matching a pattern - Implements alias_function_t -
static int	op_query (struct AliasMenuData *mdata, int op)
	query external program for addresses - Implements alias_function_t -
static int	op_search (struct AliasMenuData *mdata, int op)
	search for a regular expression - Implements alias_function_t -
static int	op_sort (struct AliasMenuData *mdata, int op)
	sort aliases - Implements alias_function_t -

Detailed Description

Prototype for a Alias Function.

Parameters

wdata	Alias Window data
op	Operation to perform, e.g. OP_ALIAS_NEXT

Return values

enum	FunctionRetval

Function Documentation

op_create_alias()

static int op_create_alias ( struct AliasMenuData *  mdata, int  op  )

static

create an alias from a message sender - Implements alias_function_t -

Definition at line 118 of file functions.c.

{
  struct Menu *menu = mdata->menu;
 
  if (menu->tag_prefix)
  {
    struct AddressList naddr = TAILQ_HEAD_INITIALIZER(naddr);
 
    struct AliasView *avp = NULL;
    ARRAY_FOREACH(avp, &mdata->ava)
    {
      if (!avp->is_tagged)
        continue;
 
      struct AddressList al = TAILQ_HEAD_INITIALIZER(al);
      if (alias_to_addrlist(&al, avp->alias))
      {
        mutt_addrlist_copy(&naddr, &al, false);
        mutt_addrlist_clear(&al);
      }
    }
 
    alias_create(&naddr, mdata->sub);
    mutt_addrlist_clear(&naddr);
  }
  else
  {
    struct AddressList al = TAILQ_HEAD_INITIALIZER(al);
    if (alias_to_addrlist(&al, ARRAY_GET(&mdata->ava, menu_get_index(menu))->alias))
    {
      alias_create(&al, mdata->sub);
      mutt_addrlist_clear(&al);
    }
  }
  return FR_SUCCESS;
}

Here is the call graph for this function:

op_delete()

static int op_delete ( struct AliasMenuData *  mdata, int  op  )

static

delete the current entry - Implements alias_function_t -

Definition at line 158 of file functions.c.

{
  struct Menu *menu = mdata->menu;
 
  if (menu->tag_prefix)
  {
    struct AliasView *avp = NULL;
    ARRAY_FOREACH(avp, &mdata->ava)
    {
      if (avp->is_tagged)
        avp->is_deleted = (op == OP_DELETE);
    }
    menu_queue_redraw(menu, MENU_REDRAW_INDEX);
  }
  else
  {
    int index = menu_get_index(menu);
    ARRAY_GET(&mdata->ava, index)->is_deleted = (op == OP_DELETE);
    menu_queue_redraw(menu, MENU_REDRAW_CURRENT);
    const bool c_resolve = cs_subset_bool(mdata->sub, "resolve");
    if (c_resolve && (index < (menu->max - 1)))
    {
      menu_set_index(menu, index + 1);
      menu_queue_redraw(menu, MENU_REDRAW_INDEX);
    }
  }
  return FR_SUCCESS;
}

Here is the call graph for this function:

op_exit()

static int op_exit ( struct AliasMenuData *  mdata, int  op  )

static

exit this menu - Implements alias_function_t -

Definition at line 190 of file functions.c.

{
  return FR_DONE;
}

Here is the caller graph for this function:

op_generic_select_entry()

static int op_generic_select_entry ( struct AliasMenuData *  mdata, int  op  )

static

select the current entry - Implements alias_function_t -

This function handles:

• OP_GENERIC_SELECT_ENTRY
• OP_MAIL

Note

AliasMenuData.is_tagged will show the user's selection

Definition at line 204 of file functions.c.

{
  struct Menu *menu = mdata->menu;
  if (menu->tag_prefix)
  {
    // Untag any non-visible aliases
    struct AliasView *avp = NULL;
    ARRAY_FOREACH(avp, &mdata->ava)
    {
      if (avp->is_tagged && !avp->is_visible)
        avp->is_tagged = false;
    }
  }
  else
  {
    // Untag all but the current alias
    struct AliasView *avp = NULL;
    const int idx = menu_get_index(menu);
    ARRAY_FOREACH(avp, &mdata->ava)
    {
      avp->is_tagged = (ARRAY_FOREACH_IDX == idx);
    }
  }
 
  return FR_CONTINUE;
}

Here is the call graph for this function:

op_main_limit()

static int op_main_limit ( struct AliasMenuData *  mdata, int  op  )

static

show only messages matching a pattern - Implements alias_function_t -

Definition at line 234 of file functions.c.

{
  struct Menu *menu = mdata->menu;
  int rc = mutt_pattern_alias_func(_("Limit to addresses matching: "), mdata, menu);
  if (rc != 0)
    return FR_NO_ACTION;
 
  alias_array_sort(&mdata->ava, mdata->sub);
  alias_set_title(mdata->sbar, mdata->title, mdata->limit);
  menu_queue_redraw(menu, MENU_REDRAW_FULL);
  window_redraw(NULL);
 
  return FR_SUCCESS;
}

Here is the call graph for this function:

op_query()

static int op_query ( struct AliasMenuData *  mdata, int  op  )

static

query external program for addresses - Implements alias_function_t -

This function handles:

• OP_QUERY
• OP_QUERY_APPEND

Definition at line 256 of file functions.c.

{
  struct Buffer *buf = mdata->query;
  if ((mw_get_field(_("Query: "), buf, MUTT_COMP_NO_FLAGS, HC_OTHER, NULL, NULL) != 0) ||
      buf_is_empty(buf))
  {
    return FR_NO_ACTION;
  }
 
  if (op == OP_QUERY)
  {
    ARRAY_FREE(&mdata->ava);
    aliaslist_clear(mdata->al);
  }
 
  struct Menu *menu = mdata->menu;
  struct AliasList al = TAILQ_HEAD_INITIALIZER(al);
 
  query_run(buf_string(buf), true, &al, mdata->sub);
  menu_queue_redraw(menu, MENU_REDRAW_FULL);
  char title[256] = { 0 };
  snprintf(title, sizeof(title), "%s%s", _("Query: "), buf_string(buf));
  sbar_set_title(mdata->sbar, title);
 
  if (TAILQ_EMPTY(&al))
  {
    if (op == OP_QUERY)
      menu->max = 0;
    return FR_NO_ACTION;
  }
 
  struct Alias *np = NULL;
  struct Alias *tmp = NULL;
  TAILQ_FOREACH_SAFE(np, &al, entries, tmp)
  {
    alias_array_alias_add(&mdata->ava, np);
    TAILQ_REMOVE(&al, np, entries);
    TAILQ_INSERT_TAIL(mdata->al, np, entries); // Transfer
  }
  alias_array_sort(&mdata->ava, mdata->sub);
  menu->max = ARRAY_SIZE(&mdata->ava);
  return FR_SUCCESS;
}

Here is the call graph for this function:

op_search()

static int op_search ( struct AliasMenuData *  mdata, int  op  )

static

search for a regular expression - Implements alias_function_t -

This function handles:

• OP_SEARCH
• OP_SEARCH_NEXT
• OP_SEARCH_OPPOSITE
• OP_SEARCH_REVERSE

Definition at line 309 of file functions.c.

{
  SearchFlags flags = SEARCH_NO_FLAGS;
  switch (op)
  {
    case OP_SEARCH:
      flags |= SEARCH_PROMPT;
      mdata->search_state->reverse = false;
      break;
    case OP_SEARCH_REVERSE:
      flags |= SEARCH_PROMPT;
      mdata->search_state->reverse = true;
      break;
    case OP_SEARCH_NEXT:
      break;
    case OP_SEARCH_OPPOSITE:
      flags |= SEARCH_OPPOSITE;
      break;
  }
 
  struct Menu *menu = mdata->menu;
  int index = menu_get_index(menu);
  index = mutt_search_alias_command(menu, index, mdata->search_state, flags);
  if (index == -1)
    return FR_NO_ACTION;
 
  menu_set_index(menu, index);
  return FR_SUCCESS;
}

Here is the call graph for this function:

op_sort()

static int op_sort ( struct AliasMenuData *  mdata, int  op  )

static

sort aliases - Implements alias_function_t -

This function handles:

• OP_SORT
• OP_SORT_REVERSE

Definition at line 346 of file functions.c.

{
  int sort = cs_subset_sort(mdata->sub, "sort_alias");
  bool resort = true;
  bool reverse = (op == OP_SORT_REVERSE);
 
  switch (mw_multi_choice(reverse ?
                              /* L10N: The highlighted letters must match the "Sort" options */
                              _("Rev-Sort (a)lias, a(d)dress or (u)nsorted?") :
                              /* L10N: The highlighted letters must match the "Rev-Sort" options */
                              _("Sort (a)lias, a(d)dress or (u)nsorted?"),
                          /* L10N: These must match the highlighted letters from "Sort" and "Rev-Sort" */
                          _("adu")))
  {
    case -1: /* abort */
      resort = false;
      break;
 
    case 1: /* (a)lias */
      sort = SORT_ALIAS;
      break;
 
    case 2: /* a(d)dress */
      sort = SORT_ADDRESS;
      break;
 
    case 3: /* (u)nsorted */
      sort = SORT_ORDER;
      break;
  }
 
  if (resort)
  {
    sort |= reverse ? SORT_REVERSE : 0;
 
    // This will trigger a WA_RECALC
    cs_subset_str_native_set(mdata->sub, "sort_alias", sort, NULL);
  }
 
  return FR_SUCCESS;
}

Here is the call graph for this function: