struct hlist_node *tmp;
int i;
- hash_for_each_safe(db->send_access_hash, i, tmp, e, hentry)
+ hash_for_each_safe(db->entries_hash, i, tmp, e, hentry)
if (e->owner == owner) {
hash_del(&e->hentry);
kdbus_policy_entry_free(e);
}
/**
- * kdbus_policy_remove_conn() - remove all entries related to a connection
+ * kdbus_policy_remove_conn() - remove all cached entries related to
+ * a connection
* @db: The policy database
* @conn: The connection which items to remove
*/
* At the same time, the lookup mechanism won't find any collisions
* when looking for already exising names.
*/
- hash_for_each_safe(db->send_access_hash, i, tmp, e, hentry)
+ hash_for_each_safe(db->entries_hash, i, tmp, e, hentry)
if (e->owner == owner) {
struct kdbus_policy_list_entry *l;