RFALSE 154 fs/reiserfs/bitmap.c RFALSE(bmap_n >= reiserfs_bmap_count(s), "Bitmap %u is out of " RFALSE 474 fs/reiserfs/bitmap.c RFALSE(!s, "vs-4061: trying to free block on nonexistent device"); RFALSE 495 fs/reiserfs/bitmap.c RFALSE(!th->t_super, RFALSE 872 fs/reiserfs/bitmap.c RFALSE(!bh, "green-4002: Illegal path specified to get_left_neighbor"); RFALSE 115 fs/reiserfs/dir.c RFALSE(COMP_SHORT_KEYS(&ih->ih_key, &pos_key), RFALSE 118 fs/reiserfs/dir.c RFALSE(item_num > B_NR_ITEMS(bh) - 1, RFALSE 126 fs/reiserfs/dir.c RFALSE(ih_entry_count(ih) < entry_num, RFALSE 86 fs/reiserfs/do_balan.c RFALSE(ih_item_len(ih) + IH_SIZE != -tb->insert_size[0], RFALSE 103 fs/reiserfs/do_balan.c RFALSE(!item_pos && !tb->CFL[0], RFALSE 130 fs/reiserfs/do_balan.c RFALSE(!item_pos && !pos_in_item && !tb->CFL[0], RFALSE 140 fs/reiserfs/do_balan.c RFALSE(!ih_item_len(ih), RFALSE 191 fs/reiserfs/do_balan.c RFALSE(tb->rnum[0] != 0, RFALSE 206 fs/reiserfs/do_balan.c RFALSE((tb->lnum[0] + tb->rnum[0] < n) || RFALSE 211 fs/reiserfs/do_balan.c RFALSE((tb->lnum[0] + tb->rnum[0] == n) && RFALSE 216 fs/reiserfs/do_balan.c RFALSE((tb->lnum[0] + tb->rnum[0] == n + 1) && RFALSE 245 fs/reiserfs/do_balan.c RFALSE(tb->FR[0] && B_LEVEL(tb->FR[0]) != DISK_LEAF_NODE_LEVEL + 1, RFALSE 247 fs/reiserfs/do_balan.c RFALSE(tb->blknum[0] > 1, RFALSE 249 fs/reiserfs/do_balan.c RFALSE(!tb->blknum[0] && !PATH_H_PPARENT(tb->tb_path, 0), RFALSE 281 fs/reiserfs/do_balan.c RFALSE(tb->rnum[0], RFALSE 307 fs/reiserfs/do_balan.c RFALSE(ih_item_len(ih) <= 0, RFALSE 333 fs/reiserfs/do_balan.c RFALSE(ih_item_len(ih) <= 0, RFALSE 358 fs/reiserfs/do_balan.c RFALSE(tb->zeroes_num, RFALSE 427 fs/reiserfs/do_balan.c RFALSE(tb->lbytes <= 0, RFALSE 430 fs/reiserfs/do_balan.c RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)), RFALSE 454 fs/reiserfs/do_balan.c RFALSE(tb->insert_size[0] <= 0, RFALSE 475 fs/reiserfs/do_balan.c RFALSE(ih_item_len(tbS0_0_ih), RFALSE 477 fs/reiserfs/do_balan.c RFALSE(comp_short_le_keys(&tbS0_0_ih->ih_key, RFALSE 504 fs/reiserfs/do_balan.c RFALSE(comp_short_le_keys(&tbS0_0_ih->ih_key, RFALSE 517 fs/reiserfs/do_balan.c RFALSE(tb->pos_in_item <= 0, RFALSE 715 fs/reiserfs/do_balan.c RFALSE(tb->zeroes_num, RFALSE 723 fs/reiserfs/do_balan.c RFALSE(tb->rbytes - 1 >= entry_count || !tb->insert_size[0], RFALSE 784 fs/reiserfs/do_balan.c RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)), RFALSE 866 fs/reiserfs/do_balan.c RFALSE(tb->item_pos - n + tb->rnum[0], RFALSE 1025 fs/reiserfs/do_balan.c RFALSE(!tb->insert_size[0], RFALSE 1027 fs/reiserfs/do_balan.c RFALSE(tb->sbytes[i] - 1 >= entry_count, RFALSE 1078 fs/reiserfs/do_balan.c RFALSE(ih, "PAP-12210: ih must be 0"); RFALSE 1089 fs/reiserfs/do_balan.c RFALSE(tb->pos_in_item != ih_item_len(item_head(tbS0, tb->item_pos)) || RFALSE 1165 fs/reiserfs/do_balan.c RFALSE(leaf_mi, RFALSE 1231 fs/reiserfs/do_balan.c RFALSE(!tb->snum[i], RFALSE 1252 fs/reiserfs/do_balan.c RFALSE(!buffer_journaled(tb->S_new[i]) RFALSE 1286 fs/reiserfs/do_balan.c RFALSE(!tb->insert_size[0], RFALSE 1300 fs/reiserfs/do_balan.c RFALSE(!tb->CFL[0] || !tb->L[0], RFALSE 1328 fs/reiserfs/do_balan.c RFALSE(tb->insert_size[0] <= 0, RFALSE 1418 fs/reiserfs/do_balan.c RFALSE(tb->blknum[0] > 3, RFALSE 1420 fs/reiserfs/do_balan.c RFALSE(tb->blknum[0] < 0, RFALSE 1430 fs/reiserfs/do_balan.c RFALSE(!tb->lnum[0] || !tb->rnum[0], RFALSE 1472 fs/reiserfs/do_balan.c RFALSE(bi->bi_bh == NULL, "PAP-12295: pointer to the buffer is NULL"); RFALSE 1556 fs/reiserfs/do_balan.c RFALSE(dest == NULL || src == NULL, RFALSE 1559 fs/reiserfs/do_balan.c RFALSE(!B_IS_KEYS_LEVEL(dest), RFALSE 1562 fs/reiserfs/do_balan.c RFALSE(n_dest < 0 || n_src < 0, RFALSE 1564 fs/reiserfs/do_balan.c RFALSE(n_dest >= B_NR_ITEMS(dest) || n_src >= B_NR_ITEMS(src), RFALSE 1583 fs/reiserfs/do_balan.c RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FL[h] == NULL, RFALSE 1597 fs/reiserfs/do_balan.c RFALSE(PATH_H_PPARENT(tb->tb_path, h) == NULL || tb->FR[h] == NULL, RFALSE 1616 fs/reiserfs/do_balan.c RFALSE(!bh, "PAP-12336: bh == 0"); RFALSE 1621 fs/reiserfs/do_balan.c RFALSE(!buffer_dirty(bh) && RFALSE 1800 fs/reiserfs/do_balan.c RFALSE(check_before_balancing(tb), "PAP-12340: locked buffers in TB"); RFALSE 38 fs/reiserfs/fix_node.c RFALSE(new_num == 0, RFALSE 44 fs/reiserfs/fix_node.c RFALSE(mode != M_DELETE, RFALSE 135 fs/reiserfs/fix_node.c RFALSE(vn->vn_ins_ih == NULL, RFALSE 201 fs/reiserfs/fix_node.c RFALSE(cur_free < 0, "vs-8050: cur_free (%d) < 0", cur_free); RFALSE 218 fs/reiserfs/fix_node.c RFALSE(!PATH_H_PPARENT(tb->tb_path, 0), RFALSE 227 fs/reiserfs/fix_node.c RFALSE(vn->vn_mode == M_INSERT || vn->vn_mode == M_PASTE, RFALSE 287 fs/reiserfs/fix_node.c RFALSE(cur_free < 0, "vs-8070: cur_free < 0"); RFALSE 304 fs/reiserfs/fix_node.c RFALSE(!PATH_H_PPARENT(tb->tb_path, 0), RFALSE 313 fs/reiserfs/fix_node.c RFALSE(vn->vn_mode == M_INSERT || vn->vn_mode == M_PASTE, RFALSE 417 fs/reiserfs/fix_node.c RFALSE(tb->insert_size[h] < 0 || (mode != M_INSERT && mode != M_PASTE), RFALSE 461 fs/reiserfs/fix_node.c RFALSE(needed_nodes > 3, "vs-8105: too many nodes are needed"); RFALSE 490 fs/reiserfs/fix_node.c RFALSE(is_direct_le_ih(vi->vi_ih), RFALSE 716 fs/reiserfs/fix_node.c RFALSE(B_NR_ITEMS(S0) != 1, RFALSE 742 fs/reiserfs/fix_node.c RFALSE(le_ih_k_offset(ih) == DOT_OFFSET, RFALSE 887 fs/reiserfs/fix_node.c RFALSE(!*blocknr, RFALSE 891 fs/reiserfs/fix_node.c RFALSE(buffer_dirty(new_bh) || RFALSE 898 fs/reiserfs/fix_node.c RFALSE(tb->FEB[tb->cur_blknum], RFALSE 973 fs/reiserfs/fix_node.c RFALSE(!father || RFALSE 993 fs/reiserfs/fix_node.c RFALSE(buffer_uptodate(left) && !B_IS_IN_TREE(left), RFALSE 1044 fs/reiserfs/fix_node.c RFALSE(counter < FIRST_PATH_ELEMENT_OFFSET, RFALSE 1101 fs/reiserfs/fix_node.c RFALSE(B_LEVEL(*pcom_father) <= DISK_LEAF_NODE_LEVEL, RFALSE 1152 fs/reiserfs/fix_node.c RFALSE(B_LEVEL(*pfather) != h + 1, RFALSE 1154 fs/reiserfs/fix_node.c RFALSE(s_path_to_neighbor_father.path_length < RFALSE 1227 fs/reiserfs/fix_node.c RFALSE((curf && !B_IS_IN_TREE(curf)) || RFALSE 1262 fs/reiserfs/fix_node.c RFALSE((curf && !B_IS_IN_TREE(curf)) || RFALSE 1458 fs/reiserfs/fix_node.c RFALSE(h && RFALSE 1462 fs/reiserfs/fix_node.c RFALSE(!h && ((tb->lnum[h] >= vn->vn_nr_item && (tb->lbytes == -1)) || RFALSE 1638 fs/reiserfs/fix_node.c RFALSE(h && RFALSE 1892 fs/reiserfs/fix_node.c RFALSE(!tb->FL[h] && !tb->FR[h], "vs-8235: trying to borrow for root"); RFALSE 1956 fs/reiserfs/fix_node.c RFALSE(-levbytes >= maxsize - B_FREE_SPACE(S0), RFALSE 1990 fs/reiserfs/fix_node.c RFALSE(!tb->FL[h], RFALSE 2033 fs/reiserfs/fix_node.c RFALSE(!(PATH_H_PBUFFER(tb->tb_path, h)), RFALSE 2078 fs/reiserfs/fix_node.c RFALSE(mode == M_INSERT && !vn->vn_ins_ih, RFALSE 2100 fs/reiserfs/fix_node.c RFALSE(path_offset < FIRST_PATH_ELEMENT_OFFSET - 1, RFALSE 2167 fs/reiserfs/fix_node.c RFALSE(bh == tb->FL[h] && RFALSE 2187 fs/reiserfs/fix_node.c RFALSE(!B_IS_IN_TREE(tb->FL[h]) || RFALSE 2191 fs/reiserfs/fix_node.c RFALSE(!B_IS_IN_TREE(bh), "PAP-8280: invalid child"); RFALSE 2192 fs/reiserfs/fix_node.c RFALSE(!h && RFALSE 2207 fs/reiserfs/fix_node.c RFALSE(bh == tb->FR[h] && RFALSE 2229 fs/reiserfs/fix_node.c RFALSE(!h RFALSE 2672 fs/reiserfs/fix_node.c RFALSE(tb->blknum[h] != 1, RFALSE 2686 fs/reiserfs/fix_node.c RFALSE(h == MAX_HEIGHT - 1, RFALSE 145 fs/reiserfs/ibalance.c RFALSE(count > 2, "too many children (%d) are to be inserted", count); RFALSE 146 fs/reiserfs/ibalance.c RFALSE(B_FREE_SPACE(cur) < count * (KEY_SIZE + DC_SIZE), RFALSE 215 fs/reiserfs/ibalance.c RFALSE(cur == NULL, "buffer is 0"); RFALSE 216 fs/reiserfs/ibalance.c RFALSE(del_num < 0, RFALSE 218 fs/reiserfs/ibalance.c RFALSE(first_p < 0 || first_p + del_num > B_NR_ITEMS(cur) + 1 RFALSE 231 fs/reiserfs/ibalance.c RFALSE(first_i != 0, RFALSE 237 fs/reiserfs/ibalance.c RFALSE(first_i + del_num > B_NR_ITEMS(cur), RFALSE 316 fs/reiserfs/ibalance.c RFALSE(dest == NULL || src == NULL, RFALSE 318 fs/reiserfs/ibalance.c RFALSE(last_first != FIRST_TO_LAST && last_first != LAST_TO_FIRST, RFALSE 320 fs/reiserfs/ibalance.c RFALSE(nr_src < cpy_num - 1, RFALSE 322 fs/reiserfs/ibalance.c RFALSE(cpy_num < 0, "cpy_num less than 0 (%d)", cpy_num); RFALSE 323 fs/reiserfs/ibalance.c RFALSE(cpy_num - 1 + B_NR_ITEMS(dest) > (int)MAX_NR_KEY(dest), RFALSE 439 fs/reiserfs/ibalance.c RFALSE(dest == NULL || src == NULL, RFALSE 441 fs/reiserfs/ibalance.c RFALSE(dest_position_before < 0 || src_position < 0, RFALSE 444 fs/reiserfs/ibalance.c RFALSE(dest_position_before > B_NR_ITEMS(dest) || RFALSE 449 fs/reiserfs/ibalance.c RFALSE(B_FREE_SPACE(dest) < KEY_SIZE, RFALSE 585 fs/reiserfs/ibalance.c RFALSE(src_bi.bi_bh != PATH_H_PBUFFER(tb->tb_path, h) /*tb->S[h] */ || RFALSE 650 fs/reiserfs/ibalance.c RFALSE(tb->blknum[h] > 1, RFALSE 660 fs/reiserfs/ibalance.c RFALSE(n RFALSE 664 fs/reiserfs/ibalance.c RFALSE(bi.bi_parent, "root has parent (%p)", RFALSE 699 fs/reiserfs/ibalance.c RFALSE(tb->rnum[h] != 0, RFALSE 711 fs/reiserfs/ibalance.c RFALSE(tb->lnum[h] != 0, RFALSE 723 fs/reiserfs/ibalance.c RFALSE(tb->rnum[h] != 0, RFALSE 733 fs/reiserfs/ibalance.c RFALSE(tb->lnum[h] != 0, RFALSE 742 fs/reiserfs/ibalance.c RFALSE(tb->rnum[h] == 0 || tb->lnum[h] + tb->rnum[h] != n + 1, RFALSE 762 fs/reiserfs/ibalance.c RFALSE(tb->L[h] == NULL || tb->CFL[h] == NULL, RFALSE 777 fs/reiserfs/ibalance.c RFALSE(tb->R[h] == NULL || tb->CFR[h] == NULL, RFALSE 780 fs/reiserfs/ibalance.c RFALSE(B_NR_ITEMS(tb->R[h]) == 0, RFALSE 825 fs/reiserfs/ibalance.c RFALSE(h < 1, "h (%d) can not be < 1 on internal level", h); RFALSE 840 fs/reiserfs/ibalance.c RFALSE(insert_num < -2 || insert_num > 2, RFALSE 843 fs/reiserfs/ibalance.c RFALSE(h > 1 && (insert_num > 1 || insert_num < -1), RFALSE 990 fs/reiserfs/ibalance.c RFALSE(tb->blknum[h] > 2, "blknum can not be > 2 for internal level"); RFALSE 991 fs/reiserfs/ibalance.c RFALSE(tb->blknum[h] < 0, "blknum can not be < 0"); RFALSE 994 fs/reiserfs/ibalance.c RFALSE(!tbSh, "S[h] is equal NULL"); RFALSE 1136 fs/reiserfs/ibalance.c RFALSE(!buffer_journaled(S_new) || buffer_journal_dirty(S_new) RFALSE 1022 fs/reiserfs/inode.c RFALSE(pos_in_item != ih_item_len(ih) / UNFM_P_SIZE, RFALSE 1036 fs/reiserfs/inode.c RFALSE(cpu_key_k_offset(&tmp_key) > cpu_key_k_offset(&key), RFALSE 446 fs/reiserfs/item_ops.c RFALSE(mode != M_PASTE || virtual_entry_num == 0, RFALSE 33 fs/reiserfs/lbalance.c RFALSE(!is_direntry_le_ih(ih), "vs-10000: item must be directory item"); RFALSE 161 fs/reiserfs/lbalance.c RFALSE(!ih_item_len(ih), RFALSE 204 fs/reiserfs/lbalance.c RFALSE(get_ih_free_space(dih), RFALSE 249 fs/reiserfs/lbalance.c RFALSE(is_indirect_le_ih(ih) && get_ih_free_space(ih), RFALSE 257 fs/reiserfs/lbalance.c RFALSE(le_ih_k_offset(dih) != RFALSE 269 fs/reiserfs/lbalance.c RFALSE(ih_item_len(ih) <= bytes_or_entries, RFALSE 276 fs/reiserfs/lbalance.c RFALSE(le_ih_k_offset(dih) <= RFALSE 284 fs/reiserfs/lbalance.c RFALSE(le_ih_k_offset(dih) <= RFALSE 322 fs/reiserfs/lbalance.c RFALSE(last_first != LAST_TO_FIRST && last_first != FIRST_TO_LAST, RFALSE 324 fs/reiserfs/lbalance.c RFALSE(B_NR_ITEMS(src) - first < cpy_num, RFALSE 327 fs/reiserfs/lbalance.c RFALSE(cpy_num < 0, "vs-10110: can not copy negative amount of items"); RFALSE 328 fs/reiserfs/lbalance.c RFALSE(!dest_bi, "vs-10120: can not copy negative amount of items"); RFALSE 332 fs/reiserfs/lbalance.c RFALSE(!dest, "vs-10130: can not copy negative amount of items"); RFALSE 350 fs/reiserfs/lbalance.c RFALSE(blkh_free_space(blkh) < cpy_num * IH_SIZE, RFALSE 375 fs/reiserfs/lbalance.c RFALSE(free_space < j - last_inserted_loc, RFALSE 397 fs/reiserfs/lbalance.c RFALSE(dc_block_number(t_dc) != dest->b_blocknr, RFALSE 421 fs/reiserfs/lbalance.c RFALSE(cpy_bytes == -1, RFALSE 445 fs/reiserfs/lbalance.c RFALSE(cpy_bytes == ih_item_len(ih) RFALSE 452 fs/reiserfs/lbalance.c RFALSE(op_is_left_mergeable(&ih->ih_key, src->b_size), RFALSE 491 fs/reiserfs/lbalance.c RFALSE(!cpy_bytes && get_ih_free_space(ih), RFALSE 528 fs/reiserfs/lbalance.c RFALSE(!dest || !src, "vs-10210: !dest || !src"); RFALSE 529 fs/reiserfs/lbalance.c RFALSE(last_first != FIRST_TO_LAST && last_first != LAST_TO_FIRST, RFALSE 531 fs/reiserfs/lbalance.c RFALSE(B_NR_ITEMS(src) < cpy_num, RFALSE 534 fs/reiserfs/lbalance.c RFALSE(cpy_num < 0, "vs-10240: cpy_num < 0 (%d)", cpy_num); RFALSE 706 fs/reiserfs/lbalance.c RFALSE(!src_bi->bi_bh || !dest_bi->bi_bh, RFALSE 756 fs/reiserfs/lbalance.c RFALSE(shift_bytes != -1, RFALSE 776 fs/reiserfs/lbalance.c RFALSE((shift_bytes != -1 && RFALSE 833 fs/reiserfs/lbalance.c RFALSE(!bh, "10155: bh is not defined"); RFALSE 834 fs/reiserfs/lbalance.c RFALSE(del_num < 0, "10160: del_num can not be < 0. del_num==%d", RFALSE 836 fs/reiserfs/lbalance.c RFALSE(first < 0 RFALSE 919 fs/reiserfs/lbalance.c RFALSE(free_space < ih_item_len(inserted_item_ih) + IH_SIZE, RFALSE 922 fs/reiserfs/lbalance.c RFALSE(zeros_number > ih_item_len(inserted_item_ih), RFALSE 994 fs/reiserfs/lbalance.c RFALSE(free_space < paste_size, RFALSE 1086 fs/reiserfs/lbalance.c RFALSE(!is_direntry_le_ih(ih), "10180: item is not directory item"); RFALSE 1087 fs/reiserfs/lbalance.c RFALSE(ih_entry_count(ih) < from + del_count, RFALSE 1166 fs/reiserfs/lbalance.c RFALSE(cut_item_num, RFALSE 1174 fs/reiserfs/lbalance.c RFALSE(is_statdata_le_ih(ih), "10195: item is stat data"); RFALSE 1175 fs/reiserfs/lbalance.c RFALSE(pos_in_item && pos_in_item + cut_size != ih_item_len(ih), RFALSE 1196 fs/reiserfs/lbalance.c RFALSE(ih_item_len(ih) == cut_size RFALSE 1250 fs/reiserfs/lbalance.c RFALSE(bh == NULL, "10210: buffer is 0"); RFALSE 1251 fs/reiserfs/lbalance.c RFALSE(del_num < 0, "10215: del_num less than 0 (%d)", del_num); RFALSE 1259 fs/reiserfs/lbalance.c RFALSE(first < 0 || first + del_num > nr, RFALSE 1337 fs/reiserfs/lbalance.c RFALSE(!is_direntry_le_ih(ih), "10225: item is not directory item"); RFALSE 1338 fs/reiserfs/lbalance.c RFALSE(ih_entry_count(ih) < before, RFALSE 242 fs/reiserfs/namei.c RFALSE(de->de_deh != B_I_DEH(de->de_bh, de->de_ih), RFALSE 294 fs/reiserfs/namei.c RFALSE(de->de_item_num, RFALSE 1556 fs/reiserfs/namei.c RFALSE(S_ISDIR(old_inode_mode) && RFALSE 135 fs/reiserfs/objectid.c RFALSE(sb_oid_cursize(rs) < 2 || RFALSE 23 fs/reiserfs/stree.c RFALSE(B_LEVEL(bh) > MAX_HEIGHT, RFALSE 221 fs/reiserfs/stree.c RFALSE(path_offset < FIRST_PATH_ELEMENT_OFFSET, RFALSE 227 fs/reiserfs/stree.c RFALSE(!buffer_uptodate RFALSE 268 fs/reiserfs/stree.c RFALSE(path_offset < FIRST_PATH_ELEMENT_OFFSET, RFALSE 273 fs/reiserfs/stree.c RFALSE(!buffer_uptodate RFALSE 330 fs/reiserfs/stree.c RFALSE(!key || chk_path->path_length < FIRST_PATH_ELEMENT_OFFSET RFALSE 334 fs/reiserfs/stree.c RFALSE(!PATH_PLAST_BUFFER(chk_path)->b_bdev, RFALSE 349 fs/reiserfs/stree.c RFALSE(p->path_length != ILLEGAL_PATH_ELEMENT_OFFSET, RFALSE 364 fs/reiserfs/stree.c RFALSE(path_offset < ILLEGAL_PATH_ELEMENT_OFFSET, RFALSE 381 fs/reiserfs/stree.c RFALSE(path_offset < ILLEGAL_PATH_ELEMENT_OFFSET, RFALSE 711 fs/reiserfs/stree.c RFALSE(comp_keys(&MAX_KEY, key) && RFALSE 739 fs/reiserfs/stree.c RFALSE(node_level < stop_level, RFALSE 852 fs/reiserfs/stree.c RFALSE(!ih_item_len RFALSE 862 fs/reiserfs/stree.c RFALSE(!PATH_LAST_POSITION(search_path), RFALSE 977 fs/reiserfs/stree.c RFALSE(ih_entry_count(le_ih) != 2, RFALSE 1037 fs/reiserfs/stree.c RFALSE(new_file_length != max_reiserfs_offset(inode), RFALSE 1264 fs/reiserfs/stree.c RFALSE(mode != M_DELETE, "PAP-5320: mode must be M_DELETE"); RFALSE 1595 fs/reiserfs/stree.c RFALSE(path->pos_in_item != RFALSE 1603 fs/reiserfs/stree.c RFALSE(removed <= 0 RFALSE 1669 fs/reiserfs/stree.c RFALSE(ret_value != CARRY_ON, RFALSE 1756 fs/reiserfs/stree.c RFALSE(mode == M_PASTE || mode == M_INSERT, "invalid mode"); RFALSE 1961 fs/reiserfs/stree.c RFALSE(deleted > file_size, RFALSE 2005 fs/reiserfs/stree.c RFALSE(file_size > ROUND_UP(new_file_size), RFALSE 441 fs/reiserfs/super.c RFALSE(truncate && RFALSE 445 fs/reiserfs/super.c RFALSE(!truncate && RFALSE 120 fs/reiserfs/tail_conversion.c RFALSE(!is_direct_le_ih(p_le_ih),