linux-kernel - Re: [PATCH] clocksource: moxart: Add AST2500 compatible string

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: <CACRpkdYbicYPJvaeTMpHSn4F77ognBfnEbj7OknFiZgfK1qizA@mail.gmail.com>
Date:   Tue, 30 May 2017 09:44:26 +0200
From:   Linus Walleij <linus.walleij@...aro.org>
To:     Daniel Lezcano <daniel.lezcano@...aro.org>
Cc:     Andrew Jeffery <andrew@...id.au>,
        "linux-kernel@...r.kernel.org" <linux-kernel@...r.kernel.org>,
        Rob Herring <robh+dt@...nel.org>,
        Mark Rutland <mark.rutland@....com>,
        Thomas Gleixner <tglx@...utronix.de>,
        Joel Stanley <joel@....id.au>,
        "devicetree@...r.kernel.org" <devicetree@...r.kernel.org>,
        Ryan Chen <ryan_chen@...eedtech.com>
Subject: Re: [PATCH] clocksource: moxart: Add AST2500 compatible string

On Sun, May 28, 2017 at 8:27 PM, Daniel Lezcano
<daniel.lezcano@...aro.org> wrote:
> On 28/05/2017 15:59, Linus Walleij wrote:
>> On Tue, May 16, 2017 at 9:58 AM, Andrew Jeffery <andrew@...id.au> wrote:
>>
>>> Also clean up space-before-tab issues in the documentation.
>>>
>>> Signed-off-by: Andrew Jeffery <andrew@...id.au>
>>
>> Reviewed-by: Linus Walleij <linus.walleij@...aro.org>
>>
>> Does this collide with Daniel's 2500 patch?
>>
>> Sorry for the mess, tell me if I need to fix something up :(
>
> It is ok, an usual collision change to be fixed when merging ;)
>
> By the way, can you have a look at fttmr010_read_sched_clock to remove
> the local_fttmr->count_down test?

I guess what we can do is make two different sched_clock()
callbacks: one for upward and one for downward counting.

Would you like an optimization like that?

(It makes sense.)

Yours,
Linus Walleij