From mboxrd@z Thu Jan 1 00:00:00 1970 From: elfring@users.sourceforge.net (SF Markus Elfring) Date: Wed, 08 Oct 2014 20:05:46 +0200 Subject: [Cocci] Searching for pass-through functions In-Reply-To: References: <54303340.3090901@users.sourceforge.net> <54305719.1050304@users.sourceforge.net> <54312F70.3080809@users.sourceforge.net> <54313662.8000402@users.sourceforge.net> <543522B0.9020700@users.sourceforge.net> <5435279E.2070901@users.sourceforge.net> <54352C21.3050309@users.sourceforge.net> Message-ID: <54357CFA.8070808@users.sourceforge.net> To: cocci@systeme.lip6.fr List-Id: cocci@systeme.lip6.fr > @@ > identifier other_functions; > @@ > > ( > \(function\|names\|that\|are\|of\|no\|interest\) > | > * other_functions > ) > (...) Thanks for another example of a semantic patch rule. Would any more fine-tuning make sense for the shown SmPL disjunction when it gets longer? Does the current Coccinelle software support to organise entries in such a name list into subgroups where common prefixes or suffixes will be used? Your suggestion comes close to my idea to work with the functionality "negative lookaround" (in constraints) for some use cases. http://www.regular-expressions.info/lookaround.html Regards, Markus