1*8d741a5dSApple OSS Distributions /*-
2*8d741a5dSApple OSS Distributions * Copyright (c) 2009 Xin LI <[email protected]>
3*8d741a5dSApple OSS Distributions * All rights reserved.
4*8d741a5dSApple OSS Distributions *
5*8d741a5dSApple OSS Distributions * Redistribution and use in source and binary forms, with or without
6*8d741a5dSApple OSS Distributions * modification, are permitted provided that the following conditions
7*8d741a5dSApple OSS Distributions * are met:
8*8d741a5dSApple OSS Distributions * 1. Redistributions of source code must retain the above copyright
9*8d741a5dSApple OSS Distributions * notice, this list of conditions and the following disclaimer.
10*8d741a5dSApple OSS Distributions * 2. Redistributions in binary form must reproduce the above copyright
11*8d741a5dSApple OSS Distributions * notice, this list of conditions and the following disclaimer in the
12*8d741a5dSApple OSS Distributions * documentation and/or other materials provided with the distribution.
13*8d741a5dSApple OSS Distributions *
14*8d741a5dSApple OSS Distributions * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15*8d741a5dSApple OSS Distributions * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16*8d741a5dSApple OSS Distributions * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17*8d741a5dSApple OSS Distributions * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18*8d741a5dSApple OSS Distributions * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19*8d741a5dSApple OSS Distributions * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20*8d741a5dSApple OSS Distributions * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21*8d741a5dSApple OSS Distributions * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22*8d741a5dSApple OSS Distributions * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23*8d741a5dSApple OSS Distributions * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
24*8d741a5dSApple OSS Distributions * SUCH DAMAGE.
25*8d741a5dSApple OSS Distributions */
26*8d741a5dSApple OSS Distributions
27*8d741a5dSApple OSS Distributions #include "string.h"
28*8d741a5dSApple OSS Distributions #include <limits.h>
29*8d741a5dSApple OSS Distributions
30*8d741a5dSApple OSS Distributions /*
31*8d741a5dSApple OSS Distributions * Portable strlen() for 32-bit and 64-bit systems.
32*8d741a5dSApple OSS Distributions *
33*8d741a5dSApple OSS Distributions * Rationale: it is generally much more efficient to do word length
34*8d741a5dSApple OSS Distributions * operations and avoid branches on modern computer systems, as
35*8d741a5dSApple OSS Distributions * compared to byte-length operations with a lot of branches.
36*8d741a5dSApple OSS Distributions *
37*8d741a5dSApple OSS Distributions * The expression:
38*8d741a5dSApple OSS Distributions *
39*8d741a5dSApple OSS Distributions * ((x - 0x01....01) & ~x & 0x80....80)
40*8d741a5dSApple OSS Distributions *
41*8d741a5dSApple OSS Distributions * would evaluate to a non-zero value iff any of the bytes in the
42*8d741a5dSApple OSS Distributions * original word is zero. However, we can further reduce ~1/3 of
43*8d741a5dSApple OSS Distributions * time if we consider that strlen() usually operate on 7-bit ASCII
44*8d741a5dSApple OSS Distributions * by employing the following expression, which allows false positive
45*8d741a5dSApple OSS Distributions * when high bit of 1 and use the tail case to catch these case:
46*8d741a5dSApple OSS Distributions *
47*8d741a5dSApple OSS Distributions * ((x - 0x01....01) & 0x80....80)
48*8d741a5dSApple OSS Distributions *
49*8d741a5dSApple OSS Distributions * This is more than 5.2 times as fast as the raw implementation on
50*8d741a5dSApple OSS Distributions * Intel T7300 under long mode for strings longer than word length.
51*8d741a5dSApple OSS Distributions */
52*8d741a5dSApple OSS Distributions
53*8d741a5dSApple OSS Distributions /* Magic numbers for the algorithm */
54*8d741a5dSApple OSS Distributions #if LONG_BIT == 32
55*8d741a5dSApple OSS Distributions static const unsigned long mask01 = 0x01010101;
56*8d741a5dSApple OSS Distributions static const unsigned long mask80 = 0x80808080;
57*8d741a5dSApple OSS Distributions #elif LONG_BIT == 64
58*8d741a5dSApple OSS Distributions static const unsigned long mask01 = 0x0101010101010101;
59*8d741a5dSApple OSS Distributions static const unsigned long mask80 = 0x8080808080808080;
60*8d741a5dSApple OSS Distributions #else
61*8d741a5dSApple OSS Distributions #error Unsupported word size
62*8d741a5dSApple OSS Distributions #endif
63*8d741a5dSApple OSS Distributions
64*8d741a5dSApple OSS Distributions #define LONGPTR_MASK (sizeof(long) - 1)
65*8d741a5dSApple OSS Distributions
66*8d741a5dSApple OSS Distributions /*
67*8d741a5dSApple OSS Distributions * Helper macro to return string length if we caught the zero
68*8d741a5dSApple OSS Distributions * byte.
69*8d741a5dSApple OSS Distributions */
70*8d741a5dSApple OSS Distributions #define testbyte(x) \
71*8d741a5dSApple OSS Distributions do { \
72*8d741a5dSApple OSS Distributions if (p[x] == '\0') \
73*8d741a5dSApple OSS Distributions return (p - str + x); \
74*8d741a5dSApple OSS Distributions } while (0)
75*8d741a5dSApple OSS Distributions
76*8d741a5dSApple OSS Distributions __attribute__((visibility("hidden")))
77*8d741a5dSApple OSS Distributions size_t
_libkernel_strlen(const char * str)78*8d741a5dSApple OSS Distributions _libkernel_strlen(const char *str)
79*8d741a5dSApple OSS Distributions {
80*8d741a5dSApple OSS Distributions const char *p;
81*8d741a5dSApple OSS Distributions const unsigned long *lp;
82*8d741a5dSApple OSS Distributions
83*8d741a5dSApple OSS Distributions /* Skip the first few bytes until we have an aligned p */
84*8d741a5dSApple OSS Distributions for (p = str; (uintptr_t)p & LONGPTR_MASK; p++) {
85*8d741a5dSApple OSS Distributions if (*p == '\0') {
86*8d741a5dSApple OSS Distributions return p - str;
87*8d741a5dSApple OSS Distributions }
88*8d741a5dSApple OSS Distributions }
89*8d741a5dSApple OSS Distributions
90*8d741a5dSApple OSS Distributions /* Scan the rest of the string using word sized operation */
91*8d741a5dSApple OSS Distributions for (lp = (const unsigned long *)p;; lp++) {
92*8d741a5dSApple OSS Distributions if ((*lp - mask01) & mask80) {
93*8d741a5dSApple OSS Distributions p = (const char *)(lp);
94*8d741a5dSApple OSS Distributions testbyte(0);
95*8d741a5dSApple OSS Distributions testbyte(1);
96*8d741a5dSApple OSS Distributions testbyte(2);
97*8d741a5dSApple OSS Distributions testbyte(3);
98*8d741a5dSApple OSS Distributions #if (LONG_BIT >= 64)
99*8d741a5dSApple OSS Distributions testbyte(4);
100*8d741a5dSApple OSS Distributions testbyte(5);
101*8d741a5dSApple OSS Distributions testbyte(6);
102*8d741a5dSApple OSS Distributions testbyte(7);
103*8d741a5dSApple OSS Distributions #endif
104*8d741a5dSApple OSS Distributions }
105*8d741a5dSApple OSS Distributions }
106*8d741a5dSApple OSS Distributions
107*8d741a5dSApple OSS Distributions /* NOTREACHED */
108*8d741a5dSApple OSS Distributions return 0;
109*8d741a5dSApple OSS Distributions }
110