Home
last modified time | relevance | path

Searched refs:nnode (Results 1 – 4 of 4) sorted by relevance

/trueos/sys/fs/tmpfs/
HDtmpfs_subr.c166 struct tmpfs_node *nnode; in tmpfs_alloc_node() local
201 nnode = (struct tmpfs_node *)uma_zalloc_arg( in tmpfs_alloc_node()
205 nnode->tn_type = type; in tmpfs_alloc_node()
206 vfs_timestamp(&nnode->tn_atime); in tmpfs_alloc_node()
207 nnode->tn_birthtime = nnode->tn_ctime = nnode->tn_mtime = in tmpfs_alloc_node()
208 nnode->tn_atime; in tmpfs_alloc_node()
209 nnode->tn_uid = uid; in tmpfs_alloc_node()
210 nnode->tn_gid = gid; in tmpfs_alloc_node()
211 nnode->tn_mode = mode; in tmpfs_alloc_node()
212 nnode->tn_id = alloc_unr(tmp->tm_ino_unr); in tmpfs_alloc_node()
[all …]
/trueos/sys/fs/nandfs/
HDnandfs_alloc.c188 nandfs_find_entry(struct nandfs_mdt* mdt, struct nandfs_node *nnode, in nandfs_find_entry() argument
198 error = nandfs_bread(nnode, dblock, NOCRED, 0, &req->bp_desc); in nandfs_find_entry()
204 error = nandfs_bread(nnode, bblock, NOCRED, 0, &req->bp_bitmap); in nandfs_find_entry()
211 error = nandfs_bread(nnode, eblock, NOCRED, 0, &req->bp_entry); in nandfs_find_entry()
HDnandfs_vnops.c2046 struct nandfs_node *nnode = VTON(vp); in nandfs_bmap() local
2047 struct nandfs_device *nandfsdev = nnode->nn_nandfsdev; in nandfs_bmap()
2053 nnode, (uintmax_t)nnode->nn_ino)); in nandfs_bmap()
2071 error = nandfs_bmap_lookup(nnode, ap->a_bn, &l2vmap); in nandfs_bmap()
2076 error = nandfs_vtop(nnode, l2vmap, &v2pmap); in nandfs_bmap()
2087 __func__, vp, nnode, (uintmax_t)nnode->nn_ino, (uintmax_t)ap->a_bn, in nandfs_bmap()
/trueos/contrib/gcc/
HDtree-ssa-structalias.c1148 unsigned int nnode = find (n); in scc_visit() local
1149 gcc_assert (nnode == n); in scc_visit()
1151 if (si->dfs[t] < si->dfs[nnode]) in scc_visit()
1716 unsigned int nnode = si->node_mapping[n]; in label_visit() local
1717 gcc_assert (nnode == n); in label_visit()
1719 if (si->dfs[t] < si->dfs[nnode]) in label_visit()
1736 unsigned int nnode = si->node_mapping[n]; in label_visit() local
1737 gcc_assert (nnode == n); in label_visit()
1739 if (si->dfs[t] < si->dfs[nnode]) in label_visit()