Searched refs:waiters (Results 1 - 23 of 23) sorted by relevance

/macosx-10.10/ruby-106/ruby/lib/
H A Dthread.rb55 @waiters = {}
70 @waiters[Thread.current] = true
76 @waiters.delete(Thread.current)
89 t, _ = @waiters_mutex.synchronize { @waiters.shift }
105 threads = @waiters.keys
106 @waiters.clear
/macosx-10.10/bind9-45.101/bind9/lib/isc/win32/include/isc/
H A Dcondition.h41 unsigned int waiters; member in struct:isc_condition
/macosx-10.10/ntp-92/lib/isc/win32/include/isc/
H A Dcondition.h41 unsigned int waiters; member in struct:isc_condition
/macosx-10.10/bind9-45.101/bind9/lib/isc/win32/
H A Dcondition.c37 cond->waiters = 0;
176 REQUIRE(cond->waiters == 0);
201 * number of waiters > 0. Always reacquire the mutex regardless of the
218 cond->waiters++;
223 cond->waiters--;
/macosx-10.10/ntp-92/lib/isc/win32/
H A Dcondition.c37 cond->waiters = 0;
176 REQUIRE(cond->waiters == 0);
201 * number of waiters > 0. Always reacquire the mutex regardless of the
218 cond->waiters++;
223 cond->waiters--;
/macosx-10.10/SmartcardCCID-55008/libusb/libusb/libusb/os/
H A Dthreads_windows.c87 list_init(&cond->waiters );
95 if(!list_empty(&cond->waiters)) return ((errno=EBUSY )); // (!see above!)
113 list_for_each_entry(pos, &cond->waiters, list, struct usbi_cond_perthread) {
126 if(list_empty(&cond->waiters)) return 0; // no one to wakeup.
127 pos = list_entry(&cond->waiters.next, struct usbi_cond_perthread, list);
157 list_add(&pos->list, &cond->waiters);
H A Dthreads_windows.h38 struct list_head waiters; member in struct:usbi_cond_t_
/macosx-10.10/BerkeleyDB-21/db/repmgr/
H A Drepmgr_windows.c104 for (i=0; i<db_rep->waiters->next_avail; i++) {
105 slot = &db_rep->waiters->array[i];
166 table = db_rep->waiters;
211 slot->next_free = db_rep->waiters->first_free;
212 db_rep->waiters->first_free = slot;
295 * close_sync function. db_rep->waiters should be non-NULL iff all of these
341 db_rep->waiters = table;
357 db_rep->waiters = NULL;
373 for (i = 0; i < db_rep->waiters->next_avail; i++) {
374 if (!CloseHandle(db_rep->waiters
[all...]
H A Drepmgr_method.c223 db_rep->waiters = NULL;
/macosx-10.10/xnu-2782.1.97/tools/tests/affinity/
H A Dpool.c76 unsigned int waiters; member in struct:work_queue
257 sp->input->waiters++;
259 sp->input->waiters--;
283 * Signal waiters if required.
287 if (sp->output->waiters) {
405 sp->bufq.waiters = 0;
H A Dsets.c75 boolean_t waiters; member in struct:work_queue
246 sp->input->waiters = TRUE;
248 sp->input->waiters = FALSE;
261 * Signal waiters if required.
265 if (sp->output->waiters) {
435 sp->bufq.waiters = FALSE;
/macosx-10.10/kext_tools-384.1.4/
H A Dkextd_watchvol.c141 CFMutableArrayRef waiters; // reply ports awaiting this volume member in struct:watchedVol
504 // helper: caller must remove port from other structures (e.g. waiters queue)
506 // While the volume lock waiters queue is a CFArray (which takes its own
510 // where *port = (CFMachPortRef)CFArrayGetValueAtIndex(watched->waiters,i);
581 // cleans up watched->lock, checks for waiters, assigns the lock, and signals
590 // see if we have any waiters
591 // XX should have a loop that can try multiple waiters
592 if (watched->waiters && CFArrayGetCount(watched->waiters)) {
593 waiter = (CFMachPortRef)CFArrayGetValueAtIndex(watched->waiters,
[all...]
/macosx-10.10/BerkeleyDB-21/db/lock/
H A Dlock.c284 * Go through both waiters and holders. Don't bother
287 * awakened as their waiters are released.
289 for (lp = SH_TAILQ_FIRST(&sh_obj->waiters, __db_lock);
291 lp = SH_TAILQ_FIRST(&sh_obj->waiters, __db_lock))
602 * anyone on the holders list OR anyone on the waiters list.
618 * In case of conflict, we put the new lock on the end of the waiters
630 * join the waiters queue. This must be done as a single operation
694 * Look for conflicting waiters.
697 lp, &sh_obj->waiters, links, __db_lock)
703 * If there are no conflicting holders or waiters,
[all...]
H A Dlock_deadlock.c408 SH_TAILQ_FOREACH(lp, &op->waiters, links, __db_lock) {
516 * We only need consider objects that have waiters, so we use
517 * the list of objects with waiters (dd_objs) instead of traversing
518 * the entire hash table. For each object, we traverse the waiters
593 lp = SH_TAILQ_FIRST(&op->waiters, __db_lock);
878 SH_TAILQ_REMOVE(&sh_obj->waiters, lockp, links, __db_lock);
881 * Either the waiters list is now empty, in which case we remove
885 if (SH_TAILQ_FIRST(&sh_obj->waiters, __db_lock) == NULL) {
974 * we treat the first waiter like other waiters.
H A Dlock_stat.c585 SH_TAILQ_FOREACH(lp, &op->waiters, links, __db_lock)
/macosx-10.10/libxml2-26/libxml2/
H A Dthreads.c124 unsigned int waiters; member in struct:_xmlRMutex
307 tok->waiters = 0;
370 tok->waiters++;
373 tok->waiters--;
411 if (tok->waiters)
/macosx-10.10/pyobjc-45/2.6/pyobjc/pyobjc-core/libxml2-src/
H A Dthreads.c124 unsigned int waiters; member in struct:_xmlRMutex
307 tok->waiters = 0;
370 tok->waiters++;
373 tok->waiters--;
411 if (tok->waiters)
/macosx-10.10/objc4-646/runtime/
H A Dobjc-os.h509 HANDLE waiters; // semaphore for those in cond_wait() member in struct:__anon56
536 SignalObjectAndWait(c->mutex, c->waiters, INFINITE, FALSE);
544 // tell broadcaster that all waiters have awoken
561 ReleaseSemaphore(c->waiters, 1, 0);
574 ReleaseSemaphore(c->waiters, c->waitCount, 0);
577 // fairness: wait for everyone to move from waiters to mutex
H A Dobjc-os.mm50 c->waiters = CreateSemaphore(NULL, 0, 0x7fffffff, NULL);
/macosx-10.10/BerkeleyDB-21/db/dbinc/
H A Dlock.h66 SH_TAILQ_HEAD(__dobj) dd_objs; /* objects with waiters */
107 SH_TAILQ_HEAD(__waitl) waiters; /* List of waiting locks. */ member in struct:__db_lockobj
H A Drepmgr.h409 #define REPMGR_SYNC_INITED(db_rep) (db_rep->waiters != NULL)
H A Drep.h499 ACK_WAITERS_TABLE *waiters; member in struct:__db_rep
/macosx-10.10/xnu-2782.1.97/osfmk/kern/
H A Dlocks.c694 * Returns the current number of waiters.
824 * When there are waiters, we skip the hot-patch spot in the
876 int waiters; local
883 waiters = lck->lck_mtx_ptr->lck_mtx.lck_mtx_waiters;
885 waiters = lck->lck_mtx_waiters;
887 if ( !waiters) {

Completed in 296 milliseconds