nnodes            384 drivers/clk/zynqmp/clkc.c 				       u32 *nnodes)
nnodes            393 drivers/clk/zynqmp/clkc.c 		topology[*nnodes].type = type;
nnodes            394 drivers/clk/zynqmp/clkc.c 		topology[*nnodes].flag = FIELD_GET(CLK_TOPOLOGY_FLAGS,
nnodes            396 drivers/clk/zynqmp/clkc.c 		topology[*nnodes].type_flag =
nnodes            399 drivers/clk/zynqmp/clkc.c 		(*nnodes)++;
nnodes           2399 fs/btrfs/qgroup.c 	if (!roots || roots->nnodes == 0)
nnodes           2437 fs/btrfs/qgroup.c 		nr_new_roots = new_roots->nnodes;
nnodes           2442 fs/btrfs/qgroup.c 		nr_old_roots = old_roots->nnodes;
nnodes             51 fs/btrfs/ulist.c 	ulist->nnodes = 0;
nnodes            140 fs/btrfs/ulist.c 	BUG_ON(ulist->nnodes == 0);
nnodes            141 fs/btrfs/ulist.c 	ulist->nnodes--;
nnodes            213 fs/btrfs/ulist.c 	ulist->nnodes++;
nnodes             39 fs/btrfs/ulist.h 	unsigned long nnodes;
nnodes             14 lib/interval_tree_test.c __param(int, nnodes, 100, "Number of nodes in the interval tree");
nnodes             45 lib/interval_tree_test.c 	for (i = 0; i < nnodes; i++) {
nnodes             68 lib/interval_tree_test.c 	nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node),
nnodes             87 lib/interval_tree_test.c 		for (j = 0; j < nnodes; j++)
nnodes             89 lib/interval_tree_test.c 		for (j = 0; j < nnodes; j++)
nnodes            101 lib/interval_tree_test.c 	for (j = 0; j < nnodes; j++)
nnodes             14 lib/rbtree_test.c __param(int, nnodes, 100, "Number of nodes in the rb-tree");
nnodes            152 lib/rbtree_test.c 	for (i = 0; i < nnodes; i++) {
nnodes            248 lib/rbtree_test.c 	nodes = kmalloc_array(nnodes, sizeof(*nodes), GFP_KERNEL);
nnodes            260 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++)
nnodes            262 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++)
nnodes            276 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++)
nnodes            278 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++)
nnodes            289 lib/rbtree_test.c 	for (i = 0; i < nnodes; i++)
nnodes            329 lib/rbtree_test.c 	for (i = 0; i < nnodes; i++)
nnodes            335 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++) {
nnodes            339 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++) {
nnodes            340 lib/rbtree_test.c 			check(nnodes - j);
nnodes            353 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++)
nnodes            355 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++)
nnodes            368 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++)
nnodes            370 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++)
nnodes            382 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++) {
nnodes            386 lib/rbtree_test.c 		for (j = 0; j < nnodes; j++) {
nnodes            387 lib/rbtree_test.c 			check_augmented(nnodes - j);
nnodes           1890 mm/mempolicy.c 	unsigned nnodes = nodes_weight(pol->v.nodes);
nnodes           1895 mm/mempolicy.c 	if (!nnodes)
nnodes           1897 mm/mempolicy.c 	target = (unsigned int)n % nnodes;