Lines Matching refs:names_found
4639 if (cb->names_found >= MAX_NAME_COUNT) in parse_regex()
4659 for (i = 0; i < cb->names_found; i++, ng++) in parse_regex()
4680 if (i < cb->names_found) break; /* Ignore duplicate with same number */ in parse_regex()
4684 if (cb->names_found >= cb->named_group_list_size) in parse_regex()
4707 cb->named_groups[cb->names_found].name = name; in parse_regex()
4708 cb->named_groups[cb->names_found].length = (uint16_t)namelen; in parse_regex()
4709 cb->named_groups[cb->names_found].number = cb->bracount; in parse_regex()
4710 cb->named_groups[cb->names_found].isdup = (uint16_t)isdupname; in parse_regex()
4711 cb->names_found++; in parse_regex()
5318 for (i = 0; i < cb->names_found; i++) in find_dupname_details()
5328 if (i >= cb->names_found) in find_dupname_details()
5347 if (++i >= cb->names_found) break; in find_dupname_details()
6353 for (i = 0; i < cb->names_found; i++, ng++) in compile_branch()
6374 if (i >= cb->names_found) in compile_branch()
6773 for (unsigned int i = 0; i < cb->names_found; i++, ng++) in compile_branch()
9320 for (i = 0; i < cb->names_found; i++, ng++) in get_branchlength()
9898 cb.names_found = 0; in pcre2_compile()
10206 for (i = 0; i < cb.names_found; i++, ng++) in pcre2_compile()
10250 (PCRE2_SIZE)cb.names_found * (PCRE2_SIZE)cb.name_entry_size); in pcre2_compile()
10288 re->name_count = cb.names_found; in pcre2_compile()
10314 if (cb.names_found > 0) in pcre2_compile()
10317 for (i = 0; i < cb.names_found; i++, ng++) in pcre2_compile()