Searched refs:hashbin (Results 1 - 2 of 2) sorted by relevance

/net/irda/
H A Dirqueue.c53 * Notes on the concurrent access to hashbin and other SMP issues
59 * management of concurrent access to the hashbin and how to guarantee the
63 * 1) Protect user data (content pointed by the hashbin)
64 * 2) Protect hashbin structure itself (linked list in each bin)
76 * B) No protection for the hashbin struct global data
89 * hashbin :
93 * As the data is still in the hashbin, it may be changed or free'd
95 * be done within the hashbin, but must include use of the data within
108 * hashbin locking :
110 * 2) hashbin
355 hashbin_t* hashbin; local
391 hashbin_delete( hashbin_t* hashbin, FREE_FUNC free_func) argument
449 hashbin_insert(hashbin_t* hashbin, irda_queue_t* entry, long hashv, const char* name) argument
502 hashbin_remove_first( hashbin_t *hashbin) argument
562 hashbin_remove( hashbin_t* hashbin, long hashv, const char* name) argument
655 hashbin_remove_this( hashbin_t* hashbin, irda_queue_t* entry) argument
717 hashbin_find( hashbin_t* hashbin, long hashv, const char* name ) argument
772 hashbin_lock_find( hashbin_t* hashbin, long hashv, const char* name ) argument
802 hashbin_find_next( hashbin_t* hashbin, long hashv, const char* name, void ** pnext) argument
840 hashbin_get_first( hashbin_t* hashbin) argument
875 hashbin_get_next( hashbin_t *hashbin) argument
[all...]
H A Dirlmp.c348 /* We must remove ourselves from the hashbin *first*. This ensure
1866 hashbin_t *hashbin; member in struct:irlmp_iter_state
1876 spin_lock_irq(&iter->hashbin->hb_spinlock);
1877 for (element = hashbin_get_first(iter->hashbin);
1879 element = hashbin_get_next(iter->hashbin)) {
1881 /* NB: hashbin left locked */
1885 spin_unlock_irq(&iter->hashbin->hb_spinlock);
1886 iter->hashbin = NULL;
1897 iter->hashbin = NULL;
1901 iter->hashbin
[all...]

Completed in 71 milliseconds