Searched refs:locks (Results 1 - 25 of 30) sorted by last modified time

12

/freebsd-9.3-release/sys/compat/linux/
H A Dlinux_misc.c101 LIN_SDT_PROBE_DECLARE(locks, emul_lock, locked);
102 LIN_SDT_PROBE_DECLARE(locks, emul_lock, unlock);
103 LIN_SDT_PROBE_DECLARE(locks, emul_shared_rlock, locked);
104 LIN_SDT_PROBE_DECLARE(locks, emul_shared_rlock, unlock);
105 LIN_SDT_PROBE_DECLARE(locks, emul_shared_wlock, locked);
106 LIN_SDT_PROBE_DECLARE(locks, emul_shared_wlock, unlock);
H A Dlinux_futex.c75 LIN_SDT_PROBE_DECLARE(locks, emul_lock, locked);
76 LIN_SDT_PROBE_DECLARE(locks, emul_lock, unlock);
79 * Futex part for the special DTrace module "locks".
81 LIN_SDT_PROBE_DEFINE1(locks, futex_mtx, locked, "struct mtx *");
82 LIN_SDT_PROBE_DEFINE1(locks, futex_mtx, unlock, "struct mtx *");
231 LIN_SDT_PROBE1(locks, futex_mtx, \
235 LIN_SDT_PROBE1(locks, futex_mtx, \
H A Dcheck_internal_locks.d32 * Check if the internal locks are correctly acquired/released:
33 * - no recursive locking (mtx locks, write locks)
50 linuxulator*:locks:emul_lock:locked,
51 linuxulator*:locks:emul_shared_wlock:locked,
52 linuxulator*:locks:futex_mtx:locked
60 linuxulator*:locks:emul_lock:locked,
61 linuxulator*:locks:emul_shared_rlock:locked,
62 linuxulator*:locks:emul_shared_wlock:locked,
63 linuxulator*:locks
[all...]
H A Dlinux_emul.c76 * Special DTrace module "locks", it covers some linuxulator internal
77 * locks.
79 LIN_SDT_PROBE_DEFINE1(locks, emul_lock, locked, "struct mtx *");
80 LIN_SDT_PROBE_DEFINE1(locks, emul_lock, unlock, "struct mtx *");
81 LIN_SDT_PROBE_DEFINE1(locks, emul_shared_rlock, locked, "struct sx *");
82 LIN_SDT_PROBE_DEFINE1(locks, emul_shared_rlock, unlock, "struct sx *");
83 LIN_SDT_PROBE_DEFINE1(locks, emul_shared_wlock, locked, "struct sx *");
84 LIN_SDT_PROBE_DEFINE1(locks, emul_shared_wlock, unlock, "struct sx *");
H A Dlinux_emul.h68 * DTrace probes for locks should be fired after locking and before releasing
74 LIN_SDT_PROBE1(locks, emul_lock, \
78 LIN_SDT_PROBE1(locks, emul_lock, \
85 LIN_SDT_PROBE1(locks, emul_shared_rlock, \
89 LIN_SDT_PROBE1(locks, emul_shared_rlock, \
95 LIN_SDT_PROBE1(locks, emul_shared_wlock, \
99 LIN_SDT_PROBE1(locks, emul_shared_wlock, \
H A Dlinux_fork.c61 LIN_SDT_PROBE_DECLARE(locks, emul_lock, locked);
62 LIN_SDT_PROBE_DECLARE(locks, emul_lock, unlock);
H A Dtrace_futexes.d33 * - internal locks
107 /* Internal locks */
109 linuxulator*:locks:futex_mtx:locked
120 linuxulator*:locks:futex_mtx:unlock
130 linuxulator*:locks:futex_mtx:unlock
137 /* Timeout handling for internal locks */
171 printf("Number of locks per type:");
/freebsd-9.3-release/contrib/ntp/sntp/libevent/test/
H A Dregress_bufferevent.c201 * Trace lock/unlock/alloc/free for locks.
216 /* Map of locks */
217 lock_wrapper *locks; member in struct:lock_unlock_base
220 .locks = NULL,
227 lock_wrapper *lock = &lu_base.locks[i];
237 lu_base.locks = realloc(lu_base.locks,
240 lu_base.locks[lu_base.nr_locks - 1] = (lock_wrapper){ lock, ALLOC, 0 };
304 /** re-create debug locks correctly */
314 free(lu_base.locks);
[all...]
/freebsd-9.3-release/lib/libc/gen/
H A Ddlfcn.c210 _rtld_atfork_pre(int *locks) argument
216 _rtld_atfork_post(int *locks) argument
/freebsd-9.3-release/contrib/compiler-rt/lib/
H A Datomic.c11 * arbitrary-sized memory locations. This design uses locks that should
21 * locks and hashes the object pointers to find the one that it should use.
38 /// Number of locks. This allocates one page on 32-bit platforms, two on
71 /// locks for atomic operations
72 static Lock locks[SPINLOCK_COUNT] = { [0 ... SPINLOCK_COUNT-1] = {0,1,0} }; variable
87 /// locks for atomic operations
88 static Lock locks[SPINLOCK_COUNT]; variable
106 return locks + (hash & SPINLOCK_MASK);
/freebsd-9.3-release/contrib/ipfilter/
H A DHISTORY635 enable use of shared/exclusive locks on freebsd5 and above
1332 use readers/writers locks in Solaris2 in place of some mutexes.
/freebsd-9.3-release/contrib/cvs/contrib/
H A Dpvcs2rcs.in80 # (The directory locks and existance checking make this a fairly quick
165 [-v none|locks|exists] [options] [path...]
268 verify => "locks",
465 if ($options{verify} =~ /^locks$/ ) {
510 if ($options{verify} =~ /^locks$/) {
750 if ($options{verify} =~ /^locks|exists$/ and -f $rcsarchive)
1021 @hits = grep /^$options{verify}/i, ("none", "locks", "exists", "lockdates", "revs", "full");
1025 . " Must be one of: 'none', 'locks', 'exists', 'lockdates', 'revs',\n"
1029 $options{verify} =~ /^none|locks|exists$/ or die
H A Drcslock.in75 # if any locks are outstanding and what versions of the file are
78 # see if any locks are outstanding. If locks are outstanding, the
151 # Create the locks associative array. The elements in the array are
154 # The name of the RCS file with a value of the total number of locks found
177 if ( $_ =~ /^locks: strict$/ )
185 # access list: is the line immediately following the list of locks.
194 $locks{$curfile}++;
197 $locks{"$curfile" . "$2"} = $1
214 if ( defined $locks{
[all...]
/freebsd-9.3-release/contrib/cvs/src/
H A Drcs.c531 if (STREQ (key, "locks"))
538 "Duplicate `locks' keyword found in RCS file.");
971 if (rnode->locks != (List *) NULL)
972 dellist (&rnode->locks);
2115 * process the locks list of the rcs file
3257 rcs->locks = getlist ();
3258 do_locks (rcs->locks, rcs->locks_data);
3263 return rcs->locks;
5328 /* Figure out where the commit point is by looking for locks.
6001 List *locks;
5999 List *locks; local
6094 List *locks; local
[all...]
H A Drcs.h97 called, we parse these into ->locks, and free ->locks_data. */
102 List *locks; member in struct:rcsnode
H A Dsanity.sh2504 locks: strict
3596 locks: strict
3613 locks: strict
3632 locks: strict
3649 locks: strict
3668 locks: strict
3685 locks: strict
5922 locks: strict
5934 locks: strict
6305 locks
[all...]
/freebsd-9.3-release/contrib/bind9/lib/dns/
H A Dopenssl_link.c61 static isc_mutex_t *locks = NULL; variable
106 LOCK(&locks[type]);
108 UNLOCK(&locks[type]);
168 locks = mem_alloc(sizeof(isc_mutex_t) * nlocks);
169 if (locks == NULL)
171 result = isc_mutexblock_init(locks, nlocks);
237 DESTROYMUTEXBLOCK(locks, nlocks);
239 mem_free(locks);
240 locks = NULL;
281 if (locks !
[all...]
H A Drequest.c69 isc_mutex_t locks[DNS_REQUEST_NLOCKS]; member in struct:dns_requestmgr
179 result = isc_mutex_init(&requestmgr->locks[i]);
182 DESTROYLOCK(&requestmgr->locks[i]);
405 DESTROYLOCK(&requestmgr->locks[i]);
1150 LOCK(&request->requestmgr->locks[request->hash]);
1155 UNLOCK(&request->requestmgr->locks[request->hash]);
1166 LOCK(&request->requestmgr->locks[request->hash]);
1172 UNLOCK(&request->requestmgr->locks[request->hash]);
1219 LOCK(&request->requestmgr->locks[request->hash]);
1223 UNLOCK(&request->requestmgr->locks[reques
[all...]
/freebsd-9.3-release/tools/sched/
H A Dschedgraph.py905 self.locks = {}
/freebsd-9.3-release/gnu/usr.bin/rcs/co/
H A Dco.c91 * Permit multiple locks by same user. Add setuid support.
392 int locks = lockflag ? findlock(false, &targetdelta) : 0; variable
398 switch (locks) {
470 locks += lockflag;
471 if (1 < locks)
472 rcswarn("You now have %d locks.", locks);
/freebsd-9.3-release/gnu/usr.bin/rcs/
H A Drcstest433 locks: strict
/freebsd-9.3-release/usr.bin/csup/
H A Drcstokenizer.l48 keyword head|access|symbols|locks|comment|expand|strict|date|author|state|branches|next|desc|log|text
/freebsd-9.3-release/sys/fs/nfsclient/
H A Dnfs_clstate.c1057 * Now, update the byte ranges for locks.
1287 * First check the delegation locks.
1382 * Free up all lock owners and associated locks.
1398 * If there are no byte range locks nor a Share Deny lost, try to do a
1613 printf("nfsv4 expired locks lost\n");
1631 printf("nfsv4 expired locks lost\n");
1650 /* First, get rid of local locks on delegations. */
1984 /* and reclaim all byte range locks */
2008 /* If no locks, but a lockowner, just delete it. */
2245 * Returns 1 if the locks wer
2621 nfscl_dumpstate(struct nfsmount *nmp, int openowner, int opens, int lockowner, int locks) argument
[all...]
/freebsd-9.3-release/sys/kern/
H A Dkern_lockf.c176 * POSIX fcntl locks, local file for BSD flock locks or <pid,sysid>
177 * pair for remote locks) is represented by a unique instance of
195 int lo_refs; /* (l) Number of locks referring to this */
213 * We have two types of directed graph, the first is the set of locks,
214 * both active and pending on a vnode. Within this graph, active locks
216 * edges). Pending locks have out-going edges to each blocking active
220 * added to or from new nodes (either new pending locks which only add
221 * out-going edges or new active locks which only add in-coming edges)
272 * Initialise various structures and locks
1866 struct lockdesclist locks; local
1928 struct lockdesclist locks; local
[all...]
H A Dsubr_witness.c74 * 3) Giant may be acquired before or after sleepable locks.
78 * locks may always be acquired while holding a sleepable lock. The second
148 * will hold LOCK_NCHILDREN locks. We handle failure ok, and we should
192 * recursion count of a lock. Lock instances are held in lists. Spin locks
193 * are held in a per-cpu list while sleep locks are held in per-thread list.
203 * A simple list type used to build the list of locks held by a thread
296 * Returns 0 if one of the locks is a spin lock and the other is not.
378 * lock order checking for all locks. At runtime, lock order checking
392 * - locks are held when going to sleep.
406 * - locks ar
[all...]

Completed in 216 milliseconds

12