lustre/ldlm/ldlm_extent.c

   1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
   2  * vim:expandtab:shiftwidth=8:tabstop=8:
   3  *
   4  *  Copyright (c) 2002, 2003 Cluster File Systems, Inc.
   5  *   Author: Peter Braam <braam@clusterfs.com>
   6  *   Author: Phil Schwan <phil@clusterfs.com>
   7  *
   8  *   This file is part of Lustre, http://www.lustre.org.
   9  *
  10  *   Lustre is free software; you can redistribute it and/or
  11  *   modify it under the terms of version 2 of the GNU General Public
  12  *   License as published by the Free Software Foundation.
  13  *
  14  *   Lustre is distributed in the hope that it will be useful,
  15  *   but WITHOUT ANY WARRANTY; without even the implied warranty of
  16  *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  17  *   GNU General Public License for more details.
  18  *
  19  *   You should have received a copy of the GNU General Public License
  20  *   along with Lustre; if not, write to the Free Software
  21  *   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  22  */
  23
  24 #define DEBUG_SUBSYSTEM S_LDLM
  25 #ifndef __KERNEL__
  26 # include <liblustre.h>
  27 #endif
  28
  29 #include <linux/lustre_dlm.h>
  30 #include <linux/obd_support.h>
  31 #include <linux/lustre_lib.h>
  32
  33 #include "ldlm_internal.h"
  34
  35 /* The purpose of this function is to return:
  36  * - the maximum extent
  37  * - containing the requested extent
  38  * - and not overlapping existing conflicting extents outside the requested one
  39  */
  40 static void
  41 ldlm_extent_internal_policy(struct list_head *queue, struct ldlm_lock *req,
  42                             struct ldlm_extent *new_ex)
  43 {
  44         struct list_head *tmp;
  45         ldlm_mode_t req_mode = req->l_req_mode;
  46         __u64 req_start = req->l_req_extent.start;
  47         __u64 req_end = req->l_req_extent.end;
  48         int conflicting = 0;
  49         ENTRY;
  50
  51         lockmode_verify(req_mode);
  52
  53         list_for_each(tmp, queue) {
  54                 struct ldlm_lock *lock;
  55                 struct ldlm_extent *l_extent;
  56
  57                 lock = list_entry(tmp, struct ldlm_lock, l_res_link);
  58                 l_extent = &lock->l_policy_data.l_extent;
  59
  60                 if (new_ex->start == req_start && new_ex->end == req_end) {
  61                         EXIT;
  62                         return;
  63                 }
  64
  65                 /* Don't conflict with ourselves */
  66                 if (req == lock)
  67                         continue;
  68
  69                 /* Locks are compatible, overlap doesn't matter */
  70                 /* Until bug 20 is fixed, try to avoid granting overlapping
  71                  * locks on one client (they take a long time to cancel) */
  72                 if (lockmode_compat(lock->l_req_mode, req_mode) &&
  73                     lock->l_export != req->l_export)
  74                         continue;
  75
  76                 /* If this is a high-traffic lock, don't grow downwards at all
  77                  * or grow upwards too much */
  78                 ++conflicting;
  79                 if (conflicting > 4)
  80                         new_ex->start = req_start;
  81
  82                 /* If lock doesn't overlap new_ex, skip it. */
  83                 if (l_extent->end < new_ex->start ||
  84                     l_extent->start > new_ex->end)
  85                         continue;
  86
  87                 /* Locks conflicting in requested extents and we can't satisfy
  88                  * both locks, so ignore it.  Either we will ping-pong this
  89                  * extent (we would regardless of what extent we granted) or
  90                  * lock is unused and it shouldn't limit our extent growth. */
  91                 if (lock->l_req_extent.end >= req_start &&
  92                     lock->l_req_extent.start <= req_end)
  93                         continue;
  94
  95                 /* We grow extents downwards only as far as they don't overlap
  96                  * with already-granted locks, on the assumtion that clients
  97                  * will be writing beyond the initial requested end and would
  98                  * then need to enqueue a new lock beyond previous request.
  99                  * l_req_extent->end strictly < req_start, checked above. */
 100                 if (l_extent->start < req_start && new_ex->start != req_start) {
 101                         if (l_extent->end >= req_start)
 102                                 new_ex->start = req_start;
 103                         else
 104                                 new_ex->start = min(l_extent->end+1, req_start);
 105                 }
 106
 107                 /* If we need to cancel this lock anyways because our request
 108                  * overlaps the granted lock, we grow up to its requested
 109                  * extent start instead of limiting this extent, assuming that
 110                  * clients are writing forwards and the lock had over grown
 111                  * its extent downwards before we enqueued our request. */
 112                 if (l_extent->end > req_end) {
 113                         if (l_extent->start <= req_end)
 114                                 new_ex->end = max(lock->l_req_extent.start - 1,
 115                                                   req_end);
 116                         else
 117                                 new_ex->end = max(l_extent->start - 1, req_end);
 118                 }
 119         }
 120
 121 #define LDLM_MAX_GROWN_EXTENT (32 * 1024 * 1024 - 1)
 122         if (conflicting > 32 && (req_mode == LCK_PW || req_mode == LCK_CW)) {
 123                 if (req_end < req_start + LDLM_MAX_GROWN_EXTENT)
 124                         new_ex->end = min(req_start + LDLM_MAX_GROWN_EXTENT,
 125                                           new_ex->end);
 126         }
 127         EXIT;
 128 }
 129
 130 /* In order to determine the largest possible extent we can grant, we need
 131  * to scan all of the queues. */
 132 static void ldlm_extent_policy(struct ldlm_resource *res,
 133                                struct ldlm_lock *lock, int *flags)
 134 {
 135         struct ldlm_extent new_ex = { .start = 0, .end = ~0};
 136
 137         if (lock->l_req_mode == LCK_GROUP)
 138                 return;
 139
 140         ldlm_extent_internal_policy(&res->lr_granted, lock, &new_ex);
 141         ldlm_extent_internal_policy(&res->lr_waiting, lock, &new_ex);
 142
 143         if (new_ex.start != lock->l_policy_data.l_extent.start ||
 144             new_ex.end != lock->l_policy_data.l_extent.end) {
 145                 *flags |= LDLM_FL_LOCK_CHANGED;
 146                 lock->l_policy_data.l_extent.start = new_ex.start;
 147                 lock->l_policy_data.l_extent.end = new_ex.end;
 148         }
 149 }
 150
 151 /* Determine if the lock is compatible with all locks on the queue.
 152  * We stop walking the queue if we hit ourselves so we don't take
 153  * conflicting locks enqueued after us into accound, or we'd wait forever.
 154  *
 155  * 0 if the lock is not compatible
 156  * 1 if the lock is compatible
 157  * 2 if this group lock is compatible and requires no further checking
 158  * negative error, such as EWOULDBLOCK for group locks
 159  */
 160 static int
 161 ldlm_extent_compat_queue(struct list_head *queue, struct ldlm_lock *req,
 162                          int *flags, struct list_head *work_list,
 163                          struct list_head **insertp, int count)
 164 {
 165         struct list_head *tmp;
 166         struct ldlm_lock *lock;
 167         ldlm_mode_t req_mode = req->l_req_mode;
 168         int compat = 1;
 169         ENTRY;
 170
 171         lockmode_verify(req_mode);
 172
 173         if (req->l_req_mode == LCK_GROUP) {
 174                 int found = 0;
 175
 176                 list_for_each(tmp, queue) {
 177                         lock = list_entry(tmp, struct ldlm_lock, l_res_link);
 178                         if (req == lock)
 179                                 break;
 180
 181                         if (lock->l_req_mode != LCK_GROUP) {
 182                                 /* group locks are not blocked by waiting PR|PW
 183                                  * locks. also, any group locks that could have
 184                                  * blocked us would have appeared before this
 185                                  * PR|PW lock in the list.  */
 186                                 if (lock->l_req_mode != lock->l_granted_mode)
 187                                         break;
 188
 189                                 compat = 0;
 190                                 if (!work_list)
 191                                         break;
 192
 193                                 if (lock->l_blocking_ast)
 194                                         ldlm_add_ast_work_item(lock, req,
 195                                                                work_list);
 196                                 continue;
 197                         }
 198
 199                         /* no blocking ASTs are sent for group locks. */
 200
 201                         if (lock->l_policy_data.l_extent.gid !=
 202                             req->l_policy_data.l_extent.gid) {
 203                                 if (*flags & LDLM_FL_BLOCK_NOWAIT)
 204                                         RETURN(-EWOULDBLOCK);
 205
 206                                 compat = 0;
 207
 208                                 /* there's a blocking group lock in front
 209                                  * of us on the queue.  It can be held
 210                                  * indefinitely, so don't timeout. */
 211                                 *flags |= LDLM_FL_NO_TIMEOUT;
 212
 213                                 /* the only reason to continue traversing the
 214                                  * list at this point is to find the proper
 215                                  * place to insert the lock in the waitq. */
 216                                 if (insertp && !found)
 217                                         continue;
 218
 219                                 break;
 220                         }
 221
 222                         /* if a group lock with this gid has already been
 223                          * granted then grant this one. */
 224                         if (lock->l_req_mode == lock->l_granted_mode) {
 225                                 compat = 2;
 226                                 break;
 227                         }
 228                         found = 1;
 229                 }
 230         } else {
 231                 __u64 req_start = req->l_req_extent.start;
 232                 __u64 req_end = req->l_req_extent.end;
 233
 234                 list_for_each(tmp, queue) {
 235                         lock = list_entry(tmp, struct ldlm_lock, l_res_link);
 236                         if (req == lock)
 237                                 break;
 238
 239                         if (lock->l_req_mode == LCK_GROUP) {
 240                                 if (*flags & LDLM_FL_BLOCK_NOWAIT)
 241                                         RETURN(-EWOULDBLOCK);
 242
 243                                 /* No blocking ASTs are sent for group locks. */
 244                                 compat = 0;
 245
 246                                 /* there's a blocking group lock in front
 247                                  * of us on the queue.  It can be held
 248                                  * indefinitely, so don't timeout. */
 249                                 *flags |= LDLM_FL_NO_TIMEOUT;
 250
 251                                 if (work_list)
 252                                         continue;
 253                                 else
 254                                         break;
 255                         }
 256
 257                         /* locks are compatible, overlap doesn't matter */
 258                         if (lockmode_compat(lock->l_req_mode, req_mode))
 259                                 continue;
 260
 261                         if (lock->l_policy_data.l_extent.end < req_start ||
 262                             lock->l_policy_data.l_extent.start > req_end)
 263                                 continue;
 264
 265                         compat = 0;
 266
 267                         if (!work_list)
 268                                 break;
 269
 270                         if (lock->l_blocking_ast)
 271                                 ldlm_add_ast_work_item(lock, req, work_list);
 272                 }
 273
 274                 /* Ensure we scan entire list if insertp is requested so that
 275                  * the new request will be appended to the end of the list. */
 276                 if (!((insertp == NULL) || (tmp == queue))) {
 277                         unlock_res(req->l_resource);
 278                         ldlm_lock_dump(D_ERROR, req, 0);
 279                 }
 280                 LASSERTF((insertp == NULL) || (tmp == queue), "insertp = %p, "
 281                          "tmp = %p, queue = %p, count = %d\n", insertp, tmp,
 282                          queue, count);
 283         }
 284
 285         if (insertp)
 286                 *insertp = tmp;
 287
 288         RETURN(compat);
 289 }
 290
 291 /* If first_enq is 0 (ie, called from ldlm_reprocess_queue):
 292   *   - blocking ASTs have already been sent
 293   *   - the caller has already initialized req->lr_tmp
 294   *   - must call this function with the ns lock held
 295   *
 296   * If first_enq is 1 (ie, called from ldlm_lock_enqueue):
 297   *   - blocking ASTs have not been sent
 298   *   - the caller has NOT initialized req->lr_tmp, so we must
 299   *   - must call this function with the ns lock held once */
 300 int ldlm_process_extent_lock(struct ldlm_lock *lock, int *flags, int first_enq,
 301                              ldlm_error_t *err, struct list_head *work_list)
 302 {
 303         struct ldlm_resource *res = lock->l_resource;
 304         struct list_head rpc_list = LIST_HEAD_INIT(rpc_list);
 305         struct list_head *insertp = NULL;
 306         int rc, rc2, count = 0;
 307         ENTRY;
 308
 309         LASSERT(list_empty(&res->lr_converting));
 310         *err = ELDLM_OK;
 311
 312         if (!first_enq) {
 313                 /* -EWOULDBLOCK can't occur here since (flags & BLOCK_NOWAIT)
 314                  * lock requests would either be granted or fail on their
 315                  * first_enq. flags should always be zero here, and if that
 316                  * ever changes we want to find out. */
 317                 LASSERT(*flags == 0);
 318                 rc = ldlm_extent_compat_queue(&res->lr_granted, lock,
 319                                               flags, NULL, NULL, -1);
 320                 if (rc == 1) {
 321                         rc = ldlm_extent_compat_queue(&res->lr_waiting, lock,
 322                                                       flags, NULL, NULL, -2);
 323                 }
 324                 if (rc == 0)
 325                         RETURN(LDLM_ITER_STOP);
 326
 327                 ldlm_resource_unlink_lock(lock);
 328                 ldlm_extent_policy(res, lock, flags);
 329                 ldlm_grant_lock(lock, work_list);
 330                 RETURN(LDLM_ITER_CONTINUE);
 331         }
 332
 333  restart:
 334         count++;
 335         rc = ldlm_extent_compat_queue(&res->lr_granted, lock, flags, &rpc_list,
 336                                       NULL, count);
 337         if (rc < 0)
 338                 GOTO(destroylock, rc);
 339         if (rc == 2)
 340                 goto grant;
 341
 342         /* Traverse the waiting list in case there are other conflicting
 343          * lock requests ahead of us in the queue and send blocking ASTs */
 344         rc2 = ldlm_extent_compat_queue(&res->lr_waiting, lock, flags, &rpc_list,
 345                                        &insertp, count);
 346         if (rc2 < 0)
 347                 GOTO(destroylock, rc);
 348         if (rc + rc2 == 2) {
 349  grant:
 350                 ldlm_extent_policy(res, lock, flags);
 351                 ldlm_resource_unlink_lock(lock);
 352                 ldlm_grant_lock(lock, NULL);
 353         } else {
 354                 /* If either of the compat_queue()s returned failure, then we
 355                  * have ASTs to send and must go onto the waiting list.
 356                  *
 357                  * bug 2322: we used to unlink and re-add here, which was a
 358                  * terrible folly -- if we goto restart, we could get
 359                  * re-ordered!  Causes deadlock, because ASTs aren't sent! */
 360                 if (list_empty(&lock->l_res_link))
 361                         ldlm_resource_add_lock(res, insertp, lock);
 362                 unlock_res(res);
 363                 rc = ldlm_run_bl_ast_work(&rpc_list);
 364                 lock_res(res);
 365                 if (rc == -ERESTART)
 366                         GOTO(restart, -ERESTART);
 367                 *flags |= LDLM_FL_BLOCK_GRANTED;
 368         }
 369
 370         RETURN(0);
 371
 372  destroylock:
 373         list_del_init(&lock->l_res_link);
 374         unlock_res(res);
 375         ldlm_lock_destroy(lock);
 376         lock_res(res);
 377         *err = rc;
 378         RETURN(rc);
 379 }
 380
 381 /* When a lock is cancelled by a client, the KMS may undergo change if this
 382  * is the "highest lock".  This function returns the new KMS value.
 383  * Caller must hold ns_lock already.
 384  *
 385  * NB: A lock on [x,y] protects a KMS of up to y + 1 bytes! */
 386 __u64 ldlm_extent_shift_kms(struct ldlm_lock *lock, __u64 old_kms)
 387 {
 388         struct ldlm_resource *res = lock->l_resource;
 389         struct list_head *tmp;
 390         struct ldlm_lock *lck;
 391         __u64 kms = 0;
 392         ENTRY;
 393
 394         /* don't let another thread in ldlm_extent_shift_kms race in
 395          * just after we finish and take our lock into account in its
 396          * calculation of the kms */
 397
 398         lock->l_flags |= LDLM_FL_KMS_IGNORE;
 399
 400         list_for_each(tmp, &res->lr_granted) {
 401                 lck = list_entry(tmp, struct ldlm_lock, l_res_link);
 402
 403                 if (lck->l_flags & LDLM_FL_KMS_IGNORE)
 404                         continue;
 405
 406                 if (lck->l_policy_data.l_extent.end >= old_kms)
 407                         RETURN(old_kms);
 408
 409                 /* This extent _has_ to be smaller than old_kms (checked above)
 410                  * so kms can only ever be smaller or the same as old_kms. */
 411                 if (lck->l_policy_data.l_extent.end + 1 > kms)
 412                         kms = lck->l_policy_data.l_extent.end + 1;
 413         }
 414         LASSERTF(kms <= old_kms, "kms "LPU64" old_kms "LPU64"\n", kms, old_kms);
 415
 416         RETURN(kms);
 417 }