cs                810 ext/com_dotnet/com_com.c 	zend_bool cs = TRUE;
cs                814 ext/com_dotnet/com_com.c 	if (FAILURE == zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "s|b", &name, &namelen, &cs)) {
cs                825 ext/com_dotnet/com_com.c 		} else if (php_com_import_typelib(pTL, cs ? CONST_CS : 0, codepage TSRMLS_CC) == SUCCESS) {
cs                 96 ext/ereg/regex/debug.c 	register cset *cs;
cs                148 ext/ereg/regex/debug.c 			cs = &g->sets[opnd];
cs                151 ext/ereg/regex/debug.c 				if (CHIN(cs, i) && i < g->csetsize) {
cs                439 ext/ereg/regex/engine.c 	register cset *cs;
cs                458 ext/ereg/regex/engine.c 			cs = &m->g->sets[OPND(s)];
cs                459 ext/ereg/regex/engine.c 			if (sp == stop || !CHIN(cs, *sp++))
cs                820 ext/ereg/regex/engine.c 	register cset *cs;
cs                860 ext/ereg/regex/engine.c 			cs = &g->sets[OPND(s)];
cs                861 ext/ereg/regex/engine.c 			if (!NONCHAR(ch) && CHIN(cs, ch))
cs                593 ext/ereg/regex/regcomp.c 	register cset *cs = allocset(p);
cs                611 ext/ereg/regex/regcomp.c 		CHadd(cs, ']');
cs                613 ext/ereg/regex/regcomp.c 		CHadd(cs, '-');
cs                615 ext/ereg/regex/regcomp.c 		p_b_term(p, cs);
cs                617 ext/ereg/regex/regcomp.c 		CHadd(cs, '-');
cs                628 ext/ereg/regex/regcomp.c 			if (CHIN(cs, i) && isalpha(i)) {
cs                631 ext/ereg/regex/regcomp.c 					CHadd(cs, ci);
cs                633 ext/ereg/regex/regcomp.c 		if (cs->multis != NULL)
cs                634 ext/ereg/regex/regcomp.c 			mccase(p, cs);
cs                640 ext/ereg/regex/regcomp.c 			if (CHIN(cs, i))
cs                641 ext/ereg/regex/regcomp.c 				CHsub(cs, i);
cs                643 ext/ereg/regex/regcomp.c 				CHadd(cs, i);
cs                645 ext/ereg/regex/regcomp.c 			CHsub(cs, '\n');
cs                646 ext/ereg/regex/regcomp.c 		if (cs->multis != NULL)
cs                647 ext/ereg/regex/regcomp.c 			mcinvert(p, cs);
cs                650 ext/ereg/regex/regcomp.c 	assert(cs->multis == NULL);		/* xxx */
cs                652 ext/ereg/regex/regcomp.c 	if (nch(p, cs) == 1) {		/* optimize singleton sets */
cs                653 ext/ereg/regex/regcomp.c 		ordinary(p, firstch(p, cs));
cs                654 ext/ereg/regex/regcomp.c 		freeset(p, cs);
cs                656 ext/ereg/regex/regcomp.c 		EMIT(OANYOF, freezeset(p, cs));
cs                664 ext/ereg/regex/regcomp.c p_b_term(p, cs)
cs                666 ext/ereg/regex/regcomp.c register cset *cs;
cs                692 ext/ereg/regex/regcomp.c 		p_b_cclass(p, cs);
cs                701 ext/ereg/regex/regcomp.c 		p_b_eclass(p, cs);
cs                720 ext/ereg/regex/regcomp.c 			CHadd(cs, i);
cs                730 ext/ereg/regex/regcomp.c p_b_cclass(p, cs)
cs                732 ext/ereg/regex/regcomp.c register cset *cs;
cs                754 ext/ereg/regex/regcomp.c 		CHadd(cs, c);
cs                756 ext/ereg/regex/regcomp.c 		MCadd(p, cs, u);
cs                766 ext/ereg/regex/regcomp.c p_b_eclass(p, cs)
cs                768 ext/ereg/regex/regcomp.c register cset *cs;
cs                773 ext/ereg/regex/regcomp.c 	CHadd(cs, c);
cs               1014 ext/ereg/regex/regcomp.c 	register cset *cs;
cs               1048 ext/ereg/regex/regcomp.c 	cs = &p->g->sets[no];
cs               1049 ext/ereg/regex/regcomp.c 	cs->ptr = p->g->setbits + css*((no)/CHAR_BIT);
cs               1050 ext/ereg/regex/regcomp.c 	cs->mask = 1 << ((no) % CHAR_BIT);
cs               1051 ext/ereg/regex/regcomp.c 	cs->hash = 0;
cs               1052 ext/ereg/regex/regcomp.c 	cs->smultis = 0;
cs               1053 ext/ereg/regex/regcomp.c 	cs->multis = NULL;
cs               1055 ext/ereg/regex/regcomp.c 	return(cs);
cs               1063 ext/ereg/regex/regcomp.c freeset(p, cs)
cs               1065 ext/ereg/regex/regcomp.c register cset *cs;
cs               1072 ext/ereg/regex/regcomp.c 		CHsub(cs, i);
cs               1073 ext/ereg/regex/regcomp.c 	if (cs == top-1)	/* recover only the easy case */
cs               1088 ext/ereg/regex/regcomp.c freezeset(p, cs)
cs               1090 ext/ereg/regex/regcomp.c register cset *cs;
cs               1092 ext/ereg/regex/regcomp.c 	register uch h = cs->hash;
cs               1100 ext/ereg/regex/regcomp.c 		if (cs2->hash == h && cs2 != cs) {
cs               1103 ext/ereg/regex/regcomp.c 				if (!!CHIN(cs2, i) != !!CHIN(cs, i))
cs               1110 ext/ereg/regex/regcomp.c 		freeset(p, cs);
cs               1111 ext/ereg/regex/regcomp.c 		cs = cs2;
cs               1114 ext/ereg/regex/regcomp.c 	return((int)(cs - p->g->sets));
cs               1122 ext/ereg/regex/regcomp.c firstch(p, cs)
cs               1124 ext/ereg/regex/regcomp.c register cset *cs;
cs               1130 ext/ereg/regex/regcomp.c 		if (CHIN(cs, i))
cs               1141 ext/ereg/regex/regcomp.c nch(p, cs)
cs               1143 ext/ereg/regex/regcomp.c register cset *cs;
cs               1150 ext/ereg/regex/regcomp.c 		if (CHIN(cs, i))
cs               1161 ext/ereg/regex/regcomp.c mcadd(p, cs, cp)
cs               1163 ext/ereg/regex/regcomp.c register cset *cs;
cs               1166 ext/ereg/regex/regcomp.c 	register size_t oldend = cs->smultis;
cs               1168 ext/ereg/regex/regcomp.c 	cs->smultis += strlen(cp) + 1;
cs               1169 ext/ereg/regex/regcomp.c 	if (cs->multis == NULL)
cs               1170 ext/ereg/regex/regcomp.c 		cs->multis = malloc(cs->smultis);
cs               1172 ext/ereg/regex/regcomp.c 		cs->multis = realloc(cs->multis, cs->smultis);
cs               1173 ext/ereg/regex/regcomp.c 	if (cs->multis == NULL) {
cs               1178 ext/ereg/regex/regcomp.c 	(void) strcpy(cs->multis + oldend - 1, cp);
cs               1179 ext/ereg/regex/regcomp.c 	cs->multis[cs->smultis - 1] = '\0';
cs               1188 ext/ereg/regex/regcomp.c mcsub(cs, cp)
cs               1189 ext/ereg/regex/regcomp.c register unsigned cset *cs;
cs               1192 ext/ereg/regex/regcomp.c 	register unsigned char *fp = mcfind(cs, cp);
cs               1197 ext/ereg/regex/regcomp.c 				cs->smultis - (fp + len + 1 - cs->multis));
cs               1198 ext/ereg/regex/regcomp.c 	cs->smultis -= len;
cs               1200 ext/ereg/regex/regcomp.c 	if (cs->smultis == 0) {
cs               1201 ext/ereg/regex/regcomp.c 		free(cs->multis);
cs               1202 ext/ereg/regex/regcomp.c 		cs->multis = NULL;
cs               1206 ext/ereg/regex/regcomp.c 	cs->multis = realloc(cs->multis, cs->smultis);
cs               1207 ext/ereg/regex/regcomp.c 	assert(cs->multis != NULL);
cs               1215 ext/ereg/regex/regcomp.c mcin(cs, cp)
cs               1216 ext/ereg/regex/regcomp.c register cset *cs;
cs               1219 ext/ereg/regex/regcomp.c 	return(mcfind(cs, cp) != NULL);
cs               1228 ext/ereg/regex/regcomp.c mcfind(cs, cp)
cs               1229 ext/ereg/regex/regcomp.c register cset *cs;
cs               1234 ext/ereg/regex/regcomp.c 	if (cs->multis == NULL)
cs               1236 ext/ereg/regex/regcomp.c 	for (p = cs->multis; *p != '\0'; p += strlen(p) + 1)
cs               1251 ext/ereg/regex/regcomp.c mcinvert(p, cs)
cs               1253 ext/ereg/regex/regcomp.c register cset *cs;
cs               1255 ext/ereg/regex/regcomp.c 	assert(cs->multis == NULL);	/* xxx */
cs               1266 ext/ereg/regex/regcomp.c mccase(p, cs)
cs               1268 ext/ereg/regex/regcomp.c register cset *cs;
cs               1270 ext/ereg/regex/regcomp.c 	assert(cs->multis == NULL);	/* xxx */
cs                 96 ext/ereg/regex/regex2.h #define	CHadd(cs, c)	((cs)->ptr[(uch)(c)] |= (cs)->mask, (cs)->hash += (c))
cs                 97 ext/ereg/regex/regex2.h #define	CHsub(cs, c)	((cs)->ptr[(uch)(c)] &= ~(cs)->mask, (cs)->hash -= (c))
cs                 98 ext/ereg/regex/regex2.h #define	CHIN(cs, c)	((cs)->ptr[(uch)(c)] & (cs)->mask)
cs                 99 ext/ereg/regex/regex2.h #define	MCadd(p, cs, cp)	mcadd(p, cs, cp)	/* regcomp() internal fns */
cs                100 ext/ereg/regex/regex2.h #define	MCsub(p, cs, cp)	mcsub(p, cs, cp)
cs                101 ext/ereg/regex/regex2.h #define	MCin(p, cs, cp)	mcin(p, cs, cp)
cs                635 ext/gd/libgd/gd.h void gdImageGd2(gdImagePtr im, FILE *out, int cs, int fmt);
cs                645 ext/gd/libgd/gd.h void* gdImageGd2Ptr(gdImagePtr im, int cs, int fmt, int *size);
cs                 54 ext/gd/libgd/gd_gd2.c static int _gd2GetHeader(gdIOCtxPtr in, int *sx, int *sy, int *cs, int *vers, int *fmt, int *ncx, int *ncy, t_chunk_info ** chunkIdx)
cs                105 ext/gd/libgd/gd_gd2.c 	if (gdGetWord(cs, in) != 1) {
cs                108 ext/gd/libgd/gd_gd2.c 	GD2_DBG(php_gd_error("ChunkSize: %d", *cs));
cs                110 ext/gd/libgd/gd_gd2.c 	if ((*cs < GD2_CHUNKSIZE_MIN) || (*cs > GD2_CHUNKSIZE_MAX)) {
cs                111 ext/gd/libgd/gd_gd2.c 		GD2_DBG(php_gd_error("Bad chunk size: %d", *cs));
cs                165 ext/gd/libgd/gd_gd2.c static gdImagePtr _gd2CreateFromFile (gdIOCtxPtr in, int *sx, int *sy, int *cs, int *vers, int *fmt, int *ncx, int *ncy, t_chunk_info ** cidx)
cs                169 ext/gd/libgd/gd_gd2.c 	if (_gd2GetHeader (in, sx, sy, cs, vers, fmt, ncx, ncy, cidx) != 1) {
cs                253 ext/gd/libgd/gd_gd2.c 	int ncx, ncy, nc, cs, cx, cy;
cs                269 ext/gd/libgd/gd_gd2.c 	if (!(im = _gd2CreateFromFile(in, &sx, &sy, &cs, &vers, &fmt, &ncx, &ncy, &chunkIdx))) {
cs                287 ext/gd/libgd/gd_gd2.c 		chunkMax = cs * bytesPerPixel * cs;
cs                300 ext/gd/libgd/gd_gd2.c 			ylo = cy * cs;
cs                301 ext/gd/libgd/gd_gd2.c 			yhi = ylo + cs;
cs                320 ext/gd/libgd/gd_gd2.c 				xlo = cx * cs;
cs                321 ext/gd/libgd/gd_gd2.c 				xhi = xlo + cs;
cs                415 ext/gd/libgd/gd_gd2.c 	int nc, ncx, ncy, cs, cx, cy;
cs                441 ext/gd/libgd/gd_gd2.c 	if (_gd2GetHeader(in, &fsx, &fsy, &cs, &vers, &fmt, &ncx, &ncy, &chunkIdx) != 1) {
cs                476 ext/gd/libgd/gd_gd2.c 			chunkMax = cs * cs * 4;
cs                478 ext/gd/libgd/gd_gd2.c 			chunkMax = cs * cs;
cs                489 ext/gd/libgd/gd_gd2.c 	scx = srcx / cs;
cs                490 ext/gd/libgd/gd_gd2.c 	scy = srcy / cs;
cs                498 ext/gd/libgd/gd_gd2.c 	ecx = (srcx + w) / cs;
cs                499 ext/gd/libgd/gd_gd2.c 	ecy = (srcy + h) / cs;
cs                513 ext/gd/libgd/gd_gd2.c 		ylo = cy * cs;
cs                514 ext/gd/libgd/gd_gd2.c 		yhi = ylo + cs;
cs                521 ext/gd/libgd/gd_gd2.c 			xlo = cx * cs;
cs                522 ext/gd/libgd/gd_gd2.c 			xhi = xlo + cs;
cs                532 ext/gd/libgd/gd_gd2.c 					dpos = (cy * (cs * fsx) * 4 + cx * cs * (yhi - ylo) * 4) + dstart;
cs                534 ext/gd/libgd/gd_gd2.c 					dpos = cy * (cs * fsx) + cx * cs * (yhi - ylo) + dstart;
cs                622 ext/gd/libgd/gd_gd2.c static void _gd2PutHeader (gdImagePtr im, gdIOCtx * out, int cs, int fmt, int cx, int cy)
cs                636 ext/gd/libgd/gd_gd2.c 	gdPutWord(cs, out);
cs                642 ext/gd/libgd/gd_gd2.c static void _gdImageGd2 (gdImagePtr im, gdIOCtx * out, int cs, int fmt)
cs                670 ext/gd/libgd/gd_gd2.c 	if (cs == 0) {
cs                671 ext/gd/libgd/gd_gd2.c 		cs = GD2_CHUNKSIZE;
cs                672 ext/gd/libgd/gd_gd2.c 	} else if (cs < GD2_CHUNKSIZE_MIN) {
cs                673 ext/gd/libgd/gd_gd2.c 		cs = GD2_CHUNKSIZE_MIN;
cs                674 ext/gd/libgd/gd_gd2.c 	} else if (cs > GD2_CHUNKSIZE_MAX) {
cs                675 ext/gd/libgd/gd_gd2.c 		cs = GD2_CHUNKSIZE_MAX;
cs                679 ext/gd/libgd/gd_gd2.c 	ncx = im->sx / cs + 1;
cs                680 ext/gd/libgd/gd_gd2.c 	ncy = im->sy / cs + 1;
cs                683 ext/gd/libgd/gd_gd2.c 	_gd2PutHeader (im, out, cs, fmt, ncx, ncy);
cs                693 ext/gd/libgd/gd_gd2.c 		compMax = (int)(cs * bytesPerPixel * cs * 1.02f) + 12;
cs                696 ext/gd/libgd/gd_gd2.c 		chunkData = safe_emalloc(cs * bytesPerPixel, cs, 0);
cs                697 ext/gd/libgd/gd_gd2.c 		memset(chunkData, 0, cs * bytesPerPixel * cs);
cs                722 ext/gd/libgd/gd_gd2.c 			ylo = cy * cs;
cs                723 ext/gd/libgd/gd_gd2.c 			yhi = ylo + cs;
cs                732 ext/gd/libgd/gd_gd2.c 				xlo = cx * cs;
cs                733 ext/gd/libgd/gd_gd2.c 				xhi = xlo + cs;
cs                810 ext/gd/libgd/gd_gd2.c void gdImageGd2 (gdImagePtr im, FILE * outFile, int cs, int fmt)
cs                814 ext/gd/libgd/gd_gd2.c 	_gdImageGd2(im, out, cs, fmt);
cs                819 ext/gd/libgd/gd_gd2.c void *gdImageGd2Ptr (gdImagePtr im, int cs, int fmt, int *size)
cs                824 ext/gd/libgd/gd_gd2.c 	_gdImageGd2(im, out, cs, fmt);
cs                 16 ext/gd/libgd/pngtogd2.c   int cs, fmt;
cs                 45 ext/gd/libgd/pngtogd2.c   cs = atoi (argv[3]);
cs                 47 ext/gd/libgd/pngtogd2.c   gdImageGd2 (im, out, cs, fmt);
cs               11223 ext/mbstring/oniguruma/enc/unicode.c       OnigCodePoint cs[3][4];
cs               11227 ext/mbstring/oniguruma/enc/unicode.c 	cs[fn][0] = to->code[fn];
cs               11228 ext/mbstring/oniguruma/enc/unicode.c 	if (onig_st_lookup(Unfold1Table, (st_data_t )cs[fn][0],
cs               11231 ext/mbstring/oniguruma/enc/unicode.c 	    cs[fn][i+1] = z3->code[i];
cs               11244 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code[0]  = cs[0][i];
cs               11245 ext/mbstring/oniguruma/enc/unicode.c 	    items[n].code[1]  = cs[1][j];
cs               11268 ext/mbstring/oniguruma/enc/unicode.c 	      items[n].code[0]  = cs[0][i];
cs               11269 ext/mbstring/oniguruma/enc/unicode.c 	      items[n].code[1]  = cs[1][j];
cs               11270 ext/mbstring/oniguruma/enc/unicode.c 	      items[n].code[2]  = cs[2][k];
cs               1015 ext/mysqli/mysqli_nonapi.c 	MY_CHARSET_INFO			cs;
cs               1017 ext/mysqli/mysqli_nonapi.c 	const MYSQLND_CHARSET	*cs;
cs               1027 ext/mysqli/mysqli_nonapi.c 	mysql_get_character_set_info(mysql->mysql, &cs);
cs               1028 ext/mysqli/mysqli_nonapi.c 	name = (char *)cs.csname;
cs               1029 ext/mysqli/mysqli_nonapi.c 	collation = (char *)cs.name;
cs               1030 ext/mysqli/mysqli_nonapi.c 	dir = (char *)cs.dir;
cs               1031 ext/mysqli/mysqli_nonapi.c 	minlength = cs.mbminlen;
cs               1032 ext/mysqli/mysqli_nonapi.c 	maxlength = cs.mbmaxlen;
cs               1033 ext/mysqli/mysqli_nonapi.c 	number = cs.number;
cs               1034 ext/mysqli/mysqli_nonapi.c 	state = cs.state;
cs               1035 ext/mysqli/mysqli_nonapi.c 	comment = cs.comment;
cs               1037 ext/mysqli/mysqli_nonapi.c 	cs = mysql->mysql->data->charset;
cs               1038 ext/mysqli/mysqli_nonapi.c 	if (!cs) {
cs               1042 ext/mysqli/mysqli_nonapi.c 	name = cs->name;
cs               1043 ext/mysqli/mysqli_nonapi.c 	collation = cs->collation;
cs               1044 ext/mysqli/mysqli_nonapi.c 	minlength = cs->char_minlen;
cs               1045 ext/mysqli/mysqli_nonapi.c 	maxlength = cs->char_maxlen;
cs               1046 ext/mysqli/mysqli_nonapi.c 	number = cs->nr;
cs               1047 ext/mysqli/mysqli_nonapi.c 	comment = cs->comment;
cs                211 ext/mysqlnd/mysqlnd.h #define mysqlnd_set_character_set(conn, cs)	((conn)->data)->m->set_charset((conn)->data, (cs) TSRMLS_CC)
cs                327 ext/opcache/Optimizer/block_pass.c #define DEL_SOURCE(cs) { \
cs                328 ext/opcache/Optimizer/block_pass.c 	zend_block_source *__ns = (*cs)->next; \
cs                329 ext/opcache/Optimizer/block_pass.c 	efree(*cs); \
cs                330 ext/opcache/Optimizer/block_pass.c 	*cs = __ns; \
cs                337 ext/opcache/Optimizer/block_pass.c 	zend_block_source **cs;
cs                340 ext/opcache/Optimizer/block_pass.c 	for (cs = &list; *cs; cs = &((*cs)->next)) {
cs                341 ext/opcache/Optimizer/block_pass.c 		if ((*cs)->from == new) {
cs                343 ext/opcache/Optimizer/block_pass.c 				DEL_SOURCE(cs);
cs                349 ext/opcache/Optimizer/block_pass.c 		if ((*cs)->from == old) {
cs                351 ext/opcache/Optimizer/block_pass.c 				DEL_SOURCE(cs);
cs                353 ext/opcache/Optimizer/block_pass.c 				(*cs)->from = new;
cs                363 ext/opcache/Optimizer/block_pass.c 	zend_block_source **cs = &to->sources;
cs                374 ext/opcache/Optimizer/block_pass.c 	while (*cs) {
cs                375 ext/opcache/Optimizer/block_pass.c 		if ((*cs)->from == from) {
cs                376 ext/opcache/Optimizer/block_pass.c 		 	DEL_SOURCE(cs);
cs                379 ext/opcache/Optimizer/block_pass.c 		cs = &((*cs)->next);
cs                497 ext/opcache/Optimizer/block_pass.c 		zend_block_source *cs;
cs                502 ext/opcache/Optimizer/block_pass.c 		cs = b->sources;
cs                503 ext/opcache/Optimizer/block_pass.c 		while (cs) {
cs                504 ext/opcache/Optimizer/block_pass.c 			zend_block_source *n = cs->next;
cs                505 ext/opcache/Optimizer/block_pass.c 			efree(cs);
cs                506 ext/opcache/Optimizer/block_pass.c 			cs = n;
cs               1423 ext/opcache/Optimizer/block_pass.c 					zend_block_source *cs = block->op1_to->sources;
cs               1426 ext/opcache/Optimizer/block_pass.c 					while(cs) {
cs               1427 ext/opcache/Optimizer/block_pass.c 						if (cs->from->follow_to == block->op1_to) {
cs               1431 ext/opcache/Optimizer/block_pass.c 						cs = cs->next;
cs               2095 ext/opcache/Optimizer/block_pass.c 		zend_block_source *cs = cur_block->sources;
cs               2096 ext/opcache/Optimizer/block_pass.c 		while (cs) {
cs               2097 ext/opcache/Optimizer/block_pass.c 			zend_block_source *n = cs->next;
cs               2098 ext/opcache/Optimizer/block_pass.c 			efree(cs);
cs               2099 ext/opcache/Optimizer/block_pass.c 			cs = n;
cs               1750 ext/pcre/pcrelib/pcre_compile.c   pcre_uchar *ce, *cs;
cs               1797 ext/pcre/pcrelib/pcre_compile.c     cs = ce = (pcre_uchar *)cd->start_code + GET(cc, 1);  /* Start subpattern */
cs               1799 ext/pcre/pcrelib/pcre_compile.c     if (cc > cs && cc < ce) return -1;                    /* Recursion */
cs               1803 ext/pcre/pcrelib/pcre_compile.c       for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break;
cs               1807 ext/pcre/pcrelib/pcre_compile.c     this_recurse.group = cs;
cs               1808 ext/pcre/pcrelib/pcre_compile.c     d = find_fixedlength(cs + IMM2_SIZE, utf, atend, cd, &this_recurse);
cs                106 ext/pcre/pcrelib/pcre_study.c   pcre_uchar *cs, *ce;
cs                118 ext/pcre/pcrelib/pcre_study.c     cs = cc + GET(cc, 1);
cs                119 ext/pcre/pcrelib/pcre_study.c     if (*cs != OP_ALT)
cs                121 ext/pcre/pcrelib/pcre_study.c       cc = cs + 1 + LINK_SIZE;
cs                398 ext/pcre/pcrelib/pcre_study.c         ce = cs = (pcre_uchar *)PRIV(find_bracket)(startcode, utf, GET2(slot, 0));
cs                399 ext/pcre/pcrelib/pcre_study.c         if (cs == NULL) return -2;
cs                401 ext/pcre/pcrelib/pcre_study.c         if (cc > cs && cc < ce)     /* Simple recursion */
cs                410 ext/pcre/pcrelib/pcre_study.c           for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break;
cs                421 ext/pcre/pcrelib/pcre_study.c             this_recurse.group = cs;
cs                422 ext/pcre/pcrelib/pcre_study.c             dd = find_minlength(re, cs, startcode, options, &this_recurse,
cs                438 ext/pcre/pcrelib/pcre_study.c       ce = cs = (pcre_uchar *)PRIV(find_bracket)(startcode, utf, GET2(cc, 1));
cs                439 ext/pcre/pcrelib/pcre_study.c       if (cs == NULL) return -2;
cs                441 ext/pcre/pcrelib/pcre_study.c       if (cc > cs && cc < ce)    /* Simple recursion */
cs                449 ext/pcre/pcrelib/pcre_study.c         for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break;
cs                458 ext/pcre/pcrelib/pcre_study.c           this_recurse.group = cs;
cs                459 ext/pcre/pcrelib/pcre_study.c           d = find_minlength(re, cs, startcode, options, &this_recurse,
cs                508 ext/pcre/pcrelib/pcre_study.c     cs = ce = (pcre_uchar *)startcode + GET(cc, 1);
cs                510 ext/pcre/pcrelib/pcre_study.c     if (cc > cs && cc < ce)    /* Simple recursion */
cs                515 ext/pcre/pcrelib/pcre_study.c       for (r = recurses; r != NULL; r = r->prev) if (r->group == cs) break;
cs                521 ext/pcre/pcrelib/pcre_study.c         this_recurse.group = cs;
cs                522 ext/pcre/pcrelib/pcre_study.c         branchlength += find_minlength(re, cs, startcode, options,
cs                 36 ext/standard/html_tables.h #define CHARSET_UNICODE_COMPAT(cs)	((cs) <= cs_8859_1)
cs                 37 ext/standard/html_tables.h #define CHARSET_SINGLE_BYTE(cs)		((cs) > cs_utf_8 && (cs) < cs_big5)
cs                 38 ext/standard/html_tables.h #define CHARSET_PARTIAL_SUPPORT(cs)	((cs) >= cs_big5)
cs               5612 ext/standard/string.c 	zend_bool cs=0;
cs               5615 ext/standard/string.c 	if (zend_parse_parameters(ZEND_NUM_ARGS() TSRMLS_CC, "ssl|lb", &s1, &s1_len, &s2, &s2_len, &offset, &len, &cs) == FAILURE) {
cs               5640 ext/standard/string.c 	if (!cs) {
cs                239 ext/zip/lib/zip_extra_field_api.c     zip_uint16_t ls, cs;
cs                292 ext/zip/lib/zip_extra_field_api.c 	cs = _zip_ef_size(de->extra_fields, ZIP_EF_CENTRAL);
cs                294 ext/zip/lib/zip_extra_field_api.c 	cs = 0;
cs                296 ext/zip/lib/zip_extra_field_api.c     new_len = ls > cs ? ls : cs;