From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mail-ej1-x62e.google.com (mail-ej1-x62e.google.com [IPv6:2a00:1450:4864:20::62e]) by sourceware.org (Postfix) with ESMTPS id F2E093858D28 for ; Thu, 5 Jan 2023 23:17:32 +0000 (GMT) DMARC-Filter: OpenDMARC Filter v1.4.2 sourceware.org F2E093858D28 Authentication-Results: sourceware.org; dmarc=pass (p=none dis=none) header.from=gmail.com Authentication-Results: sourceware.org; spf=pass smtp.mailfrom=gmail.com Received: by mail-ej1-x62e.google.com with SMTP id m18so106208eji.5 for ; Thu, 05 Jan 2023 15:17:32 -0800 (PST) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20210112; h=cc:to:subject:message-id:date:from:in-reply-to:references :mime-version:from:to:cc:subject:date:message-id:reply-to; bh=n1zQfTq8XhlqE1NzyjvOAJ1dbiSpHON3gYu2hFPryBk=; b=m2DSYrHSDzpID0rbXaX6LjpTbFqhFXlM23c8uCekXcKUOXl8BkYu5n5/wOxqSaPOuO FmI2H3bd91heeBtxgk+D5YO7APtpebViTFNcCtmAJ8AQ4VbwENlPq22G/fi0b8HE+2zq 0lSwfoEGXa3NF6y0By34ZH560xjil1BQbw6ZMNB8WTCXnhGZYqp36JtIMVKHVJBx4gAG FirN5MNrmqxQPWflAruzuCI5/ZRKAOEoUBcTz51CKDzVFmOz5IvE+rmGkPH7WEQ7lHW9 zo0vHnRMspX9TdIhbNtGrMYNsygz1/qki8EZ94YeqqLqQbCrhe+VJ5eVUNnVTwdIa4QY r7cg== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20210112; h=cc:to:subject:message-id:date:from:in-reply-to:references :mime-version:x-gm-message-state:from:to:cc:subject:date:message-id :reply-to; bh=n1zQfTq8XhlqE1NzyjvOAJ1dbiSpHON3gYu2hFPryBk=; b=dD5qRi4nSstLVM5P8h08ujlRntMUDpv8fhBC50T3nBNhEDQe/I3LXkcLOsDgcw+40n QDMQsfR26iPa6u9fCEqSq5VZc9E0wkNc6lQk7H85f6PCyuhvihk0xrBSb4Ak79qNQ8Vw D+faEdJMWy3FRCAcl8rpM4++62LorHT1zCZEQBNLlB+Ik1CEbei5eaWm0E6D+pQTYIwj zxUT24gkCWSIhAEsTBzsiBG7Yy5F+NSTmnoelVB9yuA3CisWcNCm84Nz4FnlxLd0EJ2f 1PnyXwFwZN4hfJhBEm39wwI6AzngV2sTIULX2J6/hR8pu2blQOqlNqgmqW/ZMdbpRAED 22Pw== X-Gm-Message-State: AFqh2krADbcFU5KsgZXJJptTSLOwF51uRPVZW9XkKG5dovxKn15gzmFR kqTq+iR43bBgUXlRn2GEyLILUQ1Heq6p/xbX9Nk= X-Google-Smtp-Source: AMrXdXvDqOV8od8JglZQlIcvPGzGvMkI8WJfL+O9wPHox5e3Y8jsYwVv9oU+gGW6ELA1EqYIDRCy+PzJohKzw9oa1PU= X-Received: by 2002:a17:906:52d4:b0:84d:1872:1257 with SMTP id w20-20020a17090652d400b0084d18721257mr76093ejn.593.1672960651631; Thu, 05 Jan 2023 15:17:31 -0800 (PST) MIME-Version: 1.0 References: <20220919195920.956393-1-adhemerval.zanella@linaro.org> <20220919195920.956393-9-adhemerval.zanella@linaro.org> In-Reply-To: <20220919195920.956393-9-adhemerval.zanella@linaro.org> From: Noah Goldstein Date: Thu, 5 Jan 2023 15:17:19 -0800 Message-ID: Subject: Re: [PATCH v5 08/17] string: Improve generic strchrnul To: Adhemerval Zanella Cc: libc-alpha@sourceware.org, Richard Henderson Content-Type: text/plain; charset="UTF-8" X-Spam-Status: No, score=-9.2 required=5.0 tests=BAYES_00,DKIM_SIGNED,DKIM_VALID,DKIM_VALID_AU,DKIM_VALID_EF,FREEMAIL_FROM,GIT_PATCH_0,KAM_SHORT,RCVD_IN_DNSWL_NONE,SPF_HELO_NONE,SPF_PASS,TXREP autolearn=ham autolearn_force=no version=3.4.6 X-Spam-Checker-Version: SpamAssassin 3.4.6 (2021-04-09) on server2.sourceware.org List-Id: On Mon, Sep 19, 2022 at 1:04 PM Adhemerval Zanella via Libc-alpha wrote: > > New algorithm have the following key differences: > > - Reads first word unaligned and use string-maskoff function to > remove unwanted data. This strategy follow arch-specific > optimization used on aarch64 and powerpc. > > - Use string-fz{b,i} functions. > > Checked on x86_64-linux-gnu, i686-linux-gnu, powerpc64-linux-gnu, > and powerpc-linux-gnu by removing the arch-specific assembly > implementation and disabling multi-arch (it covers both LE and BE > for 64 and 32 bits). > > Co-authored-by: Richard Henderson > --- > string/strchrnul.c | 156 +++--------------- > .../power4/multiarch/strchrnul-ppc32.c | 4 - > sysdeps/s390/strchrnul-c.c | 2 - > 3 files changed, 24 insertions(+), 138 deletions(-) > > diff --git a/string/strchrnul.c b/string/strchrnul.c > index 0cc1fc6bb0..67defa3dab 100644 > --- a/string/strchrnul.c > +++ b/string/strchrnul.c > @@ -1,10 +1,5 @@ > /* Copyright (C) 1991-2022 Free Software Foundation, Inc. > This file is part of the GNU C Library. > - Based on strlen implementation by Torbjorn Granlund (tege@sics.se), > - with help from Dan Sahlin (dan@sics.se) and > - bug fix and commentary by Jim Blandy (jimb@ai.mit.edu); > - adaptation to strchr suggested by Dick Karpinski (dick@cca.ucsf.edu), > - and implemented by Roland McGrath (roland@ai.mit.edu). > > The GNU C Library is free software; you can redistribute it and/or > modify it under the terms of the GNU Lesser General Public > @@ -21,146 +16,43 @@ > . */ > > #include > -#include > #include > +#include > +#include > +#include > +#include > +#include > > #undef __strchrnul > #undef strchrnul > > -#ifndef STRCHRNUL > -# define STRCHRNUL __strchrnul > +#ifdef STRCHRNUL > +# define __strchrnul STRCHRNUL > #endif > > /* Find the first occurrence of C in S or the final NUL byte. */ > char * > -STRCHRNUL (const char *s, int c_in) > +__strchrnul (const char *str, int c_in) > { > - const unsigned char *char_ptr; > - const unsigned long int *longword_ptr; > - unsigned long int longword, magic_bits, charmask; > - unsigned char c; > - > - c = (unsigned char) c_in; > - > - /* Handle the first few characters by reading one character at a time. > - Do this until CHAR_PTR is aligned on a longword boundary. */ > - for (char_ptr = (const unsigned char *) s; > - ((unsigned long int) char_ptr & (sizeof (longword) - 1)) != 0; > - ++char_ptr) > - if (*char_ptr == c || *char_ptr == '\0') > - return (void *) char_ptr; > - > - /* All these elucidatory comments refer to 4-byte longwords, > - but the theory applies equally well to 8-byte longwords. */ > - > - longword_ptr = (unsigned long int *) char_ptr; > - > - /* Bits 31, 24, 16, and 8 of this number are zero. Call these bits > - the "holes." Note that there is a hole just to the left of > - each byte, with an extra at the end: > - > - bits: 01111110 11111110 11111110 11111111 > - bytes: AAAAAAAA BBBBBBBB CCCCCCCC DDDDDDDD > - > - The 1-bits make sure that carries propagate to the next 0-bit. > - The 0-bits provide holes for carries to fall into. */ > - magic_bits = -1; > - magic_bits = magic_bits / 0xff * 0xfe << 1 >> 1 | 1; > - > - /* Set up a longword, each of whose bytes is C. */ > - charmask = c | (c << 8); > - charmask |= charmask << 16; > - if (sizeof (longword) > 4) > - /* Do the shift in two steps to avoid a warning if long has 32 bits. */ > - charmask |= (charmask << 16) << 16; > - if (sizeof (longword) > 8) > - abort (); > - > - /* Instead of the traditional loop which tests each character, > - we will test a longword at a time. The tricky part is testing > - if *any of the four* bytes in the longword in question are zero. */ > - for (;;) > - { > - /* We tentatively exit the loop if adding MAGIC_BITS to > - LONGWORD fails to change any of the hole bits of LONGWORD. > - > - 1) Is this safe? Will it catch all the zero bytes? > - Suppose there is a byte with all zeros. Any carry bits > - propagating from its left will fall into the hole at its > - least significant bit and stop. Since there will be no > - carry from its most significant bit, the LSB of the > - byte to the left will be unchanged, and the zero will be > - detected. > + /* Set up a word, each of whose bytes is C. */ > + op_t repeated_c = repeat_bytes (c_in); > > - 2) Is this worthwhile? Will it ignore everything except > - zero bytes? Suppose every byte of LONGWORD has a bit set > - somewhere. There will be a carry into bit 8. If bit 8 > - is set, this will carry into bit 16. If bit 8 is clear, > - one of bits 9-15 must be set, so there will be a carry > - into bit 16. Similarly, there will be a carry into bit > - 24. If one of bits 24-30 is set, there will be a carry > - into bit 31, so all of the hole bits will be changed. > + /* Align the input address to op_t. */ > + uintptr_t s_int = (uintptr_t) str; > + const op_t *word_ptr = word_containing (str); > > - The one misfire occurs when bits 24-30 are clear and bit > - 31 is set; in this case, the hole at bit 31 is not > - changed. If we had access to the processor carry flag, > - we could close this loophole by putting the fourth hole > - at bit 32! > + /* Read the first aligned word, but force bytes before the string to > + match neither zero nor goal (we make sure the high bit of each byte > + is 1, and the low 7 bits are all the opposite of the goal byte). */ > + op_t bmask = create_mask (s_int); > + op_t word = (*word_ptr | bmask) ^ (repeated_c & highbit_mask (bmask)); Think much clearer (and probably better codegen) is: find_zero_eq_low/all(word, repeated) >> (s_int * CHAR_BIT) > > - So it ignores everything except 128's, when they're aligned > - properly. > + while (! has_zero_eq (word, repeated_c)) > + word = *++word_ptr; > > - 3) But wait! Aren't we looking for C as well as zero? > - Good point. So what we do is XOR LONGWORD with a longword, > - each of whose bytes is C. This turns each byte that is C > - into a zero. */ > - > - longword = *longword_ptr++; > - > - /* Add MAGIC_BITS to LONGWORD. */ > - if ((((longword + magic_bits) > - > - /* Set those bits that were unchanged by the addition. */ > - ^ ~longword) > - > - /* Look at only the hole bits. If any of the hole bits > - are unchanged, most likely one of the bytes was a > - zero. */ > - & ~magic_bits) != 0 > - > - /* That caught zeroes. Now test for C. */ > - || ((((longword ^ charmask) + magic_bits) ^ ~(longword ^ charmask)) > - & ~magic_bits) != 0) > - { > - /* Which of the bytes was C or zero? > - If none of them were, it was a misfire; continue the search. */ > - > - const unsigned char *cp = (const unsigned char *) (longword_ptr - 1); > - > - if (*cp == c || *cp == '\0') > - return (char *) cp; > - if (*++cp == c || *cp == '\0') > - return (char *) cp; > - if (*++cp == c || *cp == '\0') > - return (char *) cp; > - if (*++cp == c || *cp == '\0') > - return (char *) cp; > - if (sizeof (longword) > 4) > - { > - if (*++cp == c || *cp == '\0') > - return (char *) cp; > - if (*++cp == c || *cp == '\0') > - return (char *) cp; > - if (*++cp == c || *cp == '\0') > - return (char *) cp; > - if (*++cp == c || *cp == '\0') > - return (char *) cp; > - } > - } > - } > - > - /* This should never happen. */ > - return NULL; > + op_t found = index_first_zero_eq (word, repeated_c); > + return (char *) (word_ptr) + found; > } > - > +#ifndef STRCHRNUL > weak_alias (__strchrnul, strchrnul) > +#endif > diff --git a/sysdeps/powerpc/powerpc32/power4/multiarch/strchrnul-ppc32.c b/sysdeps/powerpc/powerpc32/power4/multiarch/strchrnul-ppc32.c > index ed86b5e671..9c85e269f7 100644 > --- a/sysdeps/powerpc/powerpc32/power4/multiarch/strchrnul-ppc32.c > +++ b/sysdeps/powerpc/powerpc32/power4/multiarch/strchrnul-ppc32.c > @@ -19,10 +19,6 @@ > #include > > #define STRCHRNUL __strchrnul_ppc > - > -#undef weak_alias > -#define weak_alias(a,b ) > - > extern __typeof (strchrnul) __strchrnul_ppc attribute_hidden; > > #include > diff --git a/sysdeps/s390/strchrnul-c.c b/sysdeps/s390/strchrnul-c.c > index 4ffac54edd..2ebbcc62f7 100644 > --- a/sysdeps/s390/strchrnul-c.c > +++ b/sysdeps/s390/strchrnul-c.c > @@ -22,8 +22,6 @@ > # if HAVE_STRCHRNUL_IFUNC > # define STRCHRNUL STRCHRNUL_C > # define __strchrnul STRCHRNUL > -# undef weak_alias > -# define weak_alias(name, alias) > # endif > > # include > -- > 2.34.1 >