Home
last modified time | relevance | path

Searched refs:SINGLE_BYTE_SIZE (Results 1 – 4 of 4) sorted by relevance

/PHP-5.3/ext/mbstring/oniguruma/
H A Dregint.h423 #define SINGLE_BYTE_SIZE (1 << BITS_PER_BYTE) macro
425 #define BITSET_SIZE (SINGLE_BYTE_SIZE / BITS_IN_ROOM)
H A Dregparse.c153 for (i = from; i <= to && i < SINGLE_BYTE_SIZE; i++) { in bitset_set_range()
3646 for (c = 0; c < SINGLE_BYTE_SIZE; c++) { in add_ctype_to_cc()
3653 for (c = 0; c < SINGLE_BYTE_SIZE; c++) { in add_ctype_to_cc()
3663 for (c = 0; c < SINGLE_BYTE_SIZE; c++) { in add_ctype_to_cc()
3669 for (c = 0; c < SINGLE_BYTE_SIZE; c++) { in add_ctype_to_cc()
3679 for (c = 0; c < SINGLE_BYTE_SIZE; c++) { in add_ctype_to_cc()
3685 for (c = 0; c < SINGLE_BYTE_SIZE; c++) { in add_ctype_to_cc()
5040 ccs[i].from >= SINGLE_BYTE_SIZE) { in parse_exp()
H A Dregcomp.c115 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in bitset_on_num()
2453 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in is_not_included()
2463 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in is_not_included()
2488 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in is_not_included()
4432 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in optimize_node_left()
4454 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in optimize_node_left()
4462 for (i = 0; i < SINGLE_BYTE_SIZE; i++) { in optimize_node_left()
H A Dregexec.c1379 if (enclen > 1 || (code >= SINGLE_BYTE_SIZE)) { in is_code_in_cc()

Completed in 48 milliseconds