2 * Copyright (c) 2009, 2010 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
5 * by Alex Hornung <ahornung@gmail.com>
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * 3. Neither the name of The DragonFly Project nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific, prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
26 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
29 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
31 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 #if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
40 #include <sys/queue.h>
45 #ifndef _SYS_BIOTRACK_H_
46 #include <sys/biotrack.h>
48 #ifndef _SYS_SPINLOCK_H_
49 #include <sys/spinlock.h>
52 #define FQ_FQP_LOCKINIT(x) lockinit(&(x)->lock, "fqpbioq", 0, LK_CANRECURSE)
53 #define FQ_FQP_LOCK(x) fq_reference_priv((x)); \
54 lockmgr(&(x)->lock, LK_EXCLUSIVE)
55 #define FQ_FQP_UNLOCK(x) lockmgr(&(x)->lock, LK_RELEASE); \
56 fq_dereference_priv((x));
58 #define FQ_FQMP_LOCKINIT(x) spin_init(&(x)->lock)
60 #define FQ_FQP_LOCKINIT(x) spin_init(&(x)->lock)
62 #define FQ_DPRIV_LOCKINIT(x) spin_init(&(x)->lock)
63 #define FQ_GLOBAL_FQMP_LOCKINIT(x) spin_init(&fq_fqmp_lock)
66 #define FQ_FQMP_LOCK(x) fq_reference_mpriv((x)); \
67 spin_lock_wr(&(x)->lock)
69 #define FQ_FQP_LOCK(x) fq_reference_priv((x)); \
70 spin_lock_wr(&(x)->lock)
73 #define FQ_DPRIV_LOCK(x) fq_reference_dpriv((x)); \
74 spin_lock_wr(&(x)->lock)
76 #define FQ_GLOBAL_FQMP_LOCK(x) spin_lock_wr(&fq_fqmp_lock)
79 #define FQ_FQMP_UNLOCK(x) spin_unlock_wr(&(x)->lock); \
80 fq_dereference_mpriv((x))
83 #define FQ_FQP_UNLOCK(x) spin_unlock_wr(&(x)->lock); \
84 fq_dereference_priv((x))
87 #define FQ_DPRIV_UNLOCK(x) spin_unlock_wr(&(x)->lock); \
88 fq_dereference_dpriv((x))
90 #define FQ_GLOBAL_FQMP_UNLOCK(x) spin_unlock_wr(&fq_fqmp_lock)
92 #define FQ_REBALANCE_TIMEOUT 1 /* in seconds */
93 #define FQ_TOTAL_DISK_TIME 1000000*FQ_REBALANCE_TIMEOUT /* in useconds */
95 #define FQ_PRIO_BIAS 5
96 #define FQ_PRIO_MAX 10
98 #define FQ_PRIO_IDLE -1
99 #define FQ_BUCKET_ACTIVE 0x01
101 #define FQ_DRAIN_CANCEL 0x1
102 #define FQ_DRAIN_FLUSH 0x2
107 #define FQP_LINKED_DPRIV 0x01
108 #define FQP_LINKED_FQMP 0x02
110 struct dsched_fq_priv {
111 TAILQ_ENTRY(dsched_fq_priv) link;
112 TAILQ_ENTRY(dsched_fq_priv) dlink;
113 TAILQ_HEAD(, bio) queue;
117 struct dsched_fq_dpriv *dpriv;
118 struct dsched_fq_mpriv *fqmp;
125 int32_t transactions;
127 int32_t s_transactions;
128 int32_t s_avg_latency;
135 struct dsched_fq_dpriv {
137 struct thread *td_balance;
139 struct spinlock lock;
142 int avg_rq_time; /* XXX: unused */
143 int32_t incomplete_tp;
146 struct timeval start_idle;
153 int64_t budgetpb[FQ_PRIO_MAX+1];
155 /* list contains all fq_priv for this disk */
156 TAILQ_HEAD(, dsched_fq_priv) fq_priv_list;
157 TAILQ_ENTRY(dsched_fq_dpriv) link;
160 struct dsched_fq_mpriv {
164 struct spinlock lock;
166 TAILQ_HEAD(, dsched_fq_priv) fq_priv_list;
167 TAILQ_ENTRY(dsched_fq_mpriv) link;
174 struct dsched_fq_priv *fq_alloc_priv(struct disk *dp, struct dsched_fq_mpriv *fqmp);
175 struct dsched_fq_dpriv *fq_alloc_dpriv(struct disk *dp);
176 struct dsched_fq_mpriv *fq_alloc_mpriv(struct proc *p);
177 void fq_balance_thread(struct dsched_fq_dpriv *dpriv);
178 void fq_dispatcher(struct dsched_fq_dpriv *dpriv);
179 biodone_t fq_completed;
181 void fq_reference_dpriv(struct dsched_fq_dpriv *dpriv);
182 void fq_reference_priv(struct dsched_fq_priv *fqp);
183 void fq_reference_mpriv(struct dsched_fq_mpriv *fqmp);
184 void fq_dereference_dpriv(struct dsched_fq_dpriv *dpriv);
185 void fq_dereference_priv(struct dsched_fq_priv *fqp);
186 void fq_dereference_mpriv(struct dsched_fq_mpriv *fqmp);
187 void fq_dispatch(struct dsched_fq_dpriv *dpriv, struct bio *bio,
188 struct dsched_fq_priv *fqp);
189 void fq_drain(struct dsched_fq_dpriv *dpriv, int mode);
190 void fq_balance_self(struct dsched_fq_priv *fqp);
191 #endif /* _KERNEL || _KERNEL_STRUCTURES */
194 struct dsched_fq_stats {
195 int32_t fqmp_allocations;
196 int32_t fqp_allocations;
197 int32_t dpriv_allocations;
199 int32_t procs_limited;
201 int32_t transactions;
202 int32_t transactions_completed;
213 #endif /* _DSCHED_FQ_H_ */