Searched refs:num_nodes (Results 1 - 25 of 31) sorted by relevance

12

/freebsd-11-stable/crypto/openssl/crypto/lhash/
H A Dlh_stats.c78 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 Dlhash.c146 ret->num_nodes = MIN_NODES / 2;
184 for (i = 0; i < lh->num_nodes; i++) {
203 if (lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)
253 if ((lh->num_nodes > MIN_NODES) &&
254 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
292 for (i = lh->num_nodes - 1; i >= 0; i--) {
348 lh->num_nodes++;
396 lh->num_nodes--;
H A Dlhash.h143 unsigned int num_nodes; member in struct:lhash_st
/freebsd-11-stable/contrib/gcc/
H A Dddg.c270 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 Dcfgloop.c141 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 Dmodulo-sched.c344 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 Dcfgloopmanip.c166 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 Dtree-ssa-loop-unswitch.c219 for (; i < loop->num_nodes; i++)
223 if (i == loop->num_nodes)
H A Dddg.h120 int num_nodes; member in struct:ddg
H A Dtree-ssa-loop-ivcanon.c123 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 Dtree-if-conv.c167 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 Dcfgloop.h80 unsigned num_nodes; member in struct:loop
H A Dtree-vectorizer.c259 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 Dloop-unswitch.c328 for (i = 0; i < loop->num_nodes; i++)
332 if (i == loop->num_nodes)
H A Dcfgloopanal.c369 for (i = 0; i < loop->num_nodes; i++)
392 for (i = 0; i < loop->num_nodes; i++)
H A Dloop-invariant.c514 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 Dtree-vect-analyze.c100 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 Dtree-ssa-loop-prefetch.c466 for (i = 0; i < loop->num_nodes; i++)
888 if (loop->num_nodes > 2)
H A Dtree-vect-patterns.c613 unsigned int nbbs = loop->num_nodes;
H A Dloop-unroll.c960 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 Dloop-doloop.c196 for (i = 0; i < loop->num_nodes; i++)
H A Dtree-ssa-loop-im.c1298 for (i = 0; i < loop->num_nodes; i++)
1447 for (i = 0; i < loop->num_nodes; i++)
H A Dpredict.c717 for (j = 0; j < loop->num_nodes; j++)
1719 for (i = 0; i < loop->num_nodes; i++)
H A Dlambda-code.c2083 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--)
/freebsd-11-stable/sys/xen/interface/
H A Dsysctl.h513 * for maximum value of 'num_nodes'.
519 * - If 'num_nodes' is less than the number Xen wants to write but either
520 * handle is not a NULL one, partial data gets returned and 'num_nodes'
522 * - Otherwise, 'num_nodes' shall indicate the number of entries written, which
527 uint32_t num_nodes; member in struct:xen_sysctl_numainfo
533 * where N is the number of nodes that will be returned in 'num_nodes'
534 * (i.e. not 'num_nodes' provided by the caller)

Completed in 179 milliseconds

12