3690       if (cb->names_found >= MAX_NAME_COUNT)  in scan_for_captures()
3712       for (i = 0; i < cb->names_found; i++, ng++)  in scan_for_captures()
3733       if (i < cb->names_found) break;   /* Ignore duplicate with same number */  in scan_for_captures()
3737       if (cb->names_found >= cb->named_group_list_size)  in scan_for_captures()
3760       cb->named_groups[cb->names_found].name = name;  in scan_for_captures()
3761       cb->named_groups[cb->names_found].length = (uint16_t)namelen;  in scan_for_captures()
3762       cb->named_groups[cb->names_found].number = cb->bracount;  in scan_for_captures()
3763       cb->named_groups[cb->names_found].isdup = (uint16_t)isdupname;  in scan_for_captures()
3764       cb->names_found++;  in scan_for_captures()
6358         for (i = 0; i < cb->names_found; i++)  in compile_branch()
6369         if (i < cb->names_found)  in compile_branch()
6379             if (++i >= cb->names_found) break;  in compile_branch()
6723         for (i = 0; i < cb->names_found; i++, ng++)  in compile_branch()
6779           for (i = 0; i < cb->names_found; i++)  in compile_branch()
8255 for (i = 0; i < cb->names_found; i++)  in add_name_to_table()
8269       CU2BYTES((cb->names_found - i) * cb->name_entry_size));  in add_name_to_table()
8280 cb->names_found++;  in add_name_to_table()
8446 cb.names_found = 0;  in pcre2_compile()
8627   for (i = 0; i < cb.names_found; i++, ng++)  in pcre2_compile()
8674   CU2BYTES(length + cb.names_found * cb.name_entry_size);  in pcre2_compile()
8703 re->name_count = cb.names_found;  in pcre2_compile()
8754 if (cb.names_found > 0)  in pcre2_compile()
8756   int i = cb.names_found;  in pcre2_compile()
8758   cb.names_found = 0;  in pcre2_compile()