Blame view

kernel/linux-imx6_3.14.28/include/linux/blk-mq.h 5.27 KB
6b13f685e   김민수   BSP 최초 추가
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
  #ifndef BLK_MQ_H
  #define BLK_MQ_H
  
  #include <linux/blkdev.h>
  
  struct blk_mq_tags;
  
  struct blk_mq_cpu_notifier {
  	struct list_head list;
  	void *data;
  	void (*notify)(void *data, unsigned long action, unsigned int cpu);
  };
  
  struct blk_mq_hw_ctx {
  	struct {
  		spinlock_t		lock;
  		struct list_head	dispatch;
  	} ____cacheline_aligned_in_smp;
  
  	unsigned long		state;		/* BLK_MQ_S_* flags */
  	struct delayed_work	delayed_work;
  
  	unsigned long		flags;		/* BLK_MQ_F_* flags */
  
  	struct request_queue	*queue;
  	unsigned int		queue_num;
  
  	void			*driver_data;
  
  	unsigned int		nr_ctx;
  	struct blk_mq_ctx	**ctxs;
  	unsigned int 		nr_ctx_map;
  	unsigned long		*ctx_map;
  
  	struct request		**rqs;
  	struct list_head	page_list;
  	struct blk_mq_tags	*tags;
  
  	unsigned long		queued;
  	unsigned long		run;
  #define BLK_MQ_MAX_DISPATCH_ORDER	10
  	unsigned long		dispatched[BLK_MQ_MAX_DISPATCH_ORDER];
  
  	unsigned int		queue_depth;
  	unsigned int		numa_node;
  	unsigned int		cmd_size;	/* per-request extra data */
  
  	struct blk_mq_cpu_notifier	cpu_notifier;
  	struct kobject		kobj;
  };
  
  struct blk_mq_reg {
  	struct blk_mq_ops	*ops;
  	unsigned int		nr_hw_queues;
  	unsigned int		queue_depth;
  	unsigned int		reserved_tags;
  	unsigned int		cmd_size;	/* per-request extra data */
  	int			numa_node;
  	unsigned int		timeout;
  	unsigned int		flags;		/* BLK_MQ_F_* */
  };
  
  typedef int (queue_rq_fn)(struct blk_mq_hw_ctx *, struct request *);
  typedef struct blk_mq_hw_ctx *(map_queue_fn)(struct request_queue *, const int);
  typedef struct blk_mq_hw_ctx *(alloc_hctx_fn)(struct blk_mq_reg *,unsigned int);
  typedef void (free_hctx_fn)(struct blk_mq_hw_ctx *, unsigned int);
  typedef int (init_hctx_fn)(struct blk_mq_hw_ctx *, void *, unsigned int);
  typedef void (exit_hctx_fn)(struct blk_mq_hw_ctx *, unsigned int);
  
  struct blk_mq_ops {
  	/*
  	 * Queue request
  	 */
  	queue_rq_fn		*queue_rq;
  
  	/*
  	 * Map to specific hardware queue
  	 */
  	map_queue_fn		*map_queue;
  
  	/*
  	 * Called on request timeout
  	 */
  	rq_timed_out_fn		*timeout;
  
  	softirq_done_fn		*complete;
  
  	/*
  	 * Override for hctx allocations (should probably go)
  	 */
  	alloc_hctx_fn		*alloc_hctx;
  	free_hctx_fn		*free_hctx;
  
  	/*
  	 * Called when the block layer side of a hardware queue has been
  	 * set up, allowing the driver to allocate/init matching structures.
  	 * Ditto for exit/teardown.
  	 */
  	init_hctx_fn		*init_hctx;
  	exit_hctx_fn		*exit_hctx;
  };
  
  enum {
  	BLK_MQ_RQ_QUEUE_OK	= 0,	/* queued fine */
  	BLK_MQ_RQ_QUEUE_BUSY	= 1,	/* requeue IO for later */
  	BLK_MQ_RQ_QUEUE_ERROR	= 2,	/* end IO with error */
  
  	BLK_MQ_F_SHOULD_MERGE	= 1 << 0,
  	BLK_MQ_F_SHOULD_SORT	= 1 << 1,
  	BLK_MQ_F_SHOULD_IPI	= 1 << 2,
  
  	BLK_MQ_S_STOPPED	= 1 << 0,
  
  	BLK_MQ_MAX_DEPTH	= 2048,
  };
  
  struct request_queue *blk_mq_init_queue(struct blk_mq_reg *, void *);
  int blk_mq_register_disk(struct gendisk *);
  void blk_mq_unregister_disk(struct gendisk *);
  void blk_mq_init_commands(struct request_queue *, void (*init)(void *data, struct blk_mq_hw_ctx *, struct request *, unsigned int), void *data);
  
  void blk_mq_flush_plug_list(struct blk_plug *plug, bool from_schedule);
  
  void blk_mq_insert_request(struct request *, bool, bool, bool);
  void blk_mq_run_queues(struct request_queue *q, bool async);
  void blk_mq_free_request(struct request *rq);
  bool blk_mq_can_queue(struct blk_mq_hw_ctx *);
  struct request *blk_mq_alloc_request(struct request_queue *q, int rw, gfp_t gfp);
  struct request *blk_mq_alloc_reserved_request(struct request_queue *q, int rw, gfp_t gfp);
  struct request *blk_mq_rq_from_tag(struct request_queue *q, unsigned int tag);
  
  struct blk_mq_hw_ctx *blk_mq_map_queue(struct request_queue *, const int ctx_index);
  struct blk_mq_hw_ctx *blk_mq_alloc_single_hw_queue(struct blk_mq_reg *, unsigned int);
  void blk_mq_free_single_hw_queue(struct blk_mq_hw_ctx *, unsigned int);
  
  bool blk_mq_end_io_partial(struct request *rq, int error,
  		unsigned int nr_bytes);
  static inline void blk_mq_end_io(struct request *rq, int error)
  {
  	bool done = !blk_mq_end_io_partial(rq, error, blk_rq_bytes(rq));
  	BUG_ON(!done);
  }
  
  void blk_mq_complete_request(struct request *rq);
  
  void blk_mq_stop_hw_queue(struct blk_mq_hw_ctx *hctx);
  void blk_mq_start_hw_queue(struct blk_mq_hw_ctx *hctx);
  void blk_mq_stop_hw_queues(struct request_queue *q);
  void blk_mq_start_stopped_hw_queues(struct request_queue *q);
  
  /*
   * Driver command data is immediately after the request. So subtract request
   * size to get back to the original request.
   */
  static inline struct request *blk_mq_rq_from_pdu(void *pdu)
  {
  	return pdu - sizeof(struct request);
  }
  static inline void *blk_mq_rq_to_pdu(struct request *rq)
  {
  	return (void *) rq + sizeof(*rq);
  }
  
  static inline struct request *blk_mq_tag_to_rq(struct blk_mq_hw_ctx *hctx,
  					       unsigned int tag)
  {
  	return hctx->rqs[tag];
  }
  
  #define queue_for_each_hw_ctx(q, hctx, i)				\
  	for ((i) = 0; (i) < (q)->nr_hw_queues &&			\
  	     ({ hctx = (q)->queue_hw_ctx[i]; 1; }); (i)++)
  
  #define queue_for_each_ctx(q, ctx, i)					\
  	for ((i) = 0; (i) < (q)->nr_queues &&				\
  	     ({ ctx = per_cpu_ptr((q)->queue_ctx, (i)); 1; }); (i)++)
  
  #define hctx_for_each_ctx(hctx, ctx, i)					\
  	for ((i) = 0; (i) < (hctx)->nr_ctx &&				\
  	     ({ ctx = (hctx)->ctxs[(i)]; 1; }); (i)++)
  
  #define blk_ctx_sum(q, sum)						\
  ({									\
  	struct blk_mq_ctx *__x;						\
  	unsigned int __ret = 0, __i;					\
  									\
  	queue_for_each_ctx((q), __x, __i)				\
  		__ret += sum;						\
  	__ret;								\
  })
  
  #endif