"Ed Lin" <[email protected]> wrote:
>
> ....
>
> >
> >Please comment that, and check it. Consider using clear_bit or __clear_bit.
> >
> >> +static inline struct status_msg *shasta_get_status(struct st_hba *hba)
> >> +{
> >> + struct status_msg *status =
> >> + hba->status_buffer + hba->status_tail;
> >> +
> >> + ++hba->status_tail;
> >> + hba->status_tail %= MU_STATUS_COUNT;
> >> +
> >> + return status;
> >> +}
> >> +
> >> +static inline struct req_msg *shasta_alloc_req(struct st_hba *hba)
> >> +{
> >> + struct req_msg *req = ((struct req_msg *)hba->dma_mem) +
> >> + hba->req_head;
> >> +
> >> + ++hba->req_head;
> >> + hba->req_head %= MU_REQ_COUNT;
> >> +
> >> + return req;
> >> +}
> >
> >This is the awkward way of managing a ring buffer. It's simpler to let the
> >head and tail incides wrap up to 0xffffffff and only mask them when
> >actually using them as indices. That way,
> >
> > if (tail-head == size)
> > buffer is full
> >
> > if (tail-head == 0)
> > buffer is empty
> >
> >in fact, at all times,
> >
> > tail-head == items_in_buffer
> >
>
> I was always thinking about this problem, because here the req count is not
> power of 2.
> If we use wrap up, is the extra code handling 0xffffffff needed?
It's less code:
static inline unsigned round(unsigned x)
{
return x % N;
}
add()
{
buf[round(tail++)] = item;
}
remove()
{
return buf[round(head++)];
}
num_in_buffer()
{
return tail - head;
}
Not terribly important though.
> >> +static inline void shasta_map_sg(struct st_hba *hba,
> >> + struct req_msg *req, struct scsi_cmnd *cmd)
> >> +{
> >> + struct pci_dev *pdev = hba->pdev;
> >> + dma_addr_t dma_handle;
> >> + struct scatterlist *src;
> >> + struct st_sgtable *dst;
> >> + int i;
> >> +
> >> + dst = (struct st_sgtable *)req->variable;
> >> + dst->max_sg_count = cpu_to_le16(ST_MAX_SG);
> >> + dst->sz_in_byte = cpu_to_le32(cmd->request_bufflen);
> >> +
> >> + if (cmd->use_sg) {
> >> + src = (struct scatterlist *) cmd->request_buffer;
> >> + dst->sg_count = cpu_to_le16((u16)pci_map_sg(pdev, src,
> >> + cmd->use_sg, cmd->sc_data_direction));
> >> +
> >> + for (i = 0; i < dst->sg_count; i++, src++) {
> >> + dst->table[i].count = cpu_to_le32((u32)sg_dma_len(src));
> >> + dst->table[i].addr =
> >> + cpu_to_le32(sg_dma_address(src) & 0xffffffff);
> >
> >What does that 0xffffffff do?
> >
> >Should it be DMA_32BIT_MASK?
> >
>
> It is just a 32-bit mask.
Well yes ;)
But what are the implications of this mask on 64-bit platforms?
> I guess DMA_32BIT_MASK is OK?
If that's semantically what the 0xffffffff means then yes.
> > ...
> >>
> >> +static inline void
> >> +shasta_send_cmd(struct st_hba *hba, struct req_msg *req, u16 tag)
> >> +{
> >> + req->tag = cpu_to_le16(tag);
> >> + req->task_attr = TASK_ATTRIBUTE_SIMPLE;
> >> + req->task_manage = 0; /* not supported yet */
> >> + req->payload_sz = (u8)((sizeof(struct req_msg))/sizeof(u32));
> >> +
> >> + hba->ccb[tag].req = req;
> >> + hba->out_req_cnt++;
> >> + wmb();
> >> +
> >> + writel(hba->req_head, hba->mmio_base + IMR0);
> >> + writel(MU_INBOUND_DOORBELL_REQHEADCHANGED, hba->mmio_base + IDBL);
> >> + readl(hba->mmio_base + IDBL); /* flush */
> >> +}
> >
> >What is the wmb() for? Flushing memory for the upcoming DMA? That's not
> >what it's for.
> >
> >When adding any sort of open-coded barrier, please always add a comment
> >explaining why it is there.
> >
> >This function has two callsites and should be uninlined.
> >
>
> It's just for write order, but it seems unnecessary on i386.
write order of what with respect to what?
> >
> >> + switch (cmd->cmnd[0]) {
> >> + case READ_6:
> >> + case WRITE_6:
> >> + cmd->cmnd[9] = 0;
> >> + cmd->cmnd[8] = cmd->cmnd[4];
> >> + cmd->cmnd[7] = 0;
> >> + cmd->cmnd[6] = 0;
> >> + cmd->cmnd[5] = cmd->cmnd[3];
> >> + cmd->cmnd[4] = cmd->cmnd[2];
> >> + cmd->cmnd[3] = cmd->cmnd[1] & 0x1f;
> >> + cmd->cmnd[2] = 0;
> >> + cmd->cmnd[1] &= 0xe0;
> >> + cmd->cmnd[0] += READ_10 - READ_6;
> >> + break;
> >> + case MODE_SENSE:
> >> + {
> >> + char mode_sense[4] = { 3, 0, 0, 0 };
> >
> >static?
> >
> >> + shasta_direct_cp(cmd, mode_sense, sizeof(mode_sense));
> >> + cmd->result = DID_OK << 16 | COMMAND_COMPLETE << 8;
> >> + fn(cmd);
> >> + return 0;
> >> + }
> >> + case MODE_SENSE_10:
> >> + {
> >> + char mode_sense10[8] = { 0, 6, 0, 0, 0, 0, 0, 0 };
> >
> >static?
> >
>
> These commands are called just one or two times anyway, maybe need not
> static here?
The way you have the code here the compiler will need to create an array on
the stack and then populate each item in that array each time it's used.
If these are made static, that's all done at compile time.
> The rmb() here intends to guarantee every readl() to be really effective
> (directly from hardware), although there is already "volatile".
readl() should already take care of all that.
> The megaraid_mbox driver uses this...
>
> I used to observe sporadic handshake failure, so I added this(rmb()).
In that case something funny is going on. We should understand what that
is - it'll come back to bite us.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Stuff]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
[Linux Resources]
