Lines Matching full:entry
186 struct my_data *entry = NULL;
189 entry = container_of(q.next, struct my_data, link);
190 kref_get(&entry->refcount);
193 return entry;
198 struct my_data *entry = container_of(ref, struct my_data, refcount);
200 list_del(&entry->link);
201 kfree(entry);
204 static void put_entry(struct my_data *entry)
207 kref_put(&entry->refcount, release_entry);
221 static void put_entry(struct my_data *entry)
224 if (kref_put(&entry->refcount, release_entry)) {
225 list_del(&entry->link);
227 kfree(entry);
242 struct my_data *entry = NULL;
245 entry = container_of(q.next, struct my_data, link);
246 if (!kref_get_unless_zero(&entry->refcount))
247 entry = NULL;
250 return entry;
255 struct my_data *entry = container_of(ref, struct my_data, refcount);
258 list_del(&entry->link);
260 kfree(entry);
263 static void put_entry(struct my_data *entry)
265 kref_put(&entry->refcount, release_entry);
270 section that finds the entry in the lookup table,
293 struct my_data *entry = NULL;
296 entry = container_of(q.next, struct my_data, link);
297 if (!kref_get_unless_zero(&entry->refcount))
298 entry = NULL;
301 return entry;
306 struct my_data *entry = container_of(ref, struct my_data, refcount);
309 list_del_rcu(&entry->link);
311 kfree_rcu(entry, rhead);
314 static void put_entry(struct my_data *entry)
316 kref_put(&entry->refcount, release_entry_rcu);
321 by using kfree_rcu(entry, rhead) as done above, or by calling synchronize_rcu()