/fs/reiserfs/ |
D | lbalance.c | 40 RFALSE(!is_direntry_le_ih(ih), "vs-10000: item must be directory item"); in leaf_copy_dir_entries() 148 RFALSE(!ih_item_len(ih), in leaf_copy_boundary_item() 186 RFALSE(get_ih_free_space(dih), in leaf_copy_boundary_item() 225 RFALSE(is_indirect_le_ih(ih) && get_ih_free_space(ih), in leaf_copy_boundary_item() 233 RFALSE(le_ih_k_offset(dih) != in leaf_copy_boundary_item() 245 RFALSE(ih_item_len(ih) <= bytes_or_entries, in leaf_copy_boundary_item() 252 RFALSE(le_ih_k_offset(dih) <= in leaf_copy_boundary_item() 260 RFALSE(le_ih_k_offset(dih) <= in leaf_copy_boundary_item() 295 RFALSE(last_first != LAST_TO_FIRST && last_first != FIRST_TO_LAST, in leaf_copy_items_entirely() 297 RFALSE(B_NR_ITEMS(src) - first < cpy_num, in leaf_copy_items_entirely() [all …]
|
D | do_balan.c | 110 RFALSE(tb->FR[0] && B_LEVEL(tb->FR[0]) != DISK_LEAF_NODE_LEVEL + 1, in balance_leaf_when_delete() 112 RFALSE(tb->blknum[0] > 1, in balance_leaf_when_delete() 114 RFALSE(!tb->blknum[0] && !PATH_H_PPARENT(tb->tb_path, 0), in balance_leaf_when_delete() 125 RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0], in balance_leaf_when_delete() 143 RFALSE(!item_pos && !tb->CFL[0], in balance_leaf_when_delete() 158 RFALSE(!item_pos && !pos_in_item && !tb->CFL[0], in balance_leaf_when_delete() 170 RFALSE(!ih_item_len(ih), in balance_leaf_when_delete() 227 RFALSE(tb->rnum[0] != 0, in balance_leaf_when_delete() 238 RFALSE((tb->lnum[0] + tb->rnum[0] < n) || in balance_leaf_when_delete() 242 RFALSE((tb->lnum[0] + tb->rnum[0] == n) && in balance_leaf_when_delete() [all …]
|
D | ibalance.c | 137 RFALSE(count > 2, "too many children (%d) are to be inserted", count); in internal_insert_childs() 138 RFALSE(B_FREE_SPACE(cur) < count * (KEY_SIZE + DC_SIZE), in internal_insert_childs() 205 RFALSE(cur == NULL, "buffer is 0"); in internal_delete_pointers_items() 206 RFALSE(del_num < 0, in internal_delete_pointers_items() 208 RFALSE(first_p < 0 || first_p + del_num > B_NR_ITEMS(cur) + 1 in internal_delete_pointers_items() 221 RFALSE(first_i != 0, in internal_delete_pointers_items() 227 RFALSE(first_i + del_num > B_NR_ITEMS(cur), in internal_delete_pointers_items() 298 RFALSE(dest == NULL || src == NULL, in internal_copy_pointers_items() 300 RFALSE(last_first != FIRST_TO_LAST && last_first != LAST_TO_FIRST, in internal_copy_pointers_items() 302 RFALSE(nr_src < cpy_num - 1, in internal_copy_pointers_items() [all …]
|
D | fix_node.c | 65 RFALSE(new_num == 0, in old_item_num() 71 RFALSE(mode != M_DELETE, in old_item_num() 156 RFALSE(vn->vn_ins_ih == NULL, in create_virtual_node() 210 RFALSE(cur_free < 0, "vs-8050: cur_free (%d) < 0", cur_free); in check_left() 227 RFALSE(!PATH_H_PPARENT(tb->tb_path, 0), in check_left() 236 RFALSE(vn->vn_mode == M_INSERT || vn->vn_mode == M_PASTE, in check_left() 290 RFALSE(cur_free < 0, "vs-8070: cur_free < 0"); in check_right() 307 RFALSE(!PATH_H_PPARENT(tb->tb_path, 0), in check_right() 316 RFALSE(vn->vn_mode == M_INSERT || vn->vn_mode == M_PASTE, in check_right() 396 RFALSE(tb->insert_size[h] < 0 || (mode != M_INSERT && mode != M_PASTE), in get_num_ver() [all …]
|
D | stree.c | 62 RFALSE(B_LEVEL(bh) > MAX_HEIGHT, in B_IS_IN_TREE() 247 RFALSE(path_offset < FIRST_PATH_ELEMENT_OFFSET, in get_lkey() 253 RFALSE(!buffer_uptodate in get_lkey() 291 RFALSE(path_offset < FIRST_PATH_ELEMENT_OFFSET, in get_rkey() 296 RFALSE(!buffer_uptodate in get_rkey() 338 RFALSE(!key || chk_path->path_length < FIRST_PATH_ELEMENT_OFFSET in key_in_buffer() 342 RFALSE(!PATH_PLAST_BUFFER(chk_path)->b_bdev, in key_in_buffer() 357 RFALSE(p->path_length != ILLEGAL_PATH_ELEMENT_OFFSET, in reiserfs_check_path() 370 RFALSE(path_offset < ILLEGAL_PATH_ELEMENT_OFFSET, in pathrelse_and_restore() 387 RFALSE(path_offset < ILLEGAL_PATH_ELEMENT_OFFSET, in pathrelse() [all …]
|
D | dir.c | 107 RFALSE(COMP_SHORT_KEYS(&(ih->ih_key), &pos_key), in reiserfs_readdir_dentry() 110 RFALSE(item_num > B_NR_ITEMS(bh) - 1, in reiserfs_readdir_dentry() 115 RFALSE(I_ENTRY_COUNT(ih) < entry_num, in reiserfs_readdir_dentry()
|
D | objectid.c | 126 RFALSE(sb_oid_cursize(rs) < 2 || in reiserfs_release_objectid()
|
D | bitmap.c | 146 RFALSE(bmap_n >= reiserfs_bmap_count(s), "Bitmap %u is out of " in scan_bitmap_block() 437 RFALSE(!s, "vs-4061: trying to free block on nonexistent device"); in reiserfs_free_block() 458 RFALSE(!th->t_super, in reiserfs_free_prealloc_block() 818 RFALSE(!bh, "green-4002: Illegal path specified to get_left_neighbor"); in get_left_neighbor()
|
D | tail_conversion.c | 98 RFALSE(!is_direct_le_ih(p_le_ih), in direct2indirect()
|
D | namei.c | 229 RFALSE(de->de_deh != B_I_DEH(de->de_bh, de->de_ih), in linear_search_in_dir_item() 274 RFALSE(de->de_item_num, in linear_search_in_dir_item() 1435 RFALSE(S_ISDIR(old_inode_mode) && in reiserfs_rename()
|
D | item_ops.c | 459 RFALSE(mode != M_PASTE || virtual_entry_num == 0, in old_entry_num()
|
D | super.c | 390 RFALSE(truncate && in add_save_link() 394 RFALSE(!truncate && in add_save_link()
|
D | inode.c | 925 RFALSE(pos_in_item != ih_item_len(ih) / UNFM_P_SIZE, in reiserfs_get_block() 936 RFALSE(cpu_key_k_offset(&tmp_key) > cpu_key_k_offset(&key), in reiserfs_get_block()
|
D | reiserfs.h | 773 #define RFALSE(cond, format, args...) __RASSERT(!(cond), "!(" #cond ")", format, ##args) macro 775 #define RFALSE( cond, format, args... ) do {;} while( 0 ) macro
|