1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
/*
* Copyright (c) 2002 - 2003, Stockholms Universitet
* (Stockholm University, Stockholm Sweden)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the university nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include <xfs/xfs_locl.h>
#include <xfs/xfs_common.h>
#include <xfs/xfs_fs.h>
#include <xfs/xfs_deb.h>
#include <xfs/xfs_node.h>
#include <xfs/xfs_vnodeops.h>
#include <xfs/xfs_queue.h>
RCSID("$arla: xfs_node.c,v 1.3 2003/02/06 12:56:09 lha Exp $");
#define xfs_hash(node) \
(((node)->a+(node)->b+(node)->c+(node)->d) % XN_HASHSIZE)
/*
* Init the nnp node storage system
*/
void
nnfs_init_head(struct xfs_nodelist_head *head)
{
int i;
for (i = 0; i < XN_HASHSIZE; i++)
NNPQUEUE_INIT(&head->nh_nodelist[i]);
}
/*
* Tries to purge all nodes from the hashtable. Nodes that unpurgeable
* (still used nodes) are given to proc for special termination
* (conversion to dead node).
*/
void
xfs_node_purge(struct xfs_nodelist_head *head,
void (*func)(struct xfs_node *))
{
panic("xfs_node_purge");
}
/*
* xfs_node_find returns the node with the handle `handlep'.
*/
struct xfs_node *
xfs_node_find(struct xfs_nodelist_head *head, xfs_handle *handlep)
{
struct nh_node_list *h;
struct xfs_node *nn;
h = &head->nh_nodelist[xfs_hash(handlep)];
NNPQUEUE_FOREACH(nn, h, nn_hash) {
if (xfs_handle_eq(handlep, &nn->handle))
break;
}
return nn;
}
/*
* Remove the node `node' from the node storage system.
*/
void
xfs_remove_node(struct xfs_nodelist_head *head, struct xfs_node *node)
{
struct nh_node_list *h;
h = &head->nh_nodelist[xfs_hash(&node->handle)];
NNPQUEUE_REMOVE(node, h, nn_hash);
}
/*
* Add the node `node' from the node storage system.
*/
void
xfs_insert(struct xfs_nodelist_head *head, struct xfs_node *node)
{
struct nh_node_list *h;
h = &head->nh_nodelist[xfs_hash(&node->handle)];
NNPQUEUE_INSERT_HEAD(h, node, nn_hash);
}
/*
* Update `old_handlep' in the node list `head' to `new_handlep'.
*/
int
xfs_update_handle(struct xfs_nodelist_head *head,
xfs_handle *old_handlep, xfs_handle *new_handlep)
{
struct xfs_node *node;
node = xfs_node_find(head, new_handlep);
if (node)
return EEXIST;
node = xfs_node_find(head, old_handlep);
if (node == NULL)
return ENOENT;
xfs_remove_node(head, node);
node->handle = *new_handlep;
xfs_insert(head, node);
return 0;
}
|
