4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; if not, write to the
18 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
19 * Boston, MA 021110-1307, USA
23 /* Copyright (c) 2010, Oracle and/or its affiliates. All rights reserved.
24 * Copyright (c) 2012, Intel Corporation.
27 * This file is part of Lustre, http://www.lustre.org/
28 * Lustre is a trademark of Sun Microsystems, Inc.
30 * Author: liang@whamcloud.com
34 # define EXPORT_SYMTAB
36 #define DEBUG_SUBSYSTEM S_LNET
38 #include <linux/libcfs/libcfs.h>
41 /** destroy cpu-partition lock, see libcfs_private.h for more detail */
43 cfs_percpt_lock_free(struct cfs_percpt_lock *pcl)
45 LASSERT(pcl->pcl_locks != NULL);
46 LASSERT(!pcl->pcl_locked);
48 cfs_percpt_free(pcl->pcl_locks);
49 LIBCFS_FREE(pcl, sizeof(*pcl));
51 EXPORT_SYMBOL(cfs_percpt_lock_free);
54 * create cpu-partition lock, see libcfs_private.h for more detail.
56 * cpu-partition lock is designed for large-scale SMP system, so we need to
57 * reduce cacheline conflict as possible as we can, that's the
58 * reason we always allocate cacheline-aligned memory block.
60 struct cfs_percpt_lock *
61 cfs_percpt_lock_alloc(struct cfs_cpt_table *cptab)
63 struct cfs_percpt_lock *pcl;
67 /* NB: cptab can be NULL, pcl will be for HW CPUs on that case */
68 LIBCFS_ALLOC(pcl, sizeof(*pcl));
72 pcl->pcl_cptab = cptab;
73 pcl->pcl_locks = cfs_percpt_alloc(cptab, sizeof(*lock));
74 if (pcl->pcl_locks == NULL) {
75 LIBCFS_FREE(pcl, sizeof(*pcl));
79 cfs_percpt_for_each(lock, i, pcl->pcl_locks)
84 EXPORT_SYMBOL(cfs_percpt_lock_alloc);
87 * lock a CPU partition
89 * \a index != CFS_PERCPT_LOCK_EX
90 * hold private lock indexed by \a index
92 * \a index == CFS_PERCPT_LOCK_EX
93 * exclusively lock @pcl and nobody can take private lock
96 cfs_percpt_lock(struct cfs_percpt_lock *pcl, int index)
98 int ncpt = cfs_cpt_number(pcl->pcl_cptab);
101 LASSERT(index >= CFS_PERCPT_LOCK_EX && index < ncpt);
105 } else { /* serialize with exclusive lock */
106 while (pcl->pcl_locked)
110 if (likely(index != CFS_PERCPT_LOCK_EX)) {
111 spin_lock(pcl->pcl_locks[index]);
115 /* exclusive lock request */
116 for (i = 0; i < ncpt; i++) {
117 spin_lock(pcl->pcl_locks[i]);
119 LASSERT(!pcl->pcl_locked);
120 /* nobody should take private lock after this
121 * so I wouldn't starve for too long time */
126 EXPORT_SYMBOL(cfs_percpt_lock);
128 /** unlock a CPU partition */
130 cfs_percpt_unlock(struct cfs_percpt_lock *pcl, int index)
132 int ncpt = cfs_cpt_number(pcl->pcl_cptab);
135 index = ncpt == 1 ? 0 : index;
137 if (likely(index != CFS_PERCPT_LOCK_EX)) {
138 spin_unlock(pcl->pcl_locks[index]);
142 for (i = ncpt - 1; i >= 0; i--) {
144 LASSERT(pcl->pcl_locked);
147 spin_unlock(pcl->pcl_locks[i]);
150 EXPORT_SYMBOL(cfs_percpt_unlock);
153 /** free cpu-partition refcount */
155 cfs_percpt_atomic_free(atomic_t **refs)
157 cfs_percpt_free(refs);
159 EXPORT_SYMBOL(cfs_percpt_atomic_free);
161 /** allocate cpu-partition refcount with initial value @init_val */
163 cfs_percpt_atomic_alloc(struct cfs_cpt_table *cptab, int init_val)
169 refs = cfs_percpt_alloc(cptab, sizeof(*ref));
173 cfs_percpt_for_each(ref, i, refs)
174 atomic_set(ref, init_val);
177 EXPORT_SYMBOL(cfs_percpt_atomic_alloc);
179 /** return sum of cpu-partition refs */
181 cfs_percpt_atomic_summary(atomic_t **refs)
187 cfs_percpt_for_each(ref, i, refs)
188 val += atomic_read(ref);
192 EXPORT_SYMBOL(cfs_percpt_atomic_summary);