i'm creating a web interface for users to add their own mail filtering rules. the rules allow them to specify regexes to match headers and mail body. however, i'm a little concerned with how users can accidentally/ intentionally use too complex regexes like this "(a+.*(b+.+(c*.+)*.*))*" and the machine will just crawl when doing matching.

is there some way i can limit the amount of cpu time/amount of backtracking/etc when doing regex matching? or do i have to resort to os-based resource limiting?

--
dave


--
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]

Reply via email to