mirror of
https://github.com/torvalds/linux.git
synced 2024-11-11 22:51:42 +00:00
462919591a
Preparse the match data. This provides several advantages:
(1) The preparser can reject invalid criteria up front.
(2) The preparser can convert the criteria to binary data if necessary (the
asymmetric key type really wants to do binary comparison of the key IDs).
(3) The preparser can set the type of search to be performed. This means
that it's not then a one-off setting in the key type.
(4) The preparser can set an appropriate comparator function.
Signed-off-by: David Howells <dhowells@redhat.com>
Acked-by: Vivek Goyal <vgoyal@redhat.com>
|
||
|---|---|---|
| .. | ||
| asymmetric-parser.h | ||
| asymmetric-subtype.h | ||
| asymmetric-type.h | ||
| big_key-type.h | ||
| ceph-type.h | ||
| dns_resolver-type.h | ||
| encrypted-type.h | ||
| keyring-type.h | ||
| rxrpc-type.h | ||
| system_keyring.h | ||
| trusted-type.h | ||
| user-type.h | ||