1 /* $NetBSD: tmpfs.h,v 1.26 2007/02/22 06:37:00 thorpej Exp $ */ 2 3 /* 4 * Copyright (c) 2005, 2006 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Julio M. Merino Vidal, developed as part of Google's Summer of Code 9 * 2005 program. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the NetBSD 22 * Foundation, Inc. and its contributors. 23 * 4. Neither the name of The NetBSD Foundation nor the names of its 24 * contributors may be used to endorse or promote products derived 25 * from this software without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 37 * POSSIBILITY OF SUCH DAMAGE. 38 * 39 * $FreeBSD$ 40 */ 41 42 #ifndef _FS_TMPFS_TMPFS_H_ 43 #define _FS_TMPFS_TMPFS_H_ 44 45 /* --------------------------------------------------------------------- 46 * KERNEL-SPECIFIC DEFINITIONS 47 * --------------------------------------------------------------------- */ 48 #include <sys/dirent.h> 49 #include <sys/mount.h> 50 #include <sys/queue.h> 51 #include <sys/vnode.h> 52 #include <sys/file.h> 53 #include <sys/lock.h> 54 #include <sys/mutex.h> 55 56 /* --------------------------------------------------------------------- */ 57 #include <sys/malloc.h> 58 #include <sys/systm.h> 59 #include <sys/vmmeter.h> 60 #include <vm/swap_pager.h> 61 62 MALLOC_DECLARE(M_TMPFSMNT); 63 MALLOC_DECLARE(M_TMPFSNAME); 64 65 /* --------------------------------------------------------------------- */ 66 67 /* 68 * Internal representation of a tmpfs directory entry. 69 */ 70 struct tmpfs_dirent { 71 TAILQ_ENTRY(tmpfs_dirent) td_entries; 72 73 /* Length of the name stored in this directory entry. This avoids 74 * the need to recalculate it every time the name is used. */ 75 uint16_t td_namelen; 76 77 /* The name of the entry, allocated from a string pool. This 78 * string is not required to be zero-terminated; therefore, the 79 * td_namelen field must always be used when accessing its value. */ 80 char * td_name; 81 82 /* Pointer to the node this entry refers to. */ 83 struct tmpfs_node * td_node; 84 }; 85 86 /* A directory in tmpfs holds a sorted list of directory entries, which in 87 * turn point to other files (which can be directories themselves). 88 * 89 * In tmpfs, this list is managed by a tail queue, whose head is defined by 90 * the struct tmpfs_dir type. 91 * 92 * It is imporant to notice that directories do not have entries for . and 93 * .. as other file systems do. These can be generated when requested 94 * based on information available by other means, such as the pointer to 95 * the node itself in the former case or the pointer to the parent directory 96 * in the latter case. This is done to simplify tmpfs's code and, more 97 * importantly, to remove redundancy. */ 98 TAILQ_HEAD(tmpfs_dir, tmpfs_dirent); 99 100 /* Each entry in a directory has a cookie that identifies it. Cookies 101 * supersede offsets within directories because, given how tmpfs stores 102 * directories in memory, there is no such thing as an offset. (Emulating 103 * a real offset could be very difficult.) 104 * 105 * The '.', '..' and the end of directory markers have fixed cookies which 106 * cannot collide with the cookies generated by other entries. The cookies 107 * fot the other entries are generated based on the memory address on which 108 * stores their information is stored. 109 * 110 * Ideally, using the entry's memory pointer as the cookie would be enough 111 * to represent it and it wouldn't cause collisions in any system. 112 * Unfortunately, this results in "offsets" with very large values which 113 * later raise problems in the Linux compatibility layer (and maybe in other 114 * places) as described in PR kern/32034. Hence we need to workaround this 115 * with a rather ugly hack. 116 * 117 * Linux 32-bit binaries, unless built with _FILE_OFFSET_BITS=64, have off_t 118 * set to 'long', which is a 32-bit *signed* long integer. Regardless of 119 * the macro value, GLIBC (2.3 at least) always uses the getdents64 120 * system call (when calling readdir) which internally returns off64_t 121 * offsets. In order to make 32-bit binaries work, *GLIBC* converts the 122 * 64-bit values returned by the kernel to 32-bit ones and aborts with 123 * EOVERFLOW if the conversion results in values that won't fit in 32-bit 124 * integers (which it assumes is because the directory is extremely large). 125 * This wouldn't cause problems if we were dealing with unsigned integers, 126 * but as we have signed integers, this check fails due to sign expansion. 127 * 128 * For example, consider that the kernel returns the 0xc1234567 cookie to 129 * userspace in a off64_t integer. Later on, GLIBC casts this value to 130 * off_t (remember, signed) with code similar to: 131 * system call returns the offset in kernel_value; 132 * off_t casted_value = kernel_value; 133 * if (sizeof(off_t) != sizeof(off64_t) && 134 * kernel_value != casted_value) 135 * error! 136 * In this case, casted_value still has 0xc1234567, but when it is compared 137 * for equality against kernel_value, it is promoted to a 64-bit integer and 138 * becomes 0xffffffffc1234567, which is different than 0x00000000c1234567. 139 * Then, GLIBC assumes this is because the directory is very large. 140 * 141 * Given that all the above happens in user-space, we have no control over 142 * it; therefore we must workaround the issue here. We do this by 143 * truncating the pointer value to a 32-bit integer and hope that there 144 * won't be collisions. In fact, this will not cause any problems in 145 * 32-bit platforms but some might arise in 64-bit machines (I'm not sure 146 * if they can happen at all in practice). 147 * 148 * XXX A nicer solution shall be attempted. */ 149 #ifdef _KERNEL 150 #define TMPFS_DIRCOOKIE_DOT 0 151 #define TMPFS_DIRCOOKIE_DOTDOT 1 152 #define TMPFS_DIRCOOKIE_EOF 2 153 static __inline 154 off_t 155 tmpfs_dircookie(struct tmpfs_dirent *de) 156 { 157 off_t cookie; 158 159 cookie = ((off_t)(uintptr_t)de >> 1) & 0x7FFFFFFF; 160 MPASS(cookie != TMPFS_DIRCOOKIE_DOT); 161 MPASS(cookie != TMPFS_DIRCOOKIE_DOTDOT); 162 MPASS(cookie != TMPFS_DIRCOOKIE_EOF); 163 164 return cookie; 165 } 166 #endif 167 168 /* --------------------------------------------------------------------- */ 169 170 /* 171 * Internal representation of a tmpfs file system node. 172 * 173 * This structure is splitted in two parts: one holds attributes common 174 * to all file types and the other holds data that is only applicable to 175 * a particular type. The code must be careful to only access those 176 * attributes that are actually allowed by the node's type. 177 * 178 * 179 * Below is the key of locks used to protected the fields in the following 180 * structures. 181 * 182 */ 183 struct tmpfs_node { 184 /* Doubly-linked list entry which links all existing nodes for a 185 * single file system. This is provided to ease the removal of 186 * all nodes during the unmount operation. */ 187 LIST_ENTRY(tmpfs_node) tn_entries; 188 189 /* The node's type. Any of 'VBLK', 'VCHR', 'VDIR', 'VFIFO', 190 * 'VLNK', 'VREG' and 'VSOCK' is allowed. The usage of vnode 191 * types instead of a custom enumeration is to make things simpler 192 * and faster, as we do not need to convert between two types. */ 193 enum vtype tn_type; 194 195 /* Node identifier. */ 196 ino_t tn_id; 197 198 /* Node's internal status. This is used by several file system 199 * operations to do modifications to the node in a delayed 200 * fashion. */ 201 int tn_status; 202 #define TMPFS_NODE_ACCESSED (1 << 1) 203 #define TMPFS_NODE_MODIFIED (1 << 2) 204 #define TMPFS_NODE_CHANGED (1 << 3) 205 206 /* The node size. It does not necessarily match the real amount 207 * of memory consumed by it. */ 208 off_t tn_size; 209 210 /* Generic node attributes. */ 211 uid_t tn_uid; 212 gid_t tn_gid; 213 mode_t tn_mode; 214 int tn_flags; 215 nlink_t tn_links; 216 struct timespec tn_atime; 217 struct timespec tn_mtime; 218 struct timespec tn_ctime; 219 struct timespec tn_birthtime; 220 unsigned long tn_gen; 221 222 /* Head of byte-level lock list (used by tmpfs_advlock). */ 223 struct lockf * tn_lockf; 224 225 /* As there is a single vnode for each active file within the 226 * system, care has to be taken to avoid allocating more than one 227 * vnode per file. In order to do this, a bidirectional association 228 * is kept between vnodes and nodes. 229 * 230 * Whenever a vnode is allocated, its v_data field is updated to 231 * point to the node it references. At the same time, the node's 232 * tn_vnode field is modified to point to the new vnode representing 233 * it. Further attempts to allocate a vnode for this same node will 234 * result in returning a new reference to the value stored in 235 * tn_vnode. 236 * 237 * May be NULL when the node is unused (that is, no vnode has been 238 * allocated for it or it has been reclaimed). */ 239 struct vnode * tn_vnode; 240 241 /* Pointer to the node returned by tmpfs_lookup() after doing a 242 * delete or a rename lookup; its value is only valid in these two 243 * situations. In case we were looking up . or .., it holds a null 244 * pointer. */ 245 struct tmpfs_dirent * tn_lookup_dirent; 246 247 /* interlock to protect tn_vpstate */ 248 struct mtx tn_interlock; 249 250 /* Identify if current node has vnode assiocate with 251 * or allocating vnode. 252 */ 253 int tn_vpstate; 254 255 /* misc data field for different tn_type node */ 256 union { 257 /* Valid when tn_type == VBLK || tn_type == VCHR. */ 258 dev_t tn_rdev; 259 260 /* Valid when tn_type == VDIR. */ 261 struct tn_dir{ 262 /* Pointer to the parent directory. The root 263 * directory has a pointer to itself in this field; 264 * this property identifies the root node. */ 265 struct tmpfs_node * tn_parent; 266 267 /* Head of a tail-queue that links the contents of 268 * the directory together. See above for a 269 * description of its contents. */ 270 struct tmpfs_dir tn_dirhead; 271 272 /* Number and pointer of the first directory entry 273 * returned by the readdir operation if it were 274 * called again to continue reading data from the 275 * same directory as before. This is used to speed 276 * up reads of long directories, assuming that no 277 * more than one read is in progress at a given time. 278 * Otherwise, these values are discarded and a linear 279 * scan is performed from the beginning up to the 280 * point where readdir starts returning values. */ 281 off_t tn_readdir_lastn; 282 struct tmpfs_dirent * tn_readdir_lastp; 283 }tn_dir; 284 285 /* Valid when tn_type == VLNK. */ 286 /* The link's target, allocated from a string pool. */ 287 char * tn_link; 288 289 /* Valid when tn_type == VREG. */ 290 struct tn_reg { 291 /* The contents of regular files stored in a tmpfs 292 * file system are represented by a single anonymous 293 * memory object (aobj, for short). The aobj provides 294 * direct access to any position within the file, 295 * because its contents are always mapped in a 296 * contiguous region of virtual memory. It is a task 297 * of the memory management subsystem (see uvm(9)) to 298 * issue the required page ins or page outs whenever 299 * a position within the file is accessed. */ 300 vm_object_t tn_aobj; 301 size_t tn_aobj_pages; 302 303 }tn_reg; 304 305 /* Valid when tn_type = VFIFO */ 306 struct tn_fifo { 307 fo_rdwr_t *tn_fo_read; 308 fo_rdwr_t *tn_fo_write; 309 }tn_fifo; 310 }tn_spec; 311 }; 312 LIST_HEAD(tmpfs_node_list, tmpfs_node); 313 314 #define tn_rdev tn_spec.tn_rdev 315 #define tn_dir tn_spec.tn_dir 316 #define tn_link tn_spec.tn_link 317 #define tn_reg tn_spec.tn_reg 318 #define tn_fifo tn_spec.tn_fifo 319 320 #define TMPFS_NODE_LOCK(node) mtx_lock(&(node)->tn_interlock) 321 #define TMPFS_NODE_UNLOCK(node) mtx_unlock(&(node)->tn_interlock) 322 #define TMPFS_NODE_MTX(node) (&(node)->tn_interlock) 323 324 #define TMPFS_VNODE_ALLOCATING 1 325 #define TMPFS_VNODE_WANT 2 326 /* --------------------------------------------------------------------- */ 327 328 /* 329 * Internal representation of a tmpfs mount point. 330 */ 331 struct tmpfs_mount { 332 /* Maximum number of memory pages available for use by the file 333 * system, set during mount time. This variable must never be 334 * used directly as it may be bigger than the current amount of 335 * free memory; in the extreme case, it will hold the SIZE_MAX 336 * value. Instead, use the TMPFS_PAGES_MAX macro. */ 337 size_t tm_pages_max; 338 339 /* Number of pages in use by the file system. Cannot be bigger 340 * than the value returned by TMPFS_PAGES_MAX in any case. */ 341 size_t tm_pages_used; 342 343 /* Pointer to the node representing the root directory of this 344 * file system. */ 345 struct tmpfs_node * tm_root; 346 347 /* Maximum number of possible nodes for this file system; set 348 * during mount time. We need a hard limit on the maximum number 349 * of nodes to avoid allocating too much of them; their objects 350 * cannot be released until the file system is unmounted. 351 * Otherwise, we could easily run out of memory by creating lots 352 * of empty files and then simply removing them. */ 353 ino_t tm_nodes_max; 354 355 /* unrhdr used to allocate inode numbers */ 356 struct unrhdr * tm_ino_unr; 357 358 /* Number of nodes currently that are in use. */ 359 ino_t tm_nodes_inuse; 360 361 /* maximum representable file size */ 362 u_int64_t tm_maxfilesize; 363 364 /* Nodes are organized in two different lists. The used list 365 * contains all nodes that are currently used by the file system; 366 * i.e., they refer to existing files. The available list contains 367 * all nodes that are currently available for use by new files. 368 * Nodes must be kept in this list (instead of deleting them) 369 * because we need to keep track of their generation number (tn_gen 370 * field). 371 * 372 * Note that nodes are lazily allocated: if the available list is 373 * empty and we have enough space to create more nodes, they will be 374 * created and inserted in the used list. Once these are released, 375 * they will go into the available list, remaining alive until the 376 * file system is unmounted. */ 377 struct tmpfs_node_list tm_nodes_used; 378 379 /* All node lock to protect the node list and tmp_pages_used */ 380 struct mtx allnode_lock; 381 382 /* Pools used to store file system meta data. These are not shared 383 * across several instances of tmpfs for the reasons described in 384 * tmpfs_pool.c. */ 385 uma_zone_t tm_dirent_pool; 386 uma_zone_t tm_node_pool; 387 }; 388 #define TMPFS_LOCK(tm) mtx_lock(&(tm)->allnode_lock) 389 #define TMPFS_UNLOCK(tm) mtx_unlock(&(tm)->allnode_lock) 390 391 /* --------------------------------------------------------------------- */ 392 393 /* 394 * This structure maps a file identifier to a tmpfs node. Used by the 395 * NFS code. 396 */ 397 struct tmpfs_fid { 398 uint16_t tf_len; 399 uint16_t tf_pad; 400 ino_t tf_id; 401 unsigned long tf_gen; 402 }; 403 404 /* --------------------------------------------------------------------- */ 405 406 #ifdef _KERNEL 407 /* 408 * Prototypes for tmpfs_subr.c. 409 */ 410 411 int tmpfs_alloc_node(struct tmpfs_mount *, enum vtype, 412 uid_t uid, gid_t gid, mode_t mode, struct tmpfs_node *, 413 char *, dev_t, struct thread *, struct tmpfs_node **); 414 void tmpfs_free_node(struct tmpfs_mount *, struct tmpfs_node *); 415 int tmpfs_alloc_dirent(struct tmpfs_mount *, struct tmpfs_node *, 416 const char *, uint16_t, struct tmpfs_dirent **); 417 void tmpfs_free_dirent(struct tmpfs_mount *, struct tmpfs_dirent *, 418 boolean_t); 419 int tmpfs_alloc_vp(struct mount *, struct tmpfs_node *, int, 420 struct vnode **, struct thread *); 421 void tmpfs_free_vp(struct vnode *); 422 int tmpfs_alloc_file(struct vnode *, struct vnode **, struct vattr *, 423 struct componentname *, char *); 424 void tmpfs_dir_attach(struct vnode *, struct tmpfs_dirent *); 425 void tmpfs_dir_detach(struct vnode *, struct tmpfs_dirent *); 426 struct tmpfs_dirent * tmpfs_dir_lookup(struct tmpfs_node *node, 427 struct componentname *cnp); 428 int tmpfs_dir_getdotdent(struct tmpfs_node *, struct uio *); 429 int tmpfs_dir_getdotdotdent(struct tmpfs_node *, struct uio *); 430 struct tmpfs_dirent * tmpfs_dir_lookupbycookie(struct tmpfs_node *, off_t); 431 int tmpfs_dir_getdents(struct tmpfs_node *, struct uio *, off_t *); 432 int tmpfs_reg_resize(struct vnode *, off_t); 433 int tmpfs_chflags(struct vnode *, int, struct ucred *, struct thread *); 434 int tmpfs_chmod(struct vnode *, mode_t, struct ucred *, struct thread *); 435 int tmpfs_chown(struct vnode *, uid_t, gid_t, struct ucred *, 436 struct thread *); 437 int tmpfs_chsize(struct vnode *, u_quad_t, struct ucred *, struct thread *); 438 int tmpfs_chtimes(struct vnode *, struct timespec *, struct timespec *, 439 struct timespec *, int, struct ucred *, struct thread *); 440 void tmpfs_itimes(struct vnode *, const struct timespec *, 441 const struct timespec *); 442 443 void tmpfs_update(struct vnode *); 444 int tmpfs_truncate(struct vnode *, off_t); 445 446 /* --------------------------------------------------------------------- */ 447 448 /* 449 * Convenience macros to simplify some logical expressions. 450 */ 451 #define IMPLIES(a, b) (!(a) || (b)) 452 #define IFF(a, b) (IMPLIES(a, b) && IMPLIES(b, a)) 453 454 /* --------------------------------------------------------------------- */ 455 456 /* 457 * Checks that the directory entry pointed by 'de' matches the name 'name' 458 * with a length of 'len'. 459 */ 460 #define TMPFS_DIRENT_MATCHES(de, name, len) \ 461 (de->td_namelen == (uint16_t)len && \ 462 memcmp((de)->td_name, (name), (de)->td_namelen) == 0) 463 464 /* --------------------------------------------------------------------- */ 465 466 /* 467 * Ensures that the node pointed by 'node' is a directory and that its 468 * contents are consistent with respect to directories. 469 */ 470 #define TMPFS_VALIDATE_DIR(node) \ 471 MPASS((node)->tn_type == VDIR); \ 472 MPASS((node)->tn_size % sizeof(struct tmpfs_dirent) == 0); \ 473 MPASS((node)->tn_dir.tn_readdir_lastp == NULL || \ 474 tmpfs_dircookie((node)->tn_dir.tn_readdir_lastp) == (node)->tn_dir.tn_readdir_lastn); 475 476 /* --------------------------------------------------------------------- */ 477 478 /* 479 * Memory management stuff. 480 */ 481 482 /* Amount of memory pages to reserve for the system (e.g., to not use by 483 * tmpfs). 484 * XXX: Should this be tunable through sysctl, for instance? */ 485 #define TMPFS_PAGES_RESERVED (4 * 1024 * 1024 / PAGE_SIZE) 486 487 /* 488 * Returns information about the number of available memory pages, 489 * including physical and virtual ones. 490 * 491 * If 'total' is TRUE, the value returned is the total amount of memory 492 * pages configured for the system (either in use or free). 493 * If it is FALSE, the value returned is the amount of free memory pages. 494 * 495 * Remember to remove TMPFS_PAGES_RESERVED from the returned value to avoid 496 * excessive memory usage. 497 * 498 */ 499 static __inline size_t 500 tmpfs_mem_info(void) 501 { 502 size_t size; 503 504 size = swap_pager_avail + cnt.v_free_count + cnt.v_inactive_count; 505 size -= size > cnt.v_wire_count ? cnt.v_wire_count : size; 506 return size; 507 } 508 509 /* Returns the maximum size allowed for a tmpfs file system. This macro 510 * must be used instead of directly retrieving the value from tm_pages_max. 511 * The reason is that the size of a tmpfs file system is dynamic: it lets 512 * the user store files as long as there is enough free memory (including 513 * physical memory and swap space). Therefore, the amount of memory to be 514 * used is either the limit imposed by the user during mount time or the 515 * amount of available memory, whichever is lower. To avoid consuming all 516 * the memory for a given mount point, the system will always reserve a 517 * minimum of TMPFS_PAGES_RESERVED pages, which is also taken into account 518 * by this macro (see above). */ 519 static __inline size_t 520 TMPFS_PAGES_MAX(struct tmpfs_mount *tmp) 521 { 522 size_t freepages; 523 524 freepages = tmpfs_mem_info(); 525 freepages -= freepages < TMPFS_PAGES_RESERVED ? 526 freepages : TMPFS_PAGES_RESERVED; 527 528 return MIN(tmp->tm_pages_max, freepages + tmp->tm_pages_used); 529 } 530 531 /* Returns the available space for the given file system. */ 532 #define TMPFS_META_PAGES(tmp) (howmany((tmp)->tm_nodes_inuse * (sizeof(struct tmpfs_node) \ 533 + sizeof(struct tmpfs_dirent)), PAGE_SIZE)) 534 #define TMPFS_FILE_PAGES(tmp) ((tmp)->tm_pages_used) 535 536 #define TMPFS_PAGES_AVAIL(tmp) (TMPFS_PAGES_MAX(tmp) > \ 537 TMPFS_META_PAGES(tmp)+TMPFS_FILE_PAGES(tmp)? \ 538 TMPFS_PAGES_MAX(tmp) - TMPFS_META_PAGES(tmp) \ 539 - TMPFS_FILE_PAGES(tmp):0) 540 541 #endif 542 543 /* --------------------------------------------------------------------- */ 544 545 /* 546 * Macros/functions to convert from generic data structures to tmpfs 547 * specific ones. 548 */ 549 550 static inline 551 struct tmpfs_mount * 552 VFS_TO_TMPFS(struct mount *mp) 553 { 554 struct tmpfs_mount *tmp; 555 556 MPASS((mp) != NULL && (mp)->mnt_data != NULL); 557 tmp = (struct tmpfs_mount *)(mp)->mnt_data; 558 return tmp; 559 } 560 561 static inline 562 struct tmpfs_node * 563 VP_TO_TMPFS_NODE(struct vnode *vp) 564 { 565 struct tmpfs_node *node; 566 567 MPASS((vp) != NULL && (vp)->v_data != NULL); 568 node = (struct tmpfs_node *)vp->v_data; 569 return node; 570 } 571 572 static inline 573 struct tmpfs_node * 574 VP_TO_TMPFS_DIR(struct vnode *vp) 575 { 576 struct tmpfs_node *node; 577 578 node = VP_TO_TMPFS_NODE(vp); 579 TMPFS_VALIDATE_DIR(node); 580 return node; 581 } 582 583 #endif /* _FS_TMPFS_TMPFS_H_ */ 584