Home
last modified time | relevance | path

Searched refs:seekchar (Results 1 - 5 of 5) sorted by relevance

/third_party/optimized-routines/string/test/
H A Dmemchr.c58 int seekchar = 1; in test() local
67 src[i] = seekchar; in test()
69 s[len + i] = seekchar; in test()
72 s[seekpos] = seekchar; in test()
73 s[((len ^ align) & 1) ? seekpos + 1 : len] = seekchar; in test()
77 p = fun->fun (s, seekchar, maxlen); in test()
84 seekchar, maxlen, p, f); in test()
H A Dmemrchr.c56 int seekchar = 1; in test() local
65 src[i] = seekchar; in test()
67 s[len + i] = seekchar; in test()
70 s[seekpos] = seekchar; in test()
71 s[((len ^ align) & 1) && seekpos < maxlen ? seekpos - 1 : len] = seekchar; in test()
74 p = fun->fun (s, seekchar, maxlen); in test()
81 seekchar, maxlen, p, f); in test()
H A Dstrchrnul.c59 int seekchar = 0x1; in test() local
68 src[i] = (i + len) & 1 ? seekchar : 0; in test()
70 s[len + i] = (i + len) & 1 ? seekchar : 0; in test()
74 s[seekpos] = seekchar; in test()
76 s[seekpos + 1] = seekchar; in test()
81 p = fun->fun (s, seekchar); in test()
88 fun->name, s, seekchar, len, p, f, seekpos); in test()
H A Dstrrchr.c55 int seekchar = 0x1; in test() local
64 src[i] = (i + len) & 1 ? seekchar : 0; in test()
66 s[len + i] = (i + len) & 1 ? seekchar : 0; in test()
70 s[seekpos / 2] = s[seekpos] = seekchar; in test()
72 s[seekpos - 1] = seekchar; in test()
76 p = fun->fun (s, seekchar); in test()
83 fun->name, s, seekchar, len, p, f, seekpos); in test()
H A Dstrchr.c55 int seekchar = 0x1; in test() local
64 src[i] = (i + len) & 1 ? seekchar : 0; in test()
66 s[len + i] = (i + len) & 1 ? seekchar : 0; in test()
70 s[seekpos] = seekchar; in test()
72 s[seekpos + 1] = seekchar; in test()
76 p = fun->fun (s, seekchar); in test()
83 fun->name, s, seekchar, len, p, f, seekpos); in test()

Completed in 2 milliseconds