The single example you give is trivial to solve*, so I think you haven't described the task completely. What do you want your output to look like? How large are your input files? If there are other calls in between "FunctionZ" and "FunctionY", should it still match? Also I don't understand your point #3 - how do you expect to match function names when they're missing?
* e.g. /^ENTRY:.*\b\Q$f1()\E\nENTRY:.*\b\Q$f2()\E$/m
In reply to Re: Analyze a C Call-Stack sequence trace and get call sequence from given Function name onwards.
by Anonymous Monk
in thread Analyze a C Call-Stack sequence trace and get call sequence from given Function name onwards.
by tobias_hofer
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |