| @@ -1405,8 +1405,7 @@ static inline int ll_new_hw_segment(request_queue_t *q, · 1404 unmodified lines |
| 1405 | 1405 | return 1; |
| 1406 | 1406 | } |
| 1407 | 1407 | |
| 1408 | | −static int ll_back_merge_fn(request_queue_t *q, struct request *req, |
| 1409 | | − struct bio *bio) |
| 1408 | +int ll_back_merge_fn(request_queue_t *q, struct request *req, struct bio *bio) |
| 1410 | 1409 | { |
| 1411 | 1410 | unsigned short max_sectors; |
| 1412 | 1411 | int len; |
| @@ -1442,6 +1441,7 @@ static int ll_back_merge_fn(request_queue_t *q, struct request *req, · 29 unmodified lines |
| 1442 | 1441 | |
| 1443 | 1442 | return ll_new_hw_segment(q, req, bio); |
| 1444 | 1443 | } |
| 1444 | +EXPORT_SYMBOL(ll_back_merge_fn); |
| 1445 | 1445 | |
| 1446 | 1446 | static int ll_front_merge_fn(request_queue_t *q, struct request *req, |
| 1447 | 1447 | struct bio *bio) |
| @@ -1912,9 +1912,6 @@ blk_init_queue_node(request_fn_proc *rfn, spinlock_t *lock, int node_id) · 464 unmodified lines |
| 1912 | 1912 | } |
| 1913 | 1913 | |
| 1914 | 1914 | q->request_fn = rfn; |
| 1915 | | − q->back_merge_fn = ll_back_merge_fn; |
| 1916 | | − q->front_merge_fn = ll_front_merge_fn; |
| 1917 | | − q->merge_requests_fn = ll_merge_requests_fn; |
| 1918 | 1915 | q->prep_rq_fn = NULL; |
| 1919 | 1916 | q->unplug_fn = generic_unplug_device; |
| 1920 | 1917 | q->queue_flags = (1 << QUEUE_FLAG_CLUSTER); |
| @@ -2371,7 +2368,7 @@ static int __blk_rq_map_user(request_queue_t *q, struct request *rq, · 450 unmodified lines |
| 2371 | 2368 | spin_lock_irq(q->queue_lock); |
| 2372 | 2369 | if (!rq->bio) |
| 2373 | 2370 | blk_rq_bio_prep(q, rq, bio); |
| 2374 | | − else if (!q->back_merge_fn(q, rq, bio)) { |
| 2371 | + else if (!ll_back_merge_fn(q, rq, bio)) { |
| 2375 | 2372 | ret = -EINVAL; |
| 2376 | 2373 | spin_unlock_irq(q->queue_lock); |
| 2377 | 2374 | goto unmap_bio; |
| @@ -2820,7 +2817,7 @@ static int attempt_merge(request_queue_t *q, struct request *req, · 442 unmodified lines |
| 2820 | 2817 | * will have updated segment counts, update sector |
| 2821 | 2818 | * counts here. |
| 2822 | 2819 | */ |
| 2823 | | − if (!q->merge_requests_fn(q, req, next)) |
| 2820 | + if (!ll_merge_requests_fn(q, req, next)) |
| 2824 | 2821 | return 0; |
| 2825 | 2822 | |
| 2826 | 2823 | /* |
| @@ -2937,7 +2934,7 @@ static int __make_request(request_queue_t *q, struct bio *bio) · 110 unmodified lines |
| 2937 | 2934 | case ELEVATOR_BACK_MERGE: |
| 2938 | 2935 | BUG_ON(!rq_mergeable(req)); |
| 2939 | 2936 | |
| 2940 | | − if (!q->back_merge_fn(q, req, bio)) |
| 2937 | + if (!ll_back_merge_fn(q, req, bio)) |
| 2941 | 2938 | break; |
| 2942 | 2939 | |
| 2943 | 2940 | blk_add_trace_bio(q, bio, BLK_TA_BACKMERGE); |
| @@ -2954,7 +2951,7 @@ static int __make_request(request_queue_t *q, struct bio *bio) · 10 unmodified lines |
| 2954 | 2951 | case ELEVATOR_FRONT_MERGE: |
| 2955 | 2952 | BUG_ON(!rq_mergeable(req)); |
| 2956 | 2953 | |
| 2957 | | − if (!q->front_merge_fn(q, req, bio)) |
| 2954 | + if (!ll_front_merge_fn(q, req, bio)) |
| 2958 | 2955 | break; |
| 2959 | 2956 | |
| 2960 | 2957 | blk_add_trace_bio(q, bio, BLK_TA_FRONTMERGE); |