mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-26 18:05:19 +07:00
73ff5fc0a8
sidtab_context_to_sid takes up a large share of time when creating large numbers of new inodes (~30-40% in oprofile runs). This patch implements a cache of 3 entries which is checked before we do a full context_to_sid lookup. On one system this showed over a x3 improvement in the number of inodes that could be created per second and around a 20% improvement on another system. Any time we look up the same context string sucessivly (imagine ls -lZ) we should hit this cache hot. A cache miss should have a relatively minor affect on performance next to doing the full table search. All operations on the cache are done COMPLETELY lockless. We know that all struct sidtab_node objects created will never be deleted until a new policy is loaded thus we never have to worry about a pointer being dereferenced. Since we also know that pointer assignment is atomic we know that the cache will always have valid pointers. Given this information we implement a FIFO cache in an array of 3 pointers. Every result (whether a cache hit or table lookup) will be places in the 0 spot of the cache and the rest of the entries moved down one spot. The 3rd entry will be lost. Races are possible and are even likely to happen. Lets assume that 4 tasks are hitting sidtab_context_to_sid. The first task checks against the first entry in the cache and it is a miss. Now lets assume a second task updates the cache with a new entry. This will push the first entry back to the second spot. Now the first task might check against the second entry (which it already checked) and will miss again. Now say some third task updates the cache and push the second entry to the third spot. The first task my check the third entry (for the third time!) and again have a miss. At which point it will just do a full table lookup. No big deal! Signed-off-by: Eric Paris <eparis@redhat.com>
57 lines
1.5 KiB
C
57 lines
1.5 KiB
C
/*
|
|
* A security identifier table (sidtab) is a hash table
|
|
* of security context structures indexed by SID value.
|
|
*
|
|
* Author : Stephen Smalley, <sds@epoch.ncsc.mil>
|
|
*/
|
|
#ifndef _SS_SIDTAB_H_
|
|
#define _SS_SIDTAB_H_
|
|
|
|
#include "context.h"
|
|
|
|
struct sidtab_node {
|
|
u32 sid; /* security identifier */
|
|
struct context context; /* security context structure */
|
|
struct sidtab_node *next;
|
|
};
|
|
|
|
#define SIDTAB_HASH_BITS 7
|
|
#define SIDTAB_HASH_BUCKETS (1 << SIDTAB_HASH_BITS)
|
|
#define SIDTAB_HASH_MASK (SIDTAB_HASH_BUCKETS-1)
|
|
|
|
#define SIDTAB_SIZE SIDTAB_HASH_BUCKETS
|
|
|
|
struct sidtab {
|
|
struct sidtab_node **htable;
|
|
unsigned int nel; /* number of elements */
|
|
unsigned int next_sid; /* next SID to allocate */
|
|
unsigned char shutdown;
|
|
#define SIDTAB_CACHE_LEN 3
|
|
struct sidtab_node *cache[SIDTAB_CACHE_LEN];
|
|
spinlock_t lock;
|
|
};
|
|
|
|
int sidtab_init(struct sidtab *s);
|
|
int sidtab_insert(struct sidtab *s, u32 sid, struct context *context);
|
|
struct context *sidtab_search(struct sidtab *s, u32 sid);
|
|
struct context *sidtab_search_force(struct sidtab *s, u32 sid);
|
|
|
|
int sidtab_map(struct sidtab *s,
|
|
int (*apply) (u32 sid,
|
|
struct context *context,
|
|
void *args),
|
|
void *args);
|
|
|
|
int sidtab_context_to_sid(struct sidtab *s,
|
|
struct context *context,
|
|
u32 *sid);
|
|
|
|
void sidtab_hash_eval(struct sidtab *h, char *tag);
|
|
void sidtab_destroy(struct sidtab *s);
|
|
void sidtab_set(struct sidtab *dst, struct sidtab *src);
|
|
void sidtab_shutdown(struct sidtab *s);
|
|
|
|
#endif /* _SS_SIDTAB_H_ */
|
|
|
|
|