2 * Copyright 2000 by Hans Reiser, licensing governed by reiserfs/README
4 * Trivial changes by Alan Cox to remove EHASHCOLLISION for compatibility
7 * Rights granted to Hans Reiser to redistribute under other terms providing
8 * he accepts all liability including but not limited to patent, fitness
9 * for purpose, and direct or indirect claims arising from failure to perform.
14 #include <linux/time.h>
15 #include <linux/bitops.h>
16 #include <linux/slab.h>
20 #include <linux/quotaops.h>
22 #define INC_DIR_INODE_NLINK(i) if (i->i_nlink != 1) { inc_nlink(i); if (i->i_nlink >= REISERFS_LINK_MAX) set_nlink(i, 1); }
23 #define DEC_DIR_INODE_NLINK(i) if (i->i_nlink != 1) drop_nlink(i);
26 * directory item contains array of entry headers. This performs
27 * binary search through that array
29 static int bin_search_in_dir_item(struct reiserfs_dir_entry *de, loff_t off)
31 struct item_head *ih = de->de_ih;
32 struct reiserfs_de_head *deh = de->de_deh;
33 int rbound, lbound, j;
36 rbound = ih_entry_count(ih) - 1;
38 for (j = (rbound + lbound) / 2; lbound <= rbound;
39 j = (rbound + lbound) / 2) {
40 if (off < deh_offset(deh + j)) {
44 if (off > deh_offset(deh + j)) {
48 /* this is not name found, but matched third key component */
53 de->de_entry_num = lbound;
54 return NAME_NOT_FOUND;
58 * comment? maybe something like set de to point to what the path points to?
60 static inline void set_de_item_location(struct reiserfs_dir_entry *de,
61 struct treepath *path)
63 de->de_bh = get_last_bh(path);
64 de->de_ih = tp_item_head(path);
65 de->de_deh = B_I_DEH(de->de_bh, de->de_ih);
66 de->de_item_num = PATH_LAST_POSITION(path);
70 * de_bh, de_ih, de_deh (points to first element of array), de_item_num is set
72 inline void set_de_name_and_namelen(struct reiserfs_dir_entry *de)
74 struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num;
76 BUG_ON(de->de_entry_num >= ih_entry_count(de->de_ih));
78 de->de_entrylen = entry_length(de->de_bh, de->de_ih, de->de_entry_num);
79 de->de_namelen = de->de_entrylen - (de_with_sd(deh) ? SD_SIZE : 0);
80 de->de_name = ih_item_body(de->de_bh, de->de_ih) + deh_location(deh);
81 if (de->de_name[de->de_namelen - 1] == 0)
82 de->de_namelen = strlen(de->de_name);
85 /* what entry points to */
86 static inline void set_de_object_key(struct reiserfs_dir_entry *de)
88 BUG_ON(de->de_entry_num >= ih_entry_count(de->de_ih));
89 de->de_dir_id = deh_dir_id(&de->de_deh[de->de_entry_num]);
90 de->de_objectid = deh_objectid(&de->de_deh[de->de_entry_num]);
93 static inline void store_de_entry_key(struct reiserfs_dir_entry *de)
95 struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num;
97 BUG_ON(de->de_entry_num >= ih_entry_count(de->de_ih));
99 /* store key of the found entry */
100 de->de_entry_key.version = KEY_FORMAT_3_5;
101 de->de_entry_key.on_disk_key.k_dir_id =
102 le32_to_cpu(de->de_ih->ih_key.k_dir_id);
103 de->de_entry_key.on_disk_key.k_objectid =
104 le32_to_cpu(de->de_ih->ih_key.k_objectid);
105 set_cpu_key_k_offset(&de->de_entry_key, deh_offset(deh));
106 set_cpu_key_k_type(&de->de_entry_key, TYPE_DIRENTRY);
110 * We assign a key to each directory item, and place multiple entries in a
111 * single directory item. A directory item has a key equal to the key of
112 * the first directory entry in it.
114 * This function first calls search_by_key, then, if item whose first entry
115 * matches is not found it looks for the entry inside directory item found
116 * by search_by_key. Fills the path to the entry, and to the entry position
119 /* The function is NOT SCHEDULE-SAFE! */
120 int search_by_entry_key(struct super_block *sb, const struct cpu_key *key,
121 struct treepath *path, struct reiserfs_dir_entry *de)
125 retval = search_item(sb, key, path);
128 if (!PATH_LAST_POSITION(path)) {
129 reiserfs_error(sb, "vs-7000", "search_by_key "
130 "returned item position == 0");
134 PATH_LAST_POSITION(path)--;
144 reiserfs_error(sb, "vs-7002", "no path to here");
148 set_de_item_location(de, path);
150 #ifdef CONFIG_REISERFS_CHECK
151 if (!is_direntry_le_ih(de->de_ih) ||
152 COMP_SHORT_KEYS(&de->de_ih->ih_key, key)) {
153 print_block(de->de_bh, 0, -1, -1);
154 reiserfs_panic(sb, "vs-7005", "found item %h is not directory "
155 "item or does not belong to the same directory "
156 "as key %K", de->de_ih, key);
158 #endif /* CONFIG_REISERFS_CHECK */
161 * binary search in directory item by third component of the
162 * key. sets de->de_entry_num of de
164 retval = bin_search_in_dir_item(de, cpu_key_k_offset(key));
165 path->pos_in_item = de->de_entry_num;
166 if (retval != NAME_NOT_FOUND) {
168 * ugly, but rename needs de_bh, de_deh, de_name,
169 * de_namelen, de_objectid set
171 set_de_name_and_namelen(de);
172 set_de_object_key(de);
177 /* Keyed 32-bit hash function using TEA in a Davis-Meyer function */
180 * The third component is hashed, and you can choose from more than
181 * one hash function. Per directory hashes are not yet implemented
182 * but are thought about. This function should be moved to hashes.c
183 * Jedi, please do so. -Hans
185 static __u32 get_third_component(struct super_block *s,
186 const char *name, int len)
190 if (!len || (len == 1 && name[0] == '.'))
192 if (len == 2 && name[0] == '.' && name[1] == '.')
193 return DOT_DOT_OFFSET;
195 res = REISERFS_SB(s)->s_hash_function(name, len);
197 /* take bits from 7-th to 30-th including both bounds */
198 res = GET_HASH_VALUE(res);
201 * needed to have no names before "." and ".." those have hash
202 * value == 0 and generation conters 1 and 2 accordingly
205 return res + MAX_GENERATION_NUMBER;
208 static int reiserfs_match(struct reiserfs_dir_entry *de,
209 const char *name, int namelen)
211 int retval = NAME_NOT_FOUND;
213 if ((namelen == de->de_namelen) &&
214 !memcmp(de->de_name, name, de->de_namelen))
216 (de_visible(de->de_deh + de->de_entry_num) ? NAME_FOUND :
217 NAME_FOUND_INVISIBLE);
222 /* de's de_bh, de_ih, de_deh, de_item_num, de_entry_num are set already */
224 /* used when hash collisions exist */
226 static int linear_search_in_dir_item(struct cpu_key *key,
227 struct reiserfs_dir_entry *de,
228 const char *name, int namelen)
230 struct reiserfs_de_head *deh = de->de_deh;
234 i = de->de_entry_num;
236 if (i == ih_entry_count(de->de_ih) ||
237 GET_HASH_VALUE(deh_offset(deh + i)) !=
238 GET_HASH_VALUE(cpu_key_k_offset(key))) {
242 RFALSE(de->de_deh != B_I_DEH(de->de_bh, de->de_ih),
243 "vs-7010: array of entry headers not found");
247 for (; i >= 0; i--, deh--) {
248 /* hash value does not match, no need to check whole name */
249 if (GET_HASH_VALUE(deh_offset(deh)) !=
250 GET_HASH_VALUE(cpu_key_k_offset(key))) {
251 return NAME_NOT_FOUND;
254 /* mark that this generation number is used */
255 if (de->de_gen_number_bit_string)
256 set_bit(GET_GENERATION_NUMBER(deh_offset(deh)),
257 de->de_gen_number_bit_string);
259 /* calculate pointer to name and namelen */
260 de->de_entry_num = i;
261 set_de_name_and_namelen(de);
264 * de's de_name, de_namelen, de_recordlen are set.
268 reiserfs_match(de, name, namelen)) != NAME_NOT_FOUND) {
270 /* key of pointed object */
271 set_de_object_key(de);
273 store_de_entry_key(de);
275 /* retval can be NAME_FOUND or NAME_FOUND_INVISIBLE */
280 if (GET_GENERATION_NUMBER(le_ih_k_offset(de->de_ih)) == 0)
282 * we have reached left most entry in the node. In common we
283 * have to go to the left neighbor, but if generation counter
284 * is 0 already, we know for sure, that there is no name with
285 * the same hash value
288 * FIXME: this work correctly only because hash value can not
289 * be 0. Btw, in case of Yura's hash it is probably possible,
292 return NAME_NOT_FOUND;
294 RFALSE(de->de_item_num,
295 "vs-7015: two diritems of the same directory in one node?");
297 return GOTO_PREVIOUS_ITEM;
301 * may return NAME_FOUND, NAME_FOUND_INVISIBLE, NAME_NOT_FOUND
302 * FIXME: should add something like IOERROR
304 static int reiserfs_find_entry(struct inode *dir, const char *name, int namelen,
305 struct treepath *path_to_entry,
306 struct reiserfs_dir_entry *de)
308 struct cpu_key key_to_search;
311 if (namelen > REISERFS_MAX_NAME(dir->i_sb->s_blocksize))
312 return NAME_NOT_FOUND;
314 /* we will search for this key in the tree */
315 make_cpu_key(&key_to_search, dir,
316 get_third_component(dir->i_sb, name, namelen),
321 search_by_entry_key(dir->i_sb, &key_to_search,
323 if (retval == IO_ERROR) {
324 reiserfs_error(dir->i_sb, "zam-7001", "io error");
328 /* compare names for all entries having given hash value */
330 linear_search_in_dir_item(&key_to_search, de, name,
333 * there is no need to scan directory anymore.
334 * Given entry found or does not exist
336 if (retval != GOTO_PREVIOUS_ITEM) {
337 path_to_entry->pos_in_item = de->de_entry_num;
342 * there is left neighboring item of this directory
343 * and given entry can be there
345 set_cpu_key_k_offset(&key_to_search,
346 le_ih_k_offset(de->de_ih) - 1);
347 pathrelse(path_to_entry);
352 static struct dentry *reiserfs_lookup(struct inode *dir, struct dentry *dentry,
356 struct inode *inode = NULL;
357 struct reiserfs_dir_entry de;
358 INITIALIZE_PATH(path_to_entry);
360 if (REISERFS_MAX_NAME(dir->i_sb->s_blocksize) < dentry->d_name.len)
361 return ERR_PTR(-ENAMETOOLONG);
363 reiserfs_write_lock(dir->i_sb);
365 de.de_gen_number_bit_string = NULL;
367 reiserfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len,
368 &path_to_entry, &de);
369 pathrelse(&path_to_entry);
370 if (retval == NAME_FOUND) {
371 inode = reiserfs_iget(dir->i_sb,
372 (struct cpu_key *)&de.de_dir_id);
373 if (!inode || IS_ERR(inode)) {
374 reiserfs_write_unlock(dir->i_sb);
375 return ERR_PTR(-EACCES);
379 * Propagate the private flag so we know we're
383 inode->i_flags |= S_PRIVATE;
385 reiserfs_write_unlock(dir->i_sb);
386 if (retval == IO_ERROR) {
387 return ERR_PTR(-EIO);
390 return d_splice_alias(inode, dentry);
394 * looks up the dentry of the parent directory for child.
395 * taken from ext2_get_parent
397 struct dentry *reiserfs_get_parent(struct dentry *child)
400 struct inode *inode = NULL;
401 struct reiserfs_dir_entry de;
402 INITIALIZE_PATH(path_to_entry);
403 struct inode *dir = child->d_inode;
405 if (dir->i_nlink == 0) {
406 return ERR_PTR(-ENOENT);
408 de.de_gen_number_bit_string = NULL;
410 reiserfs_write_lock(dir->i_sb);
411 retval = reiserfs_find_entry(dir, "..", 2, &path_to_entry, &de);
412 pathrelse(&path_to_entry);
413 if (retval != NAME_FOUND) {
414 reiserfs_write_unlock(dir->i_sb);
415 return ERR_PTR(-ENOENT);
417 inode = reiserfs_iget(dir->i_sb, (struct cpu_key *)&de.de_dir_id);
418 reiserfs_write_unlock(dir->i_sb);
420 return d_obtain_alias(inode);
423 /* add entry to the directory (entry can be hidden).
425 insert definition of when hidden directories are used here -Hans
427 Does not mark dir inode dirty, do it after successesfull call to it */
429 static int reiserfs_add_entry(struct reiserfs_transaction_handle *th,
430 struct inode *dir, const char *name, int namelen,
431 struct inode *inode, int visible)
433 struct cpu_key entry_key;
434 struct reiserfs_de_head *deh;
435 INITIALIZE_PATH(path);
436 struct reiserfs_dir_entry de;
437 DECLARE_BITMAP(bit_string, MAX_GENERATION_NUMBER + 1);
441 * 48 bytes now and we avoid kmalloc if we
442 * create file with short name
444 char small_buf[32 + DEH_SIZE];
447 int buflen, paste_size;
450 BUG_ON(!th->t_trans_id);
452 /* cannot allow items to be added into a busy deleted directory */
456 if (namelen > REISERFS_MAX_NAME(dir->i_sb->s_blocksize))
457 return -ENAMETOOLONG;
459 /* each entry has unique key. compose it */
460 make_cpu_key(&entry_key, dir,
461 get_third_component(dir->i_sb, name, namelen),
464 /* get memory for composing the entry */
465 buflen = DEH_SIZE + ROUND_UP(namelen);
466 if (buflen > sizeof(small_buf)) {
467 buffer = kmalloc(buflen, GFP_NOFS);
474 (get_inode_sd_version(dir) ==
475 STAT_DATA_V1) ? (DEH_SIZE + namelen) : buflen;
478 * fill buffer : directory entry head, name[, dir objectid | ,
479 * stat data | ,stat data, dir objectid ]
481 deh = (struct reiserfs_de_head *)buffer;
482 deh->deh_location = 0; /* JDM Endian safe if 0 */
483 put_deh_offset(deh, cpu_key_k_offset(&entry_key));
484 deh->deh_state = 0; /* JDM Endian safe if 0 */
485 /* put key (ino analog) to de */
487 /* safe: k_dir_id is le */
488 deh->deh_dir_id = INODE_PKEY(inode)->k_dir_id;
489 /* safe: k_objectid is le */
490 deh->deh_objectid = INODE_PKEY(inode)->k_objectid;
493 memcpy((char *)(deh + 1), name, namelen);
494 /* padd by 0s to the 4 byte boundary */
495 padd_item((char *)(deh + 1), ROUND_UP(namelen), namelen);
498 * entry is ready to be pasted into tree, set 'visibility'
499 * and 'stat data in entry' attributes
501 mark_de_without_sd(deh);
502 visible ? mark_de_visible(deh) : mark_de_hidden(deh);
504 /* find the proper place for the new entry */
505 memset(bit_string, 0, sizeof(bit_string));
506 de.de_gen_number_bit_string = bit_string;
507 retval = reiserfs_find_entry(dir, name, namelen, &path, &de);
508 if (retval != NAME_NOT_FOUND) {
509 if (buffer != small_buf)
513 if (retval == IO_ERROR) {
517 if (retval != NAME_FOUND) {
518 reiserfs_error(dir->i_sb, "zam-7002",
519 "reiserfs_find_entry() returned "
520 "unexpected value (%d)", retval);
527 find_first_zero_bit(bit_string,
528 MAX_GENERATION_NUMBER + 1);
529 if (gen_number > MAX_GENERATION_NUMBER) {
530 /* there is no free generation number */
531 reiserfs_warning(dir->i_sb, "reiserfs-7010",
532 "Congratulations! we have got hash function "
534 if (buffer != small_buf)
539 /* adjust offset of directory enrty */
540 put_deh_offset(deh, SET_GENERATION_NUMBER(deh_offset(deh), gen_number));
541 set_cpu_key_k_offset(&entry_key, deh_offset(deh));
543 /* update max-hash-collisions counter in reiserfs_sb_info */
544 PROC_INFO_MAX(th->t_super, max_hash_collisions, gen_number);
546 /* we need to re-search for the insertion point */
547 if (gen_number != 0) {
548 if (search_by_entry_key(dir->i_sb, &entry_key, &path, &de) !=
550 reiserfs_warning(dir->i_sb, "vs-7032",
551 "entry with this key (%K) already "
552 "exists", &entry_key);
554 if (buffer != small_buf)
561 /* perform the insertion of the entry that we have prepared */
563 reiserfs_paste_into_item(th, &path, &entry_key, dir, buffer,
565 if (buffer != small_buf)
568 reiserfs_check_path(&path);
572 dir->i_size += paste_size;
573 dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
574 if (!S_ISDIR(inode->i_mode) && visible)
575 /* reiserfs_mkdir or reiserfs_rename will do that by itself */
576 reiserfs_update_sd(th, dir);
578 reiserfs_check_path(&path);
583 * quota utility function, call if you've had to abort after calling
584 * new_inode_init, and have not called reiserfs_new_inode yet.
585 * This should only be called on inodes that do not have stat data
586 * inserted into the tree yet.
588 static int drop_new_inode(struct inode *inode)
591 make_bad_inode(inode);
592 inode->i_flags |= S_NOQUOTA;
598 * utility function that does setup for reiserfs_new_inode.
599 * dquot_initialize needs lots of credits so it's better to have it
600 * outside of a transaction, so we had to pull some bits of
601 * reiserfs_new_inode out into this func.
603 static int new_inode_init(struct inode *inode, struct inode *dir, umode_t mode)
606 * Make inode invalid - just in case we are going to drop it before
607 * the initialization happens
609 INODE_PKEY(inode)->k_objectid = 0;
612 * the quota init calls have to know who to charge the quota to, so
613 * we have to set uid and gid here
615 inode_init_owner(inode, dir, mode);
616 dquot_initialize(inode);
620 static int reiserfs_create(struct inode *dir, struct dentry *dentry, umode_t mode,
626 * We need blocks for transaction + (user+group)*(quotas
627 * for new inode + update of quota for directory owner)
630 JOURNAL_PER_BALANCE_CNT * 2 +
631 2 * (REISERFS_QUOTA_INIT_BLOCKS(dir->i_sb) +
632 REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb));
633 struct reiserfs_transaction_handle th;
634 struct reiserfs_security_handle security;
636 dquot_initialize(dir);
638 if (!(inode = new_inode(dir->i_sb))) {
641 new_inode_init(inode, dir, mode);
643 jbegin_count += reiserfs_cache_default_acl(dir);
644 retval = reiserfs_security_init(dir, inode, &dentry->d_name, &security);
646 drop_new_inode(inode);
649 jbegin_count += retval;
650 reiserfs_write_lock(dir->i_sb);
652 retval = journal_begin(&th, dir->i_sb, jbegin_count);
654 drop_new_inode(inode);
659 reiserfs_new_inode(&th, dir, mode, NULL, 0 /*i_size */ , dentry,
664 inode->i_op = &reiserfs_file_inode_operations;
665 inode->i_fop = &reiserfs_file_operations;
666 inode->i_mapping->a_ops = &reiserfs_address_space_operations;
669 reiserfs_add_entry(&th, dir, dentry->d_name.name,
670 dentry->d_name.len, inode, 1 /*visible */ );
674 reiserfs_update_sd(&th, inode);
675 err = journal_end(&th);
678 unlock_new_inode(inode);
682 reiserfs_update_inode_transaction(inode);
683 reiserfs_update_inode_transaction(dir);
685 d_instantiate_new(dentry, inode);
686 retval = journal_end(&th);
689 reiserfs_write_unlock(dir->i_sb);
693 static int reiserfs_mknod(struct inode *dir, struct dentry *dentry, umode_t mode,
698 struct reiserfs_transaction_handle th;
699 struct reiserfs_security_handle security;
701 * We need blocks for transaction + (user+group)*(quotas
702 * for new inode + update of quota for directory owner)
705 JOURNAL_PER_BALANCE_CNT * 3 +
706 2 * (REISERFS_QUOTA_INIT_BLOCKS(dir->i_sb) +
707 REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb));
709 if (!new_valid_dev(rdev))
712 dquot_initialize(dir);
714 if (!(inode = new_inode(dir->i_sb))) {
717 new_inode_init(inode, dir, mode);
719 jbegin_count += reiserfs_cache_default_acl(dir);
720 retval = reiserfs_security_init(dir, inode, &dentry->d_name, &security);
722 drop_new_inode(inode);
725 jbegin_count += retval;
726 reiserfs_write_lock(dir->i_sb);
728 retval = journal_begin(&th, dir->i_sb, jbegin_count);
730 drop_new_inode(inode);
735 reiserfs_new_inode(&th, dir, mode, NULL, 0 /*i_size */ , dentry,
741 inode->i_op = &reiserfs_special_inode_operations;
742 init_special_inode(inode, inode->i_mode, rdev);
744 /* FIXME: needed for block and char devices only */
745 reiserfs_update_sd(&th, inode);
747 reiserfs_update_inode_transaction(inode);
748 reiserfs_update_inode_transaction(dir);
751 reiserfs_add_entry(&th, dir, dentry->d_name.name,
752 dentry->d_name.len, inode, 1 /*visible */ );
756 reiserfs_update_sd(&th, inode);
757 err = journal_end(&th);
760 unlock_new_inode(inode);
765 d_instantiate_new(dentry, inode);
766 retval = journal_end(&th);
769 reiserfs_write_unlock(dir->i_sb);
773 static int reiserfs_mkdir(struct inode *dir, struct dentry *dentry, umode_t mode)
777 struct reiserfs_transaction_handle th;
778 struct reiserfs_security_handle security;
780 * We need blocks for transaction + (user+group)*(quotas
781 * for new inode + update of quota for directory owner)
784 JOURNAL_PER_BALANCE_CNT * 3 +
785 2 * (REISERFS_QUOTA_INIT_BLOCKS(dir->i_sb) +
786 REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb));
788 dquot_initialize(dir);
790 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
792 * set flag that new packing locality created and new blocks
793 * for the content of that directory are not displaced yet
795 REISERFS_I(dir)->new_packing_locality = 1;
797 mode = S_IFDIR | mode;
798 if (!(inode = new_inode(dir->i_sb))) {
801 new_inode_init(inode, dir, mode);
803 jbegin_count += reiserfs_cache_default_acl(dir);
804 retval = reiserfs_security_init(dir, inode, &dentry->d_name, &security);
806 drop_new_inode(inode);
809 jbegin_count += retval;
810 reiserfs_write_lock(dir->i_sb);
812 retval = journal_begin(&th, dir->i_sb, jbegin_count);
814 drop_new_inode(inode);
819 * inc the link count now, so another writer doesn't overflow
820 * it while we sleep later on.
822 INC_DIR_INODE_NLINK(dir)
824 retval = reiserfs_new_inode(&th, dir, mode, NULL /*symlink */ ,
825 old_format_only(dir->i_sb) ?
826 EMPTY_DIR_SIZE_V1 : EMPTY_DIR_SIZE,
827 dentry, inode, &security);
829 DEC_DIR_INODE_NLINK(dir)
833 reiserfs_update_inode_transaction(inode);
834 reiserfs_update_inode_transaction(dir);
836 inode->i_op = &reiserfs_dir_inode_operations;
837 inode->i_fop = &reiserfs_dir_operations;
839 /* note, _this_ add_entry will not update dir's stat data */
841 reiserfs_add_entry(&th, dir, dentry->d_name.name,
842 dentry->d_name.len, inode, 1 /*visible */ );
846 DEC_DIR_INODE_NLINK(dir);
847 reiserfs_update_sd(&th, inode);
848 err = journal_end(&th);
851 unlock_new_inode(inode);
855 /* the above add_entry did not update dir's stat data */
856 reiserfs_update_sd(&th, dir);
858 d_instantiate_new(dentry, inode);
859 retval = journal_end(&th);
861 reiserfs_write_unlock(dir->i_sb);
865 static inline int reiserfs_empty_dir(struct inode *inode)
868 * we can cheat because an old format dir cannot have
869 * EMPTY_DIR_SIZE, and a new format dir cannot have
870 * EMPTY_DIR_SIZE_V1. So, if the inode is either size,
871 * regardless of disk format version, the directory is empty.
873 if (inode->i_size != EMPTY_DIR_SIZE &&
874 inode->i_size != EMPTY_DIR_SIZE_V1) {
880 static int reiserfs_rmdir(struct inode *dir, struct dentry *dentry)
884 struct reiserfs_transaction_handle th;
886 INITIALIZE_PATH(path);
887 struct reiserfs_dir_entry de;
890 * we will be doing 2 balancings and update 2 stat data, we
891 * change quotas of the owner of the directory and of the owner
892 * of the parent directory. The quota structure is possibly
893 * deleted only on last iput => outside of this transaction
896 JOURNAL_PER_BALANCE_CNT * 2 + 2 +
897 4 * REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb);
899 dquot_initialize(dir);
901 reiserfs_write_lock(dir->i_sb);
902 retval = journal_begin(&th, dir->i_sb, jbegin_count);
906 de.de_gen_number_bit_string = NULL;
908 reiserfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len,
909 &path, &de)) == NAME_NOT_FOUND) {
912 } else if (retval == IO_ERROR) {
917 inode = dentry->d_inode;
919 reiserfs_update_inode_transaction(inode);
920 reiserfs_update_inode_transaction(dir);
922 if (de.de_objectid != inode->i_ino) {
924 * FIXME: compare key of an object and a key found in the entry
929 if (!reiserfs_empty_dir(inode)) {
934 /* cut entry from dir directory */
935 retval = reiserfs_cut_from_item(&th, &path, &de.de_entry_key,
936 dir, NULL, /* page */
937 0 /*new file size - not used here */ );
941 if (inode->i_nlink != 2 && inode->i_nlink != 1)
942 reiserfs_error(inode->i_sb, "reiserfs-7040",
943 "empty directory has nlink != 2 (%d)",
947 inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
948 reiserfs_update_sd(&th, inode);
950 DEC_DIR_INODE_NLINK(dir)
951 dir->i_size -= (DEH_SIZE + de.de_entrylen);
952 reiserfs_update_sd(&th, dir);
954 /* prevent empty directory from getting lost */
955 add_save_link(&th, inode, 0 /* not truncate */ );
957 retval = journal_end(&th);
958 reiserfs_check_path(&path);
960 reiserfs_write_unlock(dir->i_sb);
965 * we must release path, because we did not call
966 * reiserfs_cut_from_item, or reiserfs_cut_from_item does not
967 * release path if operation was not complete
970 err = journal_end(&th);
971 reiserfs_write_unlock(dir->i_sb);
972 return err ? err : retval;
975 static int reiserfs_unlink(struct inode *dir, struct dentry *dentry)
979 struct reiserfs_dir_entry de;
980 INITIALIZE_PATH(path);
981 struct reiserfs_transaction_handle th;
983 unsigned long savelink;
985 dquot_initialize(dir);
987 inode = dentry->d_inode;
990 * in this transaction we can be doing at max two balancings and
991 * update two stat datas, we change quotas of the owner of the
992 * directory and of the owner of the parent directory. The quota
993 * structure is possibly deleted only on iput => outside of
997 JOURNAL_PER_BALANCE_CNT * 2 + 2 +
998 4 * REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb);
1000 reiserfs_write_lock(dir->i_sb);
1001 retval = journal_begin(&th, dir->i_sb, jbegin_count);
1005 de.de_gen_number_bit_string = NULL;
1007 reiserfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len,
1008 &path, &de)) == NAME_NOT_FOUND) {
1011 } else if (retval == IO_ERROR) {
1016 reiserfs_update_inode_transaction(inode);
1017 reiserfs_update_inode_transaction(dir);
1019 if (de.de_objectid != inode->i_ino) {
1021 * FIXME: compare key of an object and a key found in the entry
1027 if (!inode->i_nlink) {
1028 reiserfs_warning(inode->i_sb, "reiserfs-7042",
1029 "deleting nonexistent file (%lu), %d",
1030 inode->i_ino, inode->i_nlink);
1031 set_nlink(inode, 1);
1037 * we schedule before doing the add_save_link call, save the link
1038 * count so we don't race
1040 savelink = inode->i_nlink;
1043 reiserfs_cut_from_item(&th, &path, &de.de_entry_key, dir, NULL,
1049 inode->i_ctime = CURRENT_TIME_SEC;
1050 reiserfs_update_sd(&th, inode);
1052 dir->i_size -= (de.de_entrylen + DEH_SIZE);
1053 dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
1054 reiserfs_update_sd(&th, dir);
1057 /* prevent file from getting lost */
1058 add_save_link(&th, inode, 0 /* not truncate */ );
1060 retval = journal_end(&th);
1061 reiserfs_check_path(&path);
1062 reiserfs_write_unlock(dir->i_sb);
1067 err = journal_end(&th);
1068 reiserfs_check_path(&path);
1072 reiserfs_write_unlock(dir->i_sb);
1076 static int reiserfs_symlink(struct inode *parent_dir,
1077 struct dentry *dentry, const char *symname)
1080 struct inode *inode;
1083 struct reiserfs_transaction_handle th;
1084 struct reiserfs_security_handle security;
1085 int mode = S_IFLNK | S_IRWXUGO;
1087 * We need blocks for transaction + (user+group)*(quotas for
1088 * new inode + update of quota for directory owner)
1091 JOURNAL_PER_BALANCE_CNT * 3 +
1092 2 * (REISERFS_QUOTA_INIT_BLOCKS(parent_dir->i_sb) +
1093 REISERFS_QUOTA_TRANS_BLOCKS(parent_dir->i_sb));
1095 dquot_initialize(parent_dir);
1097 if (!(inode = new_inode(parent_dir->i_sb))) {
1100 new_inode_init(inode, parent_dir, mode);
1102 retval = reiserfs_security_init(parent_dir, inode, &dentry->d_name,
1105 drop_new_inode(inode);
1108 jbegin_count += retval;
1110 reiserfs_write_lock(parent_dir->i_sb);
1111 item_len = ROUND_UP(strlen(symname));
1112 if (item_len > MAX_DIRECT_ITEM_LEN(parent_dir->i_sb->s_blocksize)) {
1113 retval = -ENAMETOOLONG;
1114 drop_new_inode(inode);
1118 name = kmalloc(item_len, GFP_NOFS);
1120 drop_new_inode(inode);
1124 memcpy(name, symname, strlen(symname));
1125 padd_item(name, item_len, strlen(symname));
1127 retval = journal_begin(&th, parent_dir->i_sb, jbegin_count);
1129 drop_new_inode(inode);
1135 reiserfs_new_inode(&th, parent_dir, mode, name, strlen(symname),
1136 dentry, inode, &security);
1138 if (retval) { /* reiserfs_new_inode iputs for us */
1142 reiserfs_update_inode_transaction(inode);
1143 reiserfs_update_inode_transaction(parent_dir);
1145 inode->i_op = &reiserfs_symlink_inode_operations;
1146 inode->i_mapping->a_ops = &reiserfs_address_space_operations;
1148 retval = reiserfs_add_entry(&th, parent_dir, dentry->d_name.name,
1149 dentry->d_name.len, inode, 1 /*visible */ );
1153 reiserfs_update_sd(&th, inode);
1154 err = journal_end(&th);
1157 unlock_new_inode(inode);
1162 d_instantiate_new(dentry, inode);
1163 retval = journal_end(&th);
1165 reiserfs_write_unlock(parent_dir->i_sb);
1169 static int reiserfs_link(struct dentry *old_dentry, struct inode *dir,
1170 struct dentry *dentry)
1173 struct inode *inode = old_dentry->d_inode;
1174 struct reiserfs_transaction_handle th;
1176 * We need blocks for transaction + update of quotas for
1177 * the owners of the directory
1180 JOURNAL_PER_BALANCE_CNT * 3 +
1181 2 * REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb);
1183 dquot_initialize(dir);
1185 reiserfs_write_lock(dir->i_sb);
1186 if (inode->i_nlink >= REISERFS_LINK_MAX) {
1187 /* FIXME: sd_nlink is 32 bit for new files */
1188 reiserfs_write_unlock(dir->i_sb);
1192 /* inc before scheduling so reiserfs_unlink knows we are here */
1195 retval = journal_begin(&th, dir->i_sb, jbegin_count);
1198 reiserfs_write_unlock(dir->i_sb);
1202 /* create new entry */
1204 reiserfs_add_entry(&th, dir, dentry->d_name.name,
1205 dentry->d_name.len, inode, 1 /*visible */ );
1207 reiserfs_update_inode_transaction(inode);
1208 reiserfs_update_inode_transaction(dir);
1213 err = journal_end(&th);
1214 reiserfs_write_unlock(dir->i_sb);
1215 return err ? err : retval;
1218 inode->i_ctime = CURRENT_TIME_SEC;
1219 reiserfs_update_sd(&th, inode);
1222 d_instantiate(dentry, inode);
1223 retval = journal_end(&th);
1224 reiserfs_write_unlock(dir->i_sb);
1228 /* de contains information pointing to an entry which */
1229 static int de_still_valid(const char *name, int len,
1230 struct reiserfs_dir_entry *de)
1232 struct reiserfs_dir_entry tmp = *de;
1234 /* recalculate pointer to name and name length */
1235 set_de_name_and_namelen(&tmp);
1236 /* FIXME: could check more */
1237 if (tmp.de_namelen != len || memcmp(name, de->de_name, len))
1242 static int entry_points_to_object(const char *name, int len,
1243 struct reiserfs_dir_entry *de,
1244 struct inode *inode)
1246 if (!de_still_valid(name, len, de))
1250 if (!de_visible(de->de_deh + de->de_entry_num))
1251 reiserfs_panic(inode->i_sb, "vs-7042",
1252 "entry must be visible");
1253 return (de->de_objectid == inode->i_ino) ? 1 : 0;
1256 /* this must be added hidden entry */
1257 if (de_visible(de->de_deh + de->de_entry_num))
1258 reiserfs_panic(NULL, "vs-7043", "entry must be visible");
1263 /* sets key of objectid the entry has to point to */
1264 static void set_ino_in_dir_entry(struct reiserfs_dir_entry *de,
1265 struct reiserfs_key *key)
1267 /* JDM These operations are endian safe - both are le */
1268 de->de_deh[de->de_entry_num].deh_dir_id = key->k_dir_id;
1269 de->de_deh[de->de_entry_num].deh_objectid = key->k_objectid;
1273 * process, that is going to call fix_nodes/do_balance must hold only
1274 * one path. If it holds 2 or more, it can get into endless waiting in
1275 * get_empty_nodes or its clones
1277 static int reiserfs_rename(struct inode *old_dir, struct dentry *old_dentry,
1278 struct inode *new_dir, struct dentry *new_dentry)
1281 INITIALIZE_PATH(old_entry_path);
1282 INITIALIZE_PATH(new_entry_path);
1283 INITIALIZE_PATH(dot_dot_entry_path);
1284 struct item_head new_entry_ih, old_entry_ih, dot_dot_ih;
1285 struct reiserfs_dir_entry old_de, new_de, dot_dot_de;
1286 struct inode *old_inode, *new_dentry_inode;
1287 struct reiserfs_transaction_handle th;
1289 umode_t old_inode_mode;
1290 unsigned long savelink = 1;
1291 struct timespec ctime;
1294 * three balancings: (1) old name removal, (2) new name insertion
1295 * and (3) maybe "save" link insertion
1296 * stat data updates: (1) old directory,
1297 * (2) new directory and (3) maybe old object stat data (when it is
1298 * directory) and (4) maybe stat data of object to which new entry
1299 * pointed initially and (5) maybe block containing ".." of
1301 * quota updates: two parent directories
1304 JOURNAL_PER_BALANCE_CNT * 3 + 5 +
1305 4 * REISERFS_QUOTA_TRANS_BLOCKS(old_dir->i_sb);
1307 dquot_initialize(old_dir);
1308 dquot_initialize(new_dir);
1310 old_inode = old_dentry->d_inode;
1311 new_dentry_inode = new_dentry->d_inode;
1314 * make sure that oldname still exists and points to an object we
1315 * are going to rename
1317 old_de.de_gen_number_bit_string = NULL;
1318 reiserfs_write_lock(old_dir->i_sb);
1320 reiserfs_find_entry(old_dir, old_dentry->d_name.name,
1321 old_dentry->d_name.len, &old_entry_path,
1323 pathrelse(&old_entry_path);
1324 if (retval == IO_ERROR) {
1325 reiserfs_write_unlock(old_dir->i_sb);
1329 if (retval != NAME_FOUND || old_de.de_objectid != old_inode->i_ino) {
1330 reiserfs_write_unlock(old_dir->i_sb);
1334 old_inode_mode = old_inode->i_mode;
1335 if (S_ISDIR(old_inode_mode)) {
1337 * make sure that directory being renamed has correct ".."
1338 * and that its new parent directory has not too many links
1341 if (new_dentry_inode) {
1342 if (!reiserfs_empty_dir(new_dentry_inode)) {
1343 reiserfs_write_unlock(old_dir->i_sb);
1349 * directory is renamed, its parent directory will be changed,
1350 * so find ".." entry
1352 dot_dot_de.de_gen_number_bit_string = NULL;
1354 reiserfs_find_entry(old_inode, "..", 2, &dot_dot_entry_path,
1356 pathrelse(&dot_dot_entry_path);
1357 if (retval != NAME_FOUND) {
1358 reiserfs_write_unlock(old_dir->i_sb);
1362 /* inode number of .. must equal old_dir->i_ino */
1363 if (dot_dot_de.de_objectid != old_dir->i_ino) {
1364 reiserfs_write_unlock(old_dir->i_sb);
1369 retval = journal_begin(&th, old_dir->i_sb, jbegin_count);
1371 reiserfs_write_unlock(old_dir->i_sb);
1375 /* add new entry (or find the existing one) */
1377 reiserfs_add_entry(&th, new_dir, new_dentry->d_name.name,
1378 new_dentry->d_name.len, old_inode, 0);
1379 if (retval == -EEXIST) {
1380 if (!new_dentry_inode) {
1381 reiserfs_panic(old_dir->i_sb, "vs-7050",
1382 "new entry is found, new inode == 0");
1384 } else if (retval) {
1385 int err = journal_end(&th);
1386 reiserfs_write_unlock(old_dir->i_sb);
1387 return err ? err : retval;
1390 reiserfs_update_inode_transaction(old_dir);
1391 reiserfs_update_inode_transaction(new_dir);
1394 * this makes it so an fsync on an open fd for the old name will
1395 * commit the rename operation
1397 reiserfs_update_inode_transaction(old_inode);
1399 if (new_dentry_inode)
1400 reiserfs_update_inode_transaction(new_dentry_inode);
1404 * look for old name using corresponding entry key
1405 * (found by reiserfs_find_entry)
1408 search_by_entry_key(new_dir->i_sb, &old_de.de_entry_key,
1410 &old_de)) != NAME_FOUND) {
1411 pathrelse(&old_entry_path);
1413 reiserfs_write_unlock(old_dir->i_sb);
1417 copy_item_head(&old_entry_ih, tp_item_head(&old_entry_path));
1419 reiserfs_prepare_for_journal(old_inode->i_sb, old_de.de_bh, 1);
1421 /* look for new name by reiserfs_find_entry */
1422 new_de.de_gen_number_bit_string = NULL;
1424 reiserfs_find_entry(new_dir, new_dentry->d_name.name,
1425 new_dentry->d_name.len, &new_entry_path,
1428 * reiserfs_add_entry should not return IO_ERROR,
1429 * because it is called with essentially same parameters from
1430 * reiserfs_add_entry above, and we'll catch any i/o errors
1431 * before we get here.
1433 if (retval != NAME_FOUND_INVISIBLE && retval != NAME_FOUND) {
1434 pathrelse(&new_entry_path);
1435 pathrelse(&old_entry_path);
1437 reiserfs_write_unlock(old_dir->i_sb);
1441 copy_item_head(&new_entry_ih, tp_item_head(&new_entry_path));
1443 reiserfs_prepare_for_journal(old_inode->i_sb, new_de.de_bh, 1);
1445 if (S_ISDIR(old_inode->i_mode)) {
1447 search_by_entry_key(new_dir->i_sb,
1448 &dot_dot_de.de_entry_key,
1449 &dot_dot_entry_path,
1450 &dot_dot_de)) != NAME_FOUND) {
1451 pathrelse(&dot_dot_entry_path);
1452 pathrelse(&new_entry_path);
1453 pathrelse(&old_entry_path);
1455 reiserfs_write_unlock(old_dir->i_sb);
1458 copy_item_head(&dot_dot_ih,
1459 tp_item_head(&dot_dot_entry_path));
1460 /* node containing ".." gets into transaction */
1461 reiserfs_prepare_for_journal(old_inode->i_sb,
1462 dot_dot_de.de_bh, 1);
1465 * we should check seals here, not do
1466 * this stuff, yes? Then, having
1467 * gathered everything into RAM we
1468 * should lock the buffers, yes? -Hans
1471 * probably. our rename needs to hold more
1472 * than one path at once. The seals would
1473 * have to be written to deal with multi-path
1477 * sanity checking before doing the rename - avoid races many
1478 * of the above checks could have scheduled. We have to be
1479 * sure our items haven't been shifted by another process.
1481 if (item_moved(&new_entry_ih, &new_entry_path) ||
1482 !entry_points_to_object(new_dentry->d_name.name,
1483 new_dentry->d_name.len,
1484 &new_de, new_dentry_inode) ||
1485 item_moved(&old_entry_ih, &old_entry_path) ||
1486 !entry_points_to_object(old_dentry->d_name.name,
1487 old_dentry->d_name.len,
1488 &old_de, old_inode)) {
1489 reiserfs_restore_prepared_buffer(old_inode->i_sb,
1491 reiserfs_restore_prepared_buffer(old_inode->i_sb,
1493 if (S_ISDIR(old_inode_mode))
1494 reiserfs_restore_prepared_buffer(old_inode->
1500 if (S_ISDIR(old_inode_mode)) {
1501 if (item_moved(&dot_dot_ih, &dot_dot_entry_path) ||
1502 !entry_points_to_object("..", 2, &dot_dot_de,
1504 reiserfs_restore_prepared_buffer(old_inode->
1507 reiserfs_restore_prepared_buffer(old_inode->
1510 reiserfs_restore_prepared_buffer(old_inode->
1518 RFALSE(S_ISDIR(old_inode_mode) &&
1519 !buffer_journal_prepared(dot_dot_de.de_bh), "");
1525 * ok, all the changes can be done in one fell swoop when we
1526 * have claimed all the buffers needed.
1529 mark_de_visible(new_de.de_deh + new_de.de_entry_num);
1530 set_ino_in_dir_entry(&new_de, INODE_PKEY(old_inode));
1531 journal_mark_dirty(&th, new_de.de_bh);
1533 mark_de_hidden(old_de.de_deh + old_de.de_entry_num);
1534 journal_mark_dirty(&th, old_de.de_bh);
1535 ctime = CURRENT_TIME_SEC;
1536 old_dir->i_ctime = old_dir->i_mtime = ctime;
1537 new_dir->i_ctime = new_dir->i_mtime = ctime;
1539 * thanks to Alex Adriaanse <alex_a@caltech.edu> for patch
1540 * which adds ctime update of renamed object
1542 old_inode->i_ctime = ctime;
1544 if (new_dentry_inode) {
1545 /* adjust link number of the victim */
1546 if (S_ISDIR(new_dentry_inode->i_mode)) {
1547 clear_nlink(new_dentry_inode);
1549 drop_nlink(new_dentry_inode);
1551 new_dentry_inode->i_ctime = ctime;
1552 savelink = new_dentry_inode->i_nlink;
1555 if (S_ISDIR(old_inode_mode)) {
1556 /* adjust ".." of renamed directory */
1557 set_ino_in_dir_entry(&dot_dot_de, INODE_PKEY(new_dir));
1558 journal_mark_dirty(&th, dot_dot_de.de_bh);
1561 * there (in new_dir) was no directory, so it got new link
1562 * (".." of renamed directory)
1564 if (!new_dentry_inode)
1565 INC_DIR_INODE_NLINK(new_dir);
1567 /* old directory lost one link - ".. " of renamed directory */
1568 DEC_DIR_INODE_NLINK(old_dir);
1571 * looks like in 2.3.99pre3 brelse is atomic.
1572 * so we can use pathrelse
1574 pathrelse(&new_entry_path);
1575 pathrelse(&dot_dot_entry_path);
1578 * FIXME: this reiserfs_cut_from_item's return value may screw up
1579 * anybody, but it will panic if will not be able to find the
1580 * entry. This needs one more clean up
1582 if (reiserfs_cut_from_item
1583 (&th, &old_entry_path, &old_de.de_entry_key, old_dir, NULL,
1585 reiserfs_error(old_dir->i_sb, "vs-7060",
1586 "couldn't not cut old name. Fsck later?");
1588 old_dir->i_size -= DEH_SIZE + old_de.de_entrylen;
1590 reiserfs_update_sd(&th, old_dir);
1591 reiserfs_update_sd(&th, new_dir);
1592 reiserfs_update_sd(&th, old_inode);
1594 if (new_dentry_inode) {
1596 add_save_link(&th, new_dentry_inode,
1597 0 /* not truncate */ );
1598 reiserfs_update_sd(&th, new_dentry_inode);
1601 retval = journal_end(&th);
1602 reiserfs_write_unlock(old_dir->i_sb);
1606 /* directories can handle most operations... */
1607 const struct inode_operations reiserfs_dir_inode_operations = {
1608 .create = reiserfs_create,
1609 .lookup = reiserfs_lookup,
1610 .link = reiserfs_link,
1611 .unlink = reiserfs_unlink,
1612 .symlink = reiserfs_symlink,
1613 .mkdir = reiserfs_mkdir,
1614 .rmdir = reiserfs_rmdir,
1615 .mknod = reiserfs_mknod,
1616 .rename = reiserfs_rename,
1617 .setattr = reiserfs_setattr,
1618 .setxattr = reiserfs_setxattr,
1619 .getxattr = reiserfs_getxattr,
1620 .listxattr = reiserfs_listxattr,
1621 .removexattr = reiserfs_removexattr,
1622 .permission = reiserfs_permission,
1623 .get_acl = reiserfs_get_acl,
1624 .set_acl = reiserfs_set_acl,
1628 * symlink operations.. same as page_symlink_inode_operations, with xattr
1631 const struct inode_operations reiserfs_symlink_inode_operations = {
1632 .readlink = generic_readlink,
1633 .follow_link = page_follow_link_light,
1634 .put_link = page_put_link,
1635 .setattr = reiserfs_setattr,
1636 .setxattr = reiserfs_setxattr,
1637 .getxattr = reiserfs_getxattr,
1638 .listxattr = reiserfs_listxattr,
1639 .removexattr = reiserfs_removexattr,
1640 .permission = reiserfs_permission,
1644 * special file operations.. just xattr/acl stuff
1646 const struct inode_operations reiserfs_special_inode_operations = {
1647 .setattr = reiserfs_setattr,
1648 .setxattr = reiserfs_setxattr,
1649 .getxattr = reiserfs_getxattr,
1650 .listxattr = reiserfs_listxattr,
1651 .removexattr = reiserfs_removexattr,
1652 .permission = reiserfs_permission,
1653 .get_acl = reiserfs_get_acl,
1654 .set_acl = reiserfs_set_acl,