4 * Copyright (C) 2012 VMware, Inc. All rights reserved.
6 * This program is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License as published by the
8 * Free Software Foundation version 2 and no later version.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
12 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 #include <linux/vmw_vmci_defs.h>
17 #include <linux/hash.h>
18 #include <linux/types.h>
19 #include <linux/rculist.h>
20 #include <linux/completion.h>
22 #include "vmci_resource.h"
23 #include "vmci_driver.h"
26 #define VMCI_RESOURCE_HASH_BITS 7
27 #define VMCI_RESOURCE_HASH_BUCKETS (1 << VMCI_RESOURCE_HASH_BITS)
29 struct vmci_hash_table
{
31 struct hlist_head entries
[VMCI_RESOURCE_HASH_BUCKETS
];
34 static struct vmci_hash_table vmci_resource_table
= {
35 .lock
= __SPIN_LOCK_UNLOCKED(vmci_resource_table
.lock
),
38 static unsigned int vmci_resource_hash(struct vmci_handle handle
)
40 return hash_32(handle
.resource
, VMCI_RESOURCE_HASH_BITS
);
44 * Gets a resource (if one exists) matching given handle from the hash table.
46 static struct vmci_resource
*vmci_resource_lookup(struct vmci_handle handle
,
47 enum vmci_resource_type type
)
49 struct vmci_resource
*r
, *resource
= NULL
;
50 unsigned int idx
= vmci_resource_hash(handle
);
53 hlist_for_each_entry_rcu(r
,
54 &vmci_resource_table
.entries
[idx
], node
) {
55 u32 cid
= r
->handle
.context
;
56 u32 rid
= r
->handle
.resource
;
58 if (r
->type
== type
&&
59 rid
== handle
.resource
&&
60 (cid
== handle
.context
|| cid
== VMCI_INVALID_ID
)) {
71 * Find an unused resource ID and return it. The first
72 * VMCI_RESERVED_RESOURCE_ID_MAX are reserved so we start from
74 * Returns VMCI resource id on success, VMCI_INVALID_ID on failure.
76 static u32
vmci_resource_find_id(u32 context_id
,
77 enum vmci_resource_type resource_type
)
79 static u32 resource_id
= VMCI_RESERVED_RESOURCE_ID_MAX
+ 1;
80 u32 old_rid
= resource_id
;
84 * Generate a unique resource ID. Keep on trying until we wrap around
88 struct vmci_handle handle
;
90 current_rid
= resource_id
;
92 if (unlikely(resource_id
== VMCI_INVALID_ID
)) {
93 /* Skip the reserved rids. */
94 resource_id
= VMCI_RESERVED_RESOURCE_ID_MAX
+ 1;
97 handle
= vmci_make_handle(context_id
, current_rid
);
98 if (!vmci_resource_lookup(handle
, resource_type
))
100 } while (resource_id
!= old_rid
);
102 return VMCI_INVALID_ID
;
106 int vmci_resource_add(struct vmci_resource
*resource
,
107 enum vmci_resource_type resource_type
,
108 struct vmci_handle handle
)
114 spin_lock(&vmci_resource_table
.lock
);
116 if (handle
.resource
== VMCI_INVALID_ID
) {
117 handle
.resource
= vmci_resource_find_id(handle
.context
,
119 if (handle
.resource
== VMCI_INVALID_ID
) {
120 result
= VMCI_ERROR_NO_HANDLE
;
123 } else if (vmci_resource_lookup(handle
, resource_type
)) {
124 result
= VMCI_ERROR_ALREADY_EXISTS
;
128 resource
->handle
= handle
;
129 resource
->type
= resource_type
;
130 INIT_HLIST_NODE(&resource
->node
);
131 kref_init(&resource
->kref
);
132 init_completion(&resource
->done
);
134 idx
= vmci_resource_hash(resource
->handle
);
135 hlist_add_head_rcu(&resource
->node
, &vmci_resource_table
.entries
[idx
]);
137 result
= VMCI_SUCCESS
;
140 spin_unlock(&vmci_resource_table
.lock
);
144 void vmci_resource_remove(struct vmci_resource
*resource
)
146 struct vmci_handle handle
= resource
->handle
;
147 unsigned int idx
= vmci_resource_hash(handle
);
148 struct vmci_resource
*r
;
150 /* Remove resource from hash table. */
151 spin_lock(&vmci_resource_table
.lock
);
153 hlist_for_each_entry(r
, &vmci_resource_table
.entries
[idx
], node
) {
154 if (vmci_handle_is_equal(r
->handle
, resource
->handle
)) {
155 hlist_del_init_rcu(&r
->node
);
160 spin_unlock(&vmci_resource_table
.lock
);
163 vmci_resource_put(resource
);
164 wait_for_completion(&resource
->done
);
167 struct vmci_resource
*
168 vmci_resource_by_handle(struct vmci_handle resource_handle
,
169 enum vmci_resource_type resource_type
)
171 struct vmci_resource
*r
, *resource
= NULL
;
175 r
= vmci_resource_lookup(resource_handle
, resource_type
);
177 (resource_type
== r
->type
||
178 resource_type
== VMCI_RESOURCE_TYPE_ANY
)) {
179 resource
= vmci_resource_get(r
);
188 * Get a reference to given resource.
190 struct vmci_resource
*vmci_resource_get(struct vmci_resource
*resource
)
192 kref_get(&resource
->kref
);
197 static void vmci_release_resource(struct kref
*kref
)
199 struct vmci_resource
*resource
=
200 container_of(kref
, struct vmci_resource
, kref
);
202 /* Verify the resource has been unlinked from hash table */
203 WARN_ON(!hlist_unhashed(&resource
->node
));
205 /* Signal that container of this resource can now be destroyed */
206 complete(&resource
->done
);
210 * Resource's release function will get called if last reference.
211 * If it is the last reference, then we are sure that nobody else
212 * can increment the count again (it's gone from the resource hash
213 * table), so there's no need for locking here.
215 int vmci_resource_put(struct vmci_resource
*resource
)
218 * We propagate the information back to caller in case it wants to know
219 * whether entry was freed.
221 return kref_put(&resource
->kref
, vmci_release_resource
) ?
222 VMCI_SUCCESS_ENTRY_DEAD
: VMCI_SUCCESS
;
225 struct vmci_handle
vmci_resource_handle(struct vmci_resource
*resource
)
227 return resource
->handle
;