Lines Matching defs:read
259 if (hlock->read)
1438 * bit 0 - write/read
1447 * keep state, bit flip the direction and strip read.
1468 * Prove that the new dependency does not connect a hardirq-safe-read
1553 * Returns: 0 on deadlock detected, 1 on OK, 2 on recursive read
1557 struct lockdep_map *next_instance, int read)
1573 * Allow read-after-read recursion of the same
1576 if ((read == 2) && prev->read)
1651 * For recursive read-locks we do all the dependency checks,
1652 * but we dont store read-triggered dependencies (only
1658 if (next->read == 2 || prev->read == 2)
1744 * Only non-recursive-read entries get new dependencies
1747 if (hlock->read != 2) {
1917 int ret = check_deadlock(curr, hlock, lock, hlock->read);
1922 * Mark recursive read, as we jump over it when
1927 hlock->read = 2;
1930 * of the chain, and if it's not a secondary read-lock:
2194 int read = new_bit & 1;
2218 if ((!read || !dir || STRICT_READ_CHECKS) &&
2223 * Check for read in write conflicts
2225 if (!read) {
2261 if (hlock->read)
2490 if (hlock->read) {
2509 if (hlock->read) {
2535 if (hlock->read) {
2712 int trylock, int read, int check, int hardirqs_off,
2794 hlock->read = read;
2971 hlock->read, hlock->check, hlock->hardirqs_off,
3047 hlock->read, hlock->check, hlock->hardirqs_off,
3200 int trylock, int read, int check,
3212 trace_lock_acquire(lock, subclass, trylock, read, check, nest_lock, ip);
3213 __lock_acquire(lock, subclass, trylock, read, check,
3340 stats->bounces[bounce_contended + !!hlock->read]++;
3388 if (hlock->read)
3394 stats->bounces[bounce_acquired + !!hlock->read]++;