lkml.org 
[lkml]   [2007]   [Nov]   [6]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: [PATCH] Smackv10: Smack rules grammar + their stateful parser
On Tue, Nov 06, 2007 at 04:27:19PM -0800, Linus Torvalds wrote:
>
>
> On Wed, 7 Nov 2007, Adrian Bunk wrote:
> >
> > But if you want to match "one character" (like TOMOYO does) or want to
> > check for printable characters except space (like Smack does) you must
> > know whether the byte string 0xC3 0xA0 is the character à or a sequence
> > of two characters with the second one being NBSP.
>
> No you don't. You just check the binary value, and decide that ' ', '\t'
> and '\n' are special.
>
> Don't go get excited.

How should TOMOYO implement it's "match one character" in a pattern
(used to allow or deny access in a name-based MAC)?

> Linus

cu
Adrian

--

"Is there not promise of rain?" Ling Tan asked suddenly out
of the darkness. There had been need of rain for many days.
"Only a promise," Lao Er said.
Pearl S. Buck - Dragon Seed

-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2007-11-07 01:47    [W:0.174 / U:0.016 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site