/* Return the length of the maximum initial segment of S which contains only characters in ACCEPT. */ size_t STRSPN (const char *str, const char *accept) { if (accept[0] == '\0') return 0; if (__glibc_unlikely (accept[1] == '\0')) { const char *a = str; for (; *str == *accept; str++); return str - a; } /* Use multiple small memsets to enable inlining on most targets. */ unsigned char table[256]; unsigned char *p = memset (table, 0, 64); memset (p + 64, 0, 64); memset (p + 128, 0, 64); memset (p + 192, 0, 64); unsigned char *s = (unsigned char*) accept; /* Different from strcspn it does not add the NULL on the table so can avoid check if str[i] is NULL, since table['\0'] will be 0 and thus stopping the loop check. */ do p[*s++] = 1; while (*s); s = (unsigned char*) str; if (!p[s[0]]) return 0; if (!p[s[1]]) return 1; if (!p[s[2]]) return 2; if (!p[s[3]]) return 3; s = (unsigned char *) PTR_ALIGN_DOWN (s, 4); unsigned int c0, c1, c2, c3; do { s += 4; c0 = p[s[0]]; c1 = p[s[1]]; c2 = p[s[2]]; c3 = p[s[3]]; } while ((c0 & c1 & c2 & c3) != 0); size_t count = s - (unsigned char *) str; return (c0 & c1) == 0 ? count + c0 : count + c2 + 2; }
mps_res_t MPS_CALL ps_scan(mps_ss_t scan_state, mps_addr_t base, mps_addr_t limit) { register OBJECT *obj; OBJECT *obj_limit; register mps_addr_t ref; size_t len = 0; obj_limit = limit; MPS_SCAN_BEGIN( scan_state ) for ( obj = base; obj < obj_limit; obj++ ) { ref = (mps_addr_t)oOther( *obj ); switch ( oType( *obj )) { case ONAME: MPS_RETAIN( (mps_addr_t *)&oName( *obj ), TRUE ); continue; case OSAVE: continue; case ODICTIONARY: NOTREACHED; break; case OSTRING: { mps_addr_t ref_limit; ref_limit = ADDR_ADD( ref, theLen(*obj)); /* ref could point into the middle of a string, so align it. */ ref = PTR_ALIGN_DOWN( mps_addr_t, ref, MM_PS_ALIGNMENT ); len = ADDR_OFFSET( ref, ref_limit ); } break; case OFILE: NOTREACHED; break; case OARRAY: case OPACKEDARRAY: len = theLen(*obj) * sizeof( OBJECT ); break; case OGSTATE: case OLONGSTRING: NOTREACHED; break; default: continue; /* not a composite object */ } PS_MARK_BLOCK( scan_state, ref, len ); } MPS_SCAN_END(scan_state); return MPS_RES_OK; }
/* Return the length of the maximum initial segment of S which contains no characters from REJECT. */ size_t STRCSPN (const char *str, const char *reject) { if (__glibc_unlikely (reject[0] == '\0') || __glibc_unlikely (reject[1] == '\0')) return __strchrnul (str, reject [0]) - str; /* Use multiple small memsets to enable inlining on most targets. */ unsigned char table[256]; unsigned char *p = memset (table, 0, 64); memset (p + 64, 0, 64); memset (p + 128, 0, 64); memset (p + 192, 0, 64); unsigned char *s = (unsigned char*) reject; unsigned char tmp; do p[tmp = *s++] = 1; while (tmp); s = (unsigned char*) str; if (p[s[0]]) return 0; if (p[s[1]]) return 1; if (p[s[2]]) return 2; if (p[s[3]]) return 3; s = (unsigned char *) PTR_ALIGN_DOWN (s, 4); unsigned int c0, c1, c2, c3; do { s += 4; c0 = p[s[0]]; c1 = p[s[1]]; c2 = p[s[2]]; c3 = p[s[3]]; } while ((c0 | c1 | c2 | c3) == 0); size_t count = s - (unsigned char *) str; return (c0 | c1) != 0 ? count - c0 + 1 : count - c2 + 3; }