4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2007, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2011, 2014, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * lustre/ptlrpc/sec_bulk.c
38 * Author: Eric Mei <ericm@clusterfs.com>
41 #define DEBUG_SUBSYSTEM S_SEC
43 #include <libcfs/libcfs.h>
46 #include <obd_cksum.h>
47 #include <obd_class.h>
48 #include <obd_support.h>
49 #include <lustre_net.h>
50 #include <lustre_import.h>
51 #include <lustre_dlm.h>
52 #include <lustre_sec.h>
54 #include "ptlrpc_internal.h"
56 /****************************************
57 * bulk encryption page pools *
58 ****************************************/
61 #define PTRS_PER_PAGE (PAGE_CACHE_SIZE / sizeof(void *))
62 #define PAGES_PER_POOL (PTRS_PER_PAGE)
64 #define IDLE_IDX_MAX (100)
65 #define IDLE_IDX_WEIGHT (3)
67 #define CACHE_QUIESCENT_PERIOD (20)
69 static struct ptlrpc_enc_page_pool {
73 unsigned long epp_max_pages; /* maximum pages can hold, const */
74 unsigned int epp_max_pools; /* number of pools, const */
77 * wait queue in case of not enough free pages.
79 wait_queue_head_t epp_waitq; /* waiting threads */
80 unsigned int epp_waitqlen; /* wait queue length */
81 unsigned long epp_pages_short; /* # of pages wanted of in-q users */
82 unsigned int epp_growing:1; /* during adding pages */
85 * indicating how idle the pools are, from 0 to MAX_IDLE_IDX
86 * this is counted based on each time when getting pages from
87 * the pools, not based on time. which means in case that system
88 * is idled for a while but the idle_idx might still be low if no
89 * activities happened in the pools.
91 unsigned long epp_idle_idx;
93 /* last shrink time due to mem tight */
98 * in-pool pages bookkeeping
100 spinlock_t epp_lock; /* protect following fields */
101 unsigned long epp_total_pages; /* total pages in pools */
102 unsigned long epp_free_pages; /* current pages available */
107 unsigned long epp_st_max_pages; /* # of pages ever reached */
108 unsigned int epp_st_grows; /* # of grows */
109 unsigned int epp_st_grow_fails; /* # of add pages failures */
110 unsigned int epp_st_shrinks; /* # of shrinks */
111 unsigned long epp_st_access; /* # of access */
112 unsigned long epp_st_missings; /* # of cache missing */
113 unsigned long epp_st_lowfree; /* lowest free pages reached */
114 unsigned int epp_st_max_wqlen; /* highest waitqueue length */
115 cfs_time_t epp_st_max_wait; /* in jeffies */
119 struct page ***epp_pools;
125 static const int pools_shrinker_seeks = DEFAULT_SEEKS;
126 static struct shrinker *pools_shrinker;
130 * /proc/fs/lustre/sptlrpc/encrypt_page_pools
132 int sptlrpc_proc_enc_pool_seq_show(struct seq_file *m, void *v)
136 spin_lock(&page_pools.epp_lock);
139 "physical pages: %lu\n"
140 "pages per pool: %lu\n"
145 "idle index: %lu/100\n"
146 "last shrink: %lds\n"
147 "last access: %lds\n"
148 "max pages reached: %lu\n"
150 "grows failure: %u\n"
152 "cache access: %lu\n"
153 "cache missing: %lu\n"
154 "low free mark: %lu\n"
155 "max waitqueue depth: %u\n"
156 "max wait time: "CFS_TIME_T"/%lu\n"
160 page_pools.epp_max_pages,
161 page_pools.epp_max_pools,
162 page_pools.epp_total_pages,
163 page_pools.epp_free_pages,
164 page_pools.epp_idle_idx,
165 cfs_time_current_sec() - page_pools.epp_last_shrink,
166 cfs_time_current_sec() - page_pools.epp_last_access,
167 page_pools.epp_st_max_pages,
168 page_pools.epp_st_grows,
169 page_pools.epp_st_grow_fails,
170 page_pools.epp_st_shrinks,
171 page_pools.epp_st_access,
172 page_pools.epp_st_missings,
173 page_pools.epp_st_lowfree,
174 page_pools.epp_st_max_wqlen,
175 page_pools.epp_st_max_wait,
176 msecs_to_jiffies(MSEC_PER_SEC)
179 spin_unlock(&page_pools.epp_lock);
183 static void enc_pools_release_free_pages(long npages)
186 int p_idx_max1, p_idx_max2;
189 LASSERT(npages <= page_pools.epp_free_pages);
190 LASSERT(page_pools.epp_free_pages <= page_pools.epp_total_pages);
192 /* max pool index before the release */
193 p_idx_max2 = (page_pools.epp_total_pages - 1) / PAGES_PER_POOL;
195 page_pools.epp_free_pages -= npages;
196 page_pools.epp_total_pages -= npages;
198 /* max pool index after the release */
199 p_idx_max1 = page_pools.epp_total_pages == 0 ? -1 :
200 ((page_pools.epp_total_pages - 1) / PAGES_PER_POOL);
202 p_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
203 g_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
204 LASSERT(page_pools.epp_pools[p_idx]);
207 LASSERT(page_pools.epp_pools[p_idx]);
208 LASSERT(page_pools.epp_pools[p_idx][g_idx] != NULL);
210 __free_page(page_pools.epp_pools[p_idx][g_idx]);
211 page_pools.epp_pools[p_idx][g_idx] = NULL;
213 if (++g_idx == PAGES_PER_POOL) {
219 /* free unused pools */
220 while (p_idx_max1 < p_idx_max2) {
221 LASSERT(page_pools.epp_pools[p_idx_max2]);
222 OBD_FREE(page_pools.epp_pools[p_idx_max2], PAGE_CACHE_SIZE);
223 page_pools.epp_pools[p_idx_max2] = NULL;
229 * we try to keep at least PTLRPC_MAX_BRW_PAGES pages in the pool.
231 static unsigned long enc_pools_shrink_count(struct shrinker *s,
232 struct shrink_control *sc)
235 * if no pool access for a long time, we consider it's fully idle.
236 * a little race here is fine.
238 if (unlikely(cfs_time_current_sec() - page_pools.epp_last_access >
239 CACHE_QUIESCENT_PERIOD)) {
240 spin_lock(&page_pools.epp_lock);
241 page_pools.epp_idle_idx = IDLE_IDX_MAX;
242 spin_unlock(&page_pools.epp_lock);
245 LASSERT(page_pools.epp_idle_idx <= IDLE_IDX_MAX);
246 return max((int)page_pools.epp_free_pages - PTLRPC_MAX_BRW_PAGES, 0) *
247 (IDLE_IDX_MAX - page_pools.epp_idle_idx) / IDLE_IDX_MAX;
251 * we try to keep at least PTLRPC_MAX_BRW_PAGES pages in the pool.
253 static unsigned long enc_pools_shrink_scan(struct shrinker *s,
254 struct shrink_control *sc)
256 spin_lock(&page_pools.epp_lock);
257 sc->nr_to_scan = min_t(unsigned long, sc->nr_to_scan,
258 page_pools.epp_free_pages - PTLRPC_MAX_BRW_PAGES);
259 if (sc->nr_to_scan > 0) {
260 enc_pools_release_free_pages(sc->nr_to_scan);
261 CDEBUG(D_SEC, "released %ld pages, %ld left\n",
262 (long)sc->nr_to_scan, page_pools.epp_free_pages);
264 page_pools.epp_st_shrinks++;
265 page_pools.epp_last_shrink = cfs_time_current_sec();
267 spin_unlock(&page_pools.epp_lock);
270 * if no pool access for a long time, we consider it's fully idle.
271 * a little race here is fine.
273 if (unlikely(cfs_time_current_sec() - page_pools.epp_last_access >
274 CACHE_QUIESCENT_PERIOD)) {
275 spin_lock(&page_pools.epp_lock);
276 page_pools.epp_idle_idx = IDLE_IDX_MAX;
277 spin_unlock(&page_pools.epp_lock);
280 LASSERT(page_pools.epp_idle_idx <= IDLE_IDX_MAX);
281 return sc->nr_to_scan;
284 #ifndef HAVE_SHRINKER_COUNT
286 * could be called frequently for query (@nr_to_scan == 0).
287 * we try to keep at least PTLRPC_MAX_BRW_PAGES pages in the pool.
289 static int enc_pools_shrink(SHRINKER_ARGS(sc, nr_to_scan, gfp_mask))
291 struct shrink_control scv = {
292 .nr_to_scan = shrink_param(sc, nr_to_scan),
293 .gfp_mask = shrink_param(sc, gfp_mask)
295 #if !defined(HAVE_SHRINKER_WANT_SHRINK_PTR) && !defined(HAVE_SHRINK_CONTROL)
296 struct shrinker* shrinker = NULL;
299 enc_pools_shrink_scan(shrinker, &scv);
301 return enc_pools_shrink_count(shrinker, &scv);
304 #endif /* HAVE_SHRINKER_COUNT */
307 int npages_to_npools(unsigned long npages)
309 return (int) ((npages + PAGES_PER_POOL - 1) / PAGES_PER_POOL);
313 * return how many pages cleaned up.
315 static unsigned long enc_pools_cleanup(struct page ***pools, int npools)
317 unsigned long cleaned = 0;
320 for (i = 0; i < npools; i++) {
322 for (j = 0; j < PAGES_PER_POOL; j++) {
324 __free_page(pools[i][j]);
328 OBD_FREE(pools[i], PAGE_CACHE_SIZE);
337 * merge @npools pointed by @pools which contains @npages new pages
338 * into current pools.
340 * we have options to avoid most memory copy with some tricks. but we choose
341 * the simplest way to avoid complexity. It's not frequently called.
343 static void enc_pools_insert(struct page ***pools, int npools, int npages)
346 int op_idx, np_idx, og_idx, ng_idx;
347 int cur_npools, end_npools;
350 LASSERT(page_pools.epp_total_pages+npages <= page_pools.epp_max_pages);
351 LASSERT(npages_to_npools(npages) == npools);
352 LASSERT(page_pools.epp_growing);
354 spin_lock(&page_pools.epp_lock);
357 * (1) fill all the free slots of current pools.
359 /* free slots are those left by rent pages, and the extra ones with
360 * index >= total_pages, locate at the tail of last pool. */
361 freeslot = page_pools.epp_total_pages % PAGES_PER_POOL;
363 freeslot = PAGES_PER_POOL - freeslot;
364 freeslot += page_pools.epp_total_pages - page_pools.epp_free_pages;
366 op_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
367 og_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
369 ng_idx = (npages - 1) % PAGES_PER_POOL;
372 LASSERT(page_pools.epp_pools[op_idx][og_idx] == NULL);
373 LASSERT(pools[np_idx][ng_idx] != NULL);
375 page_pools.epp_pools[op_idx][og_idx] = pools[np_idx][ng_idx];
376 pools[np_idx][ng_idx] = NULL;
380 if (++og_idx == PAGES_PER_POOL) {
388 ng_idx = PAGES_PER_POOL - 1;
393 * (2) add pools if needed.
395 cur_npools = (page_pools.epp_total_pages + PAGES_PER_POOL - 1) /
397 end_npools = (page_pools.epp_total_pages + npages + PAGES_PER_POOL -1) /
399 LASSERT(end_npools <= page_pools.epp_max_pools);
402 while (cur_npools < end_npools) {
403 LASSERT(page_pools.epp_pools[cur_npools] == NULL);
404 LASSERT(np_idx < npools);
405 LASSERT(pools[np_idx] != NULL);
407 page_pools.epp_pools[cur_npools++] = pools[np_idx];
408 pools[np_idx++] = NULL;
411 page_pools.epp_total_pages += npages;
412 page_pools.epp_free_pages += npages;
413 page_pools.epp_st_lowfree = page_pools.epp_free_pages;
415 if (page_pools.epp_total_pages > page_pools.epp_st_max_pages)
416 page_pools.epp_st_max_pages = page_pools.epp_total_pages;
418 CDEBUG(D_SEC, "add %d pages to total %lu\n", npages,
419 page_pools.epp_total_pages);
421 spin_unlock(&page_pools.epp_lock);
424 static int enc_pools_add_pages(int npages)
426 static DEFINE_MUTEX(add_pages_mutex);
427 struct page ***pools;
428 int npools, alloced = 0;
429 int i, j, rc = -ENOMEM;
431 if (npages < PTLRPC_MAX_BRW_PAGES)
432 npages = PTLRPC_MAX_BRW_PAGES;
434 mutex_lock(&add_pages_mutex);
436 if (npages + page_pools.epp_total_pages > page_pools.epp_max_pages)
437 npages = page_pools.epp_max_pages - page_pools.epp_total_pages;
440 page_pools.epp_st_grows++;
442 npools = npages_to_npools(npages);
443 OBD_ALLOC(pools, npools * sizeof(*pools));
447 for (i = 0; i < npools; i++) {
448 OBD_ALLOC(pools[i], PAGE_CACHE_SIZE);
449 if (pools[i] == NULL)
452 for (j = 0; j < PAGES_PER_POOL && alloced < npages; j++) {
453 pools[i][j] = alloc_page(GFP_NOFS |
455 if (pools[i][j] == NULL)
461 LASSERT(alloced == npages);
463 enc_pools_insert(pools, npools, npages);
464 CDEBUG(D_SEC, "added %d pages into pools\n", npages);
468 enc_pools_cleanup(pools, npools);
469 OBD_FREE(pools, npools * sizeof(*pools));
472 page_pools.epp_st_grow_fails++;
473 CERROR("Failed to allocate %d enc pages\n", npages);
476 mutex_unlock(&add_pages_mutex);
480 static inline void enc_pools_wakeup(void)
482 assert_spin_locked(&page_pools.epp_lock);
484 if (unlikely(page_pools.epp_waitqlen)) {
485 LASSERT(waitqueue_active(&page_pools.epp_waitq));
486 wake_up_all(&page_pools.epp_waitq);
490 static int enc_pools_should_grow(int page_needed, long now)
492 /* don't grow if someone else is growing the pools right now,
493 * or the pools has reached its full capacity
495 if (page_pools.epp_growing ||
496 page_pools.epp_total_pages == page_pools.epp_max_pages)
499 /* if total pages is not enough, we need to grow */
500 if (page_pools.epp_total_pages < page_needed)
504 * we wanted to return 0 here if there was a shrink just happened
505 * moment ago, but this may cause deadlock if both client and ost
506 * live on single node.
509 if (now - page_pools.epp_last_shrink < 2)
514 * here we perhaps need consider other factors like wait queue
515 * length, idle index, etc. ?
518 /* grow the pools in any other cases */
523 * we allocate the requested pages atomically.
525 int sptlrpc_enc_pool_get_pages(struct ptlrpc_bulk_desc *desc)
527 wait_queue_t waitlink;
528 unsigned long this_idle = -1;
534 LASSERT(desc->bd_iov_count > 0);
535 LASSERT(desc->bd_iov_count <= page_pools.epp_max_pages);
537 /* resent bulk, enc iov might have been allocated previously */
538 if (desc->bd_enc_iov != NULL)
541 OBD_ALLOC(desc->bd_enc_iov,
542 desc->bd_iov_count * sizeof(*desc->bd_enc_iov));
543 if (desc->bd_enc_iov == NULL)
546 spin_lock(&page_pools.epp_lock);
548 page_pools.epp_st_access++;
550 if (unlikely(page_pools.epp_free_pages < desc->bd_iov_count)) {
552 tick = cfs_time_current();
554 now = cfs_time_current_sec();
556 page_pools.epp_st_missings++;
557 page_pools.epp_pages_short += desc->bd_iov_count;
559 if (enc_pools_should_grow(desc->bd_iov_count, now)) {
560 page_pools.epp_growing = 1;
562 spin_unlock(&page_pools.epp_lock);
563 enc_pools_add_pages(page_pools.epp_pages_short / 2);
564 spin_lock(&page_pools.epp_lock);
566 page_pools.epp_growing = 0;
570 if (++page_pools.epp_waitqlen >
571 page_pools.epp_st_max_wqlen)
572 page_pools.epp_st_max_wqlen =
573 page_pools.epp_waitqlen;
575 set_current_state(TASK_UNINTERRUPTIBLE);
576 init_waitqueue_entry_current(&waitlink);
577 add_wait_queue(&page_pools.epp_waitq, &waitlink);
579 spin_unlock(&page_pools.epp_lock);
580 waitq_wait(&waitlink, TASK_UNINTERRUPTIBLE);
581 remove_wait_queue(&page_pools.epp_waitq, &waitlink);
582 LASSERT(page_pools.epp_waitqlen > 0);
583 spin_lock(&page_pools.epp_lock);
584 page_pools.epp_waitqlen--;
587 LASSERT(page_pools.epp_pages_short >= desc->bd_iov_count);
588 page_pools.epp_pages_short -= desc->bd_iov_count;
594 /* record max wait time */
595 if (unlikely(tick != 0)) {
596 tick = cfs_time_current() - tick;
597 if (tick > page_pools.epp_st_max_wait)
598 page_pools.epp_st_max_wait = tick;
601 /* proceed with rest of allocation */
602 page_pools.epp_free_pages -= desc->bd_iov_count;
604 p_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
605 g_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
607 for (i = 0; i < desc->bd_iov_count; i++) {
608 LASSERT(page_pools.epp_pools[p_idx][g_idx] != NULL);
609 desc->bd_enc_iov[i].kiov_page =
610 page_pools.epp_pools[p_idx][g_idx];
611 page_pools.epp_pools[p_idx][g_idx] = NULL;
613 if (++g_idx == PAGES_PER_POOL) {
619 if (page_pools.epp_free_pages < page_pools.epp_st_lowfree)
620 page_pools.epp_st_lowfree = page_pools.epp_free_pages;
623 * new idle index = (old * weight + new) / (weight + 1)
625 if (this_idle == -1) {
626 this_idle = page_pools.epp_free_pages * IDLE_IDX_MAX /
627 page_pools.epp_total_pages;
629 page_pools.epp_idle_idx = (page_pools.epp_idle_idx * IDLE_IDX_WEIGHT +
631 (IDLE_IDX_WEIGHT + 1);
633 page_pools.epp_last_access = cfs_time_current_sec();
635 spin_unlock(&page_pools.epp_lock);
638 EXPORT_SYMBOL(sptlrpc_enc_pool_get_pages);
640 void sptlrpc_enc_pool_put_pages(struct ptlrpc_bulk_desc *desc)
645 if (desc->bd_enc_iov == NULL)
648 LASSERT(desc->bd_iov_count > 0);
650 spin_lock(&page_pools.epp_lock);
652 p_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
653 g_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
655 LASSERT(page_pools.epp_free_pages + desc->bd_iov_count <=
656 page_pools.epp_total_pages);
657 LASSERT(page_pools.epp_pools[p_idx]);
659 for (i = 0; i < desc->bd_iov_count; i++) {
660 LASSERT(desc->bd_enc_iov[i].kiov_page != NULL);
661 LASSERT(g_idx != 0 || page_pools.epp_pools[p_idx]);
662 LASSERT(page_pools.epp_pools[p_idx][g_idx] == NULL);
664 page_pools.epp_pools[p_idx][g_idx] =
665 desc->bd_enc_iov[i].kiov_page;
667 if (++g_idx == PAGES_PER_POOL) {
673 page_pools.epp_free_pages += desc->bd_iov_count;
677 spin_unlock(&page_pools.epp_lock);
679 OBD_FREE(desc->bd_enc_iov,
680 desc->bd_iov_count * sizeof(*desc->bd_enc_iov));
681 desc->bd_enc_iov = NULL;
685 * we don't do much stuff for add_user/del_user anymore, except adding some
686 * initial pages in add_user() if current pools are empty, rest would be
687 * handled by the pools's self-adaption.
689 int sptlrpc_enc_pool_add_user(void)
693 spin_lock(&page_pools.epp_lock);
694 if (page_pools.epp_growing == 0 && page_pools.epp_total_pages == 0) {
695 page_pools.epp_growing = 1;
698 spin_unlock(&page_pools.epp_lock);
701 enc_pools_add_pages(PTLRPC_MAX_BRW_PAGES +
702 PTLRPC_MAX_BRW_PAGES);
704 spin_lock(&page_pools.epp_lock);
705 page_pools.epp_growing = 0;
707 spin_unlock(&page_pools.epp_lock);
711 EXPORT_SYMBOL(sptlrpc_enc_pool_add_user);
713 int sptlrpc_enc_pool_del_user(void)
717 EXPORT_SYMBOL(sptlrpc_enc_pool_del_user);
719 static inline void enc_pools_alloc(void)
721 LASSERT(page_pools.epp_max_pools);
722 OBD_ALLOC_LARGE(page_pools.epp_pools,
723 page_pools.epp_max_pools *
724 sizeof(*page_pools.epp_pools));
727 static inline void enc_pools_free(void)
729 LASSERT(page_pools.epp_max_pools);
730 LASSERT(page_pools.epp_pools);
732 OBD_FREE_LARGE(page_pools.epp_pools,
733 page_pools.epp_max_pools *
734 sizeof(*page_pools.epp_pools));
737 int sptlrpc_enc_pool_init(void)
739 DEF_SHRINKER_VAR(shvar, enc_pools_shrink,
740 enc_pools_shrink_count, enc_pools_shrink_scan);
742 * maximum capacity is 1/8 of total physical memory.
743 * is the 1/8 a good number?
745 page_pools.epp_max_pages = totalram_pages / 8;
746 page_pools.epp_max_pools = npages_to_npools(page_pools.epp_max_pages);
748 init_waitqueue_head(&page_pools.epp_waitq);
749 page_pools.epp_waitqlen = 0;
750 page_pools.epp_pages_short = 0;
752 page_pools.epp_growing = 0;
754 page_pools.epp_idle_idx = 0;
755 page_pools.epp_last_shrink = cfs_time_current_sec();
756 page_pools.epp_last_access = cfs_time_current_sec();
758 spin_lock_init(&page_pools.epp_lock);
759 page_pools.epp_total_pages = 0;
760 page_pools.epp_free_pages = 0;
762 page_pools.epp_st_max_pages = 0;
763 page_pools.epp_st_grows = 0;
764 page_pools.epp_st_grow_fails = 0;
765 page_pools.epp_st_shrinks = 0;
766 page_pools.epp_st_access = 0;
767 page_pools.epp_st_missings = 0;
768 page_pools.epp_st_lowfree = 0;
769 page_pools.epp_st_max_wqlen = 0;
770 page_pools.epp_st_max_wait = 0;
773 if (page_pools.epp_pools == NULL)
776 pools_shrinker = set_shrinker(pools_shrinker_seeks, &shvar);
777 if (pools_shrinker == NULL) {
785 void sptlrpc_enc_pool_fini(void)
787 unsigned long cleaned, npools;
789 LASSERT(pools_shrinker);
790 LASSERT(page_pools.epp_pools);
791 LASSERT(page_pools.epp_total_pages == page_pools.epp_free_pages);
793 remove_shrinker(pools_shrinker);
795 npools = npages_to_npools(page_pools.epp_total_pages);
796 cleaned = enc_pools_cleanup(page_pools.epp_pools, npools);
797 LASSERT(cleaned == page_pools.epp_total_pages);
801 if (page_pools.epp_st_access > 0) {
803 "max pages %lu, grows %u, grow fails %u, shrinks %u, "
804 "access %lu, missing %lu, max qlen %u, max wait "
806 page_pools.epp_st_max_pages, page_pools.epp_st_grows,
807 page_pools.epp_st_grow_fails,
808 page_pools.epp_st_shrinks, page_pools.epp_st_access,
809 page_pools.epp_st_missings, page_pools.epp_st_max_wqlen,
810 page_pools.epp_st_max_wait,
811 msecs_to_jiffies(MSEC_PER_SEC));
816 static int cfs_hash_alg_id[] = {
817 [BULK_HASH_ALG_NULL] = CFS_HASH_ALG_NULL,
818 [BULK_HASH_ALG_ADLER32] = CFS_HASH_ALG_ADLER32,
819 [BULK_HASH_ALG_CRC32] = CFS_HASH_ALG_CRC32,
820 [BULK_HASH_ALG_MD5] = CFS_HASH_ALG_MD5,
821 [BULK_HASH_ALG_SHA1] = CFS_HASH_ALG_SHA1,
822 [BULK_HASH_ALG_SHA256] = CFS_HASH_ALG_SHA256,
823 [BULK_HASH_ALG_SHA384] = CFS_HASH_ALG_SHA384,
824 [BULK_HASH_ALG_SHA512] = CFS_HASH_ALG_SHA512,
826 const char * sptlrpc_get_hash_name(__u8 hash_alg)
828 return cfs_crypto_hash_name(cfs_hash_alg_id[hash_alg]);
831 __u8 sptlrpc_get_hash_alg(const char *algname)
833 return cfs_crypto_hash_alg(algname);
836 int bulk_sec_desc_unpack(struct lustre_msg *msg, int offset, int swabbed)
838 struct ptlrpc_bulk_sec_desc *bsd;
839 int size = msg->lm_buflens[offset];
841 bsd = lustre_msg_buf(msg, offset, sizeof(*bsd));
843 CERROR("Invalid bulk sec desc: size %d\n", size);
848 __swab32s(&bsd->bsd_nob);
851 if (unlikely(bsd->bsd_version != 0)) {
852 CERROR("Unexpected version %u\n", bsd->bsd_version);
856 if (unlikely(bsd->bsd_type >= SPTLRPC_BULK_MAX)) {
857 CERROR("Invalid type %u\n", bsd->bsd_type);
861 /* FIXME more sanity check here */
863 if (unlikely(bsd->bsd_svc != SPTLRPC_BULK_SVC_NULL &&
864 bsd->bsd_svc != SPTLRPC_BULK_SVC_INTG &&
865 bsd->bsd_svc != SPTLRPC_BULK_SVC_PRIV)) {
866 CERROR("Invalid svc %u\n", bsd->bsd_svc);
872 EXPORT_SYMBOL(bulk_sec_desc_unpack);
875 * Compute the checksum of an RPC buffer payload. If the return \a buflen
876 * is not large enough, truncate the result to fit so that it is possible
877 * to use a hash function with a large hash space, but only use a part of
878 * the resulting hash.
880 int sptlrpc_get_bulk_checksum(struct ptlrpc_bulk_desc *desc, __u8 alg,
881 void *buf, int buflen)
883 struct cfs_crypto_hash_desc *hdesc;
885 unsigned int bufsize;
888 LASSERT(alg > BULK_HASH_ALG_NULL && alg < BULK_HASH_ALG_MAX);
889 LASSERT(buflen >= 4);
891 hdesc = cfs_crypto_hash_init(cfs_hash_alg_id[alg], NULL, 0);
893 CERROR("Unable to initialize checksum hash %s\n",
894 cfs_crypto_hash_name(cfs_hash_alg_id[alg]));
895 return PTR_ERR(hdesc);
898 hashsize = cfs_crypto_hash_digestsize(cfs_hash_alg_id[alg]);
900 for (i = 0; i < desc->bd_iov_count; i++) {
901 cfs_crypto_hash_update_page(hdesc, desc->bd_iov[i].kiov_page,
902 desc->bd_iov[i].kiov_offset & ~CFS_PAGE_MASK,
903 desc->bd_iov[i].kiov_len);
906 if (hashsize > buflen) {
907 unsigned char hashbuf[CFS_CRYPTO_HASH_DIGESTSIZE_MAX];
909 bufsize = sizeof(hashbuf);
910 LASSERTF(bufsize >= hashsize, "bufsize = %u < hashsize %u\n",
912 err = cfs_crypto_hash_final(hdesc, hashbuf, &bufsize);
913 memcpy(buf, hashbuf, buflen);
916 err = cfs_crypto_hash_final(hdesc, buf, &bufsize);