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

12

/openbsd-current/sys/dev/pci/drm/amd/amdgpu/
H A Dta_xgmi_if.h97 uint32_t num_nodes; member in struct:ta_xgmi_cmd_get_topology_info_input
102 uint32_t num_nodes; member in struct:ta_xgmi_cmd_get_topology_info_output
107 uint32_t num_nodes; member in struct:ta_xgmi_cmd_get_peer_link_info_output
112 uint32_t num_nodes; member in struct:ta_xgmi_cmd_set_topology_info_input
H A Damdgpu_xgmi.c346 for (i = 0; i < top->num_nodes; i++)
365 for (i = 0; i < top->num_nodes; i++)
695 for (i = 0 ; i < top->num_nodes; ++i)
707 for (i = 0 ; i < top->num_nodes; ++i)
793 top_info->num_nodes = count;
806 top_info->num_nodes = count;
/openbsd-current/lib/libcrypto/lhash/
H A Dlhash_local.h80 unsigned int num_nodes; member in struct:lhash_st
H A Dlhash.c82 lh->num_nodes++;
148 lh->num_nodes--;
207 ret->num_nodes = MIN_NODES / 2;
226 for (i = 0; i < lh->num_nodes; i++) {
254 if (lh->up_load <= (lh->num_items * LH_LOAD_MULT / lh->num_nodes))
306 if ((lh->num_nodes > MIN_NODES) &&
307 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
356 for (i = lh->num_nodes - 1; i >= 0; i--) {
374 if ((lh->num_nodes > MIN_NODES) &&
375 (lh->down_load >= (lh->num_items * LH_LOAD_MULT / lh->num_nodes)))
[all...]
/openbsd-current/gnu/gcc/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 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 Dddg.h120 int num_nodes; member in struct:ddg
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++)
854 unsigned int orig_loop_num_nodes = loop->num_nodes;
895 unsigned int orig_loop_num_nodes = loop->num_nodes;
1064 gcc_assert (loop->num_nodes);
1067 blocks = XCNEWVEC (basic_block, loop->num_nodes);
1073 while (index < loop->num_nodes)
1095 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.c99 int nbbs = loop->num_nodes;
232 int nbbs = loop->num_nodes;
1558 unsigned int nbbs = loop->num_nodes;
1872 || loop->num_nodes != 2
1879 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.c612 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++)
/openbsd-current/gnu/usr.bin/gcc/gcc/
H A Dcfgloop.c139 for (i = 0; i < loop->num_nodes; i++)
287 for (i = 0; i < loop->num_nodes; i++)
309 for (i = 0; i < loop->num_nodes; i++)
334 int num_nodes = 1;
345 num_nodes++;
366 num_nodes++;
373 return num_nodes;
850 loops->parray[0]->num_nodes = n_basic_blocks + 2;
910 loop->num_nodes = flow_loop_nodes_find (loop->header, loop);
998 if (!loop->num_nodes)
333 int num_nodes = 1; local
[all...]
/openbsd-current/sys/dev/pci/drm/amd/amdkfd/
H A Dkfd_device.c568 static void kfd_cleanup_nodes(struct kfd_dev *kfd, unsigned int num_nodes) argument
573 for (i = 0; i < num_nodes; i++) {
638 kfd->num_nodes = amdgpu_xcp_get_num_xcp(kfd->adev->xcp_mgr);
640 if (kfd->num_nodes == 0) {
681 kfd->num_nodes != 1) {
744 if (!kfd->hive_id && (KFD_GC_VERSION(kfd) == IP_VERSION(9, 4, 3)) && kfd->num_nodes > 1)
752 kfd->num_nodes);
755 for (i = 0, xcp_idx = 0; i < kfd->num_nodes; i++) {
784 kfd->num_nodes != 1) {
854 kfd_cleanup_nodes(kfd, kfd->num_nodes);
[all...]
H A Dkfd_crat.c1281 uint16_t num_nodes; local
1292 num_nodes = crat_table->num_domains;
1295 pr_debug("Parsing CRAT table with %d nodes\n", num_nodes);
1297 for (node_id = 0; node_id < num_nodes; node_id++) {
1990 bool use_ta_info = kdev->kfd->num_nodes == 1;
2091 (cu_info.cu_active_number / kdev->kfd->num_nodes);
2214 int ret = 0, num_nodes; local
2229 num_nodes = num_online_nodes();
2231 num_nodes * (sizeof(struct crat_subtype_computeunit) +
2233 (num_nodes
[all...]
H A Dkfd_mqd_manager.c113 cu_active_per_node = cu_info.cu_active_number / mm->dev->kfd->num_nodes;

Completed in 148 milliseconds

12