mirror of
https://github.com/johndoe6345789/typthon.git
synced 2026-04-25 14:15:29 +00:00
b198f511d2
Massive automated renaming of all Py_/PyObject/etc. prefixes to Ty_/TyObject/etc. This includes: - All public API types (TyObject, TyTypeObject, etc.) - All public API functions (Ty_Initialize, Ty_BuildValue, etc.) - All internal API (_Ty_ prefixes) - Reference counting macros (Ty_INCREF, Ty_DECREF, etc.) - Type flags (Ty_TPFLAGS_*) - Debug flags (Ty_DEBUG, Ty_TRACE_REFS, etc.) - All object type APIs (TyList_, TyDict_, TyUnicode_, etc.) This changes over 60,000 occurrences across 1000+ files. Co-authored-by: johndoe6345789 <224850594+johndoe6345789@users.noreply.github.com>
54 lines
1.8 KiB
C
54 lines
1.8 KiB
C
/* stringlib: replace implementation */
|
|
|
|
#ifndef STRINGLIB_FASTSEARCH_H
|
|
#error must include "stringlib/fastsearch.h" before including this module
|
|
#endif
|
|
|
|
Ty_LOCAL_INLINE(void)
|
|
STRINGLIB(replace_1char_inplace)(STRINGLIB_CHAR* s, STRINGLIB_CHAR* end,
|
|
Ty_UCS4 u1, Ty_UCS4 u2, Ty_ssize_t maxcount)
|
|
{
|
|
*s = u2;
|
|
while (--maxcount && ++s != end) {
|
|
/* Find the next character to be replaced.
|
|
|
|
If it occurs often, it is faster to scan for it using an inline
|
|
loop. If it occurs seldom, it is faster to scan for it using a
|
|
function call; the overhead of the function call is amortized
|
|
across the many characters that call covers. We start with an
|
|
inline loop and use a heuristic to determine whether to fall back
|
|
to a function call. */
|
|
if (*s != u1) {
|
|
int attempts = 10;
|
|
/* search u1 in a dummy loop */
|
|
while (1) {
|
|
if (++s == end)
|
|
return;
|
|
if (*s == u1)
|
|
break;
|
|
if (!--attempts) {
|
|
/* if u1 was not found for attempts iterations,
|
|
use FASTSEARCH() or memchr() */
|
|
#ifdef STRINGLIB_FAST_MEMCHR
|
|
s++;
|
|
s = STRINGLIB_FAST_MEMCHR(s, u1, end - s);
|
|
if (s == NULL)
|
|
return;
|
|
#else
|
|
Ty_ssize_t i;
|
|
STRINGLIB_CHAR ch1 = (STRINGLIB_CHAR) u1;
|
|
s++;
|
|
i = FASTSEARCH(s, end - s, &ch1, 1, 0, FAST_SEARCH);
|
|
if (i < 0)
|
|
return;
|
|
s += i;
|
|
#endif
|
|
/* restart the dummy loop */
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
*s = u2;
|
|
}
|
|
}
|