iter = self_overlapping_locks.begin();
iter != self_overlapping_locks.end();
++iter) {
- dout(15) << "self overlapping lock " << (*iter)->second << dendl;
+ ldout(cct,15) << "self overlapping lock " << (*iter)->second << dendl;
old_lock = &(*iter)->second;
bool old_lock_to_end = (0 == old_lock->length);
- old_lock_end = old_lock->start + old_lock->length - 1;
+ uint64_t old_lock_end = old_lock->start + old_lock->length - 1;
old_lock_client = old_lock->client;
if (remove_to_end) {
if (old_lock->start < removal_start) {
list<multimap<uint64_t, ceph_filelock>::iterator>
neighbor_locks)
{
- dout(15) << "adjust_locks" << dendl;
+ ldout(cct,15) << "adjust_locks" << dendl;
bool new_lock_to_end = (0 == new_lock.length);
- uint64_t new_lock_start, new_lock_end;
- uint64_t old_lock_start, old_lock_end;
__s64 old_lock_client = 0;
ceph_filelock *old_lock;
for (list<multimap<uint64_t, ceph_filelock>::iterator>::iterator
iter != old_locks.end();
++iter) {
old_lock = &(*iter)->second;
- dout(15) << "adjusting lock: " << *old_lock << dendl;
+ ldout(cct,15) << "adjusting lock: " << *old_lock << dendl;
bool old_lock_to_end = (0 == old_lock->length);
- old_lock_start = old_lock->start;
- old_lock_end = old_lock->start + old_lock->length - 1;
- new_lock_start = new_lock.start;
- new_lock_end = new_lock.start + new_lock.length - 1;
+ uint64_t old_lock_start = old_lock->start;
+ uint64_t old_lock_end = old_lock->start + old_lock->length - 1;
+ uint64_t new_lock_start = new_lock.start;
+ uint64_t new_lock_end = new_lock.start + new_lock.length - 1;
old_lock_client = old_lock->client;
if (new_lock_to_end || old_lock_to_end) {
//special code path to deal with a length set at 0