forked from luck/tmp_suning_uos_patched
8c38fb5c3d
-----BEGIN PGP SIGNATURE----- iQJIBAABCAAyFiEEcQCq365ubpQNLgrWVeRaWujKfIoFAloJ+XwUHHBhdWxAcGF1 bC1tb29yZS5jb20ACgkQVeRaWujKfIqv3w//aNbHxEvf59yf9TjdrmJE6ivFlTAL RmYCMsFn7uEisolTX1LPnz3cVNqN2/GQ5cnfcnrMiw7d2E/k85jq6Ket6NysX0Wi LCj6V/JTDeibB41GPDbiC9pSbIER5kUaqXI+X2aR4PgGumxxjdIqmammd1Sf1Hy9 470OJjDnhH68KFLG4bxVPY8Y4j4i/xgIKHU9z9EUA5LErhDAajWADSbvLcTZcp4b eja/DeSb8zbvHloB/maoqI9mnSKnwuGd91nz6cJBb92Lhy2A6xXNMCIVY/9tsb9n ZOw8NvFbfpOZ6WUZgwQCjdyn4nV0TuJQPpXNcjVoD9djczTnBq5EXz0FpHcM7d7n d44DeHOMJmJ2vGIbUz9MpelAxqckhY9wh/XTi1Kszr6qR8kSfzSnDsk1/bOWHWdk 2dKz6MAr4GbN6vgWRTtuuZ7db8TqFa1KdLVicKC0okaYlc0dH5PWC3KahKHbjgGi 5COdBhFexkeL82kJtMrFbusMNetBrYoLO4qOoSThuEOoCEGh0Fgx5zXlLFlEm3uv hLtEdxT+FLO3jFKCVejLoIHwl/YJ+Pd8C2rAkaXV8AEvs2Cn1gni4lb150nXtq5+ BhkrkjvthYTXuQZH+yMsoTVFVa0QVm2U+QgLmf19MT1EUqc46xIczYUAInV2VxlY 2WQ4d6mcD+PMzoQ= =VtxX -----END PGP SIGNATURE----- Merge tag 'selinux-pr-20171113' of git://git.kernel.org/pub/scm/linux/kernel/git/pcmoore/selinux Pull SELinux updates from Paul Moore: "Seven SELinux patches for v4.15, although five of the seven are small build fixes and cleanups. Of the remaining two patches, the only one worth really calling out is Eric's fix for the SELinux filesystem xattr set/remove code; the other patch simply converts the SELinux hash table implementation to use kmem_cache. Eric's setxattr/removexattr tweak converts SELinux back to calling the commoncap implementations when the xattr is not SELinux related. The immediate win is to fixup filesystem capabilities in user namespaces, but it makes things a bit saner overall; more information in the commit description" * tag 'selinux-pr-20171113' of git://git.kernel.org/pub/scm/linux/kernel/git/pcmoore/selinux: selinux: remove extraneous initialization of slots_used and max_chain_len selinux: remove redundant assignment to len selinux: remove redundant assignment to str selinux: fix build warning selinux: fix build warning by removing the unused sid variable selinux: Perform both commoncap and selinux xattr checks selinux: Use kmem_cache for hashtab_node
93 lines
2.6 KiB
C
93 lines
2.6 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
/*
|
|
* A hash table (hashtab) maintains associations between
|
|
* key values and datum values. The type of the key values
|
|
* and the type of the datum values is arbitrary. The
|
|
* functions for hash computation and key comparison are
|
|
* provided by the creator of the table.
|
|
*
|
|
* Author : Stephen Smalley, <sds@tycho.nsa.gov>
|
|
*/
|
|
#ifndef _SS_HASHTAB_H_
|
|
#define _SS_HASHTAB_H_
|
|
|
|
#define HASHTAB_MAX_NODES 0xffffffff
|
|
|
|
struct hashtab_node {
|
|
void *key;
|
|
void *datum;
|
|
struct hashtab_node *next;
|
|
};
|
|
|
|
struct hashtab {
|
|
struct hashtab_node **htable; /* hash table */
|
|
u32 size; /* number of slots in hash table */
|
|
u32 nel; /* number of elements in hash table */
|
|
u32 (*hash_value)(struct hashtab *h, const void *key);
|
|
/* hash function */
|
|
int (*keycmp)(struct hashtab *h, const void *key1, const void *key2);
|
|
/* key comparison function */
|
|
};
|
|
|
|
struct hashtab_info {
|
|
u32 slots_used;
|
|
u32 max_chain_len;
|
|
};
|
|
|
|
/*
|
|
* Creates a new hash table with the specified characteristics.
|
|
*
|
|
* Returns NULL if insufficent space is available or
|
|
* the new hash table otherwise.
|
|
*/
|
|
struct hashtab *hashtab_create(u32 (*hash_value)(struct hashtab *h, const void *key),
|
|
int (*keycmp)(struct hashtab *h, const void *key1, const void *key2),
|
|
u32 size);
|
|
|
|
/*
|
|
* Inserts the specified (key, datum) pair into the specified hash table.
|
|
*
|
|
* Returns -ENOMEM on memory allocation error,
|
|
* -EEXIST if there is already an entry with the same key,
|
|
* -EINVAL for general errors or
|
|
0 otherwise.
|
|
*/
|
|
int hashtab_insert(struct hashtab *h, void *k, void *d);
|
|
|
|
/*
|
|
* Searches for the entry with the specified key in the hash table.
|
|
*
|
|
* Returns NULL if no entry has the specified key or
|
|
* the datum of the entry otherwise.
|
|
*/
|
|
void *hashtab_search(struct hashtab *h, const void *k);
|
|
|
|
/*
|
|
* Destroys the specified hash table.
|
|
*/
|
|
void hashtab_destroy(struct hashtab *h);
|
|
|
|
/*
|
|
* Applies the specified apply function to (key,datum,args)
|
|
* for each entry in the specified hash table.
|
|
*
|
|
* The order in which the function is applied to the entries
|
|
* is dependent upon the internal structure of the hash table.
|
|
*
|
|
* If apply returns a non-zero status, then hashtab_map will cease
|
|
* iterating through the hash table and will propagate the error
|
|
* return to its caller.
|
|
*/
|
|
int hashtab_map(struct hashtab *h,
|
|
int (*apply)(void *k, void *d, void *args),
|
|
void *args);
|
|
|
|
/* Fill info with some hash table statistics */
|
|
void hashtab_stat(struct hashtab *h, struct hashtab_info *info);
|
|
|
|
/* Use kmem_cache for hashtab_node */
|
|
void hashtab_cache_init(void);
|
|
void hashtab_cache_destroy(void);
|
|
|
|
#endif /* _SS_HASHTAB_H */
|