anode             440 fs/hpfs/alloc.c struct anode *hpfs_alloc_anode(struct super_block *s, secno near, anode_secno *ano,
anode             443 fs/hpfs/alloc.c 	struct anode *a;
anode              18 fs/hpfs/anode.c 	struct anode *anode;
anode              28 fs/hpfs/anode.c 				if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
anode              29 fs/hpfs/anode.c 				btree = &anode->btree;
anode              63 fs/hpfs/anode.c 	struct anode *anode = NULL, *ranode = NULL;
anode              75 fs/hpfs/anode.c 		if (!(anode = hpfs_map_anode(s, node, &bh))) return -1;
anode              76 fs/hpfs/anode.c 		btree = &anode->btree;
anode              92 fs/hpfs/anode.c 		if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
anode              93 fs/hpfs/anode.c 		btree = &anode->btree;
anode             124 fs/hpfs/anode.c 		up = a != node ? anode->up : -1;
anode             125 fs/hpfs/anode.c 		if (!(anode = hpfs_alloc_anode(s, a, &na, &bh1))) {
anode             131 fs/hpfs/anode.c 			anode->up = node;
anode             132 fs/hpfs/anode.c 			anode->btree.fnode_parent = 1;
anode             133 fs/hpfs/anode.c 			anode->btree.n_used_nodes = btree->n_used_nodes;
anode             134 fs/hpfs/anode.c 			anode->btree.first_free = btree->first_free;
anode             135 fs/hpfs/anode.c 			anode->btree.n_free_nodes = 40 - anode->btree.n_used_nodes;
anode             136 fs/hpfs/anode.c 			memcpy(&anode->u, &btree->u, btree->n_used_nodes * 12);
anode             153 fs/hpfs/anode.c 		btree = &anode->btree;
anode             165 fs/hpfs/anode.c 		struct anode *new_anode;
anode             169 fs/hpfs/anode.c 			if (!(anode = hpfs_map_anode(s, up, &bh))) return -1;
anode             170 fs/hpfs/anode.c 			btree = &anode->btree;
anode             185 fs/hpfs/anode.c 			if ((anode = hpfs_map_anode(s, na, &bh))) {
anode             186 fs/hpfs/anode.c 				anode->up = up;
anode             187 fs/hpfs/anode.c 				anode->btree.fnode_parent = up == node && fnod;
anode             193 fs/hpfs/anode.c 		up = up != node ? anode->up : -1;
anode             199 fs/hpfs/anode.c 			anode = new_anode;
anode             201 fs/hpfs/anode.c 			anode->btree.internal = 1;
anode             202 fs/hpfs/anode.c 			anode->btree.n_used_nodes = 1;
anode             203 fs/hpfs/anode.c 			anode->btree.n_free_nodes = 59;
anode             204 fs/hpfs/anode.c 			anode->btree.first_free = 16;
anode             205 fs/hpfs/anode.c 			anode->btree.u.internal[0].down = a;
anode             206 fs/hpfs/anode.c 			anode->btree.u.internal[0].file_secno = -1;
anode             209 fs/hpfs/anode.c 			if ((anode = hpfs_map_anode(s, a, &bh))) {
anode             210 fs/hpfs/anode.c 				anode->up = na;
anode             216 fs/hpfs/anode.c 	if ((anode = hpfs_map_anode(s, na, &bh))) {
anode             217 fs/hpfs/anode.c 		anode->up = node;
anode             218 fs/hpfs/anode.c 		if (fnod) anode->btree.fnode_parent = 1;
anode             223 fs/hpfs/anode.c 		if (!(anode = hpfs_map_anode(s, node, &bh))) {
anode             227 fs/hpfs/anode.c 		btree = &anode->btree;
anode             240 fs/hpfs/anode.c 		struct anode *unode;
anode             271 fs/hpfs/anode.c 	struct anode *anode = NULL;
anode             287 fs/hpfs/anode.c 		if (!(anode = hpfs_map_anode(s, ano, &bh))) return;
anode             288 fs/hpfs/anode.c 		btree1 = &anode->btree;
anode             301 fs/hpfs/anode.c 	ano = anode->up;
anode             303 fs/hpfs/anode.c 		if (!(anode = hpfs_map_anode(s, ano, &bh))) return;
anode             304 fs/hpfs/anode.c 		btree1 = &anode->btree;
anode             326 fs/hpfs/anode.c 	struct anode *anode;
anode             328 fs/hpfs/anode.c 	if (!(anode = hpfs_map_anode(s, a, &bh))) return -1;
anode             329 fs/hpfs/anode.c 	return hpfs_bplus_lookup(s, NULL, &anode->btree, sec, bh);
anode             381 fs/hpfs/anode.c 	struct anode *anode;
anode             384 fs/hpfs/anode.c 		if (!(anode = hpfs_map_anode(s, a, &bh))) return;
anode             385 fs/hpfs/anode.c 		hpfs_remove_btree(s, &anode->btree);
anode             396 fs/hpfs/anode.c 	struct anode *anode;
anode             406 fs/hpfs/anode.c 		if (!(anode = hpfs_map_anode(s, f, &bh))) return;
anode             407 fs/hpfs/anode.c 		btree = &anode->btree;
anode             444 fs/hpfs/anode.c 		if (!(anode = hpfs_map_anode(s, node, &bh))) return;
anode             445 fs/hpfs/anode.c 		btree = &anode->btree;
anode             487 fs/hpfs/anode.c 			hpfs_ea_remove(s, ea_sec(ea), ea->anode, ea_len(ea));
anode              34 fs/hpfs/ea.c   			hpfs_ea_remove(s, ea_sec(ea), ea->anode, ea_len(ea));
anode              41 fs/hpfs/ea.c   		struct anode *anode;
anode              42 fs/hpfs/ea.c   		if ((anode = hpfs_map_anode(s, a, &bh))) {
anode              43 fs/hpfs/ea.c   			hpfs_remove_btree(s, &anode->btree);
anode             122 fs/hpfs/ea.c   	if (hpfs_ea_read(s, ea_sec(ea), ea->anode, 0, ea_len(ea), buf))
anode             140 fs/hpfs/ea.c   				return get_indirect_ea(s, ea->anode, ea_sec(ea), *size = ea_len(ea));
anode             166 fs/hpfs/ea.c   				return get_indirect_ea(s, ea->anode, ea_sec(ea), *size = ea_len(ea));
anode             203 fs/hpfs/ea.c   					set_indirect_ea(s, ea->anode, ea_sec(ea), data, size);
anode             227 fs/hpfs/ea.c   					set_indirect_ea(s, ea->anode, ea_sec(ea), data, size);
anode             466 fs/hpfs/hpfs.h   unsigned anode: 1;			/* 1 -> sector is an anode
anode             211 fs/hpfs/hpfs_fn.h struct anode *hpfs_alloc_anode(struct super_block *, secno, anode_secno *, struct buffer_head **);
anode             289 fs/hpfs/hpfs_fn.h struct anode *hpfs_map_anode(struct super_block *s, anode_secno, struct buffer_head **);
anode             175 fs/hpfs/map.c  struct anode *hpfs_map_anode(struct super_block *s, anode_secno ano, struct buffer_head **bhp)
anode             177 fs/hpfs/map.c  	struct anode *anode;
anode             179 fs/hpfs/map.c  	if ((anode = hpfs_map_sector(s, ano, bhp, ANODE_RD_AHEAD)))
anode             181 fs/hpfs/map.c  			if (anode->magic != ANODE_MAGIC || anode->self != ano) {
anode             185 fs/hpfs/map.c  			if ((unsigned)anode->btree.n_used_nodes + (unsigned)anode->btree.n_free_nodes !=
anode             186 fs/hpfs/map.c  			    (anode->btree.internal ? 60 : 40)) {
anode             190 fs/hpfs/map.c  			if (anode->btree.first_free !=
anode             191 fs/hpfs/map.c  			    8 + anode->btree.n_used_nodes * (anode->btree.internal ? 8 : 12)) {
anode             196 fs/hpfs/map.c  	return anode;