Home
last modified time | relevance | path

Searched refs:sorted (Results 1 – 13 of 13) sorted by relevance

/fs/bcachefs/
A Dbtree_write_buffer.c233 darray_resize(&wb->sorted, wb->flushing.keys.size); in move_keys_from_inc_to_flushing()
241 wb->sorted.size - wb->flushing.keys.nr); in move_keys_from_inc_to_flushing()
267 BUG_ON(wb->sorted.size < wb->flushing.keys.nr); in move_keys_from_inc_to_flushing()
308 wb->sorted.data[i].idx = i; in bch2_btree_write_buffer_flush_locked()
312 wb->sorted.nr = wb->flushing.keys.nr; in bch2_btree_write_buffer_flush_locked()
328 wb_sort(wb->sorted.data, wb->sorted.nr); in bch2_btree_write_buffer_flush_locked()
330 darray_for_each(wb->sorted, i) { in bch2_btree_write_buffer_flush_locked()
349 if (i + 1 < &darray_top(wb->sorted) && in bch2_btree_write_buffer_flush_locked()
735 ret = darray_resize(&wb->sorted, wb->flushing.keys.size); in bch2_journal_key_to_wb_slowpath()
869 darray_exit(&wb->sorted); in bch2_fs_btree_write_buffer_exit()
[all …]
A Ddisk_groups.c26 struct bch_disk_group *g, *sorted = NULL; in bch2_sb_disk_groups_validate() local
68 sorted = kmalloc_array(nr_groups, sizeof(*sorted), GFP_KERNEL); in bch2_sb_disk_groups_validate()
69 if (!sorted) in bch2_sb_disk_groups_validate()
72 memcpy(sorted, groups->entries, nr_groups * sizeof(*sorted)); in bch2_sb_disk_groups_validate()
73 sort(sorted, nr_groups, sizeof(*sorted), group_cmp, NULL); in bch2_sb_disk_groups_validate()
75 for (g = sorted; g + 1 < sorted + nr_groups; g++) in bch2_sb_disk_groups_validate()
85 kfree(sorted); in bch2_sb_disk_groups_validate()
A Dbtree_iter.c1039 btree_path_idx_t idx = trans->sorted[i]; in bch2_btree_path_traverse_all()
1683 btree_path_idx_t *sorted = p; in btree_paths_realloc() local
1684 memcpy(sorted, trans->sorted, trans->nr_sorted * sizeof(btree_path_idx_t)); in btree_paths_realloc()
1694 rcu_assign_pointer(trans->sorted, sorted); in btree_paths_realloc()
2990 BUG_ON(trans->sorted[path->sorted_idx] != i); in btree_trans_verify_sorted_refs()
2994 unsigned idx = trans->sorted[i]; in btree_trans_verify_sorted_refs()
3044 swap(trans->sorted[i], trans->sorted[i + 1]); in __bch2_btree_trans_sort_paths()
3070 trans->sorted + path->sorted_idx + 1, in btree_path_list_remove()
3090 trans->sorted + path->sorted_idx, in btree_path_list_add()
3094 trans->sorted[path->sorted_idx] = path_idx; in btree_path_list_add()
[all …]
A Ddebug.c43 struct bset *sorted, *inmemory = &b->data->keys; in bch2_btree_verify_replica() local
73 sorted = &n_sorted->keys; in bch2_btree_verify_replica()
75 if (inmemory->u64s != sorted->u64s || in bch2_btree_verify_replica()
77 sorted->start, in bch2_btree_verify_replica()
89 bch2_dump_bset(c, v, sorted, 0); in bch2_btree_verify_replica()
112 if (inmemory->_data[j] != sorted->_data[j]) in bch2_btree_verify_replica()
A Dbtree_write_buffer_types.h51 DARRAY(struct wb_key_ref) sorted;
A Dbtree_iter.h146 ? trans->paths + trans->sorted[idx] in next_btree_path()
155 ? trans->paths + trans->sorted[idx - 1] in prev_btree_path()
161 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
172 (_iter.path_idx = trans->sorted[_iter.sorted_idx], \
179 ((_path) = (_trans)->paths + trans->sorted[_i]), (_i) >= 0;\
A Dbtree_io.c1058 struct btree_node *sorted; in bch2_btree_node_read_done() local
1278 sorted = btree_bounce_alloc(c, btree_buf_bytes(b), &used_mempool); in bch2_btree_node_read_done()
1279 sorted->keys.u64s = 0; in bch2_btree_node_read_done()
1281 b->nr = bch2_key_sort_fix_overlapping(c, &sorted->keys, iter); in bch2_btree_node_read_done()
1282 memset((uint8_t *)(sorted + 1) + b->nr.live_u64s * sizeof(u64), 0, in bch2_btree_node_read_done()
1287 b->data->keys.u64s = sorted->keys.u64s; in bch2_btree_node_read_done()
1288 *sorted = *b->data; in bch2_btree_node_read_done()
1289 swap(sorted, b->data); in bch2_btree_node_read_done()
1296 btree_bounce_free(c, btree_buf_bytes(b), used_mempool, sorted); in bch2_btree_node_read_done()
A Dbtree_types.h494 btree_path_idx_t *sorted; member
/fs/nfsd/
A Dnfs4acl.c374 int sorted = 0, i; in sort_pacl_range() local
378 while (!sorted) { in sort_pacl_range()
379 sorted = 1; in sort_pacl_range()
383 sorted = 0; in sort_pacl_range()
/fs/cramfs/
A Dinode.c760 int sorted; in cramfs_lookup() local
763 sorted = CRAMFS_SB(dir->i_sb)->flags & CRAMFS_FLAG_SORTED_DIRS; in cramfs_lookup()
774 if (sorted && (dentry->d_name.name[0] < name[0])) in cramfs_lookup()
803 if (sorted) in cramfs_lookup()
A DREADME32 Beginning in 2.4.7, directory entries are sorted. This optimization
/fs/affs/
A DChanges197 - Fixed bug in add_entry(): When doing a sorted insert,
272 - Hash chains are now sorted by block numbers.
/fs/ext4/
A Dxattr.c321 void *end, int name_index, const char *name, int sorted) in xattr_find_entry() argument
341 if (!cmp || (cmp < 0 && sorted)) in xattr_find_entry()

Completed in 42 milliseconds