On Sun, 29 Nov 2020, Markus Elfring wrote:
> >>> I think it would suffice to iterate over a rule that ensures that the
> >>> pattern of interest does not occur before the place where it is matched.
> >>
> >> It seems that I stumble still on understanding difficulties for the
> >> application
> >> of “iteration” according to the SmPL meaning.
> >>
> >> Something should provide elements with which an iteration step can work
> >> finally.
> >> I find it challenging to extract such information from mentioned demo
> >> scripts.
> >> https://github.com/coccinelle/coccinelle/blob/730dbb034559b3e549ec0b2973cd0400a3fa072f/docs/manual/cocci_syntax.tex#L1981
> >
> > When you rule matches, ie you make a change, then you can run Coccinelle
> > again on the result, by calling something like the add_if_not_present
> > function shown in the example.
>
> I find this information only partly reasonable.
>
> I guess that I know the set of identifiers already for which a transformation
> loop could be performed.
> I am unsure about the way to integrate such items into a “demonstrated”
> data processing approach so far.
I think that the only part of the functionality that you need is
it = Iteration()
it.register()
julia
_______________________________________________
Cocci mailing list
[email protected]
https://systeme.lip6.fr/mailman/listinfo/cocci
