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/reiserfs_fs.h>
17 #include <linux/reiserfs_acl.h>
18 #include <linux/reiserfs_xattr.h>
19 #include <linux/quotaops.h>
21 #define INC_DIR_INODE_NLINK(i) if (i->i_nlink != 1) { inc_nlink(i); if (i->i_nlink >= REISERFS_LINK_MAX) i->i_nlink=1; }
22 #define DEC_DIR_INODE_NLINK(i) if (i->i_nlink != 1) drop_nlink(i);
24 // directory item contains array of entry headers. This performs
25 // binary search through that array
26 static int bin_search_in_dir_item(struct reiserfs_dir_entry *de, loff_t off)
28 struct item_head *ih = de->de_ih;
29 struct reiserfs_de_head *deh = de->de_deh;
30 int rbound, lbound, j;
33 rbound = I_ENTRY_COUNT(ih) - 1;
35 for (j = (rbound + lbound) / 2; lbound <= rbound;
36 j = (rbound + lbound) / 2) {
37 if (off < deh_offset(deh + j)) {
41 if (off > deh_offset(deh + j)) {
45 // this is not name found, but matched third key component
50 de->de_entry_num = lbound;
51 return NAME_NOT_FOUND;
54 // comment? maybe something like set de to point to what the path points to?
55 static inline void set_de_item_location(struct reiserfs_dir_entry *de,
56 struct treepath *path)
58 de->de_bh = get_last_bh(path);
59 de->de_ih = get_ih(path);
60 de->de_deh = B_I_DEH(de->de_bh, de->de_ih);
61 de->de_item_num = PATH_LAST_POSITION(path);
64 // de_bh, de_ih, de_deh (points to first element of array), de_item_num is set
65 inline void set_de_name_and_namelen(struct reiserfs_dir_entry *de)
67 struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num;
69 BUG_ON(de->de_entry_num >= ih_entry_count(de->de_ih));
71 de->de_entrylen = entry_length(de->de_bh, de->de_ih, de->de_entry_num);
72 de->de_namelen = de->de_entrylen - (de_with_sd(deh) ? SD_SIZE : 0);
73 de->de_name = B_I_PITEM(de->de_bh, de->de_ih) + deh_location(deh);
74 if (de->de_name[de->de_namelen - 1] == 0)
75 de->de_namelen = strlen(de->de_name);
78 // what entry points to
79 static inline void set_de_object_key(struct reiserfs_dir_entry *de)
81 BUG_ON(de->de_entry_num >= ih_entry_count(de->de_ih));
82 de->de_dir_id = deh_dir_id(&(de->de_deh[de->de_entry_num]));
83 de->de_objectid = deh_objectid(&(de->de_deh[de->de_entry_num]));
86 static inline void store_de_entry_key(struct reiserfs_dir_entry *de)
88 struct reiserfs_de_head *deh = de->de_deh + de->de_entry_num;
90 BUG_ON(de->de_entry_num >= ih_entry_count(de->de_ih));
92 /* store key of the found entry */
93 de->de_entry_key.version = KEY_FORMAT_3_5;
94 de->de_entry_key.on_disk_key.k_dir_id =
95 le32_to_cpu(de->de_ih->ih_key.k_dir_id);
96 de->de_entry_key.on_disk_key.k_objectid =
97 le32_to_cpu(de->de_ih->ih_key.k_objectid);
98 set_cpu_key_k_offset(&(de->de_entry_key), deh_offset(deh));
99 set_cpu_key_k_type(&(de->de_entry_key), TYPE_DIRENTRY);
102 /* We assign a key to each directory item, and place multiple entries
103 in a single directory item. A directory item has a key equal to the
104 key of the first directory entry in it.
106 This function first calls search_by_key, then, if item whose first
107 entry matches is not found it looks for the entry inside directory
108 item found by search_by_key. Fills the path to the entry, and to the
109 entry position in the item
113 /* The function is NOT SCHEDULE-SAFE! */
114 int search_by_entry_key(struct super_block *sb, const struct cpu_key *key,
115 struct treepath *path, struct reiserfs_dir_entry *de)
119 retval = search_item(sb, key, path);
122 if (!PATH_LAST_POSITION(path)) {
123 reiserfs_error(sb, "vs-7000", "search_by_key "
124 "returned item position == 0");
128 PATH_LAST_POSITION(path)--;
138 reiserfs_error(sb, "vs-7002", "no path to here");
142 set_de_item_location(de, path);
144 #ifdef CONFIG_REISERFS_CHECK
145 if (!is_direntry_le_ih(de->de_ih) ||
146 COMP_SHORT_KEYS(&(de->de_ih->ih_key), key)) {
147 print_block(de->de_bh, 0, -1, -1);
148 reiserfs_panic(sb, "vs-7005", "found item %h is not directory "
149 "item or does not belong to the same directory "
150 "as key %K", de->de_ih, key);
152 #endif /* CONFIG_REISERFS_CHECK */
154 /* binary search in directory item by third componen t of the
155 key. sets de->de_entry_num of de */
156 retval = bin_search_in_dir_item(de, cpu_key_k_offset(key));
157 path->pos_in_item = de->de_entry_num;
158 if (retval != NAME_NOT_FOUND) {
159 // ugly, but rename needs de_bh, de_deh, de_name, de_namelen, de_objectid set
160 set_de_name_and_namelen(de);
161 set_de_object_key(de);
166 /* Keyed 32-bit hash function using TEA in a Davis-Meyer function */
168 /* The third component is hashed, and you can choose from more than
169 one hash function. Per directory hashes are not yet implemented
170 but are thought about. This function should be moved to hashes.c
171 Jedi, please do so. -Hans */
173 static __u32 get_third_component(struct super_block *s,
174 const char *name, int len)
178 if (!len || (len == 1 && name[0] == '.'))
180 if (len == 2 && name[0] == '.' && name[1] == '.')
181 return DOT_DOT_OFFSET;
183 res = REISERFS_SB(s)->s_hash_function(name, len);
185 // take bits from 7-th to 30-th including both bounds
186 res = GET_HASH_VALUE(res);
188 // needed to have no names before "." and ".." those have hash
189 // value == 0 and generation conters 1 and 2 accordingly
191 return res + MAX_GENERATION_NUMBER;
194 static int reiserfs_match(struct reiserfs_dir_entry *de,
195 const char *name, int namelen)
197 int retval = NAME_NOT_FOUND;
199 if ((namelen == de->de_namelen) &&
200 !memcmp(de->de_name, name, de->de_namelen))
202 (de_visible(de->de_deh + de->de_entry_num) ? NAME_FOUND :
203 NAME_FOUND_INVISIBLE);
208 /* de's de_bh, de_ih, de_deh, de_item_num, de_entry_num are set already */
210 /* used when hash collisions exist */
212 static int linear_search_in_dir_item(struct cpu_key *key,
213 struct reiserfs_dir_entry *de,
214 const char *name, int namelen)
216 struct reiserfs_de_head *deh = de->de_deh;
220 i = de->de_entry_num;
222 if (i == I_ENTRY_COUNT(de->de_ih) ||
223 GET_HASH_VALUE(deh_offset(deh + i)) !=
224 GET_HASH_VALUE(cpu_key_k_offset(key))) {
228 RFALSE(de->de_deh != B_I_DEH(de->de_bh, de->de_ih),
229 "vs-7010: array of entry headers not found");
233 for (; i >= 0; i--, deh--) {
234 if (GET_HASH_VALUE(deh_offset(deh)) !=
235 GET_HASH_VALUE(cpu_key_k_offset(key))) {
236 // hash value does not match, no need to check whole name
237 return NAME_NOT_FOUND;
240 /* mark, that this generation number is used */
241 if (de->de_gen_number_bit_string)
242 set_bit(GET_GENERATION_NUMBER(deh_offset(deh)),
243 de->de_gen_number_bit_string);
245 // calculate pointer to name and namelen
246 de->de_entry_num = i;
247 set_de_name_and_namelen(de);
250 reiserfs_match(de, name, namelen)) != NAME_NOT_FOUND) {
251 // de's de_name, de_namelen, de_recordlen are set. Fill the rest:
253 // key of pointed object
254 set_de_object_key(de);
256 store_de_entry_key(de);
258 // retval can be NAME_FOUND or NAME_FOUND_INVISIBLE
263 if (GET_GENERATION_NUMBER(le_ih_k_offset(de->de_ih)) == 0)
264 /* we have reached left most entry in the node. In common we
265 have to go to the left neighbor, but if generation counter
266 is 0 already, we know for sure, that there is no name with
267 the same hash value */
268 // FIXME: this work correctly only because hash value can not
269 // be 0. Btw, in case of Yura's hash it is probably possible,
271 return NAME_NOT_FOUND;
273 RFALSE(de->de_item_num,
274 "vs-7015: two diritems of the same directory in one node?");
276 return GOTO_PREVIOUS_ITEM;
279 // may return NAME_FOUND, NAME_FOUND_INVISIBLE, NAME_NOT_FOUND
280 // FIXME: should add something like IOERROR
281 static int reiserfs_find_entry(struct inode *dir, const char *name, int namelen,
282 struct treepath *path_to_entry,
283 struct reiserfs_dir_entry *de)
285 struct cpu_key key_to_search;
288 if (namelen > REISERFS_MAX_NAME(dir->i_sb->s_blocksize))
289 return NAME_NOT_FOUND;
291 /* we will search for this key in the tree */
292 make_cpu_key(&key_to_search, dir,
293 get_third_component(dir->i_sb, name, namelen),
298 search_by_entry_key(dir->i_sb, &key_to_search,
300 if (retval == IO_ERROR) {
301 reiserfs_error(dir->i_sb, "zam-7001", "io error");
305 /* compare names for all entries having given hash value */
307 linear_search_in_dir_item(&key_to_search, de, name,
309 if (retval != GOTO_PREVIOUS_ITEM) {
310 /* there is no need to scan directory anymore. Given entry found or does not exist */
311 path_to_entry->pos_in_item = de->de_entry_num;
315 /* there is left neighboring item of this directory and given entry can be there */
316 set_cpu_key_k_offset(&key_to_search,
317 le_ih_k_offset(de->de_ih) - 1);
318 pathrelse(path_to_entry);
323 static struct dentry *reiserfs_lookup(struct inode *dir, struct dentry *dentry,
324 struct nameidata *nd)
327 struct inode *inode = NULL;
328 struct reiserfs_dir_entry de;
329 INITIALIZE_PATH(path_to_entry);
331 if (REISERFS_MAX_NAME(dir->i_sb->s_blocksize) < dentry->d_name.len)
332 return ERR_PTR(-ENAMETOOLONG);
334 reiserfs_write_lock(dir->i_sb);
335 de.de_gen_number_bit_string = NULL;
337 reiserfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len,
338 &path_to_entry, &de);
339 pathrelse(&path_to_entry);
340 if (retval == NAME_FOUND) {
341 /* Hide the .reiserfs_priv directory */
342 if (reiserfs_xattrs(dir->i_sb) &&
343 !old_format_only(dir->i_sb) &&
344 REISERFS_SB(dir->i_sb)->priv_root &&
345 REISERFS_SB(dir->i_sb)->priv_root->d_inode &&
347 le32_to_cpu(INODE_PKEY
348 (REISERFS_SB(dir->i_sb)->priv_root->d_inode)->
350 reiserfs_write_unlock(dir->i_sb);
351 return ERR_PTR(-EACCES);
355 reiserfs_iget(dir->i_sb, (struct cpu_key *)&(de.de_dir_id));
356 if (!inode || IS_ERR(inode)) {
357 reiserfs_write_unlock(dir->i_sb);
358 return ERR_PTR(-EACCES);
361 /* Propagate the private flag so we know we're
362 * in the priv tree */
364 inode->i_flags |= S_PRIVATE;
366 reiserfs_write_unlock(dir->i_sb);
367 if (retval == IO_ERROR) {
368 return ERR_PTR(-EIO);
371 return d_splice_alias(inode, dentry);
375 ** looks up the dentry of the parent directory for child.
376 ** taken from ext2_get_parent
378 struct dentry *reiserfs_get_parent(struct dentry *child)
381 struct inode *inode = NULL;
382 struct reiserfs_dir_entry de;
383 INITIALIZE_PATH(path_to_entry);
384 struct inode *dir = child->d_inode;
386 if (dir->i_nlink == 0) {
387 return ERR_PTR(-ENOENT);
389 de.de_gen_number_bit_string = NULL;
391 reiserfs_write_lock(dir->i_sb);
392 retval = reiserfs_find_entry(dir, "..", 2, &path_to_entry, &de);
393 pathrelse(&path_to_entry);
394 if (retval != NAME_FOUND) {
395 reiserfs_write_unlock(dir->i_sb);
396 return ERR_PTR(-ENOENT);
398 inode = reiserfs_iget(dir->i_sb, (struct cpu_key *)&(de.de_dir_id));
399 reiserfs_write_unlock(dir->i_sb);
401 return d_obtain_alias(inode);
404 /* add entry to the directory (entry can be hidden).
406 insert definition of when hidden directories are used here -Hans
408 Does not mark dir inode dirty, do it after successesfull call to it */
410 static int reiserfs_add_entry(struct reiserfs_transaction_handle *th,
411 struct inode *dir, const char *name, int namelen,
412 struct inode *inode, int visible)
414 struct cpu_key entry_key;
415 struct reiserfs_de_head *deh;
416 INITIALIZE_PATH(path);
417 struct reiserfs_dir_entry de;
418 DECLARE_BITMAP(bit_string, MAX_GENERATION_NUMBER + 1);
420 char small_buf[32 + DEH_SIZE]; /* 48 bytes now and we avoid kmalloc
421 if we create file with short name */
423 int buflen, paste_size;
426 BUG_ON(!th->t_trans_id);
428 /* cannot allow items to be added into a busy deleted directory */
432 if (namelen > REISERFS_MAX_NAME(dir->i_sb->s_blocksize))
433 return -ENAMETOOLONG;
435 /* each entry has unique key. compose it */
436 make_cpu_key(&entry_key, dir,
437 get_third_component(dir->i_sb, name, namelen),
440 /* get memory for composing the entry */
441 buflen = DEH_SIZE + ROUND_UP(namelen);
442 if (buflen > sizeof(small_buf)) {
443 buffer = kmalloc(buflen, GFP_NOFS);
450 (get_inode_sd_version(dir) ==
451 STAT_DATA_V1) ? (DEH_SIZE + namelen) : buflen;
453 /* fill buffer : directory entry head, name[, dir objectid | , stat data | ,stat data, dir objectid ] */
454 deh = (struct reiserfs_de_head *)buffer;
455 deh->deh_location = 0; /* JDM Endian safe if 0 */
456 put_deh_offset(deh, cpu_key_k_offset(&entry_key));
457 deh->deh_state = 0; /* JDM Endian safe if 0 */
458 /* put key (ino analog) to de */
459 deh->deh_dir_id = INODE_PKEY(inode)->k_dir_id; /* safe: k_dir_id is le */
460 deh->deh_objectid = INODE_PKEY(inode)->k_objectid; /* safe: k_objectid is le */
463 memcpy((char *)(deh + 1), name, namelen);
464 /* padd by 0s to the 4 byte boundary */
465 padd_item((char *)(deh + 1), ROUND_UP(namelen), namelen);
467 /* entry is ready to be pasted into tree, set 'visibility' and 'stat data in entry' attributes */
468 mark_de_without_sd(deh);
469 visible ? mark_de_visible(deh) : mark_de_hidden(deh);
471 /* find the proper place for the new entry */
472 memset(bit_string, 0, sizeof(bit_string));
473 de.de_gen_number_bit_string = bit_string;
474 retval = reiserfs_find_entry(dir, name, namelen, &path, &de);
475 if (retval != NAME_NOT_FOUND) {
476 if (buffer != small_buf)
480 if (retval == IO_ERROR) {
484 if (retval != NAME_FOUND) {
485 reiserfs_error(dir->i_sb, "zam-7002",
486 "reiserfs_find_entry() returned "
487 "unexpected value (%d)", retval);
494 find_first_zero_bit(bit_string,
495 MAX_GENERATION_NUMBER + 1);
496 if (gen_number > MAX_GENERATION_NUMBER) {
497 /* there is no free generation number */
498 reiserfs_warning(dir->i_sb, "reiserfs-7010",
499 "Congratulations! we have got hash function "
501 if (buffer != small_buf)
506 /* adjust offset of directory enrty */
507 put_deh_offset(deh, SET_GENERATION_NUMBER(deh_offset(deh), gen_number));
508 set_cpu_key_k_offset(&entry_key, deh_offset(deh));
510 /* update max-hash-collisions counter in reiserfs_sb_info */
511 PROC_INFO_MAX(th->t_super, max_hash_collisions, gen_number);
513 if (gen_number != 0) { /* we need to re-search for the insertion point */
514 if (search_by_entry_key(dir->i_sb, &entry_key, &path, &de) !=
516 reiserfs_warning(dir->i_sb, "vs-7032",
517 "entry with this key (%K) already "
518 "exists", &entry_key);
520 if (buffer != small_buf)
527 /* perform the insertion of the entry that we have prepared */
529 reiserfs_paste_into_item(th, &path, &entry_key, dir, buffer,
531 if (buffer != small_buf)
534 reiserfs_check_path(&path);
538 dir->i_size += paste_size;
539 dir->i_mtime = dir->i_ctime = CURRENT_TIME_SEC;
540 if (!S_ISDIR(inode->i_mode) && visible)
541 // reiserfs_mkdir or reiserfs_rename will do that by itself
542 reiserfs_update_sd(th, dir);
544 reiserfs_check_path(&path);
548 /* quota utility function, call if you've had to abort after calling
549 ** new_inode_init, and have not called reiserfs_new_inode yet.
550 ** This should only be called on inodes that do not have stat data
551 ** inserted into the tree yet.
553 static int drop_new_inode(struct inode *inode)
556 make_bad_inode(inode);
557 inode->i_flags |= S_NOQUOTA;
562 /* utility function that does setup for reiserfs_new_inode.
563 ** vfs_dq_init needs lots of credits so it's better to have it
564 ** outside of a transaction, so we had to pull some bits of
565 ** reiserfs_new_inode out into this func.
567 static int new_inode_init(struct inode *inode, struct inode *dir, int mode)
570 /* the quota init calls have to know who to charge the quota to, so
571 ** we have to set uid and gid here
573 inode->i_uid = current_fsuid();
574 inode->i_mode = mode;
575 /* Make inode invalid - just in case we are going to drop it before
576 * the initialization happens */
577 INODE_PKEY(inode)->k_objectid = 0;
579 if (dir->i_mode & S_ISGID) {
580 inode->i_gid = dir->i_gid;
582 inode->i_mode |= S_ISGID;
584 inode->i_gid = current_fsgid();
590 static int reiserfs_create(struct inode *dir, struct dentry *dentry, int mode,
591 struct nameidata *nd)
595 /* We need blocks for transaction + (user+group)*(quotas for new inode + update of quota for directory owner) */
597 JOURNAL_PER_BALANCE_CNT * 2 +
598 2 * (REISERFS_QUOTA_INIT_BLOCKS(dir->i_sb) +
599 REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb));
600 struct reiserfs_transaction_handle th;
601 struct reiserfs_security_handle security;
603 if (!(inode = new_inode(dir->i_sb))) {
606 new_inode_init(inode, dir, mode);
608 jbegin_count += reiserfs_cache_default_acl(dir);
609 retval = reiserfs_security_init(dir, inode, &security);
611 drop_new_inode(inode);
614 jbegin_count += retval;
615 reiserfs_write_lock(dir->i_sb);
617 retval = journal_begin(&th, dir->i_sb, jbegin_count);
619 drop_new_inode(inode);
624 reiserfs_new_inode(&th, dir, mode, NULL, 0 /*i_size */ , dentry,
629 inode->i_op = &reiserfs_file_inode_operations;
630 inode->i_fop = &reiserfs_file_operations;
631 inode->i_mapping->a_ops = &reiserfs_address_space_operations;
634 reiserfs_add_entry(&th, dir, dentry->d_name.name,
635 dentry->d_name.len, inode, 1 /*visible */ );
639 reiserfs_update_sd(&th, inode);
640 err = journal_end(&th, dir->i_sb, jbegin_count);
643 unlock_new_inode(inode);
647 reiserfs_update_inode_transaction(inode);
648 reiserfs_update_inode_transaction(dir);
650 d_instantiate(dentry, inode);
651 unlock_new_inode(inode);
652 retval = journal_end(&th, dir->i_sb, jbegin_count);
655 reiserfs_write_unlock(dir->i_sb);
659 static int reiserfs_mknod(struct inode *dir, struct dentry *dentry, int mode,
664 struct reiserfs_transaction_handle th;
665 struct reiserfs_security_handle security;
666 /* We need blocks for transaction + (user+group)*(quotas for new inode + update of quota for directory owner) */
668 JOURNAL_PER_BALANCE_CNT * 3 +
669 2 * (REISERFS_QUOTA_INIT_BLOCKS(dir->i_sb) +
670 REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb));
672 if (!new_valid_dev(rdev))
675 if (!(inode = new_inode(dir->i_sb))) {
678 new_inode_init(inode, dir, mode);
680 jbegin_count += reiserfs_cache_default_acl(dir);
681 retval = reiserfs_security_init(dir, inode, &security);
683 drop_new_inode(inode);
686 jbegin_count += retval;
687 reiserfs_write_lock(dir->i_sb);
689 retval = journal_begin(&th, dir->i_sb, jbegin_count);
691 drop_new_inode(inode);
696 reiserfs_new_inode(&th, dir, mode, NULL, 0 /*i_size */ , dentry,
702 inode->i_op = &reiserfs_special_inode_operations;
703 init_special_inode(inode, inode->i_mode, rdev);
705 //FIXME: needed for block and char devices only
706 reiserfs_update_sd(&th, inode);
708 reiserfs_update_inode_transaction(inode);
709 reiserfs_update_inode_transaction(dir);
712 reiserfs_add_entry(&th, dir, dentry->d_name.name,
713 dentry->d_name.len, inode, 1 /*visible */ );
717 reiserfs_update_sd(&th, inode);
718 err = journal_end(&th, dir->i_sb, jbegin_count);
721 unlock_new_inode(inode);
726 d_instantiate(dentry, inode);
727 unlock_new_inode(inode);
728 retval = journal_end(&th, dir->i_sb, jbegin_count);
731 reiserfs_write_unlock(dir->i_sb);
735 static int reiserfs_mkdir(struct inode *dir, struct dentry *dentry, int mode)
739 struct reiserfs_transaction_handle th;
740 struct reiserfs_security_handle security;
741 /* We need blocks for transaction + (user+group)*(quotas for new inode + update of quota for directory owner) */
743 JOURNAL_PER_BALANCE_CNT * 3 +
744 2 * (REISERFS_QUOTA_INIT_BLOCKS(dir->i_sb) +
745 REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb));
747 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
748 /* set flag that new packing locality created and new blocks for the content * of that directory are not displaced yet */
749 REISERFS_I(dir)->new_packing_locality = 1;
751 mode = S_IFDIR | mode;
752 if (!(inode = new_inode(dir->i_sb))) {
755 new_inode_init(inode, dir, mode);
757 jbegin_count += reiserfs_cache_default_acl(dir);
758 retval = reiserfs_security_init(dir, inode, &security);
760 drop_new_inode(inode);
763 jbegin_count += retval;
764 reiserfs_write_lock(dir->i_sb);
766 retval = journal_begin(&th, dir->i_sb, jbegin_count);
768 drop_new_inode(inode);
772 /* inc the link count now, so another writer doesn't overflow it while
773 ** we sleep later on.
775 INC_DIR_INODE_NLINK(dir)
777 retval = reiserfs_new_inode(&th, dir, mode, NULL /*symlink */ ,
778 old_format_only(dir->i_sb) ?
779 EMPTY_DIR_SIZE_V1 : EMPTY_DIR_SIZE,
780 dentry, inode, &security);
786 reiserfs_update_inode_transaction(inode);
787 reiserfs_update_inode_transaction(dir);
789 inode->i_op = &reiserfs_dir_inode_operations;
790 inode->i_fop = &reiserfs_dir_operations;
792 // note, _this_ add_entry will not update dir's stat data
794 reiserfs_add_entry(&th, dir, dentry->d_name.name,
795 dentry->d_name.len, inode, 1 /*visible */ );
799 DEC_DIR_INODE_NLINK(dir);
800 reiserfs_update_sd(&th, inode);
801 err = journal_end(&th, dir->i_sb, jbegin_count);
804 unlock_new_inode(inode);
808 // the above add_entry did not update dir's stat data
809 reiserfs_update_sd(&th, dir);
811 d_instantiate(dentry, inode);
812 unlock_new_inode(inode);
813 retval = journal_end(&th, dir->i_sb, jbegin_count);
815 reiserfs_write_unlock(dir->i_sb);
819 static inline int reiserfs_empty_dir(struct inode *inode)
821 /* we can cheat because an old format dir cannot have
822 ** EMPTY_DIR_SIZE, and a new format dir cannot have
823 ** EMPTY_DIR_SIZE_V1. So, if the inode is either size,
824 ** regardless of disk format version, the directory is empty.
826 if (inode->i_size != EMPTY_DIR_SIZE &&
827 inode->i_size != EMPTY_DIR_SIZE_V1) {
833 static int reiserfs_rmdir(struct inode *dir, struct dentry *dentry)
837 struct reiserfs_transaction_handle th;
839 INITIALIZE_PATH(path);
840 struct reiserfs_dir_entry de;
842 /* we will be doing 2 balancings and update 2 stat data, we change quotas
843 * of the owner of the directory and of the owner of the parent directory.
844 * The quota structure is possibly deleted only on last iput => outside
845 * of this transaction */
847 JOURNAL_PER_BALANCE_CNT * 2 + 2 +
848 4 * REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb);
850 reiserfs_write_lock(dir->i_sb);
851 retval = journal_begin(&th, dir->i_sb, jbegin_count);
855 de.de_gen_number_bit_string = NULL;
857 reiserfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len,
858 &path, &de)) == NAME_NOT_FOUND) {
861 } else if (retval == IO_ERROR) {
866 inode = dentry->d_inode;
868 reiserfs_update_inode_transaction(inode);
869 reiserfs_update_inode_transaction(dir);
871 if (de.de_objectid != inode->i_ino) {
872 // FIXME: compare key of an object and a key found in the
877 if (!reiserfs_empty_dir(inode)) {
882 /* cut entry from dir directory */
883 retval = reiserfs_cut_from_item(&th, &path, &(de.de_entry_key), dir, NULL, /* page */
884 0 /*new file size - not used here */ );
888 if (inode->i_nlink != 2 && inode->i_nlink != 1)
889 reiserfs_error(inode->i_sb, "reiserfs-7040",
890 "empty directory has nlink != 2 (%d)",
894 inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
895 reiserfs_update_sd(&th, inode);
897 DEC_DIR_INODE_NLINK(dir)
898 dir->i_size -= (DEH_SIZE + de.de_entrylen);
899 reiserfs_update_sd(&th, dir);
901 /* prevent empty directory from getting lost */
902 add_save_link(&th, inode, 0 /* not truncate */ );
904 retval = journal_end(&th, dir->i_sb, jbegin_count);
905 reiserfs_check_path(&path);
907 reiserfs_write_unlock(dir->i_sb);
911 /* we must release path, because we did not call
912 reiserfs_cut_from_item, or reiserfs_cut_from_item does not
913 release path if operation was not complete */
915 err = journal_end(&th, dir->i_sb, jbegin_count);
916 reiserfs_write_unlock(dir->i_sb);
917 return err ? err : retval;
920 static int reiserfs_unlink(struct inode *dir, struct dentry *dentry)
924 struct reiserfs_dir_entry de;
925 INITIALIZE_PATH(path);
926 struct reiserfs_transaction_handle th;
928 unsigned long savelink;
930 inode = dentry->d_inode;
932 /* in this transaction we can be doing at max two balancings and update
933 * two stat datas, we change quotas of the owner of the directory and of
934 * the owner of the parent directory. The quota structure is possibly
935 * deleted only on iput => outside of this transaction */
937 JOURNAL_PER_BALANCE_CNT * 2 + 2 +
938 4 * REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb);
940 reiserfs_write_lock(dir->i_sb);
941 retval = journal_begin(&th, dir->i_sb, jbegin_count);
945 de.de_gen_number_bit_string = NULL;
947 reiserfs_find_entry(dir, dentry->d_name.name, dentry->d_name.len,
948 &path, &de)) == NAME_NOT_FOUND) {
951 } else if (retval == IO_ERROR) {
956 reiserfs_update_inode_transaction(inode);
957 reiserfs_update_inode_transaction(dir);
959 if (de.de_objectid != inode->i_ino) {
960 // FIXME: compare key of an object and a key found in the
966 if (!inode->i_nlink) {
967 reiserfs_warning(inode->i_sb, "reiserfs-7042",
968 "deleting nonexistent file (%lu), %d",
969 inode->i_ino, inode->i_nlink);
976 * we schedule before doing the add_save_link call, save the link
977 * count so we don't race
979 savelink = inode->i_nlink;
982 reiserfs_cut_from_item(&th, &path, &(de.de_entry_key), dir, NULL,
988 inode->i_ctime = CURRENT_TIME_SEC;
989 reiserfs_update_sd(&th, inode);
991 dir->i_size -= (de.de_entrylen + DEH_SIZE);
992 dir->i_ctime = dir->i_mtime = CURRENT_TIME_SEC;
993 reiserfs_update_sd(&th, dir);
996 /* prevent file from getting lost */
997 add_save_link(&th, inode, 0 /* not truncate */ );
999 retval = journal_end(&th, dir->i_sb, jbegin_count);
1000 reiserfs_check_path(&path);
1001 reiserfs_write_unlock(dir->i_sb);
1006 err = journal_end(&th, dir->i_sb, jbegin_count);
1007 reiserfs_check_path(&path);
1011 reiserfs_write_unlock(dir->i_sb);
1015 static int reiserfs_symlink(struct inode *parent_dir,
1016 struct dentry *dentry, const char *symname)
1019 struct inode *inode;
1022 struct reiserfs_transaction_handle th;
1023 struct reiserfs_security_handle security;
1024 int mode = S_IFLNK | S_IRWXUGO;
1025 /* We need blocks for transaction + (user+group)*(quotas for new inode + update of quota for directory owner) */
1027 JOURNAL_PER_BALANCE_CNT * 3 +
1028 2 * (REISERFS_QUOTA_INIT_BLOCKS(parent_dir->i_sb) +
1029 REISERFS_QUOTA_TRANS_BLOCKS(parent_dir->i_sb));
1031 if (!(inode = new_inode(parent_dir->i_sb))) {
1034 new_inode_init(inode, parent_dir, mode);
1036 retval = reiserfs_security_init(parent_dir, inode, &security);
1038 drop_new_inode(inode);
1041 jbegin_count += retval;
1043 reiserfs_write_lock(parent_dir->i_sb);
1044 item_len = ROUND_UP(strlen(symname));
1045 if (item_len > MAX_DIRECT_ITEM_LEN(parent_dir->i_sb->s_blocksize)) {
1046 retval = -ENAMETOOLONG;
1047 drop_new_inode(inode);
1051 name = kmalloc(item_len, GFP_NOFS);
1053 drop_new_inode(inode);
1057 memcpy(name, symname, strlen(symname));
1058 padd_item(name, item_len, strlen(symname));
1060 retval = journal_begin(&th, parent_dir->i_sb, jbegin_count);
1062 drop_new_inode(inode);
1068 reiserfs_new_inode(&th, parent_dir, mode, name, strlen(symname),
1069 dentry, inode, &security);
1071 if (retval) { /* reiserfs_new_inode iputs for us */
1075 reiserfs_update_inode_transaction(inode);
1076 reiserfs_update_inode_transaction(parent_dir);
1078 inode->i_op = &reiserfs_symlink_inode_operations;
1079 inode->i_mapping->a_ops = &reiserfs_address_space_operations;
1081 // must be sure this inode is written with this transaction
1083 //reiserfs_update_sd (&th, inode, READ_BLOCKS);
1085 retval = reiserfs_add_entry(&th, parent_dir, dentry->d_name.name,
1086 dentry->d_name.len, inode, 1 /*visible */ );
1090 reiserfs_update_sd(&th, inode);
1091 err = journal_end(&th, parent_dir->i_sb, jbegin_count);
1094 unlock_new_inode(inode);
1099 d_instantiate(dentry, inode);
1100 unlock_new_inode(inode);
1101 retval = journal_end(&th, parent_dir->i_sb, jbegin_count);
1103 reiserfs_write_unlock(parent_dir->i_sb);
1107 static int reiserfs_link(struct dentry *old_dentry, struct inode *dir,
1108 struct dentry *dentry)
1111 struct inode *inode = old_dentry->d_inode;
1112 struct reiserfs_transaction_handle th;
1113 /* We need blocks for transaction + update of quotas for the owners of the directory */
1115 JOURNAL_PER_BALANCE_CNT * 3 +
1116 2 * REISERFS_QUOTA_TRANS_BLOCKS(dir->i_sb);
1118 reiserfs_write_lock(dir->i_sb);
1119 if (inode->i_nlink >= REISERFS_LINK_MAX) {
1120 //FIXME: sd_nlink is 32 bit for new files
1121 reiserfs_write_unlock(dir->i_sb);
1124 if (inode->i_nlink == 0) {
1125 reiserfs_write_unlock(dir->i_sb);
1129 /* inc before scheduling so reiserfs_unlink knows we are here */
1132 retval = journal_begin(&th, dir->i_sb, jbegin_count);
1135 reiserfs_write_unlock(dir->i_sb);
1139 /* create new entry */
1141 reiserfs_add_entry(&th, dir, dentry->d_name.name,
1142 dentry->d_name.len, inode, 1 /*visible */ );
1144 reiserfs_update_inode_transaction(inode);
1145 reiserfs_update_inode_transaction(dir);
1150 err = journal_end(&th, dir->i_sb, jbegin_count);
1151 reiserfs_write_unlock(dir->i_sb);
1152 return err ? err : retval;
1155 inode->i_ctime = CURRENT_TIME_SEC;
1156 reiserfs_update_sd(&th, inode);
1158 atomic_inc(&inode->i_count);
1159 d_instantiate(dentry, inode);
1160 retval = journal_end(&th, dir->i_sb, jbegin_count);
1161 reiserfs_write_unlock(dir->i_sb);
1165 /* de contains information pointing to an entry which */
1166 static int de_still_valid(const char *name, int len,
1167 struct reiserfs_dir_entry *de)
1169 struct reiserfs_dir_entry tmp = *de;
1171 // recalculate pointer to name and name length
1172 set_de_name_and_namelen(&tmp);
1173 // FIXME: could check more
1174 if (tmp.de_namelen != len || memcmp(name, de->de_name, len))
1179 static int entry_points_to_object(const char *name, int len,
1180 struct reiserfs_dir_entry *de,
1181 struct inode *inode)
1183 if (!de_still_valid(name, len, de))
1187 if (!de_visible(de->de_deh + de->de_entry_num))
1188 reiserfs_panic(inode->i_sb, "vs-7042",
1189 "entry must be visible");
1190 return (de->de_objectid == inode->i_ino) ? 1 : 0;
1193 /* this must be added hidden entry */
1194 if (de_visible(de->de_deh + de->de_entry_num))
1195 reiserfs_panic(NULL, "vs-7043", "entry must be visible");
1200 /* sets key of objectid the entry has to point to */
1201 static void set_ino_in_dir_entry(struct reiserfs_dir_entry *de,
1202 struct reiserfs_key *key)
1204 /* JDM These operations are endian safe - both are le */
1205 de->de_deh[de->de_entry_num].deh_dir_id = key->k_dir_id;
1206 de->de_deh[de->de_entry_num].deh_objectid = key->k_objectid;
1210 * process, that is going to call fix_nodes/do_balance must hold only
1211 * one path. If it holds 2 or more, it can get into endless waiting in
1212 * get_empty_nodes or its clones
1214 static int reiserfs_rename(struct inode *old_dir, struct dentry *old_dentry,
1215 struct inode *new_dir, struct dentry *new_dentry)
1218 INITIALIZE_PATH(old_entry_path);
1219 INITIALIZE_PATH(new_entry_path);
1220 INITIALIZE_PATH(dot_dot_entry_path);
1221 struct item_head new_entry_ih, old_entry_ih, dot_dot_ih;
1222 struct reiserfs_dir_entry old_de, new_de, dot_dot_de;
1223 struct inode *old_inode, *new_dentry_inode;
1224 struct reiserfs_transaction_handle th;
1226 umode_t old_inode_mode;
1227 unsigned long savelink = 1;
1228 struct timespec ctime;
1230 /* three balancings: (1) old name removal, (2) new name insertion
1231 and (3) maybe "save" link insertion
1232 stat data updates: (1) old directory,
1233 (2) new directory and (3) maybe old object stat data (when it is
1234 directory) and (4) maybe stat data of object to which new entry
1235 pointed initially and (5) maybe block containing ".." of
1237 quota updates: two parent directories */
1239 JOURNAL_PER_BALANCE_CNT * 3 + 5 +
1240 4 * REISERFS_QUOTA_TRANS_BLOCKS(old_dir->i_sb);
1242 old_inode = old_dentry->d_inode;
1243 new_dentry_inode = new_dentry->d_inode;
1245 // make sure, that oldname still exists and points to an object we
1246 // are going to rename
1247 old_de.de_gen_number_bit_string = NULL;
1248 reiserfs_write_lock(old_dir->i_sb);
1250 reiserfs_find_entry(old_dir, old_dentry->d_name.name,
1251 old_dentry->d_name.len, &old_entry_path,
1253 pathrelse(&old_entry_path);
1254 if (retval == IO_ERROR) {
1255 reiserfs_write_unlock(old_dir->i_sb);
1259 if (retval != NAME_FOUND || old_de.de_objectid != old_inode->i_ino) {
1260 reiserfs_write_unlock(old_dir->i_sb);
1264 old_inode_mode = old_inode->i_mode;
1265 if (S_ISDIR(old_inode_mode)) {
1266 // make sure, that directory being renamed has correct ".."
1267 // and that its new parent directory has not too many links
1270 if (new_dentry_inode) {
1271 if (!reiserfs_empty_dir(new_dentry_inode)) {
1272 reiserfs_write_unlock(old_dir->i_sb);
1277 /* directory is renamed, its parent directory will be changed,
1278 ** so find ".." entry
1280 dot_dot_de.de_gen_number_bit_string = NULL;
1282 reiserfs_find_entry(old_inode, "..", 2, &dot_dot_entry_path,
1284 pathrelse(&dot_dot_entry_path);
1285 if (retval != NAME_FOUND) {
1286 reiserfs_write_unlock(old_dir->i_sb);
1290 /* inode number of .. must equal old_dir->i_ino */
1291 if (dot_dot_de.de_objectid != old_dir->i_ino) {
1292 reiserfs_write_unlock(old_dir->i_sb);
1297 retval = journal_begin(&th, old_dir->i_sb, jbegin_count);
1299 reiserfs_write_unlock(old_dir->i_sb);
1303 /* add new entry (or find the existing one) */
1305 reiserfs_add_entry(&th, new_dir, new_dentry->d_name.name,
1306 new_dentry->d_name.len, old_inode, 0);
1307 if (retval == -EEXIST) {
1308 if (!new_dentry_inode) {
1309 reiserfs_panic(old_dir->i_sb, "vs-7050",
1310 "new entry is found, new inode == 0");
1312 } else if (retval) {
1313 int err = journal_end(&th, old_dir->i_sb, jbegin_count);
1314 reiserfs_write_unlock(old_dir->i_sb);
1315 return err ? err : retval;
1318 reiserfs_update_inode_transaction(old_dir);
1319 reiserfs_update_inode_transaction(new_dir);
1321 /* this makes it so an fsync on an open fd for the old name will
1322 ** commit the rename operation
1324 reiserfs_update_inode_transaction(old_inode);
1326 if (new_dentry_inode)
1327 reiserfs_update_inode_transaction(new_dentry_inode);
1330 // look for old name using corresponding entry key (found by reiserfs_find_entry)
1332 search_by_entry_key(new_dir->i_sb, &old_de.de_entry_key,
1334 &old_de)) != NAME_FOUND) {
1335 pathrelse(&old_entry_path);
1336 journal_end(&th, old_dir->i_sb, jbegin_count);
1337 reiserfs_write_unlock(old_dir->i_sb);
1341 copy_item_head(&old_entry_ih, get_ih(&old_entry_path));
1343 reiserfs_prepare_for_journal(old_inode->i_sb, old_de.de_bh, 1);
1345 // look for new name by reiserfs_find_entry
1346 new_de.de_gen_number_bit_string = NULL;
1348 reiserfs_find_entry(new_dir, new_dentry->d_name.name,
1349 new_dentry->d_name.len, &new_entry_path,
1351 // reiserfs_add_entry should not return IO_ERROR, because it is called with essentially same parameters from
1352 // reiserfs_add_entry above, and we'll catch any i/o errors before we get here.
1353 if (retval != NAME_FOUND_INVISIBLE && retval != NAME_FOUND) {
1354 pathrelse(&new_entry_path);
1355 pathrelse(&old_entry_path);
1356 journal_end(&th, old_dir->i_sb, jbegin_count);
1357 reiserfs_write_unlock(old_dir->i_sb);
1361 copy_item_head(&new_entry_ih, get_ih(&new_entry_path));
1363 reiserfs_prepare_for_journal(old_inode->i_sb, new_de.de_bh, 1);
1365 if (S_ISDIR(old_inode->i_mode)) {
1367 search_by_entry_key(new_dir->i_sb,
1368 &dot_dot_de.de_entry_key,
1369 &dot_dot_entry_path,
1370 &dot_dot_de)) != NAME_FOUND) {
1371 pathrelse(&dot_dot_entry_path);
1372 pathrelse(&new_entry_path);
1373 pathrelse(&old_entry_path);
1374 journal_end(&th, old_dir->i_sb, jbegin_count);
1375 reiserfs_write_unlock(old_dir->i_sb);
1378 copy_item_head(&dot_dot_ih,
1379 get_ih(&dot_dot_entry_path));
1380 // node containing ".." gets into transaction
1381 reiserfs_prepare_for_journal(old_inode->i_sb,
1382 dot_dot_de.de_bh, 1);
1384 /* we should check seals here, not do
1385 this stuff, yes? Then, having
1386 gathered everything into RAM we
1387 should lock the buffers, yes? -Hans */
1388 /* probably. our rename needs to hold more
1389 ** than one path at once. The seals would
1390 ** have to be written to deal with multi-path
1393 /* sanity checking before doing the rename - avoid races many
1394 ** of the above checks could have scheduled. We have to be
1395 ** sure our items haven't been shifted by another process.
1397 if (item_moved(&new_entry_ih, &new_entry_path) ||
1398 !entry_points_to_object(new_dentry->d_name.name,
1399 new_dentry->d_name.len,
1400 &new_de, new_dentry_inode) ||
1401 item_moved(&old_entry_ih, &old_entry_path) ||
1402 !entry_points_to_object(old_dentry->d_name.name,
1403 old_dentry->d_name.len,
1404 &old_de, old_inode)) {
1405 reiserfs_restore_prepared_buffer(old_inode->i_sb,
1407 reiserfs_restore_prepared_buffer(old_inode->i_sb,
1409 if (S_ISDIR(old_inode_mode))
1410 reiserfs_restore_prepared_buffer(old_inode->
1416 if (S_ISDIR(old_inode_mode)) {
1417 if (item_moved(&dot_dot_ih, &dot_dot_entry_path) ||
1418 !entry_points_to_object("..", 2, &dot_dot_de,
1420 reiserfs_restore_prepared_buffer(old_inode->
1423 reiserfs_restore_prepared_buffer(old_inode->
1426 reiserfs_restore_prepared_buffer(old_inode->
1434 RFALSE(S_ISDIR(old_inode_mode) &&
1435 !buffer_journal_prepared(dot_dot_de.de_bh), "");
1440 /* ok, all the changes can be done in one fell swoop when we
1441 have claimed all the buffers needed. */
1443 mark_de_visible(new_de.de_deh + new_de.de_entry_num);
1444 set_ino_in_dir_entry(&new_de, INODE_PKEY(old_inode));
1445 journal_mark_dirty(&th, old_dir->i_sb, new_de.de_bh);
1447 mark_de_hidden(old_de.de_deh + old_de.de_entry_num);
1448 journal_mark_dirty(&th, old_dir->i_sb, old_de.de_bh);
1449 ctime = CURRENT_TIME_SEC;
1450 old_dir->i_ctime = old_dir->i_mtime = ctime;
1451 new_dir->i_ctime = new_dir->i_mtime = ctime;
1452 /* thanks to Alex Adriaanse <alex_a@caltech.edu> for patch which adds ctime update of
1454 old_inode->i_ctime = ctime;
1456 if (new_dentry_inode) {
1457 // adjust link number of the victim
1458 if (S_ISDIR(new_dentry_inode->i_mode)) {
1459 clear_nlink(new_dentry_inode);
1461 drop_nlink(new_dentry_inode);
1463 new_dentry_inode->i_ctime = ctime;
1464 savelink = new_dentry_inode->i_nlink;
1467 if (S_ISDIR(old_inode_mode)) {
1468 /* adjust ".." of renamed directory */
1469 set_ino_in_dir_entry(&dot_dot_de, INODE_PKEY(new_dir));
1470 journal_mark_dirty(&th, new_dir->i_sb, dot_dot_de.de_bh);
1472 if (!new_dentry_inode)
1473 /* there (in new_dir) was no directory, so it got new link
1474 (".." of renamed directory) */
1475 INC_DIR_INODE_NLINK(new_dir);
1477 /* old directory lost one link - ".. " of renamed directory */
1478 DEC_DIR_INODE_NLINK(old_dir);
1480 // looks like in 2.3.99pre3 brelse is atomic. so we can use pathrelse
1481 pathrelse(&new_entry_path);
1482 pathrelse(&dot_dot_entry_path);
1484 // FIXME: this reiserfs_cut_from_item's return value may screw up
1485 // anybody, but it will panic if will not be able to find the
1486 // entry. This needs one more clean up
1487 if (reiserfs_cut_from_item
1488 (&th, &old_entry_path, &(old_de.de_entry_key), old_dir, NULL,
1490 reiserfs_error(old_dir->i_sb, "vs-7060",
1491 "couldn't not cut old name. Fsck later?");
1493 old_dir->i_size -= DEH_SIZE + old_de.de_entrylen;
1495 reiserfs_update_sd(&th, old_dir);
1496 reiserfs_update_sd(&th, new_dir);
1497 reiserfs_update_sd(&th, old_inode);
1499 if (new_dentry_inode) {
1501 add_save_link(&th, new_dentry_inode,
1502 0 /* not truncate */ );
1503 reiserfs_update_sd(&th, new_dentry_inode);
1506 retval = journal_end(&th, old_dir->i_sb, jbegin_count);
1507 reiserfs_write_unlock(old_dir->i_sb);
1512 * directories can handle most operations...
1514 const struct inode_operations reiserfs_dir_inode_operations = {
1515 //&reiserfs_dir_operations, /* default_file_ops */
1516 .create = reiserfs_create,
1517 .lookup = reiserfs_lookup,
1518 .link = reiserfs_link,
1519 .unlink = reiserfs_unlink,
1520 .symlink = reiserfs_symlink,
1521 .mkdir = reiserfs_mkdir,
1522 .rmdir = reiserfs_rmdir,
1523 .mknod = reiserfs_mknod,
1524 .rename = reiserfs_rename,
1525 .setattr = reiserfs_setattr,
1526 .setxattr = reiserfs_setxattr,
1527 .getxattr = reiserfs_getxattr,
1528 .listxattr = reiserfs_listxattr,
1529 .removexattr = reiserfs_removexattr,
1530 .permission = reiserfs_permission,
1534 * symlink operations.. same as page_symlink_inode_operations, with xattr
1537 const struct inode_operations reiserfs_symlink_inode_operations = {
1538 .readlink = generic_readlink,
1539 .follow_link = page_follow_link_light,
1540 .put_link = page_put_link,
1541 .setattr = reiserfs_setattr,
1542 .setxattr = reiserfs_setxattr,
1543 .getxattr = reiserfs_getxattr,
1544 .listxattr = reiserfs_listxattr,
1545 .removexattr = reiserfs_removexattr,
1546 .permission = reiserfs_permission,
1551 * special file operations.. just xattr/acl stuff
1553 const struct inode_operations reiserfs_special_inode_operations = {
1554 .setattr = reiserfs_setattr,
1555 .setxattr = reiserfs_setxattr,
1556 .getxattr = reiserfs_getxattr,
1557 .listxattr = reiserfs_listxattr,
1558 .removexattr = reiserfs_removexattr,
1559 .permission = reiserfs_permission,