3505 optimal_bucket_size (Elf32_Word *hashcodes, size_t maxcnt, int optlevel)  in optimal_bucket_size()  argument
3515   if (maxcnt == 0)  in optimal_bucket_size()
3521       minsize = maxcnt;  in optimal_bucket_size()
3522       maxsize = maxcnt + 10000 / maxcnt;  in optimal_bucket_size()
3528       minsize = MAX (1, maxcnt / 4);  in optimal_bucket_size()
3531       maxsize = 2 * maxcnt + (6 * MIN (optlevel, 100) * maxcnt) / 100;  in optimal_bucket_size()
3533   bestsize = maxcnt;  in optimal_bucket_size()
3537   counts = (uint32_t *) xmalloc ((maxcnt + 1 + maxsize) * sizeof (uint32_t));  in optimal_bucket_size()
3538   lengths = &counts[maxcnt + 1];  in optimal_bucket_size()
3550       memset (counts, '\0', (maxcnt + 1) * sizeof (uint32_t));  in optimal_bucket_size()
3554       for (inner = 1; inner < maxcnt; ++inner)  in optimal_bucket_size()
3586 	factor = (1.0 * (double) success / (double) maxcnt  in optimal_bucket_size()
3587 		  + 0.3 * (double) maxcnt / (double) size);  in optimal_bucket_size()
3589 	factor = (0.3 * (double) success / (double) maxcnt  in optimal_bucket_size()
3590 		  + 1.0 * (double) maxcnt / (double) size);  in optimal_bucket_size()
3594       cost = (2 + maxcnt + size) * (factor + 1.0 / 16.0);  in optimal_bucket_size()
3598 …  maxcnt, size, cost, (double) success / (double) maxcnt, (double) maxcnt / (double) size, factor);  in optimal_bucket_size()
3616 optimal_gnu_hash_size (Elf32_Word *hashcodes, size_t maxcnt, int optlevel,  in optimal_gnu_hash_size()  argument
3622   *nbuckets = 3 * maxcnt / 2;  in optimal_gnu_hash_size()
5204       size_t maxcnt;  in ld_generic_create_outfile()  local
5217       maxcnt = file->nsymtab;  in ld_generic_create_outfile()
5219       file->symindirect = (Elf32_Word *) xcalloc (maxcnt, sizeof (Elf32_Word));  in ld_generic_create_outfile()
5223       for (cnt = ld_state.need_symtab ? 1 : file->nlocalsymbols; cnt < maxcnt;  in ld_generic_create_outfile()