}
}
-bool ceph_lock_state_t::is_waiting(const ceph_filelock &fl)
+bool ceph_lock_state_t::is_waiting(const ceph_filelock &fl) const
{
- multimap<uint64_t, ceph_filelock>::iterator p = waiting_locks.find(fl.start);
+ multimap<uint64_t, ceph_filelock>::const_iterator p = waiting_locks.find(fl.start);
while (p != waiting_locks.end()) {
if (p->second.start > fl.start)
return false;
bool ceph_lock_state_t::is_deadlock(const ceph_filelock& fl,
list<multimap<uint64_t, ceph_filelock>::iterator>&
overlapping_locks,
- const ceph_filelock *first_fl, unsigned depth)
+ const ceph_filelock *first_fl, unsigned depth) const
{
ldout(cct,15) << "is_deadlock " << fl << dendl;
* @param fl The filelock to check for
* @returns True if the lock is waiting, false otherwise
*/
- bool is_waiting(const ceph_filelock &fl);
+ bool is_waiting(const ceph_filelock &fl) const;
/**
* Remove a lock from the waiting_locks list
*
bool is_deadlock(const ceph_filelock& fl,
list<multimap<uint64_t, ceph_filelock>::iterator>&
overlapping_locks,
- const ceph_filelock *first_fl=NULL, unsigned depth=0);
+ const ceph_filelock *first_fl=NULL, unsigned depth=0) const;
/**
* Add a lock to the waiting_locks list