Searched refs:nnodes (Results 1 – 5 of 5) sorted by relevance
| /linux-4.19.296/lib/ |
| D | rbtree_test.c | 13 __param(int, nnodes, 100, "Number of nodes in the rb-tree");
167 for (i = 0; i < nnodes; i++) { in init()
250 nodes = kmalloc_array(nnodes, sizeof(*nodes), GFP_KERNEL); in rbtree_test_init()
262 for (j = 0; j < nnodes; j++) in rbtree_test_init()
264 for (j = 0; j < nnodes; j++) in rbtree_test_init()
278 for (j = 0; j < nnodes; j++) in rbtree_test_init()
280 for (j = 0; j < nnodes; j++) in rbtree_test_init()
291 for (i = 0; i < nnodes; i++) in rbtree_test_init()
331 for (i = 0; i < nnodes; i++) in rbtree_test_init()
337 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
[all …]
|
| D | interval_tree_test.c | 13 __param(int, nnodes, 100, "Number of nodes in the interval tree");
44 for (i = 0; i < nnodes; i++) { in init()
67 nodes = kmalloc_array(nnodes, sizeof(struct interval_tree_node), in interval_tree_test_init()
86 for (j = 0; j < nnodes; j++) in interval_tree_test_init()
88 for (j = 0; j < nnodes; j++) in interval_tree_test_init()
100 for (j = 0; j < nnodes; j++) in interval_tree_test_init()
|
| /linux-4.19.296/fs/btrfs/ |
| D | ulist.c | 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()
|
| D | ulist.h | 39 unsigned long nnodes; member
|
| D | qgroup.c | 2048 if (!roots || roots->nnodes == 0) in maybe_fs_roots()
2086 nr_new_roots = new_roots->nnodes; in btrfs_qgroup_account_extent()
2091 nr_old_roots = old_roots->nnodes; in btrfs_qgroup_account_extent()
|