[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CAE=gft5ZDX-T5qHYy7AJqDkfNr4-yVpTFzZq_FPS86LfFQnvfA@mail.gmail.com>
Date: Mon, 4 Jun 2018 08:40:56 -0700
From: Evan Green <evgreen@...omium.org>
To: Bart.VanAssche@....com
Cc: jejb@...ux.vnet.ibm.com, linux-kernel@...r.kernel.org,
linux-scsi@...r.kernel.org, martin.petersen@...cle.com,
Vinayak Holikatti <vinholikatti@...il.com>,
Stanislav.Nijnikov@....com, Gwendal Grignou <gwendal@...omium.org>
Subject: Re: [PATCH 5/7] scsi: ufs: Refactor descriptor read for write
On Mon, Jun 4, 2018 at 1:41 AM Bart Van Assche <Bart.VanAssche@....com> wrote:
>
> On Tue, 2018-05-29 at 11:17 -0700, Evan Green wrote:
> > /* Check whether we need temp memory */
> > if (param_offset != 0 || param_size < buff_len) {
> > - desc_buf = kmalloc(buff_len, GFP_KERNEL);
> > + desc_buf = kzalloc(buff_len, GFP_KERNEL);
> > if (!desc_buf)
> > return -ENOMEM;
> > +
> > + /* If it's a write, first read the complete descriptor, then
> > + * copy in the parts being changed.
> > + */
>
> Have you verified this patch with checkpatch? The above comment does not follow
> the Linux kernel coding style.
Yes, but I probably forgot to add that switch that turns on even more
checks. Will fix.
>
> > + if (opcode == UPIU_QUERY_OPCODE_WRITE_DESC) {
> > + if ((int)param_offset + (int)param_size > buff_len) {
> > + ret = -EINVAL;
> > + goto out;
> > + }
> > +
> > + ret = ufshcd_query_descriptor_retry(hba,
> > + UPIU_QUERY_OPCODE_READ_DESC,
> > + desc_id, desc_index, 0,
> > + desc_buf, &buff_len);
> > +
> > + if (ret) {
> > + dev_err(hba->dev,
> > + "%s: Failed reading descriptor. desc_id %d, desc_index %d, param_offset %d, ret %d",
> > + __func__, desc_id, desc_index,
> > + param_offset, ret);
> > +
> > + goto out;
> > + }
> > +
> > + memcpy(desc_buf + param_offset, param_buf, param_size);
> > + }
>
> The above code is indented deeply. I think that means that this code would become
> easier to read if a helper function would be introduced.
Ok.
>
> Additionally, I think locking is missing from the above code. How else can race
> conditions between concurrent writers be prevented?
Hm, yeah I think this followed along with my thinking that there
wouldn't be multiple processes provisioning at once. This function
will always write a consistent version of one caller's view, but
multiple callers might clobber each other's writes. I can explore
adding locking.
-Evan
Powered by blists - more mailing lists