4531       if (cb->names_found >= MAX_NAME_COUNT)  in parse_regex()
4551       for (i = 0; i < cb->names_found; i++, ng++)  in parse_regex()
4572       if (i < cb->names_found) break;   /* Ignore duplicate with same number */  in parse_regex()
4576       if (cb->names_found >= cb->named_group_list_size)  in parse_regex()
4599       cb->named_groups[cb->names_found].name = name;  in parse_regex()
4600       cb->named_groups[cb->names_found].length = (uint16_t)namelen;  in parse_regex()
4601       cb->named_groups[cb->names_found].number = cb->bracount;  in parse_regex()
4602       cb->named_groups[cb->names_found].isdup = (uint16_t)isdupname;  in parse_regex()
4603       cb->names_found++;  in parse_regex()
5210 for (i = 0; i < cb->names_found; i++)  in find_dupname_details()
5220 if (i >= cb->names_found)  in find_dupname_details()
5239   if (++i >= cb->names_found) break;  in find_dupname_details()
6242       for (i = 0; i < cb->names_found; i++, ng++)  in compile_branch()
6263       if (i >= cb->names_found)  in compile_branch()
6662       for (i = 0; i < cb->names_found; i++, ng++)  in compile_branch()
9195       for (i = 0; i < cb->names_found; i++, ng++)  in get_branchlength()
9773 cb.names_found = 0;  in pcre2_compile()
10080   for (i = 0; i < cb.names_found; i++, ng++)  in pcre2_compile()
10124   (PCRE2_SIZE)cb.names_found * (PCRE2_SIZE)cb.name_entry_size);  in pcre2_compile()
10162 re->name_count = cb.names_found;  in pcre2_compile()
10188 if (cb.names_found > 0)  in pcre2_compile()
10191   for (i = 0; i < cb.names_found; i++, ng++)  in pcre2_compile()