Searched refs:leaves (Results 1 – 5 of 5) sorted by relevance
| /fs/unicode/ |
| D | mkutf8data.c | 424 int nodes, singletons, leaves; in tree_walk() local
426 nodes = singletons = leaves = 0; in tree_walk()
432 leaves = 1; in tree_walk()
456 leaves += 1; in tree_walk()
470 leaves += 1; in tree_walk()
486 nodes, leaves, singletons); in tree_walk()
1197 int leaves; in emit() local
1202 leaves = 0; in emit()
1214 leaves++; in emit()
1280 leaves++; in emit()
[all …]
|
| /fs/gfs2/ |
| D | dir.c | 1375 unsigned leaves = 0, leaf = 0, offset, sort_offset; in gfs2_dir_read_leaf() local
1387 if (leaves == 0) in gfs2_dir_read_leaf()
1390 leaves++; in gfs2_dir_read_leaf()
1410 larr = gfs2_alloc_sort_buffer((leaves + entries + 99) * sizeof(void *)); in gfs2_dir_read_leaf()
1413 darr = (struct gfs2_dirent **)(larr + leaves); in gfs2_dir_read_leaf()
|
| /fs/btrfs/ |
| D | backref.h | 261 struct list_head leaves; member
|
| D | backref.c | 2716 INIT_LIST_HEAD(&cache->leaves); in btrfs_backref_init_cache()
2785 list_add_tail(&upper->lower, &cache->leaves); in btrfs_backref_cleanup_node()
2807 while (!list_empty(&cache->leaves)) { in btrfs_backref_release_cache()
2808 node = list_entry(cache->leaves.next, in btrfs_backref_release_cache()
3219 list_add_tail(&start->lower, &cache->leaves); in btrfs_backref_finish_upper_links()
|
| D | relocation.c | 596 list_add_tail(&new_node->lower, &cache->leaves); in clone_backref_node()
3427 struct ulist *leaves = NULL; in add_data_references() local
3435 0, &leaves, NULL, true); in add_data_references()
3440 while ((ref_node = ulist_next(leaves, &leaf_uiter))) { in add_data_references()
3459 ulist_free(leaves); in add_data_references()
|