6744         for (i = 0; i < cd->names_found; i++)  in compile_branch()
6755         if (i < cd->names_found)  in compile_branch()
6760           for (; i < cd->names_found; i++)  in compile_branch()
6971           if (cd->names_found >= MAX_NAME_COUNT)  in compile_branch()
6995           for (i = 0; i < cd->names_found; i++, ng++)  in compile_branch()
7015           if (i >= cd->names_found)     /* Not a duplicate with same number */  in compile_branch()
7019             if (cd->names_found >= cd->named_group_list_size)  in compile_branch()
7039             cd->named_groups[cd->names_found].name = name;  in compile_branch()
7040             cd->named_groups[cd->names_found].length = namelen;  in compile_branch()
7041             cd->named_groups[cd->names_found].number = number;  in compile_branch()
7042             cd->names_found++;  in compile_branch()
7105           for (i = 0; i < cd->names_found; i++, ng++)  in compile_branch()
7111           recno = (i < cd->names_found)? ng->number : 0;  in compile_branch()
7132           for (i = 0; i < cd->names_found; i++)  in compile_branch()
7140           if (i < cd->names_found)  in compile_branch()
7165           for (i++; i < cd->names_found; i++)  in compile_branch()
8693 for (i = 0; i < cd->names_found; i++)  in add_name()
8707       IN_UCHARS((cd->names_found - i) * cd->name_entry_size));  in add_name()
8719 cd->names_found++;  in add_name()
9077 cd->names_found = 0;  in pcre_compile2()
9133   (length + cd->names_found * cd->name_entry_size) * sizeof(pcre_uchar);  in pcre_compile2()
9160 re->name_count = cd->names_found;  in pcre_compile2()
9195 if (cd->names_found > 0)  in pcre_compile2()
9197   int i = cd->names_found;  in pcre_compile2()
9199   cd->names_found = 0;  in pcre_compile2()