for (d = enter_file (strcache_add (".SUFFIXES"))->deps; d ; d = d->next)
{
- size_t slen = strlen (dep_name (d));
- if (len > slen && strneq (dep_name (d), name + (len - slen), slen))
+ const char *dn = dep_name (d);
+ size_t slen = strlen (dn);
+ if (len > slen && memcmp (dn, name + (len - slen), slen) == 0)
{
file->stem = stem = strcache_add_len (name, len - slen);
break;
int result = (int) ((struct a_word const *) x)->length - ((struct a_word const *) y)->length;
if (result)
return result;
- return_STRING_COMPARE (((struct a_word const *) x)->str,
- ((struct a_word const *) y)->str);
+ return_STRING_N_COMPARE (((struct a_word const *) x)->str,
+ ((struct a_word const *) y)->str,
+ ((struct a_word const *) y)->length);
}
struct a_pattern
else
for (wp = words; wp < word_end; ++wp)
wp->matched |= (wp->length == pp->length
- && strneq (pp->str, wp->str, wp->length));
+ && memcmp (pp->str, wp->str, wp->length) == 0);
}
/* Output the words that matched (or didn't, for filter-out). */
{
len = strlen (words[i]);
if (i == wordi - 1 || strlen (words[i + 1]) != len
- || strcmp (words[i], words[i + 1]))
+ || memcmp (words[i], words[i + 1], len))
{
o = variable_buffer_output (o, words[i], len);
o = variable_buffer_output (o, " ", 1);
/* If this is MAKE_RESTARTS, check to see if the "already printed
the enter statement" flag is set. */
- if (len == 13 && strneq (envp[i], "MAKE_RESTARTS", 13))
+ if (len == 13 && memcmp (envp[i], "MAKE_RESTARTS", 13) == 0)
{
if (*ep == '-')
{
/* Compare a word, both length and contents.
- P must point to the word to be tested, and WLEN must be the length.
-*/
-#define word1eq(s) (wlen == CSTRLEN (s) && strneq (s, p, CSTRLEN (s)))
+ P must point to the word to be tested, and WLEN must be the length. */
+#define word1eq(s) (wlen == CSTRLEN (s) && memcmp (s, p, CSTRLEN (s)) == 0)
\f
/* Read in all the makefiles and return a chain of targets to rebuild. */