struct hlist_node hash; /* merge hash */
struct rb_node rb_node; /* sort/lookup */
+ /*
+ * two pointers are available for the IO schedulers, if they need
+ * more they have to dynamically allocate it.
+ */
void *elevator_private;
+ void *elevator_private2;
+
void *completion_data;
int rq_status; /* should split this into a few status bits */
request_queue_t *q;
struct request_list *rl;
- struct completion *waiting;
void *special;
char *buffer;
int retries;
/*
- * completion callback. end_io_data should be folded in with waiting
+ * completion callback.
*/
rq_end_io_fn *end_io;
void *end_io_data;