| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| 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);
|
| supergraph.h | 166 int num_nodes () const { return m_nodes.length (); } function in class:ana::supergraph
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| 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);
|
| supergraph.h | 173 int num_nodes () const { return m_nodes.length (); } function in class:ana::supergraph
|
| /src/crypto/external/bsd/openssl/dist/crypto/lhash/ |
| lhash_local.h | 23 unsigned int num_nodes; member in struct:lhash_st
|
| /src/crypto/external/apache2/openssl/dist/crypto/lhash/ |
| lhash_local.h | 27 unsigned int num_nodes; member in struct:lhash_st
|
| /src/crypto/external/bsd/openssl.old/dist/crypto/lhash/ |
| lhash_local.h | 23 unsigned int num_nodes; member in struct:lhash_st
|
| /src/sys/external/bsd/drm2/dist/drm/amd/amdgpu/ |
| 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),
|
| 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/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/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-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;
|
| 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++;
|
| /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.h | 113 int num_nodes; member in struct:ddg
|
| 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...] |
| cfgloop.h | 142 unsigned num_nodes; variable
|
| 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...] |
| /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...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ddg.h | 113 int num_nodes; member in struct:ddg
|
| 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...] |
| cfgloop.h | 139 unsigned num_nodes; variable
|
| /src/sys/external/bsd/drm2/dist/drm/amd/amdkfd/ |
| kfd_crat.c | 496 uint16_t num_nodes; local
507 num_nodes = crat_table->num_domains;
510 pr_info("Parsing CRAT table with %d nodes\n", num_nodes);
512 for (node_id = 0; node_id < num_nodes; node_id++) {
|
| /src/sys/dev/hdaudio/ |
| hdaudio.c | 706 int starting_node, num_nodes, nid; local
728 num_nodes = snc & 0xff;
734 if (num_nodes == 0) {
740 co->co_nfg = num_nodes;
743 for (nid = starting_node; nid < starting_node + num_nodes; nid++) {
|
