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, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2007, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2012, 2016, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * lustre/ptlrpc/sec_gc.c
34 * Author: Eric Mei <ericm@clusterfs.com>
37 #define DEBUG_SUBSYSTEM S_SEC
39 #include <linux/workqueue.h>
40 #include <libcfs/libcfs.h>
42 #include <obd_support.h>
43 #include <obd_class.h>
44 #include <lustre_net.h>
45 #include <lustre_sec.h>
47 #include "ptlrpc_internal.h"
49 #define SEC_GC_INTERVAL (30 * 60)
51 static DEFINE_MUTEX(sec_gc_mutex);
52 static DEFINE_SPINLOCK(sec_gc_list_lock);
53 static DEFINE_SPINLOCK(sec_gc_ctx_list_lock);
54 static LIST_HEAD(sec_gc_list);
55 static LIST_HEAD(sec_gc_ctx_list);
57 static atomic_t sec_gc_wait_del = ATOMIC_INIT(0);
59 void sptlrpc_gc_add_sec(struct ptlrpc_sec *sec)
61 LASSERT(sec->ps_policy->sp_cops->gc_ctx);
62 LASSERT(sec->ps_gc_interval > 0);
63 LASSERT(list_empty(&sec->ps_gc_list));
65 sec->ps_gc_next = ktime_get_real_seconds() + sec->ps_gc_interval;
67 spin_lock(&sec_gc_list_lock);
68 list_add_tail(&sec->ps_gc_list, &sec_gc_list);
69 spin_unlock(&sec_gc_list_lock);
71 CDEBUG(D_SEC, "added sec %p(%s)\n", sec, sec->ps_policy->sp_name);
74 void sptlrpc_gc_del_sec(struct ptlrpc_sec *sec)
76 if (list_empty(&sec->ps_gc_list))
81 /* signal before list_del to make iteration in gc thread safe */
82 atomic_inc(&sec_gc_wait_del);
84 spin_lock(&sec_gc_list_lock);
85 list_del_init(&sec->ps_gc_list);
86 spin_unlock(&sec_gc_list_lock);
89 mutex_lock(&sec_gc_mutex);
90 mutex_unlock(&sec_gc_mutex);
92 atomic_dec(&sec_gc_wait_del);
94 CDEBUG(D_SEC, "del sec %p(%s)\n", sec, sec->ps_policy->sp_name);
97 static void sec_gc_main(struct work_struct *ws);
98 static DECLARE_DELAYED_WORK(sec_gc_work, sec_gc_main);
100 void sptlrpc_gc_add_ctx(struct ptlrpc_cli_ctx *ctx)
102 LASSERT(list_empty(&ctx->cc_gc_chain));
104 CDEBUG(D_SEC, "hand over ctx %p(%u->%s)\n",
105 ctx, ctx->cc_vcred.vc_uid, sec2target_str(ctx->cc_sec));
106 spin_lock(&sec_gc_ctx_list_lock);
107 list_add(&ctx->cc_gc_chain, &sec_gc_ctx_list);
108 spin_unlock(&sec_gc_ctx_list_lock);
110 mod_delayed_work(system_wq, &sec_gc_work, 0);
112 EXPORT_SYMBOL(sptlrpc_gc_add_ctx);
114 static void sec_process_ctx_list(void)
116 struct ptlrpc_cli_ctx *ctx;
118 spin_lock(&sec_gc_ctx_list_lock);
120 while (!list_empty(&sec_gc_ctx_list)) {
121 ctx = list_entry(sec_gc_ctx_list.next,
122 struct ptlrpc_cli_ctx, cc_gc_chain);
123 list_del_init(&ctx->cc_gc_chain);
124 spin_unlock(&sec_gc_ctx_list_lock);
126 LASSERT(ctx->cc_sec);
127 LASSERT(atomic_read(&ctx->cc_refcount) == 1);
128 CDEBUG(D_SEC, "gc pick up ctx %p(%u->%s)\n",
129 ctx, ctx->cc_vcred.vc_uid, sec2target_str(ctx->cc_sec));
130 sptlrpc_cli_ctx_put(ctx, 1);
132 spin_lock(&sec_gc_ctx_list_lock);
135 spin_unlock(&sec_gc_ctx_list_lock);
138 static void sec_do_gc(struct ptlrpc_sec *sec)
140 LASSERT(sec->ps_policy->sp_cops->gc_ctx);
142 if (unlikely(sec->ps_gc_next == 0)) {
143 CDEBUG(D_SEC, "sec %p(%s) has 0 gc time\n",
144 sec, sec->ps_policy->sp_name);
148 CDEBUG(D_SEC, "check on sec %p(%s)\n", sec, sec->ps_policy->sp_name);
150 if (sec->ps_gc_next > ktime_get_real_seconds())
153 sec->ps_policy->sp_cops->gc_ctx(sec);
154 sec->ps_gc_next = ktime_get_real_seconds() + sec->ps_gc_interval;
157 static void sec_gc_main(struct work_struct *ws)
159 struct ptlrpc_sec *sec;
161 sec_process_ctx_list();
164 * go through sec list do gc.
165 * FIXME here we iterate through the whole list each time which
166 * is not optimal. we perhaps want to use balanced binary tree
167 * to trace each sec as order of expiry time.
168 * another issue here is we wakeup as fixed interval instead of
169 * according to each sec's expiry time
171 mutex_lock(&sec_gc_mutex);
172 list_for_each_entry(sec, &sec_gc_list, ps_gc_list) {
174 * if someone is waiting to be deleted, let it
175 * proceed as soon as possible.
177 if (atomic_read(&sec_gc_wait_del)) {
178 CDEBUG(D_SEC, "deletion pending, start over\n");
179 mutex_unlock(&sec_gc_mutex);
185 mutex_unlock(&sec_gc_mutex);
187 /* check ctx list again before sleep */
188 sec_process_ctx_list();
189 schedule_delayed_work(&sec_gc_work, cfs_time_seconds(SEC_GC_INTERVAL));
192 int sptlrpc_gc_init(void)
194 schedule_delayed_work(&sec_gc_work, cfs_time_seconds(SEC_GC_INTERVAL));
198 void sptlrpc_gc_fini(void)
200 cancel_delayed_work_sync(&sec_gc_work);