/freebsd-9.3-release/crypto/openssl/crypto/lhash/ |
H A D | lh_stats.c | 78 fprintf(out, "num_nodes = %u\n", lh->num_nodes); 106 for (i = 0; i < lh->num_nodes; i++) { 120 for (i = 0; i < lh->num_nodes; i++) { 128 fprintf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes); 133 (int)(total / lh->num_nodes), 134 (int)((total % lh->num_nodes) * 100 / lh->num_nodes), 185 BIO_printf(out, "num_nodes = %u\n", lh->num_nodes); [all...] |
H A D | lhash.c | 130 ret->num_nodes = MIN_NODES / 2; 168 for (i = 0; i < lh->num_nodes; i++) { 187 if (lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) 236 if ((lh->num_nodes > MIN_NODES) && 237 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))) 272 for (i = lh->num_nodes - 1; i >= 0; i--) { 328 lh->num_nodes++; 376 lh->num_nodes--;
|
H A D | lhash.h | 143 unsigned int num_nodes; member in struct:lhash_st
|
/freebsd-9.3-release/contrib/gcc/ |
H A D | ddg.c | 270 for (i = src_node->cuid + 1; i < g->num_nodes; i++) 303 for (i = use_node->cuid + 1; i < g->num_nodes; i++) 392 for (i = 0; i < g->num_nodes; i++) 444 int num_nodes = 0; 462 num_nodes++; 466 if (num_nodes <= 1) 473 g->num_nodes = num_nodes; 474 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node)); 501 g->nodes[i].successors = sbitmap_alloc (num_nodes); 442 int num_nodes = 0; local 846 int num_nodes = g->num_nodes; local 911 int num_nodes = g->num_nodes; local 1023 int num_nodes = g->num_nodes; local [all...] |
H A D | cfgloop.c | 141 for (i = 0; i < loop->num_nodes; i++) 229 int num_nodes = 1; 238 num_nodes++; 260 num_nodes++; 267 return num_nodes; 679 loops->parray[0]->num_nodes = n_basic_blocks; 739 loop->num_nodes = flow_loop_nodes_find (loop->header, loop); 790 gcc_assert (loop->num_nodes); 792 tovisit = XCNEWVEC (basic_block, loop->num_nodes); 798 gcc_assert (loop->num_nodes 228 int num_nodes = 1; local [all...] |
H A D | modulo-sched.c | 344 return (g->num_nodes / issue_rate); 362 xcalloc (g->num_nodes, 367 for (i = 0; i < g->num_nodes; i++) 376 print_node_sched_params (FILE * file, int num_nodes) 382 for (i = 0; i < num_nodes; i++) 410 for (i = 0; i < g->num_nodes; i++) 443 for (i = 0; i < g->num_nodes; i++) 478 uses_of_defs = sbitmap_vector_alloc (nreg_moves, g->num_nodes); 552 for (i = 0; i < ps->g->num_nodes; i++) 601 for (i = 0; i < g->num_nodes 373 print_node_sched_params(FILE * file, int num_nodes) argument 1489 int num_nodes = g->num_nodes; local 1660 check_nodes_order(int *node_order, int num_nodes) argument 1716 int num_nodes = g->num_nodes; local 1765 int num_nodes = g->num_nodes; local 1904 int num_nodes = g->num_nodes; local [all...] |
H A D | cfgloopmanip.c | 166 queue = XNEWVEC (basic_block, base_loop->num_nodes + 1); 167 qtop = queue + base_loop->num_nodes + 1; 397 scale_bbs_frequencies_int (bbs, loop->num_nodes, num, den); 477 for (i = 0; i < loop->num_nodes; i++) 480 for (i = 0; i < loop->num_nodes; i++) 529 n = loop->num_nodes; 573 for (i = 0; i < loop->num_nodes; i++) 586 act->num_nodes -= loop->num_nodes; 742 ret = can_copy_bbs_p (bbs, loop->num_nodes); [all...] |
H A D | tree-ssa-loop-unswitch.c | 219 for (; i < loop->num_nodes; i++) 223 if (i == loop->num_nodes)
|
H A D | ddg.h | 120 int num_nodes; member in struct:ddg
|
H A D | tree-ssa-loop-ivcanon.c | 123 for (i = 0; i < loop->num_nodes; i++) 435 for (i = 0; i < loop->num_nodes; i++) 530 for (n_before = 1; n_before <= loop->num_nodes; n_before++) 534 scale_bbs_frequencies_int (body + n_before, loop->num_nodes - n_before,
|
H A D | tree-if-conv.c | 167 for (i = 0; i < loop->num_nodes; i++) 515 if (loop->num_nodes <= 2) 553 for (i = 0; i < loop->num_nodes; i++) 669 for (i = 0; i < loop->num_nodes; i++) 856 unsigned int orig_loop_num_nodes = loop->num_nodes; 897 unsigned int orig_loop_num_nodes = loop->num_nodes; 1066 gcc_assert (loop->num_nodes); 1069 blocks = XCNEWVEC (basic_block, loop->num_nodes); 1075 while (index < loop->num_nodes) 1097 if (index == loop->num_nodes [all...] |
H A D | cfgloop.h | 80 unsigned num_nodes; member in struct:loop
|
H A D | tree-vectorizer.c | 259 for (i = 0; i < loop->num_nodes; i++) 845 if (!can_copy_bbs_p (bbs, loop->num_nodes)) 864 new_bbs = XNEWVEC (basic_block, loop->num_nodes); 866 copy_bbs (bbs, loop->num_nodes, new_bbs, 986 || loop->num_nodes != 2 1398 for (i = 0; i < loop->num_nodes; i++) 1456 nbbs = loop->num_nodes;
|
H A D | cfgloopanal.c | 369 for (i = 0; i < loop->num_nodes; i++) 392 for (i = 0; i < loop->num_nodes; i++)
|
H A D | loop-unswitch.c | 328 for (i = 0; i < loop->num_nodes; i++) 332 if (i == loop->num_nodes)
|
H A D | loop-invariant.c | 514 for (i = 0; i < loop->num_nodes; i++) 539 for (i = 0; i < loop->num_nodes; i++) 616 for (i = 0; i < loop->num_nodes; i++) 864 for (i = 0; i < loop->num_nodes; i++)
|
H A D | tree-vect-analyze.c | 100 int nbbs = loop->num_nodes; 233 int nbbs = loop->num_nodes; 1613 unsigned int nbbs = loop->num_nodes; 1927 || loop->num_nodes != 2 1934 else if (loop->num_nodes != 2)
|
H A D | tree-ssa-loop-prefetch.c | 466 for (i = 0; i < loop->num_nodes; i++) 888 if (loop->num_nodes > 2)
|
H A D | tree-vect-patterns.c | 613 unsigned int nbbs = loop->num_nodes;
|
H A D | loop-unroll.c | 960 for (i = 0; i < loop->num_nodes; i++) 1514 for (i = 0; i < loop->num_nodes; i++) 1716 opt_info->insns_to_split = htab_create (5 * loop->num_nodes, 1737 opt_info->insns_with_var_to_expand = htab_create (5 * loop->num_nodes, 1740 for (i = 0; i < loop->num_nodes; i++)
|
H A D | loop-doloop.c | 196 for (i = 0; i < loop->num_nodes; i++)
|
H A D | tree-ssa-loop-im.c | 1298 for (i = 0; i < loop->num_nodes; i++) 1447 for (i = 0; i < loop->num_nodes; i++)
|
H A D | predict.c | 717 for (j = 0; j < loop->num_nodes; j++) 1719 for (i = 0; i < loop->num_nodes; i++)
|
H A D | lambda-code.c | 2083 for (i = 0; i < loop->num_nodes; i++) 2294 for (i = 0; i < loop->num_nodes; i++) 2567 for (i = loop->num_nodes - 1; i >= 0 ; i--)
|
H A D | tree-ssa-loop-niter.c | 1019 for (i = 0; i < loop->num_nodes; i++) 1746 for (i = 0; i < loop->num_nodes; i++)
|