Rev 2687 | Rev 2730 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2687 | Rev 2691 | ||
---|---|---|---|
1 | /* |
1 | /* |
2 | * Copyright (c) 2007 Jakub Jermar |
2 | * Copyright (c) 2008 Jakub Jermar |
3 | * All rights reserved. |
3 | * All rights reserved. |
4 | * |
4 | * |
5 | * Redistribution and use in source and binary forms, with or without |
5 | * Redistribution and use in source and binary forms, with or without |
6 | * modification, are permitted provided that the following conditions |
6 | * modification, are permitted provided that the following conditions |
7 | * are met: |
7 | * are met: |
8 | * |
8 | * |
9 | * - Redistributions of source code must retain the above copyright |
9 | * - Redistributions of source code must retain the above copyright |
10 | * notice, this list of conditions and the following disclaimer. |
10 | * notice, this list of conditions and the following disclaimer. |
11 | * - Redistributions in binary form must reproduce the above copyright |
11 | * - Redistributions in binary form must reproduce the above copyright |
12 | * notice, this list of conditions and the following disclaimer in the |
12 | * notice, this list of conditions and the following disclaimer in the |
13 | * documentation and/or other materials provided with the distribution. |
13 | * documentation and/or other materials provided with the distribution. |
14 | * - The name of the author may not be used to endorse or promote products |
14 | * - The name of the author may not be used to endorse or promote products |
15 | * derived from this software without specific prior written permission. |
15 | * derived from this software without specific prior written permission. |
16 | * |
16 | * |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
27 | */ |
28 | 28 | ||
29 | /** @addtogroup fs |
29 | /** @addtogroup fs |
30 | * @{ |
30 | * @{ |
31 | */ |
31 | */ |
32 | 32 | ||
33 | /** |
33 | /** |
34 | * @file vfs_node.c |
34 | * @file vfs_node.c |
35 | * @brief Various operations on VFS nodes have their home in this file. |
35 | * @brief Various operations on VFS nodes have their home in this file. |
36 | */ |
36 | */ |
37 | 37 | ||
38 | #include "vfs.h" |
38 | #include "vfs.h" |
39 | #include <stdlib.h> |
39 | #include <stdlib.h> |
40 | #include <string.h> |
40 | #include <string.h> |
41 | #include <atomic.h> |
41 | #include <atomic.h> |
42 | #include <futex.h> |
42 | #include <futex.h> |
43 | #include <rwlock.h> |
43 | #include <rwlock.h> |
44 | #include <libadt/hash_table.h> |
44 | #include <libadt/hash_table.h> |
45 | #include <assert.h> |
45 | #include <assert.h> |
46 | 46 | ||
47 | /** Futex protecting the VFS node hash table. */ |
47 | /** Futex protecting the VFS node hash table. */ |
48 | atomic_t nodes_futex = FUTEX_INITIALIZER; |
48 | atomic_t nodes_futex = FUTEX_INITIALIZER; |
49 | 49 | ||
50 | #define NODES_BUCKETS_LOG 8 |
50 | #define NODES_BUCKETS_LOG 8 |
51 | #define NODES_BUCKETS (1 << NODES_BUCKETS_LOG) |
51 | #define NODES_BUCKETS (1 << NODES_BUCKETS_LOG) |
52 | 52 | ||
53 | /** VFS node hash table containing all active, in-memory VFS nodes. */ |
53 | /** VFS node hash table containing all active, in-memory VFS nodes. */ |
54 | hash_table_t nodes; |
54 | hash_table_t nodes; |
55 | 55 | ||
56 | #define KEY_FS_HANDLE 0 |
56 | #define KEY_FS_HANDLE 0 |
57 | #define KEY_DEV_HANDLE 1 |
57 | #define KEY_DEV_HANDLE 1 |
58 | #define KEY_INDEX 2 |
58 | #define KEY_INDEX 2 |
59 | 59 | ||
60 | static hash_index_t nodes_hash(unsigned long []); |
60 | static hash_index_t nodes_hash(unsigned long []); |
61 | static int nodes_compare(unsigned long [], hash_count_t, link_t *); |
61 | static int nodes_compare(unsigned long [], hash_count_t, link_t *); |
62 | static void nodes_remove_callback(link_t *); |
62 | static void nodes_remove_callback(link_t *); |
63 | 63 | ||
64 | /** VFS node hash table operations. */ |
64 | /** VFS node hash table operations. */ |
65 | hash_table_operations_t nodes_ops = { |
65 | hash_table_operations_t nodes_ops = { |
66 | .hash = nodes_hash, |
66 | .hash = nodes_hash, |
67 | .compare = nodes_compare, |
67 | .compare = nodes_compare, |
68 | .remove_callback = nodes_remove_callback |
68 | .remove_callback = nodes_remove_callback |
69 | }; |
69 | }; |
70 | 70 | ||
71 | /** Initialize the VFS node hash table. |
71 | /** Initialize the VFS node hash table. |
72 | * |
72 | * |
73 | * @return Return true on success, false on failure. |
73 | * @return Return true on success, false on failure. |
74 | */ |
74 | */ |
75 | bool vfs_nodes_init(void) |
75 | bool vfs_nodes_init(void) |
76 | { |
76 | { |
77 | return hash_table_create(&nodes, NODES_BUCKETS, 3, &nodes_ops); |
77 | return hash_table_create(&nodes, NODES_BUCKETS, 3, &nodes_ops); |
78 | } |
78 | } |
79 | 79 | ||
80 | static inline void _vfs_node_addref(vfs_node_t *node) |
80 | static inline void _vfs_node_addref(vfs_node_t *node) |
81 | { |
81 | { |
82 | node->refcnt++; |
82 | node->refcnt++; |
83 | } |
83 | } |
84 | 84 | ||
85 | /** Increment reference count of a VFS node. |
85 | /** Increment reference count of a VFS node. |
86 | * |
86 | * |
87 | * @param node VFS node that will have its refcnt incremented. |
87 | * @param node VFS node that will have its refcnt incremented. |
88 | */ |
88 | */ |
89 | void vfs_node_addref(vfs_node_t *node) |
89 | void vfs_node_addref(vfs_node_t *node) |
90 | { |
90 | { |
91 | futex_down(&nodes_futex); |
91 | futex_down(&nodes_futex); |
92 | _vfs_node_addref(node); |
92 | _vfs_node_addref(node); |
93 | futex_up(&nodes_futex); |
93 | futex_up(&nodes_futex); |
94 | } |
94 | } |
95 | 95 | ||
96 | /** Decrement reference count of a VFS node. |
96 | /** Decrement reference count of a VFS node. |
97 | * |
97 | * |
98 | * This function handles the case when the reference count drops to zero. |
98 | * This function handles the case when the reference count drops to zero. |
99 | * |
99 | * |
100 | * @param node VFS node that will have its refcnt decremented. |
100 | * @param node VFS node that will have its refcnt decremented. |
101 | */ |
101 | */ |
102 | void vfs_node_delref(vfs_node_t *node) |
102 | void vfs_node_delref(vfs_node_t *node) |
103 | { |
103 | { |
104 | futex_down(&nodes_futex); |
104 | futex_down(&nodes_futex); |
105 | if (node->refcnt-- == 1) { |
105 | if (node->refcnt-- == 1) { |
106 | unsigned long key[] = { |
106 | unsigned long key[] = { |
107 | [KEY_FS_HANDLE] = node->fs_handle, |
107 | [KEY_FS_HANDLE] = node->fs_handle, |
108 | [KEY_DEV_HANDLE] = node->dev_handle, |
108 | [KEY_DEV_HANDLE] = node->dev_handle, |
109 | [KEY_INDEX] = node->index |
109 | [KEY_INDEX] = node->index |
110 | }; |
110 | }; |
111 | hash_table_remove(&nodes, key, 3); |
111 | hash_table_remove(&nodes, key, 3); |
112 | } |
112 | } |
113 | futex_up(&nodes_futex); |
113 | futex_up(&nodes_futex); |
114 | } |
114 | } |
115 | 115 | ||
116 | /** Find VFS node. |
116 | /** Find VFS node. |
117 | * |
117 | * |
118 | * This function will try to lookup the given triplet in the VFS node hash |
118 | * This function will try to lookup the given triplet in the VFS node hash |
119 | * table. In case the triplet is not found there, a new VFS node is created. |
119 | * table. In case the triplet is not found there, a new VFS node is created. |
120 | * In any case, the VFS node will have its reference count incremented. Every |
120 | * In any case, the VFS node will have its reference count incremented. Every |
121 | * node returned by this call should be eventually put back by calling |
121 | * node returned by this call should be eventually put back by calling |
122 | * vfs_node_put() on it. |
122 | * vfs_node_put() on it. |
123 | * |
123 | * |
124 | * @param triplet Triplet encoding the identity of the VFS node. |
124 | * @param result Populated lookup result structure. |
125 | * @param size Size of the node as filled by vfs_lookup_internal(). |
- | |
126 | * |
125 | * |
127 | * @return VFS node corresponding to the given triplet. |
126 | * @return VFS node corresponding to the given triplet. |
128 | */ |
127 | */ |
129 | vfs_node_t *vfs_node_get(vfs_triplet_t *triplet, size_t size) |
128 | vfs_node_t *vfs_node_get(vfs_lookup_res_t *result) |
130 | { |
129 | { |
131 | unsigned long key[] = { |
130 | unsigned long key[] = { |
132 | [KEY_FS_HANDLE] = triplet->fs_handle, |
131 | [KEY_FS_HANDLE] = result->triplet.fs_handle, |
133 | [KEY_DEV_HANDLE] = triplet->dev_handle, |
132 | [KEY_DEV_HANDLE] = result->triplet.dev_handle, |
134 | [KEY_INDEX] = triplet->index |
133 | [KEY_INDEX] = result->triplet.index |
135 | }; |
134 | }; |
136 | link_t *tmp; |
135 | link_t *tmp; |
137 | vfs_node_t *node; |
136 | vfs_node_t *node; |
138 | 137 | ||
139 | futex_down(&nodes_futex); |
138 | futex_down(&nodes_futex); |
140 | tmp = hash_table_find(&nodes, key); |
139 | tmp = hash_table_find(&nodes, key); |
141 | if (!tmp) { |
140 | if (!tmp) { |
142 | node = (vfs_node_t *) malloc(sizeof(vfs_node_t)); |
141 | node = (vfs_node_t *) malloc(sizeof(vfs_node_t)); |
143 | if (!node) { |
142 | if (!node) { |
144 | futex_up(&nodes_futex); |
143 | futex_up(&nodes_futex); |
145 | return NULL; |
144 | return NULL; |
146 | } |
145 | } |
147 | memset(node, 0, sizeof(vfs_node_t)); |
146 | memset(node, 0, sizeof(vfs_node_t)); |
148 | node->fs_handle = triplet->fs_handle; |
147 | node->fs_handle = result->triplet.fs_handle; |
149 | node->dev_handle = triplet->fs_handle; |
148 | node->dev_handle = result->triplet.fs_handle; |
150 | node->index = triplet->index; |
149 | node->index = result->triplet.index; |
151 | node->size = size; |
150 | node->size = result->size; |
152 | link_initialize(&node->nh_link); |
151 | link_initialize(&node->nh_link); |
153 | rwlock_initialize(&node->contents_rwlock); |
152 | rwlock_initialize(&node->contents_rwlock); |
154 | hash_table_insert(&nodes, key, &node->nh_link); |
153 | hash_table_insert(&nodes, key, &node->nh_link); |
155 | } else { |
154 | } else { |
156 | node = hash_table_get_instance(tmp, vfs_node_t, nh_link); |
155 | node = hash_table_get_instance(tmp, vfs_node_t, nh_link); |
157 | } |
156 | } |
158 | 157 | ||
159 | assert(node->size == size); |
158 | assert(node->size == result->size); |
160 | 159 | ||
161 | _vfs_node_addref(node); |
160 | _vfs_node_addref(node); |
162 | futex_up(&nodes_futex); |
161 | futex_up(&nodes_futex); |
163 | 162 | ||
164 | return node; |
163 | return node; |
165 | } |
164 | } |
166 | 165 | ||
167 | /** Return VFS node when no longer needed by the caller. |
166 | /** Return VFS node when no longer needed by the caller. |
168 | * |
167 | * |
169 | * This function will remove the reference on the VFS node created by |
168 | * This function will remove the reference on the VFS node created by |
170 | * vfs_node_get(). This function can only be called as a closing bracket to the |
169 | * vfs_node_get(). This function can only be called as a closing bracket to the |
171 | * preceding vfs_node_get() call. |
170 | * preceding vfs_node_get() call. |
172 | * |
171 | * |
173 | * @param node VFS node being released. |
172 | * @param node VFS node being released. |
174 | */ |
173 | */ |
175 | void vfs_node_put(vfs_node_t *node) |
174 | void vfs_node_put(vfs_node_t *node) |
176 | { |
175 | { |
177 | vfs_node_delref(node); |
176 | vfs_node_delref(node); |
178 | } |
177 | } |
179 | 178 | ||
180 | hash_index_t nodes_hash(unsigned long key[]) |
179 | hash_index_t nodes_hash(unsigned long key[]) |
181 | { |
180 | { |
182 | hash_index_t a = key[KEY_FS_HANDLE] << (NODES_BUCKETS_LOG / 4); |
181 | hash_index_t a = key[KEY_FS_HANDLE] << (NODES_BUCKETS_LOG / 4); |
183 | hash_index_t b = (a | key[KEY_DEV_HANDLE]) << (NODES_BUCKETS_LOG / 2); |
182 | hash_index_t b = (a | key[KEY_DEV_HANDLE]) << (NODES_BUCKETS_LOG / 2); |
184 | 183 | ||
185 | return (b | key[KEY_INDEX]) & (NODES_BUCKETS - 1); |
184 | return (b | key[KEY_INDEX]) & (NODES_BUCKETS - 1); |
186 | } |
185 | } |
187 | 186 | ||
188 | int nodes_compare(unsigned long key[], hash_count_t keys, link_t *item) |
187 | int nodes_compare(unsigned long key[], hash_count_t keys, link_t *item) |
189 | { |
188 | { |
190 | vfs_node_t *node = hash_table_get_instance(item, vfs_node_t, nh_link); |
189 | vfs_node_t *node = hash_table_get_instance(item, vfs_node_t, nh_link); |
191 | return (node->fs_handle == key[KEY_FS_HANDLE]) && |
190 | return (node->fs_handle == key[KEY_FS_HANDLE]) && |
192 | (node->dev_handle == key[KEY_DEV_HANDLE]) && |
191 | (node->dev_handle == key[KEY_DEV_HANDLE]) && |
193 | (node->index == key[KEY_INDEX]); |
192 | (node->index == key[KEY_INDEX]); |
194 | } |
193 | } |
195 | 194 | ||
196 | void nodes_remove_callback(link_t *item) |
195 | void nodes_remove_callback(link_t *item) |
197 | { |
196 | { |
198 | vfs_node_t *node = hash_table_get_instance(item, vfs_node_t, nh_link); |
197 | vfs_node_t *node = hash_table_get_instance(item, vfs_node_t, nh_link); |
199 | free(node); |
198 | free(node); |
200 | } |
199 | } |
201 | 200 | ||
202 | /** |
201 | /** |
203 | * @} |
202 | * @} |
204 | */ |
203 | */ |
205 | 204 |