Lines Matching defs:rq
328 struct request_list rq;
493 #define blk_fs_request(rq) ((rq)->flags & REQ_CMD)
494 #define blk_pc_request(rq) ((rq)->flags & REQ_BLOCK_PC)
495 #define blk_noretry_request(rq) ((rq)->flags & REQ_FAILFAST)
496 #define blk_rq_started(rq) ((rq)->flags & REQ_STARTED)
498 #define blk_account_rq(rq) (blk_rq_started(rq) && blk_fs_request(rq))
500 #define blk_pm_suspend_request(rq) ((rq)->flags & REQ_PM_SUSPEND)
501 #define blk_pm_resume_request(rq) ((rq)->flags & REQ_PM_RESUME)
502 #define blk_pm_request(rq) \
503 ((rq)->flags & (REQ_PM_SUSPEND | REQ_PM_RESUME))
505 #define blk_sorted_rq(rq) ((rq)->flags & REQ_SORTED)
506 #define blk_barrier_rq(rq) ((rq)->flags & REQ_HARDBARRIER)
507 #define blk_fua_rq(rq) ((rq)->flags & REQ_FUA)
511 #define rq_data_dir(rq) ((rq)->flags & 1)
543 #define rq_mergeable(rq) \
544 (!((rq)->flags & RQ_NOMERGE_FLAGS) && blk_fs_request((rq)))
585 #define rq_for_each_bio(_bio, rq) \
586 if ((rq->bio)) \
587 for (_bio = (rq)->bio; _bio; _bio = _bio->bi_next)
600 extern void blk_end_sync_rq(struct request *rq, int error);
658 static inline int rq_all_done(struct request *rq, unsigned int nr_bytes)
660 if (blk_fs_request(rq))
661 return (nr_bytes >= (rq->hard_nr_sectors << 9));
662 else if (blk_pc_request(rq))
663 return nr_bytes >= rq->data_len;
682 * This should be in elevator.h, but that requires pulling in rq and q
685 struct request *rq)
687 if (q->last_merge == rq)
691 q->end_sector = rq_end_sector(rq);
692 q->boundary_rq = rq;
693 list_add_tail(&rq->queuelist, &q->queue_head);
740 #define blk_rq_tagged(rq) ((rq)->flags & REQ_QUEUED)
