"Encoding pool max memory (MB), 1/8 of total physical memory by default");
/*
- * bulk encryption page pools
+ * lustre page pools
*/
#define PTRS_PER_PAGE (PAGE_SIZE / sizeof(void *))
#define CACHE_QUIESCENT_PERIOD (20)
-static struct ptlrpc_enc_page_pool {
+static struct ptlrpc_page_pool {
unsigned long epp_max_pages; /* maximum pages can hold, const */
unsigned int epp_max_pools; /* number of pools, const */
int page_pools_seq_show(struct seq_file *m, void *v)
{
int pool_index;
- struct ptlrpc_enc_page_pool *pool;
+ struct ptlrpc_page_pool *pool;
seq_printf(m, "physical_pages: %lu\n"
"pages per pool: %lu\n\n"
return 0;
}
-static void enc_pools_release_free_pages(long npages, unsigned int pool_idx)
+static void pools_release_free_pages(long npages, unsigned int pool_idx)
{
int p_idx, g_idx;
int p_idx_max1, p_idx_max2;
- struct ptlrpc_enc_page_pool *pool = page_pools[pool_idx];
+ struct ptlrpc_page_pool *pool = page_pools[pool_idx];
LASSERT(npages > 0);
LASSERT(npages <= pool->epp_free_pages);
/*
* we try to keep at least PTLRPC_MAX_BRW_PAGES pages in the pool.
*/
-static unsigned long enc_pools_shrink_count(struct shrinker *s,
+static unsigned long pools_shrink_count(struct shrinker *s,
struct shrink_control *sc)
{
unsigned int pool_index = SEEKS_TO_INDEX(s);
- struct ptlrpc_enc_page_pool *pool = page_pools[pool_index];
+ struct ptlrpc_page_pool *pool = page_pools[pool_index];
/*
* if no pool access for a long time, we consider it's fully
* idle. A little race here is fine.
/*
* we try to keep at least PTLRPC_MAX_BRW_PAGES pages in the pool.
*/
-static unsigned long enc_pools_shrink_scan(struct shrinker *s,
+static unsigned long pools_shrink_scan(struct shrinker *s,
struct shrink_control *sc)
{
/* Get pool number passed as part of pools_shrinker_seeks value */
unsigned int pool_index = SEEKS_TO_INDEX(s);
- struct ptlrpc_enc_page_pool *pool = page_pools[pool_index];
+ struct ptlrpc_page_pool *pool = page_pools[pool_index];
spin_lock(&pool->epp_lock);
if (pool->epp_free_pages <= PTLRPC_MAX_BRW_PAGES)
sc->nr_to_scan = min_t(unsigned long, sc->nr_to_scan,
pool->epp_free_pages - PTLRPC_MAX_BRW_PAGES);
if (sc->nr_to_scan > 0) {
- enc_pools_release_free_pages(sc->nr_to_scan, pool_index);
+ pools_release_free_pages(sc->nr_to_scan, pool_index);
CDEBUG(D_SEC, "released %ld pages, %ld left\n",
(long)sc->nr_to_scan, pool->epp_free_pages);
* could be called frequently for query (@nr_to_scan == 0).
* we try to keep at least PTLRPC_MAX_BRW_PAGES pages in the pool.
*/
-static int enc_pools_shrink(struct shrinker *shrinker,
+static int pools_shrink(struct shrinker *shrinker,
struct shrink_control *sc)
{
- enc_pools_shrink_scan(shrinker, sc);
+ pools_shrink_scan(shrinker, sc);
- return enc_pools_shrink_count(shrinker, sc);
+ return pools_shrink_count(shrinker, sc);
}
#endif /* HAVE_SHRINKER_COUNT */
/*
* return how many pages cleaned up.
*/
-static unsigned long enc_pools_cleanup(void ***pools, int npools, int pool_idx)
+static unsigned long pools_cleanup(void ***pools, int npools, int pool_idx)
{
unsigned long cleaned = 0;
int i, j;
* we have options to avoid most memory copy with some tricks. but we choose
* the simplest way to avoid complexity. It's not frequently called.
*/
-static void enc_pools_insert(void ***pools, int npools, int npages,
+static void pools_insert(void ***pools, int npools, int npages,
unsigned int pool_idx)
{
int freeslot;
int op_idx, np_idx, og_idx, ng_idx;
int cur_npools, end_npools;
- struct ptlrpc_enc_page_pool *page_pool = page_pools[pool_idx];
+ struct ptlrpc_page_pool *page_pool = page_pools[pool_idx];
LASSERT(npages > 0);
LASSERT(page_pool->epp_total_pages+npages <= page_pool->epp_max_pages);
void ***pools;
int npools, alloced = 0;
int i, j, rc = -ENOMEM;
- struct ptlrpc_enc_page_pool *page_pool = page_pools[pool_index];
+ struct ptlrpc_page_pool *page_pool = page_pools[pool_index];
if (pool_index == PAGES_POOL) {
if (npages < POOL_INIT_SIZE >> PAGE_SHIFT)
}
LASSERT(alloced == npages);
- enc_pools_insert(pools, npools, npages, pool_index);
+ pools_insert(pools, npools, npages, pool_index);
CDEBUG(D_SEC, "added %d pages into pools\n", npages);
OBD_FREE_PTR_ARRAY(pools, npools);
rc = 0;
out_pools:
if (rc) {
- enc_pools_cleanup(pools, npools, pool_index);
+ pools_cleanup(pools, npools, pool_index);
}
out:
if (rc) {
page_pool->epp_st_grow_fails++;
- CERROR("Failed to allocate %d enc pages\n", npages);
+ CERROR("Failed to allocate %d pages\n", npages);
}
mutex_unlock(&page_pool->add_pages_mutex);
return rc;
}
-static inline void enc_pools_wakeup(unsigned int pool)
+static inline void pools_wakeup(unsigned int pool)
{
assert_spin_locked(&page_pools[pool]->epp_lock);
wake_up_all(&page_pools[pool]->epp_waitq);
}
-static int enc_pools_should_grow(int page_needed, time64_t now,
- unsigned int pool_index)
+static int pools_should_grow(int page_needed, time64_t now,
+ unsigned int pool_index)
{
/*
* don't grow if someone else is growing the pools right now,
/*
* Export the number of free pages in the pool
*/
-int sptlrpc_enc_pool_get_free_pages(unsigned int pool)
+int sptlrpc_pool_get_free_pages(unsigned int pool)
{
return page_pools[pool]->epp_free_pages;
}
-EXPORT_SYMBOL(sptlrpc_enc_pool_get_free_pages);
+EXPORT_SYMBOL(sptlrpc_pool_get_free_pages);
/*
- * Let outside world know if enc_pool full capacity is reached
+ * Let outside world know if pool full capacity is reached
*/
int __pool_is_at_full_capacity(unsigned int pool)
{
}
/*
- * Let outside world know if enc_pool full capacity is reached
+ * Let outside world know if pool full capacity is reached
*/
int pool_is_at_full_capacity(void)
{
/*
* we allocate the requested pages atomically.
*/
-static inline int __sptlrpc_enc_pool_get_pages(void *array, unsigned int count,
- unsigned int pool_idx,
- void **(*page_from)(void *, int))
+static inline int __sptlrpc_pool_get_pages(void *array, unsigned int count,
+ unsigned int pool_idx,
+ void **(*page_from)(void *, int))
{
- struct ptlrpc_enc_page_pool *page_pool = page_pools[pool_idx];
+ struct ptlrpc_page_pool *page_pool = page_pools[pool_idx];
wait_queue_entry_t waitlink;
unsigned long this_idle = -1;
u64 tick_ns = 0;
page_pool->epp_st_missings++;
page_pool->epp_pages_short += count;
- if (enc_pools_should_grow(count, now, pool_idx)) {
+ if (pools_should_grow(count, now, pool_idx)) {
page_pool->epp_growing = 1;
spin_unlock(&page_pool->epp_lock);
page_pool->epp_growing = 0;
- enc_pools_wakeup(pool_idx);
+ pools_wakeup(pool_idx);
} else {
if (page_pool->epp_growing) {
if (++page_pool->epp_waitqlen >
return rc;
}
-int sptlrpc_enc_pool_get_desc_pages(struct ptlrpc_bulk_desc *desc)
+int sptlrpc_pool_get_desc_pages(struct ptlrpc_bulk_desc *desc)
{
int rc;
if (desc->bd_enc_vec == NULL)
return -ENOMEM;
- rc = __sptlrpc_enc_pool_get_pages((void *)desc, desc->bd_iov_count,
+ rc = __sptlrpc_pool_get_pages((void *)desc, desc->bd_iov_count,
PAGES_POOL, page_from_bulkdesc);
if (rc) {
OBD_FREE_LARGE(desc->bd_enc_vec,
}
return rc;
}
-EXPORT_SYMBOL(sptlrpc_enc_pool_get_desc_pages);
+EXPORT_SYMBOL(sptlrpc_pool_get_desc_pages);
-int sptlrpc_enc_pool_get_pages_array(struct page **pa, unsigned int count)
+int sptlrpc_pool_get_pages_array(struct page **pa, unsigned int count)
{
- return __sptlrpc_enc_pool_get_pages((void *)pa, count, PAGES_POOL,
+ return __sptlrpc_pool_get_pages((void *)pa, count, PAGES_POOL,
page_from_pagearray);
}
-EXPORT_SYMBOL(sptlrpc_enc_pool_get_pages_array);
+EXPORT_SYMBOL(sptlrpc_pool_get_pages_array);
-int sptlrpc_enc_pool_get_pages(void **pages, unsigned int order)
+int sptlrpc_pool_get_pages(void **pages, unsigned int order)
{
- return __sptlrpc_enc_pool_get_pages((void *)pages, 0,
+ return __sptlrpc_pool_get_pages((void *)pages, 0,
PPOOL_ORDER_TO_INDEX(order),
page_from_bufarray);
}
-EXPORT_SYMBOL(sptlrpc_enc_pool_get_pages);
+EXPORT_SYMBOL(sptlrpc_pool_get_pages);
-static int __sptlrpc_enc_pool_put_pages(void *array, unsigned int count,
+static int __sptlrpc_pool_put_pages(void *array, unsigned int count,
unsigned int pool_idx,
void **(*page_from)(void *, int))
{
int p_idx, g_idx;
int i, rc = 0;
- struct ptlrpc_enc_page_pool *page_pool;
+ struct ptlrpc_page_pool *page_pool;
LASSERTF(pool_idx < POOLS_COUNT, "count %u, pool %u\n",
count, pool_idx);
}
page_pool->epp_free_pages += count;
- enc_pools_wakeup(pool_idx);
+ pools_wakeup(pool_idx);
out_unlock:
spin_unlock(&page_pool->epp_lock);
return rc;
}
-void sptlrpc_enc_pool_put_desc_pages(struct ptlrpc_bulk_desc *desc)
+void sptlrpc_pool_put_desc_pages(struct ptlrpc_bulk_desc *desc)
{
int rc;
if (desc->bd_enc_vec == NULL)
return;
- rc = __sptlrpc_enc_pool_put_pages((void *)desc, desc->bd_iov_count,
+ rc = __sptlrpc_pool_put_pages((void *)desc, desc->bd_iov_count,
PAGES_POOL, page_from_bulkdesc);
if (rc)
CDEBUG(D_SEC, "error putting pages in enc pool: %d\n", rc);
desc->bd_enc_vec = NULL;
}
-void sptlrpc_enc_pool_put_pages_array(struct page **pa, unsigned int count)
+void sptlrpc_pool_put_pages_array(struct page **pa, unsigned int count)
{
int rc;
- rc = __sptlrpc_enc_pool_put_pages((void *)pa, count, PAGES_POOL,
+ rc = __sptlrpc_pool_put_pages((void *)pa, count, PAGES_POOL,
page_from_pagearray);
if (rc)
CDEBUG(D_SEC, "error putting pages in enc pool: %d\n", rc);
}
-EXPORT_SYMBOL(sptlrpc_enc_pool_put_pages_array);
+EXPORT_SYMBOL(sptlrpc_pool_put_pages_array);
-void sptlrpc_enc_pool_put_pages(void *buf, unsigned int order)
+void sptlrpc_pool_put_pages(void *buf, unsigned int order)
{
int rc;
- rc = __sptlrpc_enc_pool_put_pages(buf, 1,
+ rc = __sptlrpc_pool_put_pages(buf, 1,
PPOOL_ORDER_TO_INDEX(order),
page_from_bufarray);
if (rc)
CDEBUG(D_SEC, "error putting pages in enc pool: %d\n", rc);
}
-EXPORT_SYMBOL(sptlrpc_enc_pool_put_pages);
+EXPORT_SYMBOL(sptlrpc_pool_put_pages);
/*
* initial pages in add_user() if current pools are empty, rest would be
* handled by the pools's self-adaption.
*/
-int sptlrpc_enc_pool_add_user(void)
+int sptlrpc_pool_add_user(void)
{
int need_grow = 0;
spin_lock(&page_pools[PAGES_POOL]->epp_lock);
page_pools[PAGES_POOL]->epp_growing = 0;
- enc_pools_wakeup(PAGES_POOL);
+ pools_wakeup(PAGES_POOL);
spin_unlock(&page_pools[PAGES_POOL]->epp_lock);
}
return 0;
}
-EXPORT_SYMBOL(sptlrpc_enc_pool_add_user);
+EXPORT_SYMBOL(sptlrpc_pool_add_user);
-int sptlrpc_enc_pool_del_user(void)
+int sptlrpc_pool_del_user(void)
{
return 0;
}
-EXPORT_SYMBOL(sptlrpc_enc_pool_del_user);
+EXPORT_SYMBOL(sptlrpc_pool_del_user);
-static inline void enc_pools_alloc(struct ptlrpc_enc_page_pool *pool)
+static inline void pools_alloc(struct ptlrpc_page_pool *pool)
{
LASSERT(pool->epp_max_pools);
OBD_ALLOC_LARGE(pool->epp_pools,
sizeof(*pool->epp_pools));
}
-static inline void enc_pools_free(unsigned int i)
+static inline void pools_free(unsigned int i)
{
LASSERT(page_pools[i]->epp_max_pools);
LASSERT(page_pools[i]->epp_pools);
sizeof(*page_pools[i]->epp_pools));
}
-int sptlrpc_enc_pool_init(void)
+int sptlrpc_pool_init(void)
{
int pool_index = 0, to_revert;
int rc = 0;
- struct ptlrpc_enc_page_pool *pool;
+ struct ptlrpc_page_pool *pool;
ENTRY;
OBD_ALLOC(page_pools, POOLS_COUNT * sizeof(*page_pools));
spin_lock_init(&pool->epp_lock);
pool->epp_st_max_wait = ktime_set(0, 0);
- enc_pools_alloc(pool);
+ pools_alloc(pool);
CDEBUG(D_SEC, "Allocated pool %i\n", pool_index);
if (pool->epp_pools == NULL)
GOTO(fail, rc = -ENOMEM);
#ifdef HAVE_SHRINKER_COUNT
- pool->pool_shrinker.count_objects = enc_pools_shrink_count;
- pool->pool_shrinker.scan_objects = enc_pools_shrink_scan;
+ pool->pool_shrinker.count_objects = pools_shrink_count;
+ pool->pool_shrinker.scan_objects = pools_shrink_scan;
#else
- pool->pool_shrinker.shrink = enc_pools_shrink;
+ pool->pool_shrinker.shrink = pools_shrink;
#endif
pool->pool_shrinker.seeks = INDEX_TO_SEEKS(pool_index);
/* Pass pool number as part of pools_shrinker_seeks value */
if (pool) {
unregister_shrinker(&pool->pool_shrinker);
if (pool->epp_pools)
- enc_pools_free(pool_index);
+ pools_free(pool_index);
OBD_FREE(pool, sizeof(**page_pools));
}
}
RETURN(rc);
}
-void sptlrpc_enc_pool_fini(void)
+void sptlrpc_pool_fini(void)
{
unsigned long cleaned, npools;
int pool_index;
- struct ptlrpc_enc_page_pool *pool;
+ struct ptlrpc_page_pool *pool;
for (pool_index = 0; pool_index < POOLS_COUNT; pool_index++) {
pool = page_pools[pool_index];
LASSERT(pool->epp_total_pages == pool->epp_free_pages);
npools = npages_to_npools(pool->epp_total_pages);
- cleaned = enc_pools_cleanup(pool->epp_pools,
+ cleaned = pools_cleanup(pool->epp_pools,
npools, pool_index);
LASSERT(cleaned == pool->epp_total_pages);
- enc_pools_free(pool_index);
+ pools_free(pool_index);
if (pool->epp_st_access > 0) {
CDEBUG(D_SEC,