fs/inode.c

/* */
This source file includes following definitions.
hashfn
insert_inode_free
remove_inode_free
insert_inode_hash
remove_inode_hash
put_last_free
grow_inodes
inode_init
wait_on_inode
lock_inode
unlock_inode
clear_inode
fs_may_mount
fs_may_umount
fs_may_remount_ro
write_inode
read_inode
inode_change_ok
inode_setattr
notify_change
bmap
invalidate_inodes
sync_inodes
iput
get_empty_inode
get_pipe_inode
__iget
__wait_on_inode
   1 /*
   2  *  linux/fs/inode.c
   3  *
   4  *  Copyright (C) 1991, 1992  Linus Torvalds
   5  */
   6 
   7 #include <linux/stat.h>
   8 #include <linux/sched.h>
   9 #include <linux/kernel.h>
  10 #include <linux/mm.h>
  11 #include <linux/string.h>
  12 
  13 #include <asm/system.h>
  14 
  15 static struct inode_hash_entry {
  16         struct inode * inode;
  17         int updating;
  18 } hash_table[NR_IHASH];
  19 
  20 static struct inode * first_inode;
  21 static struct wait_queue * inode_wait = NULL;
  22 static int nr_inodes = 0, nr_free_inodes = 0;
  23 
  24 static inline int const hashfn(kdev_t dev, unsigned int i)
     /*  */
  25 {
  26         return (HASHDEV(dev) ^ i) % NR_IHASH;
  27 }
  28 
  29 static inline struct inode_hash_entry * const hash(kdev_t dev, int i)
  30 {
  31         return hash_table + hashfn(dev, i);
  32 }
  33 
  34 static void insert_inode_free(struct inode *inode)
     /*  */
  35 {
  36         inode->i_next = first_inode;
  37         inode->i_prev = first_inode->i_prev;
  38         inode->i_next->i_prev = inode;
  39         inode->i_prev->i_next = inode;
  40         first_inode = inode;
  41 }
  42 
  43 static void remove_inode_free(struct inode *inode)
     /*  */
  44 {
  45         if (first_inode == inode)
  46                 first_inode = first_inode->i_next;
  47         if (inode->i_next)
  48                 inode->i_next->i_prev = inode->i_prev;
  49         if (inode->i_prev)
  50                 inode->i_prev->i_next = inode->i_next;
  51         inode->i_next = inode->i_prev = NULL;
  52 }
  53 
  54 void insert_inode_hash(struct inode *inode)
     /*  */
  55 {
  56         struct inode_hash_entry *h;
  57         h = hash(inode->i_dev, inode->i_ino);
  58 
  59         inode->i_hash_next = h->inode;
  60         inode->i_hash_prev = NULL;
  61         if (inode->i_hash_next)
  62                 inode->i_hash_next->i_hash_prev = inode;
  63         h->inode = inode;
  64 }
  65 
  66 static void remove_inode_hash(struct inode *inode)
     /*  */
  67 {
  68         struct inode_hash_entry *h;
  69         h = hash(inode->i_dev, inode->i_ino);
  70 
  71         if (h->inode == inode)
  72                 h->inode = inode->i_hash_next;
  73         if (inode->i_hash_next)
  74                 inode->i_hash_next->i_hash_prev = inode->i_hash_prev;
  75         if (inode->i_hash_prev)
  76                 inode->i_hash_prev->i_hash_next = inode->i_hash_next;
  77         inode->i_hash_prev = inode->i_hash_next = NULL;
  78 }
  79 
  80 static void put_last_free(struct inode *inode)
     /*  */
  81 {
  82         remove_inode_free(inode);
  83         inode->i_prev = first_inode->i_prev;
  84         inode->i_prev->i_next = inode;
  85         inode->i_next = first_inode;
  86         inode->i_next->i_prev = inode;
  87 }
  88 
  89 void grow_inodes(void)
     /*  */
  90 {
  91         struct inode * inode;
  92         int i;
  93 
  94         if (!(inode = (struct inode*) get_free_page(GFP_KERNEL)))
  95                 return;
  96 
  97         i=PAGE_SIZE / sizeof(struct inode);
  98         nr_inodes += i;
  99         nr_free_inodes += i;
 100 
 101         if (!first_inode)
 102                 inode->i_next = inode->i_prev = first_inode = inode++, i--;
 103 
 104         for ( ; i ; i-- )
 105                 insert_inode_free(inode++);
 106 }
 107 
 108 unsigned long inode_init(unsigned long start, unsigned long end)
     /*  */
 109 {
 110         memset(hash_table, 0, sizeof(hash_table));
 111         first_inode = NULL;
 112         return start;
 113 }
 114 
 115 static void __wait_on_inode(struct inode *);
 116 
 117 static inline void wait_on_inode(struct inode * inode)
     /*  */
 118 {
 119         if (inode->i_lock)
 120                 __wait_on_inode(inode);
 121 }
 122 
 123 static inline void lock_inode(struct inode * inode)
     /*  */
 124 {
 125         wait_on_inode(inode);
 126         inode->i_lock = 1;
 127 }
 128 
 129 static inline void unlock_inode(struct inode * inode)
     /*  */
 130 {
 131         inode->i_lock = 0;
 132         wake_up(&inode->i_wait);
 133 }
 134 
 135 /*
 136  * Note that we don't want to disturb any wait-queues when we discard
 137  * an inode.
 138  *
 139  * Argghh. Got bitten by a gcc problem with inlining: no way to tell
 140  * the compiler that the inline asm function 'memset' changes 'inode'.
 141  * I've been searching for the bug for days, and was getting desperate.
 142  * Finally looked at the assembler output... Grrr.
 143  *
 144  * The solution is the weird use of 'volatile'. Ho humm. Have to report
 145  * it to the gcc lists, and hope we can do this more cleanly some day..
 146  */
 147 void clear_inode(struct inode * inode)
     /*  */
 148 {
 149         struct wait_queue * wait;
 150 
 151         wait_on_inode(inode);
 152         remove_inode_hash(inode);
 153         remove_inode_free(inode);
 154         wait = ((volatile struct inode *) inode)->i_wait;
 155         if (inode->i_count)
 156                 nr_free_inodes++;
 157         memset(inode,0,sizeof(*inode));
 158         ((volatile struct inode *) inode)->i_wait = wait;
 159         insert_inode_free(inode);
 160 }
 161 
 162 int fs_may_mount(kdev_t dev)
     /*  */
 163 {
 164         struct inode * inode, * next;
 165         int i;
 166 
 167         next = first_inode;
 168         for (i = nr_inodes ; i > 0 ; i--) {
 169                 inode = next;
 170                 next = inode->i_next;   /* clear_inode() changes the queues.. */
 171                 if (inode->i_dev != dev)
 172                         continue;
 173                 if (inode->i_count || inode->i_dirt || inode->i_lock)
 174                         return 0;
 175                 clear_inode(inode);
 176         }
 177         return 1;
 178 }
 179 
 180 int fs_may_umount(kdev_t dev, struct inode * mount_root)
     /*  */
 181 {
 182         struct inode * inode;
 183         int i;
 184 
 185         inode = first_inode;
 186         for (i=0 ; i < nr_inodes ; i++, inode = inode->i_next) {
 187                 if (inode->i_dev != dev || !inode->i_count)
 188                         continue;
 189                 if (inode == mount_root && inode->i_count == 1)
 190                         continue;
 191                 return 0;
 192         }
 193         return 1;
 194 }
 195 
 196 int fs_may_remount_ro(kdev_t dev)
     /*  */
 197 {
 198         struct file * file;
 199         int i;
 200 
 201         /* Check that no files are currently opened for writing. */
 202         for (file = first_file, i=0; i<nr_files; i++, file=file->f_next) {
 203                 if (!file->f_count || !file->f_inode ||
 204                     file->f_inode->i_dev != dev)
 205                         continue;
 206                 if (S_ISREG(file->f_inode->i_mode) && (file->f_mode & 2))
 207                         return 0;
 208         }
 209         return 1;
 210 }
 211 
 212 static void write_inode(struct inode * inode)
     /*  */
 213 {
 214         if (!inode->i_dirt)
 215                 return;
 216         wait_on_inode(inode);
 217         if (!inode->i_dirt)
 218                 return;
 219         if (!inode->i_sb || !inode->i_sb->s_op || !inode->i_sb->s_op->write_inode) {
 220                 inode->i_dirt = 0;
 221                 return;
 222         }
 223         inode->i_lock = 1;      
 224         inode->i_sb->s_op->write_inode(inode);
 225         unlock_inode(inode);
 226 }
 227 
 228 static void read_inode(struct inode * inode)
     /*  */
 229 {
 230         lock_inode(inode);
 231         if (inode->i_sb && inode->i_sb->s_op && inode->i_sb->s_op->read_inode)
 232                 inode->i_sb->s_op->read_inode(inode);
 233         unlock_inode(inode);
 234 }
 235 
 236 /* POSIX UID/GID verification for setting inode attributes */
 237 int inode_change_ok(struct inode *inode, struct iattr *attr)
     /*  */
 238 {
 239         /* Make sure a caller can chown */
 240         if ((attr->ia_valid & ATTR_UID) &&
 241             (current->fsuid != inode->i_uid ||
 242              attr->ia_uid != inode->i_uid) && !fsuser())
 243                 return -EPERM;
 244 
 245         /* Make sure caller can chgrp */
 246         if ((attr->ia_valid & ATTR_GID) &&
 247             (!in_group_p(attr->ia_gid) && attr->ia_gid != inode->i_gid) &&
 248             !fsuser())
 249                 return -EPERM;
 250 
 251         /* Make sure a caller can chmod */
 252         if (attr->ia_valid & ATTR_MODE) {
 253                 if ((current->fsuid != inode->i_uid) && !fsuser())
 254                         return -EPERM;
 255                 /* Also check the setgid bit! */
 256                 if (!fsuser() && !in_group_p((attr->ia_valid & ATTR_GID) ? attr->ia_gid :
 257                                              inode->i_gid))
 258                         attr->ia_mode &= ~S_ISGID;
 259         }
 260 
 261         /* Check for setting the inode time */
 262         if ((attr->ia_valid & ATTR_ATIME_SET) &&
 263             ((current->fsuid != inode->i_uid) && !fsuser()))
 264                 return -EPERM;
 265         if ((attr->ia_valid & ATTR_MTIME_SET) &&
 266             ((current->fsuid != inode->i_uid) && !fsuser()))
 267                 return -EPERM;
 268 
 269 
 270         return 0;
 271 }
 272 
 273 /*
 274  * Set the appropriate attributes from an attribute structure into
 275  * the inode structure.
 276  */
 277 void inode_setattr(struct inode *inode, struct iattr *attr)
     /*  */
 278 {
 279         if (attr->ia_valid & ATTR_UID)
 280                 inode->i_uid = attr->ia_uid;
 281         if (attr->ia_valid & ATTR_GID)
 282                 inode->i_gid = attr->ia_gid;
 283         if (attr->ia_valid & ATTR_SIZE)
 284                 inode->i_size = attr->ia_size;
 285         if (attr->ia_valid & ATTR_ATIME)
 286                 inode->i_atime = attr->ia_atime;
 287         if (attr->ia_valid & ATTR_MTIME)
 288                 inode->i_mtime = attr->ia_mtime;
 289         if (attr->ia_valid & ATTR_CTIME)
 290                 inode->i_ctime = attr->ia_ctime;
 291         if (attr->ia_valid & ATTR_MODE) {
 292                 inode->i_mode = attr->ia_mode;
 293                 if (!fsuser() && !in_group_p(inode->i_gid))
 294                         inode->i_mode &= ~S_ISGID;
 295         }
 296         inode->i_dirt = 1;
 297 }
 298 
 299 /*
 300  * notify_change is called for inode-changing operations such as
 301  * chown, chmod, utime, and truncate.  It is guaranteed (unlike
 302  * write_inode) to be called from the context of the user requesting
 303  * the change.  It is not called for ordinary access-time updates.
 304  * NFS uses this to get the authentication correct.  -- jrs
 305  */
 306 
 307 int notify_change(struct inode * inode, struct iattr *attr)
     /*  */
 308 {
 309         int retval;
 310 
 311         if (inode->i_sb && inode->i_sb->s_op  &&
 312             inode->i_sb->s_op->notify_change) 
 313                 return inode->i_sb->s_op->notify_change(inode, attr);
 314 
 315         if ((retval = inode_change_ok(inode, attr)) != 0)
 316                 return retval;
 317 
 318         inode_setattr(inode, attr);
 319         return 0;
 320 }
 321 
 322 /*
 323  * bmap is needed for demand-loading and paging: if this function
 324  * doesn't exist for a filesystem, then those things are impossible:
 325  * executables cannot be run from the filesystem etc...
 326  *
 327  * This isn't as bad as it sounds: the read-routines might still work,
 328  * so the filesystem would be otherwise ok (for example, you might have
 329  * a DOS filesystem, which doesn't lend itself to bmap very well, but
 330  * you could still transfer files to/from the filesystem)
 331  */
 332 int bmap(struct inode * inode, int block)
     /*  */
 333 {
 334         if (inode->i_op && inode->i_op->bmap)
 335                 return inode->i_op->bmap(inode,block);
 336         return 0;
 337 }
 338 
 339 void invalidate_inodes(kdev_t dev)
     /*  */
 340 {
 341         struct inode * inode, * next;
 342         int i;
 343 
 344         next = first_inode;
 345         for(i = nr_inodes ; i > 0 ; i--) {
 346                 inode = next;
 347                 next = inode->i_next;           /* clear_inode() changes the queues.. */
 348                 if (inode->i_dev != dev)
 349                         continue;
 350                 if (inode->i_count || inode->i_dirt || inode->i_lock) {
 351                         printk("VFS: inode busy on removed device %s\n",
 352                                kdevname(dev));
 353                         continue;
 354                 }
 355                 clear_inode(inode);
 356         }
 357 }
 358 
 359 void sync_inodes(kdev_t dev)
     /*  */
 360 {
 361         int i;
 362         struct inode * inode;
 363 
 364         inode = first_inode;
 365         for(i = 0; i < nr_inodes*2; i++, inode = inode->i_next) {
 366                 if (dev && inode->i_dev != dev)
 367                         continue;
 368                 wait_on_inode(inode);
 369                 if (inode->i_dirt)
 370                         write_inode(inode);
 371         }
 372 }
 373 
 374 void iput(struct inode * inode)
     /*  */
 375 {
 376         if (!inode)
 377                 return;
 378         wait_on_inode(inode);
 379         if (!inode->i_count) {
 380                 printk("VFS: iput: trying to free free inode\n");
 381                 printk("VFS: device %s, inode %lu, mode=0%07o\n",
 382                         kdevname(inode->i_rdev), inode->i_ino, inode->i_mode);
 383                 return;
 384         }
 385         if (inode->i_pipe)
 386                 wake_up_interruptible(&PIPE_WAIT(*inode));
 387 repeat:
 388         if (inode->i_count>1) {
 389                 inode->i_count--;
 390                 return;
 391         }
 392         wake_up(&inode_wait);
 393         if (inode->i_pipe) {
 394                 unsigned long page = (unsigned long) PIPE_BASE(*inode);
 395                 PIPE_BASE(*inode) = NULL;
 396                 free_page(page);
 397         }
 398         if (inode->i_sb && inode->i_sb->s_op && inode->i_sb->s_op->put_inode) {
 399                 inode->i_sb->s_op->put_inode(inode);
 400                 if (!inode->i_nlink)
 401                         return;
 402         }
 403         if (inode->i_dirt) {
 404                 write_inode(inode);     /* we can sleep - so do again */
 405                 wait_on_inode(inode);
 406                 goto repeat;
 407         }
 408         inode->i_count--;
 409         if (inode->i_mmap) {
 410                 printk("iput: inode %lu on device %s still has mappings.\n",
 411                         inode->i_ino, kdevname(inode->i_dev));
 412                 inode->i_mmap = NULL;
 413         }
 414         nr_free_inodes++;
 415         return;
 416 }
 417 
 418 struct inode * get_empty_inode(void)
     /*  */
 419 {
 420         static int ino = 0;
 421         struct inode * inode, * best;
 422         int i;
 423 
 424         if (nr_inodes < NR_INODE && nr_free_inodes < (nr_inodes >> 2))
 425                 grow_inodes();
 426 repeat:
 427         inode = first_inode;
 428         best = NULL;
 429         for (i = 0; i<nr_inodes; inode = inode->i_next, i++) {
 430                 if (!inode->i_count) {
 431                         if (!best)
 432                                 best = inode;
 433                         if (!inode->i_dirt && !inode->i_lock) {
 434                                 best = inode;
 435                                 break;
 436                         }
 437                 }
 438         }
 439         if (!best || best->i_dirt || best->i_lock)
 440                 if (nr_inodes < NR_INODE) {
 441                         grow_inodes();
 442                         goto repeat;
 443                 }
 444         inode = best;
 445         if (!inode) {
 446                 printk("VFS: No free inodes - contact Linus\n");
 447                 sleep_on(&inode_wait);
 448                 goto repeat;
 449         }
 450         if (inode->i_lock) {
 451                 wait_on_inode(inode);
 452                 goto repeat;
 453         }
 454         if (inode->i_dirt) {
 455                 write_inode(inode);
 456                 goto repeat;
 457         }
 458         if (inode->i_count)
 459                 goto repeat;
 460         clear_inode(inode);
 461         inode->i_count = 1;
 462         inode->i_nlink = 1;
 463         inode->i_version = ++event;
 464         inode->i_sem.count = 1;
 465         inode->i_ino = ++ino;
 466         inode->i_dev = 0;
 467         nr_free_inodes--;
 468         if (nr_free_inodes < 0) {
 469                 printk ("VFS: get_empty_inode: bad free inode count.\n");
 470                 nr_free_inodes = 0;
 471         }
 472         return inode;
 473 }
 474 
 475 struct inode * get_pipe_inode(void)
     /*  */
 476 {
 477         struct inode * inode;
 478         extern struct inode_operations pipe_inode_operations;
 479 
 480         if (!(inode = get_empty_inode()))
 481                 return NULL;
 482         if (!(PIPE_BASE(*inode) = (char*) __get_free_page(GFP_USER))) {
 483                 iput(inode);
 484                 return NULL;
 485         }
 486         inode->i_op = &pipe_inode_operations;
 487         inode->i_count = 2;     /* sum of readers/writers */
 488         PIPE_WAIT(*inode) = NULL;
 489         PIPE_START(*inode) = PIPE_LEN(*inode) = 0;
 490         PIPE_RD_OPENERS(*inode) = PIPE_WR_OPENERS(*inode) = 0;
 491         PIPE_READERS(*inode) = PIPE_WRITERS(*inode) = 1;
 492         PIPE_LOCK(*inode) = 0;
 493         inode->i_pipe = 1;
 494         inode->i_mode |= S_IFIFO | S_IRUSR | S_IWUSR;
 495         inode->i_uid = current->fsuid;
 496         inode->i_gid = current->fsgid;
 497         inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME;
 498         inode->i_blksize = PAGE_SIZE;
 499         return inode;
 500 }
 501 
 502 struct inode * __iget(struct super_block * sb, int nr, int crossmntp)
     /*  */
 503 {
 504         static struct wait_queue * update_wait = NULL;
 505         struct inode_hash_entry * h;
 506         struct inode * inode;
 507         struct inode * empty = NULL;
 508 
 509         if (!sb)
 510                 panic("VFS: iget with sb==NULL");
 511         h = hash(sb->s_dev, nr);
 512 repeat:
 513         for (inode = h->inode; inode ; inode = inode->i_hash_next)
 514                 if (inode->i_dev == sb->s_dev && inode->i_ino == nr)
 515                         goto found_it;
 516         if (!empty) {
 517                 h->updating++;
 518                 empty = get_empty_inode();
 519                 if (!--h->updating)
 520                         wake_up(&update_wait);
 521                 if (empty)
 522                         goto repeat;
 523                 return (NULL);
 524         }
 525         inode = empty;
 526         inode->i_sb = sb;
 527         inode->i_dev = sb->s_dev;
 528         inode->i_ino = nr;
 529         inode->i_flags = sb->s_flags;
 530         put_last_free(inode);
 531         insert_inode_hash(inode);
 532         read_inode(inode);
 533         goto return_it;
 534 
 535 found_it:
 536         if (!inode->i_count)
 537                 nr_free_inodes--;
 538         inode->i_count++;
 539         wait_on_inode(inode);
 540         if (inode->i_dev != sb->s_dev || inode->i_ino != nr) {
 541                 printk("Whee.. inode changed from under us. Tell Linus\n");
 542                 iput(inode);
 543                 goto repeat;
 544         }
 545         if (crossmntp && inode->i_mount) {
 546                 struct inode * tmp = inode->i_mount;
 547                 tmp->i_count++;
 548                 iput(inode);
 549                 inode = tmp;
 550                 wait_on_inode(inode);
 551         }
 552         if (empty)
 553                 iput(empty);
 554 
 555 return_it:
 556         while (h->updating)
 557                 sleep_on(&update_wait);
 558         return inode;
 559 }
 560 
 561 /*
 562  * The "new" scheduling primitives (new as of 0.97 or so) allow this to
 563  * be done without disabling interrupts (other than in the actual queue
 564  * updating things: only a couple of 386 instructions). This should be
 565  * much better for interrupt latency.
 566  */
 567 static void __wait_on_inode(struct inode * inode)
     /*  */
 568 {
 569         struct wait_queue wait = { current, NULL };
 570 
 571         add_wait_queue(&inode->i_wait, &wait);
 572 repeat:
 573         current->state = TASK_UNINTERRUPTIBLE;
 574         if (inode->i_lock) {
 575                 schedule();
 576                 goto repeat;
 577         }
 578         remove_wait_queue(&inode->i_wait, &wait);
 579         current->state = TASK_RUNNING;
 580 }
/* */
root/fs/inode.c

DEFINITIONS
