aboutsummaryrefslogtreecommitdiffstats
path: root/fs/sysfs/inode.c
diff options
context:
space:
mode:
authorTejun Heo <htejun@gmail.com>2007-06-13 14:45:18 -0400
committerGreg Kroah-Hartman <gregkh@suse.de>2007-07-11 19:09:07 -0400
commit0c73f18b7d95de8a007039337063a770b5fc8e7a (patch)
treecf3b6f274139b170136219918dd679f2397e69f6 /fs/sysfs/inode.c
parent8619f979898397582e366877fd5feeba7560d70c (diff)
sysfs: use singly-linked list for sysfs_dirent tree
Make sysfs_dirent use singly linked list for its tree structure. sysfs_link_sibling() and sysfs_unlink_sibling() functions are added to handle simpler cases. It adds some complexity and cpu cycle overhead but reduced memory footprint is worthwhile on big machines. This change reduces the sizeof sysfs_dirent from 104 to 88 on 64bit and from 60 to 52 on 32bit. Signed-off-by: Tejun Heo <htejun@gmail.com> Signed-off-by: Greg Kroah-Hartman <gregkh@suse.de>
Diffstat (limited to 'fs/sysfs/inode.c')
-rw-r--r--fs/sysfs/inode.c12
1 files changed, 7 insertions, 5 deletions
diff --git a/fs/sysfs/inode.c b/fs/sysfs/inode.c
index 3eab9c46a71b..732fd7f371e0 100644
--- a/fs/sysfs/inode.c
+++ b/fs/sysfs/inode.c
@@ -284,8 +284,8 @@ void sysfs_drop_dentry(struct sysfs_dirent *sd)
284 284
285int sysfs_hash_and_remove(struct dentry * dir, const char * name) 285int sysfs_hash_and_remove(struct dentry * dir, const char * name)
286{ 286{
287 struct sysfs_dirent * sd; 287 struct sysfs_dirent **pos, *sd;
288 struct sysfs_dirent * parent_sd; 288 struct sysfs_dirent *parent_sd = dir->d_fsdata;
289 int found = 0; 289 int found = 0;
290 290
291 if (!dir) 291 if (!dir)
@@ -295,13 +295,15 @@ int sysfs_hash_and_remove(struct dentry * dir, const char * name)
295 /* no inode means this hasn't been made visible yet */ 295 /* no inode means this hasn't been made visible yet */
296 return -ENOENT; 296 return -ENOENT;
297 297
298 parent_sd = dir->d_fsdata;
299 mutex_lock_nested(&dir->d_inode->i_mutex, I_MUTEX_PARENT); 298 mutex_lock_nested(&dir->d_inode->i_mutex, I_MUTEX_PARENT);
300 list_for_each_entry(sd, &parent_sd->s_children, s_sibling) { 299 for (pos = &parent_sd->s_children; *pos; pos = &(*pos)->s_sibling) {
300 sd = *pos;
301
301 if (!sd->s_type) 302 if (!sd->s_type)
302 continue; 303 continue;
303 if (!strcmp(sd->s_name, name)) { 304 if (!strcmp(sd->s_name, name)) {
304 list_del_init(&sd->s_sibling); 305 *pos = sd->s_sibling;
306 sd->s_sibling = NULL;
305 found = 1; 307 found = 1;
306 break; 308 break;
307 } 309 }