summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
8b7093a)
- converted strcmp functions to mutt internal functions where it makes sense. TODO makedoc.c.
git-svn-id: svn://svn.berlios.de/mutt-ng/trunk@224
e385b8ad-14ed-0310-8656-
cc95a2468c6d
state_attach_puts (": ", s);
if (t0)
state_attach_puts (t0, s);
state_attach_puts (": ", s);
if (t0)
state_attach_puts (t0, s);
- if (t1 && !(t0 && !strcmp (t0, t1))) {
+ if (t1 && !(t0 && !mutt_strcmp (t0, t1))) {
if (t0)
state_attach_puts (",", s);
state_attach_puts (t1, s);
if (t0)
state_attach_puts (",", s);
state_attach_puts (t1, s);
int any = 0;
for (; dn->key; dn++) {
int any = 0;
for (; dn->key; dn++) {
- if (!strcmp (dn->key, key)) {
+ if (!mutt_strcmp (dn->key, key)) {
if (any)
fputs (" + ", fp);
print_utf8 (fp, dn->value, mutt_strlen (dn->value));
if (any)
fputs (" + ", fp);
print_utf8 (fp, dn->value, mutt_strlen (dn->value));
/* now print the rest without any specific ordering */
for (; dn->key; dn++) {
for (i = 0; stdpart[i]; i++) {
/* now print the rest without any specific ordering */
for (; dn->key; dn++) {
for (i = 0; stdpart[i]; i++) {
- if (!strcmp (dn->key, stdpart[i]))
+ if (!mutt_strcmp (dn->key, stdpart[i]))
break;
}
if (!stdpart[i]) {
break;
}
if (!stdpart[i]) {
k = key->kobj;
gpgme_key_ref (k);
k = key->kobj;
gpgme_key_ref (k);
- while ((s = k->chain_id) && k->subkeys && strcmp (s, k->subkeys->fpr)) {
+ while ((s = k->chain_id) && k->subkeys && mutt_strcmp (s, k->subkeys->fpr)) {
putc ('\n', fp);
err = gpgme_op_keylist_start (listctx, s, 0);
gpgme_key_release (k);
putc ('\n', fp);
err = gpgme_op_keylist_start (listctx, s, 0);
gpgme_key_release (k);
#include "mutt_regex.h"
#include "lib/mem.h"
#include "mutt_regex.h"
#include "lib/mem.h"
#include "lib/intl.h"
typedef struct _tlssockdata {
#include "lib/intl.h"
typedef struct _tlssockdata {
if (regexec (&preg, linestr, 3, pmatch, 0) == 0) {
linestr[pmatch[1].rm_eo] = '\0';
linestr[pmatch[2].rm_eo] = '\0';
if (regexec (&preg, linestr, 3, pmatch, 0) == 0) {
linestr[pmatch[1].rm_eo] = '\0';
linestr[pmatch[2].rm_eo] = '\0';
- if (strcmp (linestr + pmatch[1].rm_so, hostname) == 0 &&
- strcmp (linestr + pmatch[2].rm_so, buf) == 0) {
+ if (mutt_strcmp (linestr + pmatch[1].rm_so, hostname) == 0 &&
+ mutt_strcmp (linestr + pmatch[2].rm_so, buf) == 0) {
regfree (&preg);
FREE(&linestr);
fclose (fp);
regfree (&preg);
FREE(&linestr);
fclose (fp);
#include "lisp.h"
#include "buffer.h"
#include "syntax.h"
#include "lisp.h"
#include "buffer.h"
#include "syntax.h"
static int ctype (const char *name)
{
static int ctype (const char *name)
{
- if (0 == strcmp (name, "alnum"))
+ if (0 == mutt_strcmp (name, "alnum"))
- if (0 == strcmp (name, "alpha"))
+ if (0 == mutt_strcmp (name, "alpha"))
- if (0 == strcmp (name, "blank"))
+ if (0 == mutt_strcmp (name, "blank"))
- if (0 == strcmp (name, "cntrl"))
+ if (0 == mutt_strcmp (name, "cntrl"))
- if (0 == strcmp (name, "digit"))
+ if (0 == mutt_strcmp (name, "digit"))
- if (0 == strcmp (name, "graph"))
+ if (0 == mutt_strcmp (name, "graph"))
- if (0 == strcmp (name, "lower"))
+ if (0 == mutt_strcmp (name, "lower"))
- if (0 == strcmp (name, "print"))
+ if (0 == mutt_strcmp (name, "print"))
- if (0 == strcmp (name, "punct"))
+ if (0 == mutt_strcmp (name, "punct"))
- if (0 == strcmp (name, "space"))
+ if (0 == mutt_strcmp (name, "space"))
- if (0 == strcmp (name, "upper"))
+ if (0 == mutt_strcmp (name, "upper"))
- if (0 == strcmp (name, "xdigit"))
+ if (0 == mutt_strcmp (name, "xdigit"))
return MUTT_XDIGIT;
return MUTT_INVALID;
}
return MUTT_XDIGIT;
return MUTT_INVALID;
}
#define BYTEWIDTH 8 /* In bits. */
#define BYTEWIDTH 8 /* In bits. */
-#define STREQ(s1, s2) ((strcmp (s1, s2) == 0))
+#define STREQ(s1, s2) ((mutt_strcmp (s1, s2) == 0))
#include "mutt.h"
#include "mime.h"
#include "charset.h"
#include "mutt.h"
#include "mime.h"
#include "charset.h"
#include "rfc2047.h"
#include "rfc2231.h"
#include "rfc2047.h"
#include "rfc2231.h"
- c = strcmp (par->value, q->value);
+ c = mutt_strcmp (par->value, q->value);
if ((c > 0) || (c == 0 && par->index >= q->index))
break;
}
if ((c > 0) || (c == 0 && par->index >= q->index))
break;
}
rfc2231_free_parameter (&par);
if ((par = q))
valp = par->value;
rfc2231_free_parameter (&par);
if ((par = q))
valp = par->value;
- } while (par && !strcmp (par->attribute, attribute));
+ } while (par && !mutt_strcmp (par->attribute, attribute));
if (value) {
if (encoded)
if (value) {
if (encoded)
#if USE_IMAP
if (ImapHomeNamespace && mutt_strlen (ImapHomeNamespace) > 0) {
if (strncmp (box, ImapHomeNamespace, mutt_strlen (ImapHomeNamespace)) == 0
#if USE_IMAP
if (ImapHomeNamespace && mutt_strlen (ImapHomeNamespace) > 0) {
if (strncmp (box, ImapHomeNamespace, mutt_strlen (ImapHomeNamespace)) == 0
- && strcmp (box, ImapHomeNamespace) != 0) {
+ && mutt_strcmp (box, ImapHomeNamespace) != 0) {
box += mutt_strlen (ImapHomeNamespace) + 1;
}
}
box += mutt_strlen (ImapHomeNamespace) + 1;
}
}
- if (Context && !strcmp (tmp->path, Context->path)) {
+ if (Context && !mutt_strcmp (tmp->path, Context->path)) {
printw ("%.*s", SidebarWidth - delim_len,
make_sidebar_entry (basename (tmp->path),
Context->msgcount, Context->unread,
printw ("%.*s", SidebarWidth - delim_len,
make_sidebar_entry (basename (tmp->path),
Context->msgcount, Context->unread,
#if !defined(HAVE_SNPRINTF) || !defined(HAVE_VSNPRINTF)
#include <string.h>
#if !defined(HAVE_SNPRINTF) || !defined(HAVE_VSNPRINTF)
#include <string.h>
/* Define this as a fall through, HAVE_STDARG_H is probably already set */
/* Define this as a fall through, HAVE_STDARG_H is probably already set */
for (y = 0; fp_nums[y] != 0; y++) {
snprintf (buf1, sizeof (buf1), fp_fmt[x], fp_nums[y]);
sprintf (buf2, fp_fmt[x], fp_nums[y]);
for (y = 0; fp_nums[y] != 0; y++) {
snprintf (buf1, sizeof (buf1), fp_fmt[x], fp_nums[y]);
sprintf (buf2, fp_fmt[x], fp_nums[y]);
- if (strcmp (buf1, buf2)) {
+ if (mutt_strcmp (buf1, buf2)) {
printf ("snprintf doesn't match Format: %s\n\tsnprintf = %s\n\tsprintf = %s\n", /* __SPRINTF_CHECKED__ */
fp_fmt[x], buf1, buf2);
fail++;
printf ("snprintf doesn't match Format: %s\n\tsnprintf = %s\n\tsprintf = %s\n", /* __SPRINTF_CHECKED__ */
fp_fmt[x], buf1, buf2);
fail++;
for (y = 0; int_nums[y] != 0; y++) {
snprintf (buf1, sizeof (buf1), int_fmt[x], int_nums[y]);
sprintf (buf2, int_fmt[x], int_nums[y]);
for (y = 0; int_nums[y] != 0; y++) {
snprintf (buf1, sizeof (buf1), int_fmt[x], int_nums[y]);
sprintf (buf2, int_fmt[x], int_nums[y]);
- if (strcmp (buf1, buf2)) {
+ if (mutt_strcmp (buf1, buf2)) {
printf ("snprintf doesn't match Format: %s\n\tsnprintf = %s\n\tsprintf = %s\n", /* __SPRINTF_CHECKED__ */
int_fmt[x], buf1, buf2);
fail++;
printf ("snprintf doesn't match Format: %s\n\tsnprintf = %s\n\tsprintf = %s\n", /* __SPRINTF_CHECKED__ */
int_fmt[x], buf1, buf2);
fail++;
#include "sort.h"
#include "mutt_idna.h"
#include "sort.h"
#include "mutt_idna.h"
/* If either aptr or bptr is equal to data, there is no numeric */
/* value for that spam attribute. In this case, compare lexically. */
if ((aptr == (*ppa)->env->spam->data) || (bptr == (*ppb)->env->spam->data))
/* If either aptr or bptr is equal to data, there is no numeric */
/* value for that spam attribute. In this case, compare lexically. */
if ((aptr == (*ppa)->env->spam->data) || (bptr == (*ppb)->env->spam->data))
- return (SORTCODE (strcmp (aptr, bptr)));
+ return (SORTCODE (mutt_strcmp (aptr, bptr)));
/* Otherwise, we have numeric value for both attrs. If these values */
/* are equal, then we first fall back upon string comparison, then */
/* upon auxiliary sort. */
if (result == 0) {
/* Otherwise, we have numeric value for both attrs. If these values */
/* are equal, then we first fall back upon string comparison, then */
/* upon auxiliary sort. */
if (result == 0) {
- result = strcmp (aptr, bptr);
+ result = mutt_strcmp (aptr, bptr);
if (result == 0)
AUXSORT (result, a, b);
}
if (result == 0)
AUXSORT (result, a, b);
}