2952 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest)  in _double_lock_balance()  argument
2954 	__acquires(busiest->lock)  in _double_lock_balance()
2958 	double_rq_lock(this_rq, busiest);  in _double_lock_balance()
2971 static inline int _double_lock_balance(struct rq *this_rq, struct rq *busiest)  in _double_lock_balance()  argument
2973 	__acquires(busiest->lock)  in _double_lock_balance()
2976 	if (__rq_lockp(this_rq) == __rq_lockp(busiest) ||  in _double_lock_balance()
2977 	    likely(raw_spin_rq_trylock(busiest))) {  in _double_lock_balance()
2978 		double_rq_clock_clear_update(this_rq, busiest);  in _double_lock_balance()
2982 	if (rq_order_less(this_rq, busiest)) {  in _double_lock_balance()
2983 		raw_spin_rq_lock_nested(busiest, SINGLE_DEPTH_NESTING);  in _double_lock_balance()
2984 		double_rq_clock_clear_update(this_rq, busiest);  in _double_lock_balance()
2989 	double_rq_lock(this_rq, busiest);  in _double_lock_balance()
2999 static inline int double_lock_balance(struct rq *this_rq, struct rq *busiest)  in double_lock_balance()  argument
3003 	return _double_lock_balance(this_rq, busiest);  in double_lock_balance()
3006 static inline void double_unlock_balance(struct rq *this_rq, struct rq *busiest)  in double_unlock_balance()  argument
3007 	__releases(busiest->lock)  in double_unlock_balance()
3009 	if (__rq_lockp(this_rq) != __rq_lockp(busiest))  in double_unlock_balance()
3010 		raw_spin_rq_unlock(busiest);  in double_unlock_balance()