search for: elevator_name

...0) { + nr_sorted = 0; + queue_for_each_ctx(q, ctx, i) + nr_sorted += ctx->nr_sorted; + if (nr_sorted && printed++ < 10) { printk(KERN_ERR "%s: forced dispatching is broken " "(nr_sorted=%u), please report this\n", - q->elevator->type->elevator_name, q->nr_sorted); + q->elevator->type->elevator_name, nr_sorted); } } void elv_quiesce_start(struct request_queue *q) { if (!q->elevator) return; spin_lock_irq(q->queue_lock); @@ -577,139 +630,149 @@ void elv_quiesce_start(struct request_queue *q) } void...

...0) { + nr_sorted = 0; + queue_for_each_ctx(q, ctx, i) + nr_sorted += ctx->nr_sorted; + if (nr_sorted && printed++ < 10) { printk(KERN_ERR "%s: forced dispatching is broken " "(nr_sorted=%u), please report this\n", - q->elevator->type->elevator_name, q->nr_sorted); + q->elevator->type->elevator_name, nr_sorted); } } void elv_quiesce_start(struct request_queue *q) { if (!q->elevator) return; spin_lock_irq(q->queue_lock); @@ -577,139 +630,149 @@ void elv_quiesce_start(struct request_queue *q) } void...

This patchset expands traditional CFQ scheduler in order to support cgroups, and improves old version. Improvements are as following. * Modularizing our new CFQ scheduler. The expanded CFQ scheduler is registered/unregistered as new I/O elevator scheduler called "cfq-cgroups". By this, the traditional CFQ scheduler, which does not handle cgroups, and our new CFQ

This patchset expands traditional CFQ scheduler in order to support cgroups, and improves old version. Improvements are as following. * Modularizing our new CFQ scheduler. The expanded CFQ scheduler is registered/unregistered as new I/O elevator scheduler called "cfq-cgroups". By this, the traditional CFQ scheduler, which does not handle cgroups, and our new CFQ