| /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);
|
| engine.cc | 2078 : m_sg (sg), m_per_node (m_sg.num_nodes ())
2083 for (int i = 0; i < m_sg.num_nodes (); i++)
2086 for (int i = 0; i < m_sg.num_nodes (); i++)
2099 for (int i = 0; i < m_sg.num_nodes (); i++)
2113 for (int i = 0; i < m_sg.num_nodes (); i++)
2356 m_global_stats (m_sg.num_nodes ()),
2357 m_functionless_stats (m_sg.num_nodes ()),
2358 m_PK_AFTER_SUPERNODE_per_snode (m_sg.num_nodes ())
2362 for (int i = 0; i < m_sg.num_nodes (); i++)
2785 per_call_string_data *data = new per_call_string_data (cs, m_sg.num_nodes ());
[all...] |
| /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
|
| amdgpu_psp_v11_0.c | 750 if (!topology || topology->num_nodes > TA_XGMI__MAX_CONNECTED_NODES)
759 topology_info_input->num_nodes = number_devices;
761 for (i = 0; i < topology_info_input->num_nodes; i++) {
775 topology->num_nodes = xgmi_cmd->xgmi_out_message.get_topology_info.num_nodes;
776 for (i = 0; i < topology->num_nodes; i++) {
793 if (!topology || topology->num_nodes > TA_XGMI__MAX_CONNECTED_NODES)
801 topology_info_input->num_nodes = number_devices;
803 for (i = 0; i < topology_info_input->num_nodes; i++) {
|
| amdgpu_vram_mgr.c | 340 unsigned long lpfn, num_nodes, pages_per_node, pages_left; local
363 num_nodes = 1;
372 num_nodes = DIV_ROUND_UP(mem->num_pages, pages_per_node);
375 nodes = kvmalloc_array((uint32_t)num_nodes, sizeof(*nodes),
|
| amdgpu_xgmi.c | 362 for (i = 0 ; i < top->num_nodes; ++i)
416 top_info->num_nodes = count;
428 top_info->num_nodes = count;
|
| /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.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...] |
| ddg.h | 113 int num_nodes; member in struct:ddg
|
| cfgloopmanip.cc | 143 act->num_nodes -= loop->num_nodes;
208 queue = XNEWVEC (basic_block, base_loop->num_nodes + 1);
209 qtop = queue + base_loop->num_nodes + 1;
232 for (unsigned i = 0; i < from->loop_father->num_nodes; ++i)
465 loop->num_nodes++;
497 scale_bbs_frequencies (bbs, loop->num_nodes, p);
630 for (i = 0; i < loop->num_nodes; i++)
633 for (i = 0; i < loop->num_nodes; i++)
879 n = loop->num_nodes;
[all...] |
| tree-ssa-loop-unswitch.cc | 319 found = loop->num_nodes;
324 for (; i < loop->num_nodes; i++)
328 if (i == loop->num_nodes)
335 if (found == loop->num_nodes)
370 if (found == loop->num_nodes)
392 tos = worklist = XNEWVEC (basic_block, loop->num_nodes);
394 for (i = 0; i < loop->num_nodes; i++)
443 for (; found < loop->num_nodes; found++)
448 if (found == loop->num_nodes)
685 for (i = 0; i < loop->num_nodes; i++
[all...] |
| tree-if-conv.cc | 1225 gcc_assert (loop->num_nodes);
1228 blocks = XCNEWVEC (basic_block, loop->num_nodes);
1234 while (index < loop->num_nodes)
1259 if (index == loop->num_nodes
1260 && visited_count != loop->num_nodes)
1292 for (i = 0; i < loop->num_nodes; i++)
1295 for (i = 0; i < loop->num_nodes; i++)
1373 for (unsigned int i = 0; i < loop->num_nodes; i++)
1418 for (i = 0; i < loop->num_nodes; i++)
1429 for (i = 0; i < loop->num_nodes; i++
[all...] |
| cfgloopanal.cc | 184 for (i = 0; i < loop->num_nodes; i++)
210 for (i = 0; i < loop->num_nodes; i++)
|
| gimple-loop-jam.cc | 150 loop->num_nodes = n;
371 gcc_assert (!next->num_nodes);
|
| tree-ssa-loop-split.cc | 501 for (j = 0; j < loop1->num_nodes; j++)
512 for (j = 0; j < loop2->num_nodes; j++)
554 if (!can_copy_bbs_p (bbs, loop1->num_nodes))
561 for (i = 0; i < loop1->num_nodes; i++)
1382 for (unsigned i = 0; i < loop->num_nodes; i++)
1616 for (unsigned i = 0; i < loop->num_nodes; i++)
1619 for (unsigned i = 0; i < loop->num_nodes; i++)
|
| df-core.cc | 1295 Returns the number of blocks which is always loop->num_nodes. */
1305 stack = XNEWVEC (edge_iterator, loop->num_nodes + 1);
1356 by LOOP. Returns the number of blocks which is always loop->num_nodes. */
1365 post_order->reserve_exact (loop->num_nodes);
1368 stack = XNEWVEC (edge_iterator, loop->num_nodes + 1);
1428 df->postorder = XNEWVEC (int, loop->num_nodes);
1432 gcc_assert ((unsigned) df->n_blocks == loop->num_nodes);
1433 gcc_assert (df->postorder_inverted.length () == loop->num_nodes);
|
| gimple-loop-interchange.cc | 318 for (unsigned i = 0; i < m_loop->num_nodes; i++)
1228 for (unsigned i = 0; i < outer->num_nodes; i++)
1752 && loop->num_nodes != loop->inner->num_nodes + 3)
1789 for (unsigned i = 0; i < loop->num_nodes; i++)
1936 for (unsigned i = 0; i < loop->num_nodes; i++)
1941 for (unsigned i = 0; loop_nest && i < loop->num_nodes; ++i)
1967 for (unsigned i = 0; i < loop->num_nodes; i++)
|
| /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...] |
| clvmd-gulm.c | 74 static int num_nodes; variable
333 num_nodes++;
345 num_nodes--;
356 DEBUGLOG("set_node_state, '%s' state = %d num_nodes=%d\n",
357 ninfo->name, ninfo->state, num_nodes);
627 DEBUGLOG("num_nodes = %d\n", num_nodes);
628 return num_nodes;
645 num_nodes++;
|
| clvmd-corosync.c | 83 static int num_nodes; variable
295 num_nodes = member_list_entries;
414 DEBUGLOG("num_nodes = %d\n", num_nodes);
415 return num_nodes;
|
| clvmd-openais.c | 87 static int num_nodes; variable
323 num_nodes = member_list_entries;
439 DEBUGLOG("num_nodes = %d\n", num_nodes);
440 return num_nodes;
|
| /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;
|
