Searched refs:nnodes (Results 1 – 7 of 7) sorted by relevance
152 for (i = 0; i < nnodes; i++) { in init()260 for (j = 0; j < nnodes; j++) in rbtree_test_init()262 for (j = 0; j < nnodes; j++) in rbtree_test_init()276 for (j = 0; j < nnodes; j++) in rbtree_test_init()278 for (j = 0; j < nnodes; j++) in rbtree_test_init()289 for (i = 0; i < nnodes; i++) in rbtree_test_init()329 for (i = 0; i < nnodes; i++) in rbtree_test_init()340 check(nnodes - j); in rbtree_test_init()353 for (j = 0; j < nnodes; j++) in rbtree_test_init()355 for (j = 0; j < nnodes; j++) in rbtree_test_init()[all …]
14 __param(int, nnodes, 100, "Number of nodes in the interval tree");45 for (i = 0; i < nnodes; i++) { in init()68 nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), in interval_tree_test_init()87 for (j = 0; j < nnodes; j++) in interval_tree_test_init()89 for (j = 0; j < nnodes; j++) in interval_tree_test_init()101 for (j = 0; j < nnodes; j++) in interval_tree_test_init()
51 ulist->nnodes = 0; in ulist_init()140 BUG_ON(ulist->nnodes == 0); in ulist_rbtree_erase()141 ulist->nnodes--; in ulist_rbtree_erase()213 ulist->nnodes++; in ulist_add_merge()
39 unsigned long nnodes; member
2518 if (!roots || roots->nnodes == 0) in maybe_fs_roots()2556 nr_new_roots = new_roots->nnodes; in btrfs_qgroup_account_extent()2561 nr_old_roots = old_roots->nnodes; in btrfs_qgroup_account_extent()
407 u32 *nnodes) in __zynqmp_clock_get_topology() argument416 topology[*nnodes].type = type; in __zynqmp_clock_get_topology()417 topology[*nnodes].flag = FIELD_GET(CLK_TOPOLOGY_FLAGS, in __zynqmp_clock_get_topology()419 topology[*nnodes].type_flag = in __zynqmp_clock_get_topology()422 topology[*nnodes].custom_type_flag = in __zynqmp_clock_get_topology()425 (*nnodes)++; in __zynqmp_clock_get_topology()
1874 unsigned int target, nnodes; in offset_il_node() local1886 nnodes = nodes_weight(nodemask); in offset_il_node()1887 if (!nnodes) in offset_il_node()1889 target = (unsigned int)n % nnodes; in offset_il_node()
Completed in 24 milliseconds