X-Git-Url: http://git.madism.org/?p=apps%2Fmadmutt.git;a=blobdiff_plain;f=curs_lib.c;h=3e9f31a4cb57505cee82c78fc8773dd4ed4c5a04;hp=9f8b8aa7d22d2297795ff1c6a11c4b2ca30d4be9;hb=a743b55a20cbf3a33699fdb24dcb8638e878cc46;hpb=8e037c67a88cb4680c4391134c578e3b55a80f8a diff --git a/curs_lib.c b/curs_lib.c index 9f8b8aa..3e9f31a 100644 --- a/curs_lib.c +++ b/curs_lib.c @@ -16,6 +16,9 @@ #endif #include +#include +#include +#include #include "mutt.h" #include "enter.h" @@ -24,9 +27,6 @@ #include "pager.h" #include "mbyte.h" -#include "lib/mem.h" -#include "lib/intl.h" -#include "lib/str.h" #include "lib/debug.h" #include @@ -206,11 +206,11 @@ int mutt_yesorno (const char *msg, int def) answer_string = p_new(char, COLS + 1); snprintf (answer_string, COLS + 1, " ([%s]/%s): ", def == M_YES ? yes : no, def == M_YES ? no : yes); - answer_string_len = str_len (answer_string); + answer_string_len = m_strlen(answer_string); printw ("%.*s%s", COLS - answer_string_len, msg, answer_string); p_delete(&answer_string); - FOREVER { + for (;;) { mutt_refresh (); ch = mutt_getch (); if (CI_is_return (ch.ch)) @@ -421,7 +421,7 @@ int mutt_do_pager (const char *banner, { int rc; - if (!Pager || str_cmp (Pager, "builtin") == 0) + if (!Pager || m_strcmp(Pager, "builtin") == 0) rc = mutt_pager (banner, tempfile, do_color, info); else { char cmd[STRING]; @@ -466,7 +466,7 @@ int _mutt_enter_fname (const char *prompt, char *buf, size_t blen, *redraw = REDRAW_FULL; } else { - char *pc = p_new(char, str_len(prompt) + 3); + char *pc = p_new(char, m_strlen(prompt) + 3); sprintf (pc, "%s: ", prompt); /* __SPRINTF_CHECKED__ */ mutt_ungetch (ch.op ? 0 : ch.ch, ch.op ? ch.op : 0); @@ -490,7 +490,7 @@ void mutt_ungetch (int ch, int op) tmp.op = op; if (UngetCount >= UngetBufLen) - mem_realloc (&KeyEvent, (UngetBufLen += 128) * sizeof (event_t)); + p_realloc(&KeyEvent, UngetBufLen += 128); KeyEvent[UngetCount++] = tmp; } @@ -531,7 +531,7 @@ int mutt_multi_choice (char *prompt, char *letters) mvaddstr (LINES - 1, 0, prompt); clrtoeol (); - FOREVER { + for (;;) { mutt_refresh (); ch = mutt_getch (); if (ch.ch == -1 || CI_is_return (ch.ch)) { @@ -546,7 +546,7 @@ int mutt_multi_choice (char *prompt, char *letters) } else if (ch.ch <= '9' && ch.ch > '0') { choice = ch.ch - '0'; - if (choice <= str_len (letters)) + if (choice <= m_strlen(letters)) break; } } @@ -567,7 +567,7 @@ int mutt_addwch (wchar_t wc) mbstate_t mbstate; size_t n1, n2; - memset (&mbstate, 0, sizeof (mbstate)); + p_clear(&mbstate, 1); if ((n1 = wcrtomb (buf, wc, &mbstate)) == (size_t) (-1) || (n2 = wcrtomb (buf + n1, 0, &mbstate)) == (size_t) (-1)) return -1; /* ERR */ @@ -595,8 +595,8 @@ void mutt_format_string (char *dest, size_t destlen, char scratch[MB_LEN_MAX]; mbstate_t mbstate1, mbstate2; - memset (&mbstate1, 0, sizeof (mbstate1)); - memset (&mbstate2, 0, sizeof (mbstate2)); + p_clear(&mbstate1, 1); + p_clear(&mbstate2, 1); --destlen; p = dest; for (; n && (k = mbrtowc (&wc, s, n, &mbstate1)); s += k, n -= k) { @@ -666,7 +666,7 @@ static void mutt_format_s_x (char *dest, } mutt_format_string (dest, destlen, min_width, max_width, - right_justify, ' ', s, str_len (s), arboreal); + right_justify, ' ', s, m_strlen(s), arboreal); } void mutt_format_s (char *dest, @@ -691,10 +691,10 @@ void mutt_paddstr (int n, const char *s) wchar_t wc; int w; size_t k; - size_t len = str_len (s); + size_t len = m_strlen(s); mbstate_t mbstate; - memset (&mbstate, 0, sizeof (mbstate)); + p_clear(&mbstate, 1); for (; len && (k = mbrtowc (&wc, s, len, &mbstate)); s += k, len -= k) { if (k == (size_t) (-1) || k == (size_t) (-2)) { k = (k == (size_t) (-1)) ? 1 : len; @@ -715,7 +715,7 @@ void mutt_paddstr (int n, const char *s) } /* - * mutt_strwidth is like str_len except that it returns the width + * mutt_strwidth is like m_strlenexcept that it returns the width * refering to the number of characters cells. */ @@ -729,9 +729,9 @@ int mutt_strwidth (const char *s) if (!s) return 0; - n = str_len (s); + n = m_strlen(s); - memset (&mbstate, 0, sizeof (mbstate)); + p_clear(&mbstate, 1); for (w = 0; n && (k = mbrtowc (&wc, s, n, &mbstate)); s += k, n -= k) { if (k == (size_t) (-1) || k == (size_t) (-2)) { k = (k == (size_t) (-1)) ? 1 : n;