Lines Matching refs:entry
156 struct my_data *entry = NULL;
159 entry = container_of(q.next, struct my_data, link);
160 kref_get(&entry->refcount);
163 return entry;
168 struct my_data *entry = container_of(ref, struct my_data, refcount);
170 list_del(&entry->link);
171 kfree(entry);
174 static void put_entry(struct my_data *entry)
177 kref_put(&entry->refcount, release_entry);
191 static void put_entry(struct my_data *entry)
194 if (kref_put(&entry->refcount, release_entry)) {
195 list_del(&entry->link);
197 kfree(entry);
222 struct my_data *entry = NULL;
225 entry = container_of(q.next, struct my_data, link);
226 if (!kref_get_unless_zero(&entry->refcount))
227 entry = NULL;
230 return entry;
235 struct my_data *entry = container_of(ref, struct my_data, refcount);
238 list_del(&entry->link);
240 kfree(entry);
243 static void put_entry(struct my_data *entry)
245 kref_put(&entry->refcount, release_entry);
250 section that finds the entry in the lookup table,
270 struct my_data *entry = NULL;
273 entry = container_of(q.next, struct my_data, link);
274 if (!kref_get_unless_zero(&entry->refcount))
275 entry = NULL;
278 return entry;
283 struct my_data *entry = container_of(ref, struct my_data, refcount);
286 list_del_rcu(&entry->link);
288 kfree_rcu(entry, rhead);
291 static void put_entry(struct my_data *entry)
293 kref_put(&entry->refcount, release_entry_rcu);
298 by using kfree_rcu(entry, rhead) as done above, or by calling synchronize_rcu()