1ad3638eeSXin LI /* $NetBSD: tmpfs.h,v 1.26 2007/02/22 06:37:00 thorpej Exp $ */ 2d1fa59e9SXin LI 3e08d5567SXin LI /*- 4d63027b6SPedro F. Giffuni * SPDX-License-Identifier: BSD-2-Clause-NetBSD 5d63027b6SPedro F. Giffuni * 6ad3638eeSXin LI * Copyright (c) 2005, 2006 The NetBSD Foundation, Inc. 7d1fa59e9SXin LI * All rights reserved. 8d1fa59e9SXin LI * 9d1fa59e9SXin LI * This code is derived from software contributed to The NetBSD Foundation 10d1fa59e9SXin LI * by Julio M. Merino Vidal, developed as part of Google's Summer of Code 11d1fa59e9SXin LI * 2005 program. 12d1fa59e9SXin LI * 13d1fa59e9SXin LI * Redistribution and use in source and binary forms, with or without 14d1fa59e9SXin LI * modification, are permitted provided that the following conditions 15d1fa59e9SXin LI * are met: 16d1fa59e9SXin LI * 1. Redistributions of source code must retain the above copyright 17d1fa59e9SXin LI * notice, this list of conditions and the following disclaimer. 18d1fa59e9SXin LI * 2. Redistributions in binary form must reproduce the above copyright 19d1fa59e9SXin LI * notice, this list of conditions and the following disclaimer in the 20d1fa59e9SXin LI * documentation and/or other materials provided with the distribution. 21d1fa59e9SXin LI * 22d1fa59e9SXin LI * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 23d1fa59e9SXin LI * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 24d1fa59e9SXin LI * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 25d1fa59e9SXin LI * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 26d1fa59e9SXin LI * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 27d1fa59e9SXin LI * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 28d1fa59e9SXin LI * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 29d1fa59e9SXin LI * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 30d1fa59e9SXin LI * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 31d1fa59e9SXin LI * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 32d1fa59e9SXin LI * POSSIBILITY OF SUCH DAMAGE. 33d1fa59e9SXin LI * 34d1fa59e9SXin LI * $FreeBSD$ 35d1fa59e9SXin LI */ 36d1fa59e9SXin LI 37d1fa59e9SXin LI #ifndef _FS_TMPFS_TMPFS_H_ 38d1fa59e9SXin LI #define _FS_TMPFS_TMPFS_H_ 39d1fa59e9SXin LI 40693d10a2SRyan Moeller #include <sys/cdefs.h> 41d1fa59e9SXin LI #include <sys/queue.h> 424fd5efe7SGleb Kurtsou #include <sys/tree.h> 43d1fa59e9SXin LI 44135beaf6SGleb Smirnoff #ifdef _SYS_MALLOC_H_ 459b258fcaSXin LI MALLOC_DECLARE(M_TMPFSNAME); 46135beaf6SGleb Smirnoff #endif 47d1fa59e9SXin LI 48*28bc23abSKonstantin Belousov #define OBJ_TMPFS OBJ_PAGERPRIV /* has tmpfs vnode allocated */ 49*28bc23abSKonstantin Belousov 50d1fa59e9SXin LI /* 51d1fa59e9SXin LI * Internal representation of a tmpfs directory entry. 52d1fa59e9SXin LI */ 534fd5efe7SGleb Kurtsou 544fd5efe7SGleb Kurtsou LIST_HEAD(tmpfs_dir_duphead, tmpfs_dirent); 554fd5efe7SGleb Kurtsou 56d1fa59e9SXin LI struct tmpfs_dirent { 574fd5efe7SGleb Kurtsou /* 584fd5efe7SGleb Kurtsou * Depending on td_cookie flag entry can be of 3 types: 594fd5efe7SGleb Kurtsou * - regular -- no hash collisions, stored in RB-Tree 604fd5efe7SGleb Kurtsou * - duphead -- synthetic linked list head for dup entries 614fd5efe7SGleb Kurtsou * - dup -- stored in linked list instead of RB-Tree 624fd5efe7SGleb Kurtsou */ 634fd5efe7SGleb Kurtsou union { 644fd5efe7SGleb Kurtsou /* regular and duphead entry types */ 654fd5efe7SGleb Kurtsou RB_ENTRY(tmpfs_dirent) td_entries; 66d1fa59e9SXin LI 674fd5efe7SGleb Kurtsou /* dup entry type */ 684fd5efe7SGleb Kurtsou struct { 694fd5efe7SGleb Kurtsou LIST_ENTRY(tmpfs_dirent) entries; 704fd5efe7SGleb Kurtsou LIST_ENTRY(tmpfs_dirent) index_entries; 714fd5efe7SGleb Kurtsou } td_dup; 724fd5efe7SGleb Kurtsou } uh; 73d1fa59e9SXin LI 744fd5efe7SGleb Kurtsou uint32_t td_cookie; 754fd5efe7SGleb Kurtsou uint32_t td_hash; 764fd5efe7SGleb Kurtsou u_int td_namelen; 77d1fa59e9SXin LI 78bba7ed20SKonstantin Belousov /* 79bba7ed20SKonstantin Belousov * Pointer to the node this entry refers to. In case this field 80bba7ed20SKonstantin Belousov * is NULL, the node is a whiteout. 81bba7ed20SKonstantin Belousov */ 82d1fa59e9SXin LI struct tmpfs_node * td_node; 834fd5efe7SGleb Kurtsou 844fd5efe7SGleb Kurtsou union { 854fd5efe7SGleb Kurtsou /* 864fd5efe7SGleb Kurtsou * The name of the entry, allocated from a string pool. This 874fd5efe7SGleb Kurtsou * string is not required to be zero-terminated. 884fd5efe7SGleb Kurtsou */ 894fd5efe7SGleb Kurtsou char * td_name; /* regular, dup */ 904fd5efe7SGleb Kurtsou struct tmpfs_dir_duphead td_duphead; /* duphead */ 914fd5efe7SGleb Kurtsou } ud; 92d1fa59e9SXin LI }; 93d1fa59e9SXin LI 94bba7ed20SKonstantin Belousov /* 95bba7ed20SKonstantin Belousov * A directory in tmpfs holds a collection of directory entries, which 96bba7ed20SKonstantin Belousov * in turn point to other files (which can be directories themselves). 97d1fa59e9SXin LI * 98bba7ed20SKonstantin Belousov * In tmpfs, this collection is managed by a RB-Tree, whose head is 99bba7ed20SKonstantin Belousov * defined by the struct tmpfs_dir type. 100d1fa59e9SXin LI * 1014fd5efe7SGleb Kurtsou * It is important to notice that directories do not have entries for . and 102d1fa59e9SXin LI * .. as other file systems do. These can be generated when requested 103d1fa59e9SXin LI * based on information available by other means, such as the pointer to 104d1fa59e9SXin LI * the node itself in the former case or the pointer to the parent directory 105d1fa59e9SXin LI * in the latter case. This is done to simplify tmpfs's code and, more 106bba7ed20SKonstantin Belousov * importantly, to remove redundancy. 107bba7ed20SKonstantin Belousov */ 1084fd5efe7SGleb Kurtsou RB_HEAD(tmpfs_dir, tmpfs_dirent); 109d1fa59e9SXin LI 110bba7ed20SKonstantin Belousov /* 111bba7ed20SKonstantin Belousov * Each entry in a directory has a cookie that identifies it. Cookies 112ad3638eeSXin LI * supersede offsets within directories because, given how tmpfs stores 1134fd5efe7SGleb Kurtsou * directories in memory, there is no such thing as an offset. 114ad3638eeSXin LI * 115ad3638eeSXin LI * The '.', '..' and the end of directory markers have fixed cookies which 116ad3638eeSXin LI * cannot collide with the cookies generated by other entries. The cookies 1174fd5efe7SGleb Kurtsou * for the other entries are generated based on the file name hash value or 1184fd5efe7SGleb Kurtsou * unique number in case of name hash collision. 119ad3638eeSXin LI * 1204fd5efe7SGleb Kurtsou * To preserve compatibility cookies are limited to 31 bits. 1214fd5efe7SGleb Kurtsou */ 1224fd5efe7SGleb Kurtsou 123d1fa59e9SXin LI #define TMPFS_DIRCOOKIE_DOT 0 124d1fa59e9SXin LI #define TMPFS_DIRCOOKIE_DOTDOT 1 125d1fa59e9SXin LI #define TMPFS_DIRCOOKIE_EOF 2 1264fd5efe7SGleb Kurtsou #define TMPFS_DIRCOOKIE_MASK ((off_t)0x3fffffffU) 1274fd5efe7SGleb Kurtsou #define TMPFS_DIRCOOKIE_MIN ((off_t)0x00000004U) 1284fd5efe7SGleb Kurtsou #define TMPFS_DIRCOOKIE_DUP ((off_t)0x40000000U) 1294fd5efe7SGleb Kurtsou #define TMPFS_DIRCOOKIE_DUPHEAD ((off_t)0x80000000U) 1304fd5efe7SGleb Kurtsou #define TMPFS_DIRCOOKIE_DUP_MIN TMPFS_DIRCOOKIE_DUP 1314fd5efe7SGleb Kurtsou #define TMPFS_DIRCOOKIE_DUP_MAX \ 1324fd5efe7SGleb Kurtsou (TMPFS_DIRCOOKIE_DUP | TMPFS_DIRCOOKIE_MASK) 133d1fa59e9SXin LI 134d1fa59e9SXin LI /* 135d1fa59e9SXin LI * Internal representation of a tmpfs file system node. 136d1fa59e9SXin LI * 137d1fa59e9SXin LI * This structure is splitted in two parts: one holds attributes common 138d1fa59e9SXin LI * to all file types and the other holds data that is only applicable to 139d1fa59e9SXin LI * a particular type. The code must be careful to only access those 140d1fa59e9SXin LI * attributes that are actually allowed by the node's type. 141d1fa59e9SXin LI * 142d1fa59e9SXin LI * Below is the key of locks used to protected the fields in the following 143d1fa59e9SXin LI * structures. 144bba7ed20SKonstantin Belousov * (v) vnode lock in exclusive mode 145bba7ed20SKonstantin Belousov * (vi) vnode lock in exclusive mode, or vnode lock in shared vnode and 146bba7ed20SKonstantin Belousov * tn_interlock 147bba7ed20SKonstantin Belousov * (i) tn_interlock 148280ffa5eSKonstantin Belousov * (m) tmpfs_mount tm_allnode_lock 149bba7ed20SKonstantin Belousov * (c) stable after creation 150d1fa59e9SXin LI */ 151d1fa59e9SXin LI struct tmpfs_node { 152bba7ed20SKonstantin Belousov /* 153bba7ed20SKonstantin Belousov * Doubly-linked list entry which links all existing nodes for 154bba7ed20SKonstantin Belousov * a single file system. This is provided to ease the removal 155bba7ed20SKonstantin Belousov * of all nodes during the unmount operation, and to support 15664c25043SKonstantin Belousov * the implementation of VOP_VNTOCNP(). tn_attached is false 15764c25043SKonstantin Belousov * when the node is removed from list and unlocked. 158bba7ed20SKonstantin Belousov */ 159bba7ed20SKonstantin Belousov LIST_ENTRY(tmpfs_node) tn_entries; /* (m) */ 160f24aa01fSMateusz Guzik 161f24aa01fSMateusz Guzik /* Node identifier. */ 162f24aa01fSMateusz Guzik ino_t tn_id; /* (c) */ 163d1fa59e9SXin LI 164bba7ed20SKonstantin Belousov /* 165bba7ed20SKonstantin Belousov * The node's type. Any of 'VBLK', 'VCHR', 'VDIR', 'VFIFO', 166d1fa59e9SXin LI * 'VLNK', 'VREG' and 'VSOCK' is allowed. The usage of vnode 167d1fa59e9SXin LI * types instead of a custom enumeration is to make things simpler 168bba7ed20SKonstantin Belousov * and faster, as we do not need to convert between two types. 169bba7ed20SKonstantin Belousov */ 170bba7ed20SKonstantin Belousov enum vtype tn_type; /* (c) */ 171d1fa59e9SXin LI 172f24aa01fSMateusz Guzik /* 173f24aa01fSMateusz Guzik * See the top comment. Reordered here to fill LP64 hole. 174f24aa01fSMateusz Guzik */ 175f24aa01fSMateusz Guzik bool tn_attached; /* (m) */ 176d1fa59e9SXin LI 177bba7ed20SKonstantin Belousov /* 178bba7ed20SKonstantin Belousov * Node's internal status. This is used by several file system 179d1fa59e9SXin LI * operations to do modifications to the node in a delayed 180bba7ed20SKonstantin Belousov * fashion. 181016b7c7eSKonstantin Belousov * 182016b7c7eSKonstantin Belousov * tn_accessed has a dedicated byte to allow update by store without 183016b7c7eSKonstantin Belousov * using atomics. This provides a micro-optimization to e.g. 184016b7c7eSKonstantin Belousov * tmpfs_read_pgcache(). 185bba7ed20SKonstantin Belousov */ 186016b7c7eSKonstantin Belousov uint8_t tn_status; /* (vi) */ 187016b7c7eSKonstantin Belousov uint8_t tn_accessed; /* unlocked */ 188d1fa59e9SXin LI 189bba7ed20SKonstantin Belousov /* 190bba7ed20SKonstantin Belousov * The node size. It does not necessarily match the real amount 191bba7ed20SKonstantin Belousov * of memory consumed by it. 192bba7ed20SKonstantin Belousov */ 193bba7ed20SKonstantin Belousov off_t tn_size; /* (v) */ 194d1fa59e9SXin LI 195d1fa59e9SXin LI /* Generic node attributes. */ 196bba7ed20SKonstantin Belousov uid_t tn_uid; /* (v) */ 197bba7ed20SKonstantin Belousov gid_t tn_gid; /* (v) */ 198bba7ed20SKonstantin Belousov mode_t tn_mode; /* (v) */ 19935b1a3abSJohn Baldwin int tn_links; /* (v) */ 200bba7ed20SKonstantin Belousov u_long tn_flags; /* (v) */ 201bba7ed20SKonstantin Belousov struct timespec tn_atime; /* (vi) */ 202bba7ed20SKonstantin Belousov struct timespec tn_mtime; /* (vi) */ 203bba7ed20SKonstantin Belousov struct timespec tn_ctime; /* (vi) */ 204bba7ed20SKonstantin Belousov struct timespec tn_birthtime; /* (v) */ 205bba7ed20SKonstantin Belousov unsigned long tn_gen; /* (c) */ 206d1fa59e9SXin LI 207bba7ed20SKonstantin Belousov /* 208bba7ed20SKonstantin Belousov * As there is a single vnode for each active file within the 209d1fa59e9SXin LI * system, care has to be taken to avoid allocating more than one 210d1fa59e9SXin LI * vnode per file. In order to do this, a bidirectional association 211d1fa59e9SXin LI * is kept between vnodes and nodes. 212d1fa59e9SXin LI * 213d1fa59e9SXin LI * Whenever a vnode is allocated, its v_data field is updated to 214d1fa59e9SXin LI * point to the node it references. At the same time, the node's 215d1fa59e9SXin LI * tn_vnode field is modified to point to the new vnode representing 216d1fa59e9SXin LI * it. Further attempts to allocate a vnode for this same node will 217d1fa59e9SXin LI * result in returning a new reference to the value stored in 218d1fa59e9SXin LI * tn_vnode. 219d1fa59e9SXin LI * 220d1fa59e9SXin LI * May be NULL when the node is unused (that is, no vnode has been 221bba7ed20SKonstantin Belousov * allocated for it or it has been reclaimed). 222bba7ed20SKonstantin Belousov */ 223bba7ed20SKonstantin Belousov struct vnode * tn_vnode; /* (i) */ 224d1fa59e9SXin LI 225bba7ed20SKonstantin Belousov /* 226bba7ed20SKonstantin Belousov * Interlock to protect tn_vpstate, and tn_status under shared 2275dc11286SKonstantin Belousov * vnode lock. 2285dc11286SKonstantin Belousov */ 229d1fa59e9SXin LI struct mtx tn_interlock; 230d1fa59e9SXin LI 231bba7ed20SKonstantin Belousov /* 232bba7ed20SKonstantin Belousov * Identify if current node has vnode assiocate with 233d1fa59e9SXin LI * or allocating vnode. 234d1fa59e9SXin LI */ 235bba7ed20SKonstantin Belousov int tn_vpstate; /* (i) */ 236d1fa59e9SXin LI 23764c25043SKonstantin Belousov /* Transient refcounter on this node. */ 2384601f5f5SKonstantin Belousov u_int tn_refcount; /* 0<->1 (m) + (i) */ 23964c25043SKonstantin Belousov 240d1fa59e9SXin LI /* misc data field for different tn_type node */ 241d1fa59e9SXin LI union { 242d1fa59e9SXin LI /* Valid when tn_type == VBLK || tn_type == VCHR. */ 243bba7ed20SKonstantin Belousov dev_t tn_rdev; /* (c) */ 244d1fa59e9SXin LI 245d1fa59e9SXin LI /* Valid when tn_type == VDIR. */ 246d1fa59e9SXin LI struct tn_dir { 247bba7ed20SKonstantin Belousov /* 248bba7ed20SKonstantin Belousov * Pointer to the parent directory. The root 249d1fa59e9SXin LI * directory has a pointer to itself in this field; 250bba7ed20SKonstantin Belousov * this property identifies the root node. 251bba7ed20SKonstantin Belousov */ 252d1fa59e9SXin LI struct tmpfs_node * tn_parent; 253d1fa59e9SXin LI 254bba7ed20SKonstantin Belousov /* 255bba7ed20SKonstantin Belousov * Head of a tree that links the contents of 256bba7ed20SKonstantin Belousov * the directory together. 257bba7ed20SKonstantin Belousov */ 258d1fa59e9SXin LI struct tmpfs_dir tn_dirhead; 259d1fa59e9SXin LI 260bba7ed20SKonstantin Belousov /* 261bba7ed20SKonstantin Belousov * Head of a list the contains fake directory entries 2624fd5efe7SGleb Kurtsou * heads, i.e. entries with TMPFS_DIRCOOKIE_DUPHEAD 263bba7ed20SKonstantin Belousov * flag. 264bba7ed20SKonstantin Belousov */ 2654fd5efe7SGleb Kurtsou struct tmpfs_dir_duphead tn_dupindex; 2664fd5efe7SGleb Kurtsou 267bba7ed20SKonstantin Belousov /* 268bba7ed20SKonstantin Belousov * Number and pointer of the first directory entry 269d1fa59e9SXin LI * returned by the readdir operation if it were 270d1fa59e9SXin LI * called again to continue reading data from the 271d1fa59e9SXin LI * same directory as before. This is used to speed 272d1fa59e9SXin LI * up reads of long directories, assuming that no 273d1fa59e9SXin LI * more than one read is in progress at a given time. 274bba7ed20SKonstantin Belousov * Otherwise, these values are discarded. 275bba7ed20SKonstantin Belousov */ 276d1fa59e9SXin LI off_t tn_readdir_lastn; 277d1fa59e9SXin LI struct tmpfs_dirent * tn_readdir_lastp; 278d1fa59e9SXin LI } tn_dir; 279d1fa59e9SXin LI 280d1fa59e9SXin LI /* Valid when tn_type == VLNK. */ 281d1fa59e9SXin LI /* The link's target, allocated from a string pool. */ 282618029afSMateusz Guzik struct tn_link { 283618029afSMateusz Guzik char * tn_link_target; /* (c) */ 284618029afSMateusz Guzik char tn_link_smr; /* (c) */ 285618029afSMateusz Guzik } tn_link; 286d1fa59e9SXin LI 287d1fa59e9SXin LI /* Valid when tn_type == VREG. */ 288d1fa59e9SXin LI struct tn_reg { 289bba7ed20SKonstantin Belousov /* 290bba7ed20SKonstantin Belousov * The contents of regular files stored in a 291bba7ed20SKonstantin Belousov * tmpfs file system are represented by a 292bba7ed20SKonstantin Belousov * single anonymous memory object (aobj, for 293bba7ed20SKonstantin Belousov * short). The aobj provides direct access to 294bba7ed20SKonstantin Belousov * any position within the file. It is a task 295bba7ed20SKonstantin Belousov * of the memory management subsystem to issue 296bba7ed20SKonstantin Belousov * the required page ins or page outs whenever 297bba7ed20SKonstantin Belousov * a position within the file is accessed. 298bba7ed20SKonstantin Belousov */ 299bba7ed20SKonstantin Belousov vm_object_t tn_aobj; /* (c) */ 300081e36e7SKonstantin Belousov struct tmpfs_mount *tn_tmp; /* (c) */ 301d1fa59e9SXin LI } tn_reg; 302bba7ed20SKonstantin Belousov } tn_spec; /* (v) */ 303d1fa59e9SXin LI }; 304d1fa59e9SXin LI LIST_HEAD(tmpfs_node_list, tmpfs_node); 305d1fa59e9SXin LI 306d1fa59e9SXin LI #define tn_rdev tn_spec.tn_rdev 307d1fa59e9SXin LI #define tn_dir tn_spec.tn_dir 308618029afSMateusz Guzik #define tn_link_target tn_spec.tn_link.tn_link_target 309618029afSMateusz Guzik #define tn_link_smr tn_spec.tn_link.tn_link_smr 310d1fa59e9SXin LI #define tn_reg tn_spec.tn_reg 311d1fa59e9SXin LI #define tn_fifo tn_spec.tn_fifo 312d1fa59e9SXin LI 31335b1a3abSJohn Baldwin #define TMPFS_LINK_MAX INT_MAX 31435b1a3abSJohn Baldwin 315d1fa59e9SXin LI #define TMPFS_NODE_LOCK(node) mtx_lock(&(node)->tn_interlock) 316d1fa59e9SXin LI #define TMPFS_NODE_UNLOCK(node) mtx_unlock(&(node)->tn_interlock) 317fb755714SXin LI #define TMPFS_NODE_MTX(node) (&(node)->tn_interlock) 318d2ca06cdSKonstantin Belousov #define TMPFS_NODE_ASSERT_LOCKED(node) mtx_assert(TMPFS_NODE_MTX(node), \ 319d2ca06cdSKonstantin Belousov MA_OWNED) 320d1fa59e9SXin LI 32182cf92d4SXin LI #ifdef INVARIANTS 32282cf92d4SXin LI #define TMPFS_ASSERT_LOCKED(node) do { \ 3234960d0d4SKonstantin Belousov MPASS((node) != NULL); \ 3244960d0d4SKonstantin Belousov MPASS((node)->tn_vnode != NULL); \ 3254960d0d4SKonstantin Belousov ASSERT_VOP_LOCKED((node)->tn_vnode, "tmpfs assert"); \ 32682cf92d4SXin LI } while (0) 32782cf92d4SXin LI #else 32882cf92d4SXin LI #define TMPFS_ASSERT_LOCKED(node) (void)0 32982cf92d4SXin LI #endif 33082cf92d4SXin LI 331016b7c7eSKonstantin Belousov /* tn_vpstate */ 332d1fa59e9SXin LI #define TMPFS_VNODE_ALLOCATING 1 333d1fa59e9SXin LI #define TMPFS_VNODE_WANT 2 33482cf92d4SXin LI #define TMPFS_VNODE_DOOMED 4 3358239a7a8SKonstantin Belousov #define TMPFS_VNODE_WRECLAIM 8 336d1fa59e9SXin LI 337016b7c7eSKonstantin Belousov /* tn_status */ 338016b7c7eSKonstantin Belousov #define TMPFS_NODE_MODIFIED 0x01 339016b7c7eSKonstantin Belousov #define TMPFS_NODE_CHANGED 0x02 340016b7c7eSKonstantin Belousov 341d1fa59e9SXin LI /* 342d1fa59e9SXin LI * Internal representation of a tmpfs mount point. 343d1fa59e9SXin LI */ 344d1fa59e9SXin LI struct tmpfs_mount { 345bba7ed20SKonstantin Belousov /* 346ac1a10efSMaxim Sobolev * Original value of the "size" parameter, for reference purposes, 347ac1a10efSMaxim Sobolev * mostly. 348ac1a10efSMaxim Sobolev */ 349ac1a10efSMaxim Sobolev off_t tm_size_max; 350ac1a10efSMaxim Sobolev /* 351bba7ed20SKonstantin Belousov * Maximum number of memory pages available for use by the file 352d1fa59e9SXin LI * system, set during mount time. This variable must never be 353974fd8c6SXin LI * used directly as it may be bigger than the current amount of 354ed2159c9SMateusz Guzik * free memory; in the extreme case, it will hold the ULONG_MAX 355bba7ed20SKonstantin Belousov * value. 356bba7ed20SKonstantin Belousov */ 357ed2159c9SMateusz Guzik u_long tm_pages_max; 358d1fa59e9SXin LI 359da7aa277SGleb Kurtsou /* Number of pages in use by the file system. */ 360ed2159c9SMateusz Guzik u_long tm_pages_used; 361d1fa59e9SXin LI 362bba7ed20SKonstantin Belousov /* 363bba7ed20SKonstantin Belousov * Pointer to the node representing the root directory of this 364bba7ed20SKonstantin Belousov * file system. 365bba7ed20SKonstantin Belousov */ 366d1fa59e9SXin LI struct tmpfs_node * tm_root; 367d1fa59e9SXin LI 368bba7ed20SKonstantin Belousov /* 369bba7ed20SKonstantin Belousov * Maximum number of possible nodes for this file system; set 370d1fa59e9SXin LI * during mount time. We need a hard limit on the maximum number 371d1fa59e9SXin LI * of nodes to avoid allocating too much of them; their objects 372d1fa59e9SXin LI * cannot be released until the file system is unmounted. 373d1fa59e9SXin LI * Otherwise, we could easily run out of memory by creating lots 374bba7ed20SKonstantin Belousov * of empty files and then simply removing them. 375bba7ed20SKonstantin Belousov */ 376d1fa59e9SXin LI ino_t tm_nodes_max; 377d1fa59e9SXin LI 3788d9a89a3SXin LI /* unrhdr used to allocate inode numbers */ 37930e0cf49SMateusz Guzik struct unrhdr64 tm_ino_unr; 380d1fa59e9SXin LI 381d1fa59e9SXin LI /* Number of nodes currently that are in use. */ 382d1fa59e9SXin LI ino_t tm_nodes_inuse; 383d1fa59e9SXin LI 38464c25043SKonstantin Belousov /* Refcounter on this struct tmpfs_mount. */ 38564c25043SKonstantin Belousov uint64_t tm_refcount; 38664c25043SKonstantin Belousov 387d1fa59e9SXin LI /* maximum representable file size */ 388d1fa59e9SXin LI u_int64_t tm_maxfilesize; 389d1fa59e9SXin LI 390bba7ed20SKonstantin Belousov /* 391bba7ed20SKonstantin Belousov * The used list contains all nodes that are currently used by 392bba7ed20SKonstantin Belousov * the file system; i.e., they refer to existing files. 393bba7ed20SKonstantin Belousov */ 394d1fa59e9SXin LI struct tmpfs_node_list tm_nodes_used; 395d1fa59e9SXin LI 396bba7ed20SKonstantin Belousov /* All node lock to protect the node list and tmp_pages_used. */ 397280ffa5eSKonstantin Belousov struct mtx tm_allnode_lock; 398d1fa59e9SXin LI 399c5ab5ce3SJaakko Heinonen /* Read-only status. */ 40000ac6a98SKonstantin Belousov bool tm_ronly; 40100ac6a98SKonstantin Belousov /* Do not use namecache. */ 40200ac6a98SKonstantin Belousov bool tm_nonc; 403c1e84733SKonstantin Belousov /* Do not update mtime on writes through mmaped areas. */ 404c1e84733SKonstantin Belousov bool tm_nomtime; 405d1fa59e9SXin LI }; 406280ffa5eSKonstantin Belousov #define TMPFS_LOCK(tm) mtx_lock(&(tm)->tm_allnode_lock) 407280ffa5eSKonstantin Belousov #define TMPFS_UNLOCK(tm) mtx_unlock(&(tm)->tm_allnode_lock) 408280ffa5eSKonstantin Belousov #define TMPFS_MP_ASSERT_LOCKED(tm) mtx_assert(&(tm)->tm_allnode_lock, MA_OWNED) 409d1fa59e9SXin LI 410d1fa59e9SXin LI /* 411d1fa59e9SXin LI * This structure maps a file identifier to a tmpfs node. Used by the 412d1fa59e9SXin LI * NFS code. 413d1fa59e9SXin LI */ 414693d10a2SRyan Moeller struct tmpfs_fid_data { 415693d10a2SRyan Moeller ino_t tfd_id; 416693d10a2SRyan Moeller unsigned long tfd_gen; 417d1fa59e9SXin LI }; 418693d10a2SRyan Moeller _Static_assert(sizeof(struct tmpfs_fid_data) <= MAXFIDSZ, 419693d10a2SRyan Moeller "(struct tmpfs_fid_data) is larger than (struct fid).fid_data"); 420d1fa59e9SXin LI 4211c07d69bSKonstantin Belousov struct tmpfs_dir_cursor { 4221c07d69bSKonstantin Belousov struct tmpfs_dirent *tdc_current; 4231c07d69bSKonstantin Belousov struct tmpfs_dirent *tdc_tree; 4241c07d69bSKonstantin Belousov }; 4251c07d69bSKonstantin Belousov 426d1fa59e9SXin LI #ifdef _KERNEL 427d1fa59e9SXin LI /* 428d1fa59e9SXin LI * Prototypes for tmpfs_subr.c. 429d1fa59e9SXin LI */ 430d1fa59e9SXin LI 43164c25043SKonstantin Belousov void tmpfs_ref_node(struct tmpfs_node *node); 4324cda7f7eSKonstantin Belousov int tmpfs_alloc_node(struct mount *mp, struct tmpfs_mount *, enum vtype, 433d1fa59e9SXin LI uid_t uid, gid_t gid, mode_t mode, struct tmpfs_node *, 4341493c2eeSBrooks Davis const char *, dev_t, struct tmpfs_node **); 435081e36e7SKonstantin Belousov int tmpfs_fo_close(struct file *fp, struct thread *td); 436d1fa59e9SXin LI void tmpfs_free_node(struct tmpfs_mount *, struct tmpfs_node *); 43764c25043SKonstantin Belousov bool tmpfs_free_node_locked(struct tmpfs_mount *, struct tmpfs_node *, bool); 43864c25043SKonstantin Belousov void tmpfs_free_tmp(struct tmpfs_mount *); 439d1fa59e9SXin LI int tmpfs_alloc_dirent(struct tmpfs_mount *, struct tmpfs_node *, 4404fd5efe7SGleb Kurtsou const char *, u_int, struct tmpfs_dirent **); 4414fd5efe7SGleb Kurtsou void tmpfs_free_dirent(struct tmpfs_mount *, struct tmpfs_dirent *); 4424fd5efe7SGleb Kurtsou void tmpfs_dirent_init(struct tmpfs_dirent *, const char *, u_int); 443158cc900SKonstantin Belousov void tmpfs_destroy_vobject(struct vnode *vp, vm_object_t obj); 4440ae6383dSXin LI int tmpfs_alloc_vp(struct mount *, struct tmpfs_node *, int, 445dfd233edSAttilio Rao struct vnode **); 446d1fa59e9SXin LI void tmpfs_free_vp(struct vnode *); 447d1fa59e9SXin LI int tmpfs_alloc_file(struct vnode *, struct vnode **, struct vattr *, 4481493c2eeSBrooks Davis struct componentname *, const char *); 449f40cb1c6SKonstantin Belousov void tmpfs_check_mtime(struct vnode *); 450d1fa59e9SXin LI void tmpfs_dir_attach(struct vnode *, struct tmpfs_dirent *); 451d1fa59e9SXin LI void tmpfs_dir_detach(struct vnode *, struct tmpfs_dirent *); 4524fd5efe7SGleb Kurtsou void tmpfs_dir_destroy(struct tmpfs_mount *, struct tmpfs_node *); 453d1fa59e9SXin LI struct tmpfs_dirent * tmpfs_dir_lookup(struct tmpfs_node *node, 454e3c7e753SKonstantin Belousov struct tmpfs_node *f, 455d1fa59e9SXin LI struct componentname *cnp); 456e1cdc30fSKonstantin Belousov int tmpfs_dir_getdents(struct tmpfs_mount *, struct tmpfs_node *, 457e1cdc30fSKonstantin Belousov struct uio *, int, u_long *, int *); 45899d57a6bSEd Schouten int tmpfs_dir_whiteout_add(struct vnode *, struct componentname *); 45999d57a6bSEd Schouten void tmpfs_dir_whiteout_remove(struct vnode *, struct componentname *); 4600b05cac3SAlan Cox int tmpfs_reg_resize(struct vnode *, off_t, boolean_t); 461b4b2596bSPawel Jakub Dawidek int tmpfs_chflags(struct vnode *, u_long, struct ucred *, struct thread *); 462d1fa59e9SXin LI int tmpfs_chmod(struct vnode *, mode_t, struct ucred *, struct thread *); 463d1fa59e9SXin LI int tmpfs_chown(struct vnode *, uid_t, gid_t, struct ucred *, 464d1fa59e9SXin LI struct thread *); 465d1fa59e9SXin LI int tmpfs_chsize(struct vnode *, u_quad_t, struct ucred *, struct thread *); 4667b81a399SKonstantin Belousov int tmpfs_chtimes(struct vnode *, struct vattr *, struct ucred *cred, 4677b81a399SKonstantin Belousov struct thread *); 468d1fa59e9SXin LI void tmpfs_itimes(struct vnode *, const struct timespec *, 469d1fa59e9SXin LI const struct timespec *); 470d1fa59e9SXin LI 471016b7c7eSKonstantin Belousov void tmpfs_set_accessed(struct tmpfs_mount *tm, struct tmpfs_node *node); 472e1cdc30fSKonstantin Belousov void tmpfs_set_status(struct tmpfs_mount *tm, struct tmpfs_node *node, 473e1cdc30fSKonstantin Belousov int status); 474d1fa59e9SXin LI int tmpfs_truncate(struct vnode *, off_t); 4751c07d69bSKonstantin Belousov struct tmpfs_dirent *tmpfs_dir_first(struct tmpfs_node *dnode, 4761c07d69bSKonstantin Belousov struct tmpfs_dir_cursor *dc); 4771c07d69bSKonstantin Belousov struct tmpfs_dirent *tmpfs_dir_next(struct tmpfs_node *dnode, 4781c07d69bSKonstantin Belousov struct tmpfs_dir_cursor *dc); 4792abdae33SMateusz Guzik static __inline void 4802abdae33SMateusz Guzik tmpfs_update(struct vnode *vp) 4812abdae33SMateusz Guzik { 4822abdae33SMateusz Guzik 4832abdae33SMateusz Guzik tmpfs_itimes(vp, NULL, NULL); 4842abdae33SMateusz Guzik } 485d1fa59e9SXin LI 486d1fa59e9SXin LI /* 487d1fa59e9SXin LI * Convenience macros to simplify some logical expressions. 488d1fa59e9SXin LI */ 489d1fa59e9SXin LI #define IMPLIES(a, b) (!(a) || (b)) 490d1fa59e9SXin LI #define IFF(a, b) (IMPLIES(a, b) && IMPLIES(b, a)) 491d1fa59e9SXin LI 492d1fa59e9SXin LI /* 493d1fa59e9SXin LI * Checks that the directory entry pointed by 'de' matches the name 'name' 494d1fa59e9SXin LI * with a length of 'len'. 495d1fa59e9SXin LI */ 496d1fa59e9SXin LI #define TMPFS_DIRENT_MATCHES(de, name, len) \ 4974fd5efe7SGleb Kurtsou (de->td_namelen == len && \ 4984fd5efe7SGleb Kurtsou bcmp((de)->ud.td_name, (name), (de)->td_namelen) == 0) 499d1fa59e9SXin LI 500d1fa59e9SXin LI /* 501d1fa59e9SXin LI * Ensures that the node pointed by 'node' is a directory and that its 502d1fa59e9SXin LI * contents are consistent with respect to directories. 503d1fa59e9SXin LI */ 5044fd5efe7SGleb Kurtsou #define TMPFS_VALIDATE_DIR(node) do { \ 505d1fa59e9SXin LI MPASS((node)->tn_type == VDIR); \ 506d1fa59e9SXin LI MPASS((node)->tn_size % sizeof(struct tmpfs_dirent) == 0); \ 5074fd5efe7SGleb Kurtsou } while (0) 508d1fa59e9SXin LI 509d1fa59e9SXin LI /* 510da7aa277SGleb Kurtsou * Amount of memory pages to reserve for the system (e.g., to not use by 511da7aa277SGleb Kurtsou * tmpfs). 512d1fa59e9SXin LI */ 513b4b3e349SAllan Jude #if !defined(TMPFS_PAGES_MINRESERVED) 514da7aa277SGleb Kurtsou #define TMPFS_PAGES_MINRESERVED (4 * 1024 * 1024 / PAGE_SIZE) 515b4b3e349SAllan Jude #endif 516d1fa59e9SXin LI 517da7aa277SGleb Kurtsou size_t tmpfs_mem_avail(void); 518da7aa277SGleb Kurtsou size_t tmpfs_pages_used(struct tmpfs_mount *tmp); 519*28bc23abSKonstantin Belousov int tmpfs_subr_init(void); 520a51c8071SKonstantin Belousov void tmpfs_subr_uninit(void); 521d1fa59e9SXin LI 522*28bc23abSKonstantin Belousov extern int tmpfs_pager_type; 523*28bc23abSKonstantin Belousov 524d1fa59e9SXin LI /* 525d1fa59e9SXin LI * Macros/functions to convert from generic data structures to tmpfs 526d1fa59e9SXin LI * specific ones. 527d1fa59e9SXin LI */ 528d1fa59e9SXin LI 529bba7ed20SKonstantin Belousov static inline struct tmpfs_mount * 530d1fa59e9SXin LI VFS_TO_TMPFS(struct mount *mp) 531d1fa59e9SXin LI { 532d1fa59e9SXin LI struct tmpfs_mount *tmp; 533d1fa59e9SXin LI 534bba7ed20SKonstantin Belousov MPASS(mp != NULL && mp->mnt_data != NULL); 535bba7ed20SKonstantin Belousov tmp = (struct tmpfs_mount *)mp->mnt_data; 536bba7ed20SKonstantin Belousov return (tmp); 537d1fa59e9SXin LI } 538d1fa59e9SXin LI 539bba7ed20SKonstantin Belousov static inline struct tmpfs_node * 540d1fa59e9SXin LI VP_TO_TMPFS_NODE(struct vnode *vp) 541d1fa59e9SXin LI { 542d1fa59e9SXin LI struct tmpfs_node *node; 543d1fa59e9SXin LI 544bba7ed20SKonstantin Belousov MPASS(vp != NULL && vp->v_data != NULL); 545d1fa59e9SXin LI node = (struct tmpfs_node *)vp->v_data; 546bba7ed20SKonstantin Belousov return (node); 547d1fa59e9SXin LI } 548d1fa59e9SXin LI 549172ffe70SMateusz Guzik #define VP_TO_TMPFS_NODE_SMR(vp) \ 550172ffe70SMateusz Guzik ((struct tmpfs_node *)vn_load_v_data_smr(vp)) 551172ffe70SMateusz Guzik 552bba7ed20SKonstantin Belousov static inline struct tmpfs_node * 553d1fa59e9SXin LI VP_TO_TMPFS_DIR(struct vnode *vp) 554d1fa59e9SXin LI { 555d1fa59e9SXin LI struct tmpfs_node *node; 556d1fa59e9SXin LI 557d1fa59e9SXin LI node = VP_TO_TMPFS_NODE(vp); 558d1fa59e9SXin LI TMPFS_VALIDATE_DIR(node); 559bba7ed20SKonstantin Belousov return (node); 560d1fa59e9SXin LI } 561d1fa59e9SXin LI 56200ac6a98SKonstantin Belousov static inline bool 56300ac6a98SKonstantin Belousov tmpfs_use_nc(struct vnode *vp) 56400ac6a98SKonstantin Belousov { 56500ac6a98SKonstantin Belousov 56600ac6a98SKonstantin Belousov return (!(VFS_TO_TMPFS(vp->v_mount)->tm_nonc)); 56700ac6a98SKonstantin Belousov } 5682abdae33SMateusz Guzik 5692abdae33SMateusz Guzik static inline void 5702abdae33SMateusz Guzik tmpfs_update_getattr(struct vnode *vp) 5712abdae33SMateusz Guzik { 5722abdae33SMateusz Guzik struct tmpfs_node *node; 5732abdae33SMateusz Guzik 5742abdae33SMateusz Guzik node = VP_TO_TMPFS_NODE(vp); 575016b7c7eSKonstantin Belousov if (__predict_false((node->tn_status & (TMPFS_NODE_MODIFIED | 576016b7c7eSKonstantin Belousov TMPFS_NODE_CHANGED)) != 0 || node->tn_accessed)) 5772abdae33SMateusz Guzik tmpfs_update(vp); 5782abdae33SMateusz Guzik } 5792abdae33SMateusz Guzik 580081e36e7SKonstantin Belousov extern struct fileops tmpfs_fnops; 581081e36e7SKonstantin Belousov 582f9f4c60aSDoug Moore #endif /* _KERNEL */ 58300ac6a98SKonstantin Belousov 584d1fa59e9SXin LI #endif /* _FS_TMPFS_TMPFS_H_ */ 585