Mercurial > hg > xemacs-beta
view src/strcmp.c @ 4407:4ee73bbe4f8e
Always use boyer_moore in ASCII or Latin-1 buffers with ASCII search strings.
2007-12-26 Aidan Kehoe <kehoea@parhasard.net>
* casetab.c:
Extend and correct some case table documentation.
* search.c (search_buffer):
Correct a bug where only the first entry for a character in the
case equivalence table was examined in determining if the
Boyer-Moore search algorithm is appropriate.
If there are case mappings outside of the charset and row of the
characters specified in the search string, those case mappings can
be safely ignored (and Boyer-Moore search can be used) if we know
from the buffer statistics that the corresponding characters cannot
occur.
* search.c (boyer_moore):
Assert that we haven't been passed a string with varying
characters sets or rows within character sets. That's what
simple_search is for.
In the very rare event that a character in the search string has a
canonical case mapping that is not in the same character set and
row, don't try to search for the canonical character, search for
some other character that is in the the desired character set and
row. Assert that the case table isn't corrupt.
Do not search for any character case mappings that cannot possibly
occur in the buffer, given the buffer metadata about its
contents.
author | Aidan Kehoe <kehoea@parhasard.net> |
---|---|
date | Wed, 26 Dec 2007 17:30:16 +0100 |
parents | abe6d1db359e |
children |
line wrap: on
line source
/* This file is part of XEmacs. XEmacs is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version. XEmacs is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with XEmacs; see the file COPYING. If not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */ /* Synched up with: Not in FSF. */ /* In SunOS 4.1.1 the strcmp and strncmp functions reference memory past the last byte of the string! This will core dump if the memory following the last byte is not mapped. Here are correct versions by hbs@lucid.com. */ # include <config.h> # ifndef REGISTER /* Strictly enforced in 20.3 */ # define REGISTER # endif #include <string.h> #define ALIGNED(x) (!(((unsigned long) (x)) & (sizeof (unsigned long) - 1))) #define MAGIC 0x7efefeff #define HIGH_BIT_P(c) ((c) & hi_bit) #define HAS_ZERO(c) (((((c) + magic) ^ (c)) & not_magic) != not_magic) int strcmp (const char *x, const char *y) { if (x == y) return 0; else if (ALIGNED (x) && ALIGNED (y)) { const unsigned long *x1 = (const unsigned long *) x; const unsigned long *y1 = (const unsigned long *) y; unsigned long c; unsigned long magic = MAGIC; unsigned long not_magic = ~magic; unsigned long hi_bit = 0x80000000; while ((c = *x1) == *y1) { if (HAS_ZERO(c)) { if (!HIGH_BIT_P (c)) return 0; else { x = (const char *) x1; y = (const char *) y1; goto slow_loop; } } x1++; y1++; } x = (const char *) x1; y = (const char *) y1; goto slow_loop; } else { char c; slow_loop: while ((c = *x) == *y) { if (c == (char) 0) return 0; x++; y++; } return (*x - *y); } } int strncmp (const char *x, const char *y, size_t n) { if ((x == y) || (n <= 0)) return 0; else if (ALIGNED (x) && ALIGNED (y)) { const unsigned long *x1 = (const unsigned long *) x; const unsigned long *y1 = (const unsigned long *) y; unsigned long c; unsigned long magic = MAGIC; unsigned long not_magic = ~magic; unsigned long hi_bit = 0x80000000; while ((c = *x1) == *y1) { n -= sizeof (unsigned long); if (n <= 0) return 0; if (HAS_ZERO(c)) { if (!HIGH_BIT_P (c)) return 0; else { x = (const char *) x1; y = (const char *) y1; goto slow_loop; } } x1++; y1++; } x = (const char *) x1; y = (const char *) y1; goto slow_loop; } else { char c; slow_loop: while ((c = *x) == *y) { n--; if (n <= 0) return 0; if (c == (char) 0) return 0; x++; y++; } return (*x - *y); } }