linux-kernel - Re: [RFC PATCH 0/3] Add a new flag for ITS device to control indirect route

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite: Windows password security audit tool. GUI, reports in PDF.

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <58413F0E.3030604@huawei.com>
Date:   Fri, 2 Dec 2016 17:29:50 +0800
From:   "majun (Euler7)" <majun258@...wei.com>
To:     Marc Zyngier <marc.zyngier@....com>,
        <linux-kernel@...r.kernel.org>, <linux-acpi@...r.kernel.org>,
        <robert.moore@...el.com>, <lenb@...nel.org>, <lv.zheng@...el.com>,
        <rafael.j.wysocki@...el.com>, <devel@...ica.org>,
        <mark.rutland@....com>, <robh+dt@...nel.org>,
        <jason@...edaemon.net>
CC:     <majun258@...wei.com>, <dingtianhong@...wei.com>,
        <guohanjun@...wei.com>
Subject: Re: [RFC PATCH 0/3] Add a new flag for ITS device to control indirect
 route



在 2016/12/1 17:07, Marc Zyngier 写道:
> On 01/12/16 07:45, Majun wrote:
>> From: MaJun <majun258@...wei.com>
>>
>> For current ITS driver, two level table (indirect route) is enabled when the memory used
>> for LPI route table over the limit(64KB * 2) size. But this function impact the 
>> performance of LPI interrupt actually because need more time to look up the table.
> 
> Are you implying that your ITS doesn't have a cache to lookup the most
> active devices, hence performing a full lookup on each interrupt?

Our ITS chip has the cache with depth 64. But this seems not enough for some
scenario,espeically on virtulization platform.
> 
> Anyway, doing this as a DT quirk doesn't feel right. Please use the ITS
> quirk infrastructure.

If there is no other better solutions, I will do this.

Thanks!
Majun



> 
> Thanks,
> 
> 	M.
>