lockdep: Add recursive read locks into dependency graph

	if (!check_irq_usage(curr, prev, next))

		return 0;

	/*

	 * For recursive read-locks we do all the dependency checks,

	 * but we dont store read-triggered dependencies (only

	 * write-triggered dependencies). This ensures that only the

	 * write-side dependencies matter, and that if for example a

	 * write-lock never takes any other locks, then the reads are

	 * equivalent to a NOP.

	 */

	if (next->read == 2 || prev->read == 2)

		return 1;

	/*

	 * Is the <prev> -> <next> dependency already present?

	 *

		u16 distance = curr->lockdep_depth - depth + 1;

		hlock = curr->held_locks + depth - 1;

		/*

		 * Only non-recursive-read entries get new dependencies

		 * added:

		 */

		if (hlock->read != 2 && hlock->check) {

			int ret = check_prev_add(curr, hlock, next, distance,

						 &trace);

		if (hlock->check) {

			int ret = check_prev_add(curr, hlock, next, distance, &trace);

			if (!ret)

				return 0;