> Il giorno 31 mar 2017, alle ore 17:20, Bart Van Assche
> ha scritto:
>
> On Fri, 2017-03-31 at 14:47 +0200, Paolo Valente wrote:
>> + entity->weight_counter = kzalloc(sizeof(struct bfq_weight_counter),
>> +GFP_ATOMIC);
> Il giorno 31 mar 2017, alle ore 17:20, Bart Van Assche
> ha scritto:
>
> On Fri, 2017-03-31 at 14:47 +0200, Paolo Valente wrote:
>> + entity->weight_counter = kzalloc(sizeof(struct bfq_weight_counter),
>> +GFP_ATOMIC);
>> +
On Fri, 2017-03-31 at 14:47 +0200, Paolo Valente wrote:
> + entity->weight_counter = kzalloc(sizeof(struct bfq_weight_counter),
> + GFP_ATOMIC);
> + entity->weight_counter->weight = entity->weight;
GFP_ATOMIC allocations are more likely to fail
On Fri, 2017-03-31 at 14:47 +0200, Paolo Valente wrote:
> + entity->weight_counter = kzalloc(sizeof(struct bfq_weight_counter),
> + GFP_ATOMIC);
> + entity->weight_counter->weight = entity->weight;
GFP_ATOMIC allocations are more likely to fail
From: Arianna Avanzini
A seeky queue (i..e, a queue containing random requests) is assigned a
very small device-idling slice, for throughput issues. Unfortunately,
given the process associated with a seeky queue, this behavior causes
the following problem: if the
From: Arianna Avanzini
A seeky queue (i..e, a queue containing random requests) is assigned a
very small device-idling slice, for throughput issues. Unfortunately,
given the process associated with a seeky queue, this behavior causes
the following problem: if the process, say P, performs sync
6 matches
Mail list logo