Searched refs:writers (Results 1 – 6 of 6) sorted by relevance
987 rms->writers = 0; in rms_init()998 MPASS(rms->writers == 0); in rms_destroy()1012 while (rms->writers > 0) in rms_rlock_fallback()1075 MPASS(rms->writers > 0); in rms_runlock_fallback()1081 wakeup_one(&rms->writers); in rms_runlock_fallback()1173 MPASS(rms->writers == 1); in rms_wlock_switch()1193 rms->writers++; in rms_wlock()1194 if (rms->writers > 1) { in rms_wlock()1229 MPASS(rms->writers >= 1); in rms_wunlock()1231 rms->writers--; in rms_wunlock()[all …]
79 int writers; member
17 Since these data structures are lockless, the writers and readers19 an element from a data structure, the writers cannot return the memory159 Hence, they can be called concurrently from multiple writers even while
90 …top the readers from accessing the hash table until writers finish their updates. Readers and writ…
1113 The threads performing table lookup are actually table writers rather than just readers.
88 that the writers can free the memory associated with the lock free data