br 309 ext/gd/libgd/gd_crop.c const int br = gdImageGetPixel(im, gdImageSX(im) - 1, gdImageSY(im) -1); br 311 ext/gd/libgd/gd_crop.c if (tr == bl && tr == br) { br 314 ext/gd/libgd/gd_crop.c } else if (tl == bl && tl == br) { br 317 ext/gd/libgd/gd_crop.c } else if (tl == tr && tl == br) { br 323 ext/gd/libgd/gd_crop.c } else if (tl == tr || tl == bl || tl == br) { br 329 ext/gd/libgd/gd_crop.c } else if (br == bl) { br 335 ext/gd/libgd/gd_crop.c r = (int)(0.5f + (gdImageRed(im, tl) + gdImageRed(im, tr) + gdImageRed(im, bl) + gdImageRed(im, br)) / 4); br 336 ext/gd/libgd/gd_crop.c g = (int)(0.5f + (gdImageGreen(im, tl) + gdImageGreen(im, tr) + gdImageGreen(im, bl) + gdImageGreen(im, br)) / 4); br 337 ext/gd/libgd/gd_crop.c b = (int)(0.5f + (gdImageBlue(im, tl) + gdImageBlue(im, tr) + gdImageBlue(im, bl) + gdImageBlue(im, br)) / 4); br 338 ext/gd/libgd/gd_crop.c a = (int)(0.5f + (gdImageAlpha(im, tl) + gdImageAlpha(im, tr) + gdImageAlpha(im, bl) + gdImageAlpha(im, br)) / 4); br 1536 ext/mbstring/oniguruma/regcomp.c BRefNode* br = NBREF(node); br 1539 ext/mbstring/oniguruma/regcomp.c if (IS_BACKREF_NEST_LEVEL(br)) { br 1541 ext/mbstring/oniguruma/regcomp.c SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); br 1545 ext/mbstring/oniguruma/regcomp.c if (br->back_num == 1) { br 1546 ext/mbstring/oniguruma/regcomp.c r = ((!IS_IGNORECASE(reg->options) && br->back_static[0] <= 2) br 1550 ext/mbstring/oniguruma/regcomp.c r = SIZE_OPCODE + SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); br 1660 ext/mbstring/oniguruma/regcomp.c BRefNode* br = NBREF(node); br 1663 ext/mbstring/oniguruma/regcomp.c if (IS_BACKREF_NEST_LEVEL(br)) { br 1668 ext/mbstring/oniguruma/regcomp.c r = add_length(reg, br->nest_level); br 1675 ext/mbstring/oniguruma/regcomp.c if (br->back_num == 1) { br 1676 ext/mbstring/oniguruma/regcomp.c n = br->back_static[0]; br 1709 ext/mbstring/oniguruma/regcomp.c r = add_length(reg, br->back_num); br 1711 ext/mbstring/oniguruma/regcomp.c p = BACKREFS_P(br); br 1712 ext/mbstring/oniguruma/regcomp.c for (i = br->back_num - 1; i >= 0; i--) { br 2036 ext/mbstring/oniguruma/regcomp.c BRefNode* br = NBREF(node); br 2037 ext/mbstring/oniguruma/regcomp.c if (br->state & NST_RECURSION) break; br 2039 ext/mbstring/oniguruma/regcomp.c backs = BACKREFS_P(br); br 2043 ext/mbstring/oniguruma/regcomp.c for (i = 1; i < br->back_num; i++) { br 2190 ext/mbstring/oniguruma/regcomp.c BRefNode* br = NBREF(node); br 2191 ext/mbstring/oniguruma/regcomp.c if (br->state & NST_RECURSION) { br 2195 ext/mbstring/oniguruma/regcomp.c backs = BACKREFS_P(br); br 2196 ext/mbstring/oniguruma/regcomp.c for (i = 0; i < br->back_num; i++) { br 3704 ext/mbstring/oniguruma/regcomp.c BRefNode* br = NBREF(node); br 3705 ext/mbstring/oniguruma/regcomp.c p = BACKREFS_P(br); br 3706 ext/mbstring/oniguruma/regcomp.c for (i = 0; i < br->back_num; i++) { br 3711 ext/mbstring/oniguruma/regcomp.c if (IS_BACKREF_NEST_LEVEL(br)) { br 4734 ext/mbstring/oniguruma/regcomp.c BRefNode* br = NBREF(node); br 4736 ext/mbstring/oniguruma/regcomp.c if (br->state & NST_RECURSION) { br 4740 ext/mbstring/oniguruma/regcomp.c backs = BACKREFS_P(br); br 4745 ext/mbstring/oniguruma/regcomp.c for (i = 1; i < br->back_num; i++) { br 6220 ext/mbstring/oniguruma/regcomp.c BRefNode* br = NBREF(node); br 6221 ext/mbstring/oniguruma/regcomp.c p = BACKREFS_P(br); br 6223 ext/mbstring/oniguruma/regcomp.c for (i = 0; i < br->back_num; i++) { br 110 ext/mbstring/oniguruma/regparse.h #define BACKREFS_P(br) \ br 111 ext/mbstring/oniguruma/regparse.h (IS_NOT_NULL((br)->back_dynamic) ? (br)->back_dynamic : (br)->back_static); br 4713 ext/standard/string.c int br, depth=0, in_q = 0; br 4728 ext/standard/string.c br = 0; br 4769 ext/standard/string.c br++; br 4787 ext/standard/string.c br--; br 4835 ext/standard/string.c if (!br && lc != '\"' && *(p-1) == '?') { br 4919 ext/standard/string.c br=0; br 163 main/streams/streams.c const char *br; br 169 main/streams/streams.c br = "<br />\n"; br 172 main/streams/streams.c br = "\n"; br 190 main/streams/streams.c strcat(msg, br);