gpt4 book ai didi

c - 理解 strlen 实现中的代码

转载 作者:太空狗 更新时间:2023-10-29 16:38:31 24 4
gpt4 key购买 nike

<分区>

关于 glibc 中 string.hstrlen 的实现,我有两个问题。

  1. 实现使用带有“漏洞”的魔数(Magic Number)。我无法理解这是如何工作的。有人可以帮我理解这个片段:

    size_t
    strlen (const char *str)
    {
    const char *char_ptr;
    const unsigned long int *longword_ptr;
    unsigned long int longword, himagic, lomagic;

    /* 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 = str; ((unsigned long int) char_ptr
    & (sizeof (longword) - 1)) != 0;
    ++char_ptr)
    if (*char_ptr == '\0')
    return char_ptr - str;

    /* 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. */

    himagic = 0x80808080L;
    lomagic = 0x01010101L;
    if (sizeof (longword) > 4)
    {
    /* 64-bit version of the magic. */
    /* Do the shift in two steps to avoid a warning if long has 32 bits. */
    himagic = ((himagic << 16) << 16) | himagic;
    lomagic = ((lomagic << 16) << 16) | lomagic;
    }
    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 (;;)
    {
    longword = *longword_ptr++;

    if (((longword - lomagic) & ~longword & himagic) != 0)
    {
    /* Which of the bytes was the zero? If none of them were, it was
    a misfire; continue the search. */

    const char *cp = (const char *) (longword_ptr - 1);

    if (cp[0] == 0)
    return cp - str;
    if (cp[1] == 0)
    return cp - str + 1;
    if (cp[2] == 0)
    return cp - str + 2;
    if (cp[3] == 0)
    return cp - str + 3;
    if (sizeof (longword) > 4)
    {
    if (cp[4] == 0)
    return cp - str + 4;
    if (cp[5] == 0)
    return cp - str + 5;
    if (cp[6] == 0)
    return cp - str + 6;
    if (cp[7] == 0)
    return cp - str + 7;
    }}}

    魔数(Magic Number)的用途是什么?

  2. 为什么不简单地递增指针直到 NULL 字符并返回计数?这种方法更快吗?为什么会这样?

24 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com