Seems to make sense...though someone could also probably get fairly far by writing a regular expression optimizer. It might not even be that hard to write a multi-regexp matching engine which took a set of regexps at once and constructed a single matching DFA for them. On Wed, 2012-08-08 at 15:31 -0400, Eric Paris wrote: > /* just to be safe! */ > buffer[MAX_REQUEST_LEN] = '\0'; Should be buffer[len] = '\0'; right? > /* calculating the length of the address is magic since it starts with nul. > * there be dragons in here! */ See also https://bugzilla.gnome.org/show_bug.cgi?id=615960 -- This message was distributed to subscribers of the selinux mailing list. If you no longer wish to subscribe, send mail to majordomo@xxxxxxxxxxxxx with the words "unsubscribe selinux" without quotes as the message.
