|
@@ -4801,16 +4801,13 @@ static ssize_t bfq_var_show(unsigned int var, char *page)
|
|
|
return sprintf(page, "%u\n", var);
|
|
|
}
|
|
|
|
|
|
-static ssize_t bfq_var_store(unsigned long *var, const char *page,
|
|
|
- size_t count)
|
|
|
+static void bfq_var_store(unsigned long *var, const char *page)
|
|
|
{
|
|
|
unsigned long new_val;
|
|
|
int ret = kstrtoul(page, 10, &new_val);
|
|
|
|
|
|
if (ret == 0)
|
|
|
*var = new_val;
|
|
|
-
|
|
|
- return count;
|
|
|
}
|
|
|
|
|
|
#define SHOW_FUNCTION(__FUNC, __VAR, __CONV) \
|
|
@@ -4852,7 +4849,7 @@ __FUNC(struct elevator_queue *e, const char *page, size_t count) \
|
|
|
{ \
|
|
|
struct bfq_data *bfqd = e->elevator_data; \
|
|
|
unsigned long uninitialized_var(__data); \
|
|
|
- int ret = bfq_var_store(&__data, (page), count); \
|
|
|
+ bfq_var_store(&__data, (page)); \
|
|
|
if (__data < (MIN)) \
|
|
|
__data = (MIN); \
|
|
|
else if (__data > (MAX)) \
|
|
@@ -4863,7 +4860,7 @@ __FUNC(struct elevator_queue *e, const char *page, size_t count) \
|
|
|
*(__PTR) = (u64)__data * NSEC_PER_MSEC; \
|
|
|
else \
|
|
|
*(__PTR) = __data; \
|
|
|
- return ret; \
|
|
|
+ return count; \
|
|
|
}
|
|
|
STORE_FUNCTION(bfq_fifo_expire_sync_store, &bfqd->bfq_fifo_expire[1], 1,
|
|
|
INT_MAX, 2);
|
|
@@ -4880,13 +4877,13 @@ static ssize_t __FUNC(struct elevator_queue *e, const char *page, size_t count)\
|
|
|
{ \
|
|
|
struct bfq_data *bfqd = e->elevator_data; \
|
|
|
unsigned long uninitialized_var(__data); \
|
|
|
- int ret = bfq_var_store(&__data, (page), count); \
|
|
|
+ bfq_var_store(&__data, (page)); \
|
|
|
if (__data < (MIN)) \
|
|
|
__data = (MIN); \
|
|
|
else if (__data > (MAX)) \
|
|
|
__data = (MAX); \
|
|
|
*(__PTR) = (u64)__data * NSEC_PER_USEC; \
|
|
|
- return ret; \
|
|
|
+ return count; \
|
|
|
}
|
|
|
USEC_STORE_FUNCTION(bfq_slice_idle_us_store, &bfqd->bfq_slice_idle, 0,
|
|
|
UINT_MAX);
|
|
@@ -4897,7 +4894,8 @@ static ssize_t bfq_max_budget_store(struct elevator_queue *e,
|
|
|
{
|
|
|
struct bfq_data *bfqd = e->elevator_data;
|
|
|
unsigned long uninitialized_var(__data);
|
|
|
- int ret = bfq_var_store(&__data, (page), count);
|
|
|
+
|
|
|
+ bfq_var_store(&__data, (page));
|
|
|
|
|
|
if (__data == 0)
|
|
|
bfqd->bfq_max_budget = bfq_calc_max_budget(bfqd);
|
|
@@ -4909,7 +4907,7 @@ static ssize_t bfq_max_budget_store(struct elevator_queue *e,
|
|
|
|
|
|
bfqd->bfq_user_max_budget = __data;
|
|
|
|
|
|
- return ret;
|
|
|
+ return count;
|
|
|
}
|
|
|
|
|
|
/*
|
|
@@ -4921,7 +4919,8 @@ static ssize_t bfq_timeout_sync_store(struct elevator_queue *e,
|
|
|
{
|
|
|
struct bfq_data *bfqd = e->elevator_data;
|
|
|
unsigned long uninitialized_var(__data);
|
|
|
- int ret = bfq_var_store(&__data, (page), count);
|
|
|
+
|
|
|
+ bfq_var_store(&__data, (page));
|
|
|
|
|
|
if (__data < 1)
|
|
|
__data = 1;
|
|
@@ -4932,7 +4931,7 @@ static ssize_t bfq_timeout_sync_store(struct elevator_queue *e,
|
|
|
if (bfqd->bfq_user_max_budget == 0)
|
|
|
bfqd->bfq_max_budget = bfq_calc_max_budget(bfqd);
|
|
|
|
|
|
- return ret;
|
|
|
+ return count;
|
|
|
}
|
|
|
|
|
|
static ssize_t bfq_strict_guarantees_store(struct elevator_queue *e,
|
|
@@ -4940,7 +4939,8 @@ static ssize_t bfq_strict_guarantees_store(struct elevator_queue *e,
|
|
|
{
|
|
|
struct bfq_data *bfqd = e->elevator_data;
|
|
|
unsigned long uninitialized_var(__data);
|
|
|
- int ret = bfq_var_store(&__data, (page), count);
|
|
|
+
|
|
|
+ bfq_var_store(&__data, (page));
|
|
|
|
|
|
if (__data > 1)
|
|
|
__data = 1;
|
|
@@ -4950,7 +4950,7 @@ static ssize_t bfq_strict_guarantees_store(struct elevator_queue *e,
|
|
|
|
|
|
bfqd->strict_guarantees = __data;
|
|
|
|
|
|
- return ret;
|
|
|
+ return count;
|
|
|
}
|
|
|
|
|
|
static ssize_t bfq_low_latency_store(struct elevator_queue *e,
|
|
@@ -4958,7 +4958,8 @@ static ssize_t bfq_low_latency_store(struct elevator_queue *e,
|
|
|
{
|
|
|
struct bfq_data *bfqd = e->elevator_data;
|
|
|
unsigned long uninitialized_var(__data);
|
|
|
- int ret = bfq_var_store(&__data, (page), count);
|
|
|
+
|
|
|
+ bfq_var_store(&__data, (page));
|
|
|
|
|
|
if (__data > 1)
|
|
|
__data = 1;
|
|
@@ -4966,7 +4967,7 @@ static ssize_t bfq_low_latency_store(struct elevator_queue *e,
|
|
|
bfq_end_wr(bfqd);
|
|
|
bfqd->low_latency = __data;
|
|
|
|
|
|
- return ret;
|
|
|
+ return count;
|
|
|
}
|
|
|
|
|
|
#define BFQ_ATTR(name) \
|