aboutsummaryrefslogtreecommitdiffstats
path: root/fs/btrfs/async-thread.h
diff options
context:
space:
mode:
authorChris Mason <chris.mason@oracle.com>2008-10-16 10:12:58 -0400
committerChris Mason <chris.mason@oracle.com>2008-10-16 10:12:58 -0400
commit26ce34a9c47334ff7984769e4661b2f1883594ff (patch)
treefbc1da082a0b9f4adc7a2560811bbd6e6c47e420 /fs/btrfs/async-thread.h
parent3fa8749e584b55f1180411ab1b51117190bac1e5 (diff)
parent37d3cdddf5378606f6eab99982ca16819745d8f4 (diff)
Merge branch 'master' of ssh://mason@master.kernel.org/pub/scm/linux/kernel/git/mason/btrfs-unstable
Diffstat (limited to 'fs/btrfs/async-thread.h')
-rw-r--r--fs/btrfs/async-thread.h85
1 files changed, 85 insertions, 0 deletions
diff --git a/fs/btrfs/async-thread.h b/fs/btrfs/async-thread.h
new file mode 100644
index 000000000000..4ec9a2ee0f9d
--- /dev/null
+++ b/fs/btrfs/async-thread.h
@@ -0,0 +1,85 @@
1/*
2 * Copyright (C) 2007 Oracle. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
17 */
18
19#ifndef __BTRFS_ASYNC_THREAD_
20#define __BTRFS_ASYNC_THREAD_
21
22struct btrfs_worker_thread;
23
24/*
25 * This is similar to a workqueue, but it is meant to spread the operations
26 * across all available cpus instead of just the CPU that was used to
27 * queue the work. There is also some batching introduced to try and
28 * cut down on context switches.
29 *
30 * By default threads are added on demand up to 2 * the number of cpus.
31 * Changing struct btrfs_workers->max_workers is one way to prevent
32 * demand creation of kthreads.
33 *
34 * the basic model of these worker threads is to embed a btrfs_work
35 * structure in your own data struct, and use container_of in a
36 * work function to get back to your data struct.
37 */
38struct btrfs_work {
39 /*
40 * only func should be set to the function you want called
41 * your work struct is passed as the only arg
42 */
43 void (*func)(struct btrfs_work *work);
44
45 /*
46 * flags should be set to zero. It is used to make sure the
47 * struct is only inserted once into the list.
48 */
49 unsigned long flags;
50
51 /* don't touch these */
52 struct btrfs_worker_thread *worker;
53 struct list_head list;
54};
55
56struct btrfs_workers {
57 /* current number of running workers */
58 int num_workers;
59
60 /* max number of workers allowed. changed by btrfs_start_workers */
61 int max_workers;
62
63 /* once a worker has this many requests or fewer, it is idle */
64 int idle_thresh;
65
66 /* list with all the work threads. The workers on the idle thread
67 * may be actively servicing jobs, but they haven't yet hit the
68 * idle thresh limit above.
69 */
70 struct list_head worker_list;
71 struct list_head idle_list;
72
73 /* lock for finding the next worker thread to queue on */
74 spinlock_t lock;
75
76 /* extra name for this worker, used for current->name */
77 char *name;
78};
79
80int btrfs_queue_worker(struct btrfs_workers *workers, struct btrfs_work *work);
81int btrfs_start_workers(struct btrfs_workers *workers, int num_workers);
82int btrfs_stop_workers(struct btrfs_workers *workers);
83void btrfs_init_workers(struct btrfs_workers *workers, char *name, int max);
84int btrfs_requeue_work(struct btrfs_work *work);
85#endif