X-Git-Url: https://git.whamcloud.com/?a=blobdiff_plain;f=lustre%2Fldlm%2Fldlm_internal.h;h=f3f5a12fd0d6712fb61fe43ccf5883e2b49acefa;hb=c6f1fc1c59cbf9ffcd884de85ebcc46184eaa810;hp=c6ee99e7c14748622f75c5b8d4a1965571a06241;hpb=9065e88a7257a98de247f18f997557bd7ccbcb1d;p=fs%2Flustre-release.git diff --git a/lustre/ldlm/ldlm_internal.h b/lustre/ldlm/ldlm_internal.h index c6ee99e..f3f5a12 100644 --- a/lustre/ldlm/ldlm_internal.h +++ b/lustre/ldlm/ldlm_internal.h @@ -1,87 +1,173 @@ /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*- * vim:expandtab:shiftwidth=8:tabstop=8: * - * Copyright (c) 2002, 2003 Cluster File Systems, Inc. - * Author: Peter Braam - * Author: Phil Schwan + * GPL HEADER START * - * This file is part of Lustre, http://www.lustre.org. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * - * Lustre is free software; you can redistribute it and/or - * modify it under the terms of version 2 of the GNU General Public - * License as published by the Free Software Foundation. + * This program is free software; you can redistribute it and/or modify + * it under the terms of the GNU General Public License version 2 only, + * as published by the Free Software Foundation. * - * Lustre is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. + * This program is distributed in the hope that it will be useful, but + * WITHOUT ANY WARRANTY; without even the implied warranty of + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU + * General Public License version 2 for more details (a copy is included + * in the LICENSE file that accompanied this code). * - * You should have received a copy of the GNU General Public License - * along with Lustre; if not, write to the Free Software - * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. + * You should have received a copy of the GNU General Public License + * version 2 along with this program; If not, see + * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf + * + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, + * CA 95054 USA or visit www.sun.com if you need additional information or + * have any questions. + * + * GPL HEADER END + */ +/* + * Copyright 2008 Sun Microsystems, Inc. All rights reserved + * Use is subject to license terms. + */ +/* + * This file is part of Lustre, http://www.lustre.org/ + * Lustre is a trademark of Sun Microsystems, Inc. */ +#define MAX_STRING_SIZE 128 + +extern cfs_atomic_t ldlm_srv_namespace_nr; +extern cfs_atomic_t ldlm_cli_namespace_nr; +extern cfs_semaphore_t ldlm_srv_namespace_lock; +extern cfs_list_t ldlm_srv_namespace_list; +extern cfs_semaphore_t ldlm_cli_namespace_lock; +extern cfs_list_t ldlm_cli_namespace_list; + +static inline cfs_atomic_t *ldlm_namespace_nr(ldlm_side_t client) +{ + return client == LDLM_NAMESPACE_SERVER ? + &ldlm_srv_namespace_nr : &ldlm_cli_namespace_nr; +} + +static inline cfs_list_t *ldlm_namespace_list(ldlm_side_t client) +{ + return client == LDLM_NAMESPACE_SERVER ? + &ldlm_srv_namespace_list : &ldlm_cli_namespace_list; +} + +static inline cfs_semaphore_t *ldlm_namespace_lock(ldlm_side_t client) +{ + return client == LDLM_NAMESPACE_SERVER ? + &ldlm_srv_namespace_lock : &ldlm_cli_namespace_lock; +} + /* ldlm_request.c */ typedef enum { LDLM_ASYNC, LDLM_SYNC, } ldlm_sync_t; -int ldlm_cancel_lru(struct ldlm_namespace *ns, ldlm_sync_t sync); +/* Cancel lru flag, it indicates we cancel aged locks. */ +enum { + LDLM_CANCEL_AGED = 1 << 0, /* Cancel aged locks (non lru resize). */ + LDLM_CANCEL_PASSED = 1 << 1, /* Cancel passed number of locks. */ + LDLM_CANCEL_SHRINK = 1 << 2, /* Cancel locks from shrinker. */ + LDLM_CANCEL_LRUR = 1 << 3 /* Cancel locks from lru resize. */ +}; + +int ldlm_cancel_lru(struct ldlm_namespace *ns, int nr, ldlm_sync_t sync, + int flags); +int ldlm_cancel_lru_local(struct ldlm_namespace *ns, + cfs_list_t *cancels, int count, int max, + int cancel_flags, int flags); +extern int ldlm_enqueue_min; +int ldlm_get_enq_timeout(struct ldlm_lock *lock); /* ldlm_resource.c */ +int ldlm_resource_putref_locked(struct ldlm_resource *res); void ldlm_resource_insert_lock_after(struct ldlm_lock *original, struct ldlm_lock *new); -int ldlm_resource_putref_locked(struct ldlm_resource *res); - +void ldlm_namespace_free_prior(struct ldlm_namespace *ns, + struct obd_import *imp, int force); +void ldlm_namespace_free_post(struct ldlm_namespace *ns); /* ldlm_lock.c */ -void ldlm_grant_lock(struct ldlm_lock *lock, struct list_head *work_list); +/* Number of blocking/completion callbacks that will be sent in + * parallel (see bug 11301). */ +#define PARALLEL_AST_LIMIT 200 + +struct ldlm_cb_set_arg { + struct ptlrpc_request_set *set; + cfs_atomic_t restart; + __u32 type; /* LDLM_BL_CALLBACK or LDLM_CP_CALLBACK */ +}; + +typedef enum { + LDLM_WORK_BL_AST, + LDLM_WORK_CP_AST, + LDLM_WORK_REVOKE_AST +} ldlm_desc_ast_t; + +void ldlm_grant_lock(struct ldlm_lock *lock, cfs_list_t *work_list); struct ldlm_lock * -ldlm_lock_create(struct ldlm_namespace *ns, - struct lustre_handle *parent_lock_handle, struct ldlm_res_id, - __u32 type, ldlm_mode_t, ldlm_blocking_callback, - ldlm_completion_callback, ldlm_glimpse_callback, void *data, - __u32 lvb_len); +ldlm_lock_create(struct ldlm_namespace *ns, const struct ldlm_res_id *, + ldlm_type_t type, ldlm_mode_t, + const struct ldlm_callback_suite *cbs, + void *data, __u32 lvb_len); ldlm_error_t ldlm_lock_enqueue(struct ldlm_namespace *, struct ldlm_lock **, void *cookie, int *flags); -void ldlm_lock_addref_internal_nolock(struct ldlm_lock *, __u32 mode); void ldlm_lock_addref_internal(struct ldlm_lock *, __u32 mode); +void ldlm_lock_addref_internal_nolock(struct ldlm_lock *, __u32 mode); void ldlm_lock_decref_internal(struct ldlm_lock *, __u32 mode); +void ldlm_lock_decref_internal_nolock(struct ldlm_lock *, __u32 mode); void ldlm_add_ast_work_item(struct ldlm_lock *lock, struct ldlm_lock *new, - struct list_head *work_list); -int ldlm_reprocess_queue(struct ldlm_resource *res, struct list_head *queue, - struct list_head *work_list); -int ldlm_run_bl_ast_work(struct list_head *rpc_list); -int ldlm_run_cp_ast_work(struct list_head *rpc_list); + cfs_list_t *work_list); +int ldlm_reprocess_queue(struct ldlm_resource *res, cfs_list_t *queue, + cfs_list_t *work_list); +int ldlm_run_ast_work(cfs_list_t *rpc_list, ldlm_desc_ast_t ast_type); +int ldlm_lock_remove_from_lru(struct ldlm_lock *lock); +int ldlm_lock_remove_from_lru_nolock(struct ldlm_lock *lock); +void ldlm_lock_add_to_lru_nolock(struct ldlm_lock *lock); +void ldlm_lock_add_to_lru(struct ldlm_lock *lock); +void ldlm_lock_touch_in_lru(struct ldlm_lock *lock); +void ldlm_lock_destroy_nolock(struct ldlm_lock *lock); + +void ldlm_cancel_locks_for_export(struct obd_export *export); /* ldlm_lockd.c */ -int ldlm_bl_to_thread(struct ldlm_namespace *ns, struct ldlm_lock_desc *ld, - struct ldlm_lock *lock); +int ldlm_bl_to_thread_lock(struct ldlm_namespace *ns, struct ldlm_lock_desc *ld, + struct ldlm_lock *lock); +int ldlm_bl_to_thread_list(struct ldlm_namespace *ns, struct ldlm_lock_desc *ld, + cfs_list_t *cancels, int count); + void ldlm_handle_bl_callback(struct ldlm_namespace *ns, struct ldlm_lock_desc *ld, struct ldlm_lock *lock); /* ldlm_plain.c */ int ldlm_process_plain_lock(struct ldlm_lock *lock, int *flags, int first_enq, - ldlm_error_t *err, struct list_head *work_list); + ldlm_error_t *err, cfs_list_t *work_list); /* ldlm_extent.c */ int ldlm_process_extent_lock(struct ldlm_lock *lock, int *flags, int first_enq, - ldlm_error_t *err, struct list_head *work_list); + ldlm_error_t *err, cfs_list_t *work_list); +void ldlm_extent_add_lock(struct ldlm_resource *res, struct ldlm_lock *lock); +void ldlm_extent_unlink_lock(struct ldlm_lock *lock); /* ldlm_flock.c */ int ldlm_process_flock_lock(struct ldlm_lock *req, int *flags, int first_enq, - ldlm_error_t *err, struct list_head *work_list); + ldlm_error_t *err, cfs_list_t *work_list); /* ldlm_inodebits.c */ int ldlm_process_inodebits_lock(struct ldlm_lock *lock, int *flags, - int first_enq, ldlm_error_t *err, - struct list_head *work); + int first_enq, ldlm_error_t *err, + cfs_list_t *work_list); /* l_lock.c */ +void l_check_ns_lock(struct ldlm_namespace *ns); void l_check_no_ns_lock(struct ldlm_namespace *ns); -extern struct proc_dir_entry *ldlm_svc_proc_dir; +extern cfs_proc_dir_entry_t *ldlm_svc_proc_dir; +extern cfs_proc_dir_entry_t *ldlm_type_proc_dir; struct ldlm_state { struct ptlrpc_service *ldlm_cb_service; @@ -91,6 +177,81 @@ struct ldlm_state { struct ldlm_bl_pool *ldlm_bl_pool; }; +/* interval tree, for LDLM_EXTENT. */ +extern cfs_mem_cache_t *ldlm_interval_slab; /* slab cache for ldlm_interval */ +extern void ldlm_interval_attach(struct ldlm_interval *n, struct ldlm_lock *l); +extern struct ldlm_interval *ldlm_interval_detach(struct ldlm_lock *l); +extern struct ldlm_interval *ldlm_interval_alloc(struct ldlm_lock *lock); +extern void ldlm_interval_free(struct ldlm_interval *node); +/* this function must be called with res lock held */ +static inline struct ldlm_extent * +ldlm_interval_extent(struct ldlm_interval *node) +{ + struct ldlm_lock *lock; + LASSERT(!cfs_list_empty(&node->li_group)); + + lock = cfs_list_entry(node->li_group.next, struct ldlm_lock, + l_sl_policy); + return &lock->l_policy_data.l_extent; +} + int ldlm_init(void); void ldlm_exit(void); +enum ldlm_policy_res { + LDLM_POLICY_CANCEL_LOCK, + LDLM_POLICY_KEEP_LOCK +}; + +typedef enum ldlm_policy_res ldlm_policy_res_t; + +#define LDLM_POOL_PROC_READER(var, type) \ + static int lprocfs_rd_##var(char *page, char **start, off_t off, \ + int count, int *eof, void *data) \ + { \ + struct ldlm_pool *pl = data; \ + type tmp; \ + \ + cfs_spin_lock(&pl->pl_lock); \ + tmp = pl->pl_##var; \ + cfs_spin_unlock(&pl->pl_lock); \ + \ + return lprocfs_rd_uint(page, start, off, count, eof, &tmp); \ + } \ + struct __##var##__dummy_read {;} /* semicolon catcher */ + +#define LDLM_POOL_PROC_WRITER(var, type) \ + int lprocfs_wr_##var(struct file *file, const char *buffer, \ + unsigned long count, void *data) \ + { \ + struct ldlm_pool *pl = data; \ + type tmp; \ + int rc; \ + \ + rc = lprocfs_wr_uint(file, buffer, count, &tmp); \ + if (rc) { \ + CERROR("Can't parse user input, rc = %d\n", rc); \ + return rc; \ + } \ + \ + cfs_spin_lock(&pl->pl_lock); \ + pl->pl_##var = tmp; \ + cfs_spin_unlock(&pl->pl_lock); \ + \ + return rc; \ + } \ + struct __##var##__dummy_write {;} /* semicolon catcher */ + +static inline int is_granted_or_cancelled(struct ldlm_lock *lock) +{ + int ret = 0; + + lock_res_and_lock(lock); + if (((lock->l_req_mode == lock->l_granted_mode) && + !(lock->l_flags & LDLM_FL_CP_REQD)) || + (lock->l_flags & LDLM_FL_FAILED)) + ret = 1; + unlock_res_and_lock(lock); + + return ret; +}