| /linux-6.15/fs/bcachefs/ |
| H A D | six.c | 19 #define EBUG_ON(cond) BUG_ON(cond) macro 21 #define EBUG_ON(cond) do {} while (0) macro 91 EBUG_ON(lock->owner); in six_set_owner() 94 EBUG_ON(lock->owner != current); in six_set_owner() 123 EBUG_ON(type == SIX_LOCK_write && lock->owner != task); in __do_six_trylock() 124 EBUG_ON(type == SIX_LOCK_write && in __do_six_trylock() 206 EBUG_ON(type == SIX_LOCK_write && try && ret <= 0 && in __do_six_trylock() 611 EBUG_ON(type == SIX_LOCK_write && in six_unlock_ip() 613 EBUG_ON((type == SIX_LOCK_write || in six_unlock_ip() 672 EBUG_ON(!(new & SIX_LOCK_HELD_read)); in six_lock_tryupgrade() [all …]
|
| H A D | btree_locking.h | 129 EBUG_ON(level >= BTREE_MAX_DEPTH); in btree_node_unlock() 183 EBUG_ON(path->l[b->c.level].b != b); in bch2_btree_node_unlock_write_inlined() 184 EBUG_ON(path->l[b->c.level].lock_seq != six_lock_seq(&b->c.lock)); in bch2_btree_node_unlock_write_inlined() 288 EBUG_ON(level >= BTREE_MAX_DEPTH); in btree_node_lock() 310 EBUG_ON(&path->l[b->level].b->c != b); in __btree_node_lock_write() 311 EBUG_ON(path->l[b->level].lock_seq != six_lock_seq(&b->lock)); in __btree_node_lock_write() 312 EBUG_ON(!btree_node_intent_locked(path, b->level)); in __btree_node_lock_write() 357 EBUG_ON(btree_node_locked(path, level) && in bch2_btree_node_relock() 369 EBUG_ON(btree_node_locked(path, level) && in bch2_btree_node_relock_notrace() 411 EBUG_ON(!btree_node_locked(path, path->level)); in btree_path_set_should_be_locked() [all …]
|
| H A D | lru.h | 19 EBUG_ON(time > LRU_TIME_MAX); in lru_pos() 20 EBUG_ON(lru_pos_id(pos) != lru_id); in lru_pos() 21 EBUG_ON(lru_pos_time(pos) != time); in lru_pos() 22 EBUG_ON(pos.offset != dev_bucket); in lru_pos()
|
| H A D | bkey_types.h | 132 EBUG_ON(!IS_ERR_OR_NULL(k) && k->k.type != KEY_TYPE_##name); \ 139 EBUG_ON(!IS_ERR_OR_NULL(k) && k->k.type != KEY_TYPE_##name); \ 145 EBUG_ON(!IS_ERR_OR_NULL(k.k) && k.k->type != KEY_TYPE_##name); \ 154 EBUG_ON(!IS_ERR_OR_NULL(k.k) && k.k->type != KEY_TYPE_##name); \ 180 EBUG_ON(!IS_ERR_OR_NULL(k) && k->k.type != KEY_TYPE_##name); \ 190 EBUG_ON(!IS_ERR_OR_NULL(k) && k->k.type != KEY_TYPE_##name); \
|
| H A D | bset.c | 455 EBUG_ON(m > U8_MAX); in bkey_to_cacheline_offset() 490 EBUG_ON(k >= btree_bkey_last(b, t)); in rw_aux_tree_set() 543 EBUG_ON(!t->size); in rw_aux_tree_bsearch() 544 EBUG_ON(idx > t->size); in rw_aux_tree_bsearch() 554 EBUG_ON(idx < t->size && in rw_aux_tree_bsearch() 557 EBUG_ON(idx + 1 < t->size && in rw_aux_tree_bsearch() 569 EBUG_ON(!bkey_packed(k)); in bkey_mantissa() 892 EBUG_ON(!idx || idx > t->size); in rw_aux_tree_insert_entry() 929 EBUG_ON(bset_has_ro_aux_tree(t)); in bch2_bset_fix_lookup_table() 948 EBUG_ON(where != t->end_offset); in bch2_bset_fix_lookup_table() [all …]
|
| H A D | bkey.c | 129 EBUG_ON(state->p < k->_data); in pack_state_finish() 272 EBUG_ON(format->nr_fields != BKEY_NR_FIELDS); in __bch2_bkey_unpack_key() 273 EBUG_ON(in->u64s < format->key_u64s); in __bch2_bkey_unpack_key() 274 EBUG_ON(in->format != KEY_FORMAT_LOCAL_BTREE); in __bch2_bkey_unpack_key() 297 EBUG_ON(format->nr_fields != BKEY_NR_FIELDS); in __bkey_unpack_pos() 298 EBUG_ON(in->u64s < format->key_u64s); in __bkey_unpack_pos() 299 EBUG_ON(in->format != KEY_FORMAT_LOCAL_BTREE); in __bkey_unpack_pos() 323 EBUG_ON((void *) in == (void *) out); in bch2_bkey_pack_key() 324 EBUG_ON(format->nr_fields != BKEY_NR_FIELDS); in bch2_bkey_pack_key() 325 EBUG_ON(in->format != KEY_FORMAT_CURRENT); in bch2_bkey_pack_key() [all …]
|
| H A D | bkey_cmp.h | 96 EBUG_ON(!bkey_packed(l) || !bkey_packed(r)); in __bch2_bkey_cmp_packed_format_checked_inlined() 97 EBUG_ON(b->nr_key_bits != bkey_format_key_bits(f)); in __bch2_bkey_cmp_packed_format_checked_inlined() 103 EBUG_ON(ret != bpos_cmp(bkey_unpack_pos(b, l), in __bch2_bkey_cmp_packed_format_checked_inlined()
|
| H A D | journal.h | 244 EBUG_ON(!res->ref); in bch2_journal_add_entry() 245 EBUG_ON(actual > res->u64s); in bch2_journal_add_entry() 360 EBUG_ON(!journal_state_count(new, new.idx)); in journal_res_get_fast() 393 EBUG_ON(res->ref); in bch2_journal_res_get() 394 EBUG_ON(!test_bit(JOURNAL_running, &j->flags)); in bch2_journal_res_get() 409 EBUG_ON(!res->ref); in bch2_journal_res_get()
|
| H A D | bset.h | 165 EBUG_ON(t->size); in bset_aux_tree_type() 168 EBUG_ON(!t->size); in bset_aux_tree_type() 171 EBUG_ON(!t->size); in bset_aux_tree_type() 262 EBUG_ON(!is_power_of_2(block_bytes)); in bset_next_set() 285 EBUG_ON(r_packed && !bkey_packed(r_packed)); in bkey_cmp_p_or_unp() 303 EBUG_ON(offset < btree_bkey_first_offset(t)); in bch2_bkey_to_bset_inlined()
|
| H A D | btree_trans_commit.c | 119 EBUG_ON(trans->write_locked); in bch2_trans_lock_write() 160 EBUG_ON(btree_node_just_written(b)); in bch2_btree_bset_insert_key() 161 EBUG_ON(bset_written(b, btree_bset_last(b))); in bch2_btree_bset_insert_key() 163 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key)); in bch2_btree_bset_insert_key() 164 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key)); in bch2_btree_bset_insert_key() 174 EBUG_ON(k && bkey_deleted(k)); in bch2_btree_bset_insert_key() 310 EBUG_ON(test_bit(BCH_FS_clean_shutdown, &c->flags)); in bch2_btree_insert_key_leaf() 341 EBUG_ON(!i->level && in btree_insert_entry_checks() 427 EBUG_ON(path->level); in btree_key_can_insert_cached() 1003 EBUG_ON(test_bit(BCH_FS_clean_shutdown, &c->flags)); in __bch2_trans_commit() [all …]
|
| H A D | util.h | 30 #define EBUG_ON(cond) BUG_ON(cond) macro 32 #define EBUG_ON(cond) macro 454 EBUG_ON(!(dst >= src + u64s * sizeof(u64) || in memcpy_u64s() 469 EBUG_ON(dst > src); in memmove_u64s_down() 483 EBUG_ON(dst > src); in memmove_u64s_down_small() 501 EBUG_ON(dst < src); in memmove_u64s_up_small() 530 EBUG_ON(dst < src); in memmove_u64s_up()
|
| H A D | ec.h | 34 EBUG_ON(s->csum_type >= BCH_CSUM_NR); in stripe_csum_offset() 73 EBUG_ON(block >= s->nr_blocks); in stripe_csum() 74 EBUG_ON(csum_idx >= stripe_csums_per_device(s)); in stripe_csum()
|
| H A D | fs-io-pagecache.h | 96 EBUG_ON(!folio_test_locked(folio)); in bch2_folio_release() 107 EBUG_ON(!folio_test_locked(folio)); in bch2_folio()
|
| H A D | disk_accounting.h | 205 EBUG_ON(bch2_accounting_counters(a.k) != e->nr_counters); in bch2_accounting_mem_mod_locked() 250 EBUG_ON(!res->ref); in journal_pos_to_bversion() 265 EBUG_ON(bversion_zero(a->k.bversion)); in bch2_accounting_trans_commit_hook()
|
| H A D | extents.h | 19 EBUG_ON((_entry) && !extent_entry_is_ptr(_entry)); \ 61 EBUG_ON(ret < 0 || ret >= BCH_EXTENT_ENTRY_MAX); in extent_entry_type() 145 EBUG_ON((_entry) && !extent_entry_is_crc(_entry)); \ 622 EBUG_ON(bch2_bkey_has_device(bkey_i_to_s(k), ptr.dev)); in bch2_bkey_append_ptr() 628 EBUG_ON(bkey_val_u64s(&k->k) >= BKEY_EXTENT_VAL_U64s_MAX); in bch2_bkey_append_ptr()
|
| H A D | two_state_shared_lock.h | 30 EBUG_ON(atomic_long_read(&lock->v) == 0); in bch2_two_state_unlock()
|
| H A D | btree_iter.h | 25 EBUG_ON(idx >= trans->nr_paths); in __btree_path_get() 26 EBUG_ON(!test_bit(idx, trans->paths_allocated)); in __btree_path_get() 39 EBUG_ON(path - trans->paths >= trans->nr_paths); in __btree_path_put() 40 EBUG_ON(!test_bit(path - trans->paths, trans->paths_allocated)); in __btree_path_put() 41 EBUG_ON(!path->ref); in __btree_path_put() 42 EBUG_ON(!path->intent_ref && intent); in __btree_path_put() 141 EBUG_ON(idx > trans->nr_sorted); in next_btree_path()
|
| H A D | btree_cache.c | 109 EBUG_ON(btree_node_write_in_flight(b)); in __btree_node_data_free() 1050 EBUG_ON(level >= BTREE_MAX_DEPTH); in __bch2_btree_node_get() 1140 EBUG_ON(b->c.btree_id != path->btree_id); in __bch2_btree_node_get() 1141 EBUG_ON(BTREE_NODE_LEVEL(b->data) != level); in __bch2_btree_node_get() 1172 EBUG_ON(level >= BTREE_MAX_DEPTH); in bch2_btree_node_get() 1230 EBUG_ON(b->c.btree_id != path->btree_id); in bch2_btree_node_get() 1231 EBUG_ON(BTREE_NODE_LEVEL(b->data) != level); in bch2_btree_node_get() 1248 EBUG_ON(level >= BTREE_MAX_DEPTH); in bch2_btree_node_get_noiter() 1313 EBUG_ON(b->c.btree_id != btree_id); in bch2_btree_node_get_noiter() 1314 EBUG_ON(BTREE_NODE_LEVEL(b->data) != level); in bch2_btree_node_get_noiter()
|
| H A D | btree_types.h | 643 EBUG_ON(!b->nsets); in bset_tree_last() 658 EBUG_ON(__btree_node_offset_to_ptr(b, ret) != p); in __btree_node_ptr_to_offset() 710 EBUG_ON(bset(_b, _t)->start != \ 718 EBUG_ON(__btree_node_offset_to_key(_b, (_t)->end_offset) != \
|
| H A D | btree_update_interior.h | 145 EBUG_ON(!btree_node_locked(path, level)); in bch2_foreground_maybe_merge_sibling() 309 EBUG_ON(btree_node_just_written(b)); in push_whiteout()
|
| H A D | io_read.c | 109 EBUG_ON(rbio->split); in rbio_data_update() 1026 EBUG_ON(offset_into_extent + bvec_iter_sectors(iter) > k.k->size); in __bch2_read_extent() 1058 EBUG_ON(crc_is_compressed(pick.crc)); in __bch2_read_extent() 1059 EBUG_ON(pick.crc.csum_type && in __bch2_read_extent() 1082 EBUG_ON(rbio->bio.bi_iter.bi_size < in __bch2_read_extent() 1114 EBUG_ON(bio_flagged(&rbio->bio, BIO_CHAIN)); in __bch2_read_extent() 1117 EBUG_ON(bio_sectors(&rbio->bio) != pick.crc.compressed_size); in __bch2_read_extent() 1276 EBUG_ON(rbio->data_update); in __bch2_read()
|
| H A D | dirent.c | 262 EBUG_ON(dirent->v.d_casefold); in dirent_init_regular_name() 275 EBUG_ON(!dirent->v.d_casefold); in dirent_init_casefolded_name() 276 EBUG_ON(!cf_name->len); in dirent_init_casefolded_name() 287 EBUG_ON(bch2_dirent_get_casefold_name(dirent_i_to_s_c(dirent)).len != cf_name->len); in dirent_init_casefolded_name() 321 EBUG_ON(bch2_dirent_get_name(dirent_i_to_s_c(dirent)).len != name->len); in dirent_create_key()
|
| H A D | journal_reclaim.h | 30 EBUG_ON(seq < j->pin.front || seq >= j->pin.back); in journal_seq_pin()
|
| H A D | btree_iter.c | 619 EBUG_ON(!btree_path_pos_in_node(path, b)); in bch2_btree_path_level_init() 729 EBUG_ON(path->nodes_locked); in btree_path_lock_root() 928 EBUG_ON(!btree_node_locked(path, path->level)); in btree_path_down() 1177 EBUG_ON(btree_path_node(path, path->level) && in bch2_btree_path_traverse_one() 1277 EBUG_ON(!trans->paths[path_idx].ref); in __bch2_btree_path_set_pos() 1844 EBUG_ON(path->btree_id != ck->key.btree_id || in bch2_btree_path_peek_slot() 1904 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_peek_node() 1953 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_next_node() 2241 EBUG_ON(btree_iter_path(trans, iter)->cached); in __bch2_btree_iter_peek() 2819 EBUG_ON(btree_iter_path(trans, iter)->level); in bch2_btree_iter_peek_slot() [all …]
|
| H A D | btree_write_buffer.h | 92 EBUG_ON(!dst->seq); in bch2_journal_key_to_wb()
|