Lines Matching refs:br
1536 BRefNode* br = NBREF(node); in compile_length_tree() local
1539 if (IS_BACKREF_NEST_LEVEL(br)) { in compile_length_tree()
1541 SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); in compile_length_tree()
1545 if (br->back_num == 1) { in compile_length_tree()
1546 r = ((!IS_IGNORECASE(reg->options) && br->back_static[0] <= 2) in compile_length_tree()
1550 r = SIZE_OPCODE + SIZE_LENGTH + (SIZE_MEMNUM * br->back_num); in compile_length_tree()
1660 BRefNode* br = NBREF(node); in compile_tree() local
1663 if (IS_BACKREF_NEST_LEVEL(br)) { in compile_tree()
1668 r = add_length(reg, br->nest_level); in compile_tree()
1675 if (br->back_num == 1) { in compile_tree()
1676 n = br->back_static[0]; in compile_tree()
1709 r = add_length(reg, br->back_num); in compile_tree()
1711 p = BACKREFS_P(br); in compile_tree()
1712 for (i = br->back_num - 1; i >= 0; i--) { in compile_tree()
2036 BRefNode* br = NBREF(node); in get_min_match_length() local
2037 if (br->state & NST_RECURSION) break; in get_min_match_length()
2039 backs = BACKREFS_P(br); in get_min_match_length()
2043 for (i = 1; i < br->back_num; i++) { in get_min_match_length()
2190 BRefNode* br = NBREF(node); in get_max_match_length() local
2191 if (br->state & NST_RECURSION) { in get_max_match_length()
2195 backs = BACKREFS_P(br); in get_max_match_length()
2196 for (i = 0; i < br->back_num; i++) { in get_max_match_length()
3704 BRefNode* br = NBREF(node); in setup_tree() local
3705 p = BACKREFS_P(br); in setup_tree()
3706 for (i = 0; i < br->back_num; i++) { in setup_tree()
3711 if (IS_BACKREF_NEST_LEVEL(br)) { in setup_tree()
4734 BRefNode* br = NBREF(node); in optimize_node_left() local
4736 if (br->state & NST_RECURSION) { in optimize_node_left()
4740 backs = BACKREFS_P(br); in optimize_node_left()
4745 for (i = 1; i < br->back_num; i++) { in optimize_node_left()
6220 BRefNode* br = NBREF(node); in print_indent_tree() local
6221 p = BACKREFS_P(br); in print_indent_tree()
6223 for (i = 0; i < br->back_num; i++) { in print_indent_tree()
