| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| complexity.h | 32 complexity (unsigned num_nodes, unsigned max_depth)
33 : m_num_nodes (num_nodes), m_max_depth (max_depth)
|
| complexity.cc | 95 unsigned num_nodes = 0; local
100 num_nodes += iter_c.m_num_nodes;
103 return complexity (num_nodes + 1, max_depth + 1);
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| complexity.h | 32 complexity (unsigned num_nodes, unsigned max_depth)
33 : m_num_nodes (num_nodes), m_max_depth (max_depth)
|
| complexity.cc | 98 unsigned num_nodes = 0; local
103 num_nodes += iter_c.m_num_nodes;
106 return complexity (num_nodes + 1, max_depth + 1);
|
| /src/crypto/external/apache2/openssl/dist/crypto/lhash/ |
| lhash_local.h | 27 unsigned int num_nodes; member in struct:lhash_st
|
| lh_stats.c | 74 BIO_printf(out, "num_nodes = %u\n", lh->num_nodes);
96 for (i = 0; i < lh->num_nodes; i++) {
110 for (i = 0; i < lh->num_nodes; i++) {
118 BIO_printf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes);
123 (int)(total / lh->num_nodes),
124 (int)((total % lh->num_nodes) * 100 / lh->num_nodes),
|
| lhash.c | 73 ret->num_nodes = MIN_NODES / 2;
104 for (i = 0; i < lh->num_nodes; i++) {
124 if ((lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) && !expand(lh))
166 if ((lh->num_nodes > MIN_NODES) && (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
202 for (i = lh->num_nodes - 1; i >= 0; i--) {
267 lh->num_nodes++;
307 lh->num_nodes--;
|
| /src/crypto/external/bsd/openssl/dist/crypto/lhash/ |
| lhash_local.h | 23 unsigned int num_nodes; member in struct:lhash_st
|
| lh_stats.c | 65 BIO_printf(out, "num_nodes = %u\n", lh->num_nodes);
87 for (i = 0; i < lh->num_nodes; i++) {
101 for (i = 0; i < lh->num_nodes; i++) {
109 BIO_printf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes);
114 (int)(total / lh->num_nodes),
115 (int)((total % lh->num_nodes) * 100 / lh->num_nodes),
|
| lhash.c | 63 ret->num_nodes = MIN_NODES / 2;
94 for (i = 0; i < lh->num_nodes; i++) {
114 if ((lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) && !expand(lh))
156 if ((lh->num_nodes > MIN_NODES) &&
157 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
190 for (i = lh->num_nodes - 1; i >= 0; i--) {
238 lh->num_nodes++;
278 lh->num_nodes--;
|
| /src/crypto/external/bsd/openssl.old/dist/crypto/lhash/ |
| lhash_local.h | 23 unsigned int num_nodes; member in struct:lhash_st
|
| lh_stats.c | 65 BIO_printf(out, "num_nodes = %u\n", lh->num_nodes);
87 for (i = 0; i < lh->num_nodes; i++) {
101 for (i = 0; i < lh->num_nodes; i++) {
109 BIO_printf(out, "%lu nodes used out of %u\n", n_used, lh->num_nodes);
114 (int)(total / lh->num_nodes),
115 (int)((total % lh->num_nodes) * 100 / lh->num_nodes),
|
| lhash.c | 63 ret->num_nodes = MIN_NODES / 2;
84 for (i = 0; i < lh->num_nodes; i++) {
103 if ((lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)) && !expand(lh))
149 if ((lh->num_nodes > MIN_NODES) &&
150 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
191 for (i = lh->num_nodes - 1; i >= 0; i--) {
240 lh->num_nodes++;
282 lh->num_nodes--;
|
| /src/sys/external/bsd/drm2/dist/drm/amd/amdgpu/ |
| ta_xgmi_if.h | 93 uint32_t num_nodes; member in struct:ta_xgmi_cmd_get_topology_info_input
98 uint32_t num_nodes; member in struct:ta_xgmi_cmd_get_topology_info_output
103 uint32_t num_nodes; member in struct:ta_xgmi_cmd_set_topology_info_input
|
| /src/external/gpl2/lvm2/dist/libdm/regex/ |
| matcher.c | 36 unsigned num_nodes; member in struct:dm_regex
74 for (i = 0; i < m->num_nodes; i++) {
76 n->firstpos = dm_bitset_create(m->scratch, m->num_nodes);
77 n->lastpos = dm_bitset_create(m->scratch, m->num_nodes);
78 n->followpos = dm_bitset_create(m->scratch, m->num_nodes);
87 for (i = 0; i < m->num_nodes; i++) {
148 for (j = 0; j < m->num_nodes; j++) {
159 for (j = 0; j < m->num_nodes; j++) {
196 unsigned iwidth = (m->num_nodes / DM_BITS_PER_INT) + 1;
206 if (!(bs = dm_bitset_create(m->scratch, m->num_nodes)))
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| ddg.cc | 458 for (i = 0; i < g->num_nodes; i++)
524 int num_nodes = 0;
544 num_nodes++;
549 if (num_nodes <= 1)
556 g->num_nodes = num_nodes;
557 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node));
582 g->nodes[i].successors = sbitmap_alloc (num_nodes);
584 g->nodes[i].predecessors = sbitmap_alloc (num_nodes);
591 g->nodes[i].max_dist = XCNEWVEC (int, num_nodes);
523 int num_nodes = 0; local
982 int num_nodes = g->num_nodes; local
1091 int num_nodes = g->num_nodes; local
[all...] |
| modulo-sched.cc | 125 the ddg's num_nodes refer directly to ddg nodes. A value of
126 X - num_nodes refers to register move X. */
174 a ps_insn id of X + g->num_nodes. */
299 gcc_checking_assert (id >= ps->g->num_nodes);
300 return &ps->reg_moves[id - ps->g->num_nodes];
308 if (id < ps->g->num_nodes)
322 gcc_assert (id < ps->g->num_nodes);
331 if (id < ps->g->num_nodes)
443 return g->num_nodes / issue_rate;
455 node_sched_param_vec.safe_grow_cleared (g->num_nodes, true)
2148 int num_nodes = g->num_nodes; local
2536 int num_nodes = g->num_nodes; local
2581 int num_nodes = g->num_nodes; local
2732 int num_nodes = g->num_nodes; local
[all...] |
| cfgloop.cc | 146 for (i = 0; i < loop->num_nodes; i++)
229 int num_nodes = 1;
241 num_nodes++;
260 num_nodes++;
268 return num_nodes;
369 root->num_nodes = n_basic_blocks_for_fn (fn);
442 loops->tree_root->num_nodes = n_basic_blocks_for_fn (cfun);
506 loop->num_nodes = flow_loop_nodes_find (loop->header, loop);
887 gcc_assert (loop->num_nodes);
889 body = XNEWVEC (basic_block, loop->num_nodes);
228 int num_nodes = 1; local
[all...] |
| ddg.h | 113 int num_nodes; member in struct:ddg
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ddg.cc | 458 for (i = 0; i < g->num_nodes; i++)
524 int num_nodes = 0;
544 num_nodes++;
549 if (num_nodes <= 1)
556 g->num_nodes = num_nodes;
557 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node));
582 g->nodes[i].successors = sbitmap_alloc (num_nodes);
584 g->nodes[i].predecessors = sbitmap_alloc (num_nodes);
591 g->nodes[i].max_dist = XCNEWVEC (int, num_nodes);
523 int num_nodes = 0; local
982 int num_nodes = g->num_nodes; local
1091 int num_nodes = g->num_nodes; local
[all...] |
| modulo-sched.cc | 125 the ddg's num_nodes refer directly to ddg nodes. A value of
126 X - num_nodes refers to register move X. */
174 a ps_insn id of X + g->num_nodes. */
299 gcc_checking_assert (id >= ps->g->num_nodes);
300 return &ps->reg_moves[id - ps->g->num_nodes];
308 if (id < ps->g->num_nodes)
322 gcc_assert (id < ps->g->num_nodes);
331 if (id < ps->g->num_nodes)
443 return g->num_nodes / issue_rate;
455 node_sched_param_vec.safe_grow_cleared (g->num_nodes, true)
2148 int num_nodes = g->num_nodes; local
2536 int num_nodes = g->num_nodes; local
2581 int num_nodes = g->num_nodes; local
2732 int num_nodes = g->num_nodes; local
[all...] |
| cfgloop.cc | 153 for (i = 0; i < loop->num_nodes; i++)
236 int num_nodes = 1;
248 num_nodes++;
267 num_nodes++;
275 return num_nodes;
376 root->num_nodes = n_basic_blocks_for_fn (fn);
449 loops->tree_root->num_nodes = n_basic_blocks_for_fn (cfun);
513 loop->num_nodes = flow_loop_nodes_find (loop->header, loop);
894 gcc_assert (loop->num_nodes);
896 body = XNEWVEC (basic_block, loop->num_nodes);
235 int num_nodes = 1; local
[all...] |
| /src/external/gpl2/lvm2/dist/daemons/clvmd/ |
| clvmd-cman.c | 62 static int num_nodes; variable
144 for (i=0; i<num_nodes; i++) {
295 for (i = 0; i < num_nodes; i++) {
313 num_nodes = cman_get_node_count(c_handle);
314 if (num_nodes == -1) {
320 if (num_nodes > count_nodes && nodes) {
326 count_nodes = num_nodes + 10; /* Overallocate a little */
353 for (i = 0; i < num_nodes; i++) {
367 for (i = 0; i < num_nodes; i++) {
383 for (i = 0; i < num_nodes; i++)
[all...] |
| /src/external/gpl2/lvm2/dist/libdm/datastruct/ |
| hash.c | 28 unsigned num_nodes; member in struct:dm_hash_table
183 t->num_nodes++;
198 t->num_nodes--;
219 return t->num_nodes;
238 t->num_nodes = 0u;
|
| /src/external/gpl3/gcc/dist/libcpp/ |
| makeuname2c.cc | 110 static unsigned long num_nodes; variable
340 ++num_nodes;
369 ++num_nodes;
390 nodes[num_nodes++] = n;
531 nodes = (struct node **) xmalloc (num_nodes * sizeof (struct node *));
532 i = num_nodes;
533 num_nodes = 0;
535 assert (num_nodes == i);
538 qsort (nodes, num_nodes, sizeof (struct node *), nodecmp);
556 for (i = 0; i < num_nodes; ++i
[all...] |
