[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <84a9fa83-8048-44c8-3191-07aa63337cfb@arm.com>
Date: Mon, 23 Sep 2019 14:23:54 +0100
From: Valentin Schneider <valentin.schneider@....com>
To: Julia Lawall <julia.lawall@...6.fr>
Cc: Markus Elfring <Markus.Elfring@....de>,
Alexey Dobriyan <adobriyan@...il.com>, dm-devel@...hat.com,
linux-block@...r.kernel.org, rcu@...r.kernel.org,
linux-kernel@...r.kernel.org,
Andrea Arcangeli <aarcange@...hat.com>,
Ingo Molnar <mingo@...hat.com>, Jens Axboe <axboe@...nel.dk>,
Peter Zijlstra <peterz@...radead.org>
Subject: Re: sched: make struct task_struct::state 32-bit
On 23/09/2019 12:43, Julia Lawall wrote:
>>>> // FIXME: match functions that do something with state_var underneath?
>>>> // How to do recursive rules?
>>>
>>> You want to look at the definitions of called functions? Coccinelle
>>> doesn't really support that, but there are hackish ways to add that. How
>>> many function calls would you expect have to be unrolled?
>>>
>>
>> I wouldn't expect more than a handful (~5). I suppose this has to do with
>> injecting some Python/Ocaml code? I have some examples bookmarked but
>> haven't gotten to stare at them long enough.
>
> You can look at iteration.cocci, but it's a bit complex.
>
> You could match definitions of functions that do what you are interested
> in, then store the names of these functions in a list (python/ocaml), and
> then look for calls to those functions. Something like
>
> identifier fn : script:ocaml() { in_my_list fn };
>
That seems promising, will try to have a look when I get some spare cycles.
Thanks for the pointers!
Powered by blists - more mailing lists