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, Whamcloud, Inc.
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>
45 #include <liblustre.h>
46 #include <libcfs/list.h>
48 #include <linux/crypto.h>
52 #include <obd_cksum.h>
53 #include <obd_class.h>
54 #include <obd_support.h>
55 #include <lustre_net.h>
56 #include <lustre_import.h>
57 #include <lustre_dlm.h>
58 #include <lustre_sec.h>
60 #include "ptlrpc_internal.h"
62 /****************************************
63 * bulk encryption page pools *
64 ****************************************/
68 #define PTRS_PER_PAGE (CFS_PAGE_SIZE / sizeof(void *))
69 #define PAGES_PER_POOL (PTRS_PER_PAGE)
71 #define IDLE_IDX_MAX (100)
72 #define IDLE_IDX_WEIGHT (3)
74 #define CACHE_QUIESCENT_PERIOD (20)
76 static struct ptlrpc_enc_page_pool {
80 unsigned long epp_max_pages; /* maximum pages can hold, const */
81 unsigned int epp_max_pools; /* number of pools, const */
84 * wait queue in case of not enough free pages.
86 cfs_waitq_t epp_waitq; /* waiting threads */
87 unsigned int epp_waitqlen; /* wait queue length */
88 unsigned long epp_pages_short; /* # of pages wanted of in-q users */
89 unsigned int epp_growing:1; /* during adding pages */
92 * indicating how idle the pools are, from 0 to MAX_IDLE_IDX
93 * this is counted based on each time when getting pages from
94 * the pools, not based on time. which means in case that system
95 * is idled for a while but the idle_idx might still be low if no
96 * activities happened in the pools.
98 unsigned long epp_idle_idx;
100 /* last shrink time due to mem tight */
101 long epp_last_shrink;
102 long epp_last_access;
105 * in-pool pages bookkeeping
107 spinlock_t epp_lock; /* protect following fields */
108 unsigned long epp_total_pages; /* total pages in pools */
109 unsigned long epp_free_pages; /* current pages available */
114 unsigned long epp_st_max_pages; /* # of pages ever reached */
115 unsigned int epp_st_grows; /* # of grows */
116 unsigned int epp_st_grow_fails; /* # of add pages failures */
117 unsigned int epp_st_shrinks; /* # of shrinks */
118 unsigned long epp_st_access; /* # of access */
119 unsigned long epp_st_missings; /* # of cache missing */
120 unsigned long epp_st_lowfree; /* lowest free pages reached */
121 unsigned int epp_st_max_wqlen; /* highest waitqueue length */
122 cfs_time_t epp_st_max_wait; /* in jeffies */
126 cfs_page_t ***epp_pools;
132 const int pools_shrinker_seeks = CFS_DEFAULT_SEEKS;
133 static struct cfs_shrinker *pools_shrinker = NULL;
137 * /proc/fs/lustre/sptlrpc/encrypt_page_pools
139 int sptlrpc_proc_read_enc_pool(char *page, char **start, off_t off, int count,
140 int *eof, void *data)
144 spin_lock(&page_pools.epp_lock);
146 rc = snprintf(page, count,
147 "physical pages: %lu\n"
148 "pages per pool: %lu\n"
153 "idle index: %lu/100\n"
154 "last shrink: %lds\n"
155 "last access: %lds\n"
156 "max pages reached: %lu\n"
158 "grows failure: %u\n"
160 "cache access: %lu\n"
161 "cache missing: %lu\n"
162 "low free mark: %lu\n"
163 "max waitqueue depth: %u\n"
164 "max wait time: "CFS_TIME_T"/%u\n"
168 page_pools.epp_max_pages,
169 page_pools.epp_max_pools,
170 page_pools.epp_total_pages,
171 page_pools.epp_free_pages,
172 page_pools.epp_idle_idx,
173 cfs_time_current_sec() - page_pools.epp_last_shrink,
174 cfs_time_current_sec() - page_pools.epp_last_access,
175 page_pools.epp_st_max_pages,
176 page_pools.epp_st_grows,
177 page_pools.epp_st_grow_fails,
178 page_pools.epp_st_shrinks,
179 page_pools.epp_st_access,
180 page_pools.epp_st_missings,
181 page_pools.epp_st_lowfree,
182 page_pools.epp_st_max_wqlen,
183 page_pools.epp_st_max_wait, CFS_HZ
186 spin_unlock(&page_pools.epp_lock);
190 static void enc_pools_release_free_pages(long npages)
193 int p_idx_max1, p_idx_max2;
196 LASSERT(npages <= page_pools.epp_free_pages);
197 LASSERT(page_pools.epp_free_pages <= page_pools.epp_total_pages);
199 /* max pool index before the release */
200 p_idx_max2 = (page_pools.epp_total_pages - 1) / PAGES_PER_POOL;
202 page_pools.epp_free_pages -= npages;
203 page_pools.epp_total_pages -= npages;
205 /* max pool index after the release */
206 p_idx_max1 = page_pools.epp_total_pages == 0 ? -1 :
207 ((page_pools.epp_total_pages - 1) / PAGES_PER_POOL);
209 p_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
210 g_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
211 LASSERT(page_pools.epp_pools[p_idx]);
214 LASSERT(page_pools.epp_pools[p_idx]);
215 LASSERT(page_pools.epp_pools[p_idx][g_idx] != NULL);
217 cfs_free_page(page_pools.epp_pools[p_idx][g_idx]);
218 page_pools.epp_pools[p_idx][g_idx] = NULL;
220 if (++g_idx == PAGES_PER_POOL) {
226 /* free unused pools */
227 while (p_idx_max1 < p_idx_max2) {
228 LASSERT(page_pools.epp_pools[p_idx_max2]);
229 OBD_FREE(page_pools.epp_pools[p_idx_max2], CFS_PAGE_SIZE);
230 page_pools.epp_pools[p_idx_max2] = NULL;
236 * could be called frequently for query (@nr_to_scan == 0).
237 * we try to keep at least PTLRPC_MAX_BRW_PAGES pages in the pool.
239 static int enc_pools_shrink(SHRINKER_ARGS(sc, nr_to_scan, gfp_mask))
241 if (unlikely(shrink_param(sc, nr_to_scan) != 0)) {
242 spin_lock(&page_pools.epp_lock);
243 shrink_param(sc, nr_to_scan) = min_t(unsigned long,
244 shrink_param(sc, nr_to_scan),
245 page_pools.epp_free_pages -
246 PTLRPC_MAX_BRW_PAGES);
247 if (shrink_param(sc, nr_to_scan) > 0) {
248 enc_pools_release_free_pages(shrink_param(sc,
250 CDEBUG(D_SEC, "released %ld pages, %ld left\n",
251 (long)shrink_param(sc, nr_to_scan),
252 page_pools.epp_free_pages);
254 page_pools.epp_st_shrinks++;
255 page_pools.epp_last_shrink = cfs_time_current_sec();
257 spin_unlock(&page_pools.epp_lock);
261 * if no pool access for a long time, we consider it's fully idle.
262 * a little race here is fine.
264 if (unlikely(cfs_time_current_sec() - page_pools.epp_last_access >
265 CACHE_QUIESCENT_PERIOD)) {
266 spin_lock(&page_pools.epp_lock);
267 page_pools.epp_idle_idx = IDLE_IDX_MAX;
268 spin_unlock(&page_pools.epp_lock);
271 LASSERT(page_pools.epp_idle_idx <= IDLE_IDX_MAX);
272 return max((int)page_pools.epp_free_pages - PTLRPC_MAX_BRW_PAGES, 0) *
273 (IDLE_IDX_MAX - page_pools.epp_idle_idx) / IDLE_IDX_MAX;
277 int npages_to_npools(unsigned long npages)
279 return (int) ((npages + PAGES_PER_POOL - 1) / PAGES_PER_POOL);
283 * return how many pages cleaned up.
285 static unsigned long enc_pools_cleanup(cfs_page_t ***pools, int npools)
287 unsigned long cleaned = 0;
290 for (i = 0; i < npools; i++) {
292 for (j = 0; j < PAGES_PER_POOL; j++) {
294 cfs_free_page(pools[i][j]);
298 OBD_FREE(pools[i], CFS_PAGE_SIZE);
307 * merge @npools pointed by @pools which contains @npages new pages
308 * into current pools.
310 * we have options to avoid most memory copy with some tricks. but we choose
311 * the simplest way to avoid complexity. It's not frequently called.
313 static void enc_pools_insert(cfs_page_t ***pools, int npools, int npages)
316 int op_idx, np_idx, og_idx, ng_idx;
317 int cur_npools, end_npools;
320 LASSERT(page_pools.epp_total_pages+npages <= page_pools.epp_max_pages);
321 LASSERT(npages_to_npools(npages) == npools);
322 LASSERT(page_pools.epp_growing);
324 spin_lock(&page_pools.epp_lock);
327 * (1) fill all the free slots of current pools.
329 /* free slots are those left by rent pages, and the extra ones with
330 * index >= total_pages, locate at the tail of last pool. */
331 freeslot = page_pools.epp_total_pages % PAGES_PER_POOL;
333 freeslot = PAGES_PER_POOL - freeslot;
334 freeslot += page_pools.epp_total_pages - page_pools.epp_free_pages;
336 op_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
337 og_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
339 ng_idx = (npages - 1) % PAGES_PER_POOL;
342 LASSERT(page_pools.epp_pools[op_idx][og_idx] == NULL);
343 LASSERT(pools[np_idx][ng_idx] != NULL);
345 page_pools.epp_pools[op_idx][og_idx] = pools[np_idx][ng_idx];
346 pools[np_idx][ng_idx] = NULL;
350 if (++og_idx == PAGES_PER_POOL) {
358 ng_idx = PAGES_PER_POOL - 1;
363 * (2) add pools if needed.
365 cur_npools = (page_pools.epp_total_pages + PAGES_PER_POOL - 1) /
367 end_npools = (page_pools.epp_total_pages + npages + PAGES_PER_POOL -1) /
369 LASSERT(end_npools <= page_pools.epp_max_pools);
372 while (cur_npools < end_npools) {
373 LASSERT(page_pools.epp_pools[cur_npools] == NULL);
374 LASSERT(np_idx < npools);
375 LASSERT(pools[np_idx] != NULL);
377 page_pools.epp_pools[cur_npools++] = pools[np_idx];
378 pools[np_idx++] = NULL;
381 page_pools.epp_total_pages += npages;
382 page_pools.epp_free_pages += npages;
383 page_pools.epp_st_lowfree = page_pools.epp_free_pages;
385 if (page_pools.epp_total_pages > page_pools.epp_st_max_pages)
386 page_pools.epp_st_max_pages = page_pools.epp_total_pages;
388 CDEBUG(D_SEC, "add %d pages to total %lu\n", npages,
389 page_pools.epp_total_pages);
391 spin_unlock(&page_pools.epp_lock);
394 static int enc_pools_add_pages(int npages)
396 static DEFINE_MUTEX(add_pages_mutex);
398 int npools, alloced = 0;
399 int i, j, rc = -ENOMEM;
401 if (npages < PTLRPC_MAX_BRW_PAGES)
402 npages = PTLRPC_MAX_BRW_PAGES;
404 mutex_lock(&add_pages_mutex);
406 if (npages + page_pools.epp_total_pages > page_pools.epp_max_pages)
407 npages = page_pools.epp_max_pages - page_pools.epp_total_pages;
410 page_pools.epp_st_grows++;
412 npools = npages_to_npools(npages);
413 OBD_ALLOC(pools, npools * sizeof(*pools));
417 for (i = 0; i < npools; i++) {
418 OBD_ALLOC(pools[i], CFS_PAGE_SIZE);
419 if (pools[i] == NULL)
422 for (j = 0; j < PAGES_PER_POOL && alloced < npages; j++) {
423 pools[i][j] = cfs_alloc_page(CFS_ALLOC_IO |
425 if (pools[i][j] == NULL)
431 LASSERT(alloced == npages);
433 enc_pools_insert(pools, npools, npages);
434 CDEBUG(D_SEC, "added %d pages into pools\n", npages);
438 enc_pools_cleanup(pools, npools);
439 OBD_FREE(pools, npools * sizeof(*pools));
442 page_pools.epp_st_grow_fails++;
443 CERROR("Failed to allocate %d enc pages\n", npages);
446 mutex_unlock(&add_pages_mutex);
450 static inline void enc_pools_wakeup(void)
452 LASSERT_SPIN_LOCKED(&page_pools.epp_lock);
453 LASSERT(page_pools.epp_waitqlen >= 0);
455 if (unlikely(page_pools.epp_waitqlen)) {
456 LASSERT(cfs_waitq_active(&page_pools.epp_waitq));
457 cfs_waitq_broadcast(&page_pools.epp_waitq);
461 static int enc_pools_should_grow(int page_needed, long now)
463 /* don't grow if someone else is growing the pools right now,
464 * or the pools has reached its full capacity
466 if (page_pools.epp_growing ||
467 page_pools.epp_total_pages == page_pools.epp_max_pages)
470 /* if total pages is not enough, we need to grow */
471 if (page_pools.epp_total_pages < page_needed)
475 * we wanted to return 0 here if there was a shrink just happened
476 * moment ago, but this may cause deadlock if both client and ost
477 * live on single node.
480 if (now - page_pools.epp_last_shrink < 2)
485 * here we perhaps need consider other factors like wait queue
486 * length, idle index, etc. ?
489 /* grow the pools in any other cases */
494 * we allocate the requested pages atomically.
496 int sptlrpc_enc_pool_get_pages(struct ptlrpc_bulk_desc *desc)
498 cfs_waitlink_t waitlink;
499 unsigned long this_idle = -1;
505 LASSERT(desc->bd_iov_count > 0);
506 LASSERT(desc->bd_iov_count <= page_pools.epp_max_pages);
508 /* resent bulk, enc iov might have been allocated previously */
509 if (desc->bd_enc_iov != NULL)
512 OBD_ALLOC(desc->bd_enc_iov,
513 desc->bd_iov_count * sizeof(*desc->bd_enc_iov));
514 if (desc->bd_enc_iov == NULL)
517 spin_lock(&page_pools.epp_lock);
519 page_pools.epp_st_access++;
521 if (unlikely(page_pools.epp_free_pages < desc->bd_iov_count)) {
523 tick = cfs_time_current();
525 now = cfs_time_current_sec();
527 page_pools.epp_st_missings++;
528 page_pools.epp_pages_short += desc->bd_iov_count;
530 if (enc_pools_should_grow(desc->bd_iov_count, now)) {
531 page_pools.epp_growing = 1;
533 spin_unlock(&page_pools.epp_lock);
534 enc_pools_add_pages(page_pools.epp_pages_short / 2);
535 spin_lock(&page_pools.epp_lock);
537 page_pools.epp_growing = 0;
541 if (++page_pools.epp_waitqlen >
542 page_pools.epp_st_max_wqlen)
543 page_pools.epp_st_max_wqlen =
544 page_pools.epp_waitqlen;
546 cfs_set_current_state(CFS_TASK_UNINT);
547 cfs_waitlink_init(&waitlink);
548 cfs_waitq_add(&page_pools.epp_waitq, &waitlink);
550 spin_unlock(&page_pools.epp_lock);
551 cfs_waitq_wait(&waitlink, CFS_TASK_UNINT);
552 cfs_waitq_del(&page_pools.epp_waitq, &waitlink);
553 LASSERT(page_pools.epp_waitqlen > 0);
554 spin_lock(&page_pools.epp_lock);
555 page_pools.epp_waitqlen--;
558 LASSERT(page_pools.epp_pages_short >= desc->bd_iov_count);
559 page_pools.epp_pages_short -= desc->bd_iov_count;
565 /* record max wait time */
566 if (unlikely(tick != 0)) {
567 tick = cfs_time_current() - tick;
568 if (tick > page_pools.epp_st_max_wait)
569 page_pools.epp_st_max_wait = tick;
572 /* proceed with rest of allocation */
573 page_pools.epp_free_pages -= desc->bd_iov_count;
575 p_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
576 g_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
578 for (i = 0; i < desc->bd_iov_count; i++) {
579 LASSERT(page_pools.epp_pools[p_idx][g_idx] != NULL);
580 desc->bd_enc_iov[i].kiov_page =
581 page_pools.epp_pools[p_idx][g_idx];
582 page_pools.epp_pools[p_idx][g_idx] = NULL;
584 if (++g_idx == PAGES_PER_POOL) {
590 if (page_pools.epp_free_pages < page_pools.epp_st_lowfree)
591 page_pools.epp_st_lowfree = page_pools.epp_free_pages;
594 * new idle index = (old * weight + new) / (weight + 1)
596 if (this_idle == -1) {
597 this_idle = page_pools.epp_free_pages * IDLE_IDX_MAX /
598 page_pools.epp_total_pages;
600 page_pools.epp_idle_idx = (page_pools.epp_idle_idx * IDLE_IDX_WEIGHT +
602 (IDLE_IDX_WEIGHT + 1);
604 page_pools.epp_last_access = cfs_time_current_sec();
606 spin_unlock(&page_pools.epp_lock);
609 EXPORT_SYMBOL(sptlrpc_enc_pool_get_pages);
611 void sptlrpc_enc_pool_put_pages(struct ptlrpc_bulk_desc *desc)
616 if (desc->bd_enc_iov == NULL)
619 LASSERT(desc->bd_iov_count > 0);
621 spin_lock(&page_pools.epp_lock);
623 p_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
624 g_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
626 LASSERT(page_pools.epp_free_pages + desc->bd_iov_count <=
627 page_pools.epp_total_pages);
628 LASSERT(page_pools.epp_pools[p_idx]);
630 for (i = 0; i < desc->bd_iov_count; i++) {
631 LASSERT(desc->bd_enc_iov[i].kiov_page != NULL);
632 LASSERT(g_idx != 0 || page_pools.epp_pools[p_idx]);
633 LASSERT(page_pools.epp_pools[p_idx][g_idx] == NULL);
635 page_pools.epp_pools[p_idx][g_idx] =
636 desc->bd_enc_iov[i].kiov_page;
638 if (++g_idx == PAGES_PER_POOL) {
644 page_pools.epp_free_pages += desc->bd_iov_count;
648 spin_unlock(&page_pools.epp_lock);
650 OBD_FREE(desc->bd_enc_iov,
651 desc->bd_iov_count * sizeof(*desc->bd_enc_iov));
652 desc->bd_enc_iov = NULL;
654 EXPORT_SYMBOL(sptlrpc_enc_pool_put_pages);
657 * we don't do much stuff for add_user/del_user anymore, except adding some
658 * initial pages in add_user() if current pools are empty, rest would be
659 * handled by the pools's self-adaption.
661 int sptlrpc_enc_pool_add_user(void)
665 spin_lock(&page_pools.epp_lock);
666 if (page_pools.epp_growing == 0 && page_pools.epp_total_pages == 0) {
667 page_pools.epp_growing = 1;
670 spin_unlock(&page_pools.epp_lock);
673 enc_pools_add_pages(PTLRPC_MAX_BRW_PAGES +
674 PTLRPC_MAX_BRW_PAGES);
676 spin_lock(&page_pools.epp_lock);
677 page_pools.epp_growing = 0;
679 spin_unlock(&page_pools.epp_lock);
683 EXPORT_SYMBOL(sptlrpc_enc_pool_add_user);
685 int sptlrpc_enc_pool_del_user(void)
689 EXPORT_SYMBOL(sptlrpc_enc_pool_del_user);
691 static inline void enc_pools_alloc(void)
693 LASSERT(page_pools.epp_max_pools);
694 OBD_ALLOC_LARGE(page_pools.epp_pools,
695 page_pools.epp_max_pools *
696 sizeof(*page_pools.epp_pools));
699 static inline void enc_pools_free(void)
701 LASSERT(page_pools.epp_max_pools);
702 LASSERT(page_pools.epp_pools);
704 OBD_FREE_LARGE(page_pools.epp_pools,
705 page_pools.epp_max_pools *
706 sizeof(*page_pools.epp_pools));
709 int sptlrpc_enc_pool_init(void)
712 * maximum capacity is 1/8 of total physical memory.
713 * is the 1/8 a good number?
715 page_pools.epp_max_pages = cfs_num_physpages / 8;
716 page_pools.epp_max_pools = npages_to_npools(page_pools.epp_max_pages);
718 cfs_waitq_init(&page_pools.epp_waitq);
719 page_pools.epp_waitqlen = 0;
720 page_pools.epp_pages_short = 0;
722 page_pools.epp_growing = 0;
724 page_pools.epp_idle_idx = 0;
725 page_pools.epp_last_shrink = cfs_time_current_sec();
726 page_pools.epp_last_access = cfs_time_current_sec();
728 spin_lock_init(&page_pools.epp_lock);
729 page_pools.epp_total_pages = 0;
730 page_pools.epp_free_pages = 0;
732 page_pools.epp_st_max_pages = 0;
733 page_pools.epp_st_grows = 0;
734 page_pools.epp_st_grow_fails = 0;
735 page_pools.epp_st_shrinks = 0;
736 page_pools.epp_st_access = 0;
737 page_pools.epp_st_missings = 0;
738 page_pools.epp_st_lowfree = 0;
739 page_pools.epp_st_max_wqlen = 0;
740 page_pools.epp_st_max_wait = 0;
743 if (page_pools.epp_pools == NULL)
746 pools_shrinker = cfs_set_shrinker(pools_shrinker_seeks,
748 if (pools_shrinker == NULL) {
756 void sptlrpc_enc_pool_fini(void)
758 unsigned long cleaned, npools;
760 LASSERT(pools_shrinker);
761 LASSERT(page_pools.epp_pools);
762 LASSERT(page_pools.epp_total_pages == page_pools.epp_free_pages);
764 cfs_remove_shrinker(pools_shrinker);
766 npools = npages_to_npools(page_pools.epp_total_pages);
767 cleaned = enc_pools_cleanup(page_pools.epp_pools, npools);
768 LASSERT(cleaned == page_pools.epp_total_pages);
772 if (page_pools.epp_st_access > 0) {
774 "max pages %lu, grows %u, grow fails %u, shrinks %u, "
775 "access %lu, missing %lu, max qlen %u, max wait "
777 page_pools.epp_st_max_pages, page_pools.epp_st_grows,
778 page_pools.epp_st_grow_fails,
779 page_pools.epp_st_shrinks, page_pools.epp_st_access,
780 page_pools.epp_st_missings, page_pools.epp_st_max_wqlen,
781 page_pools.epp_st_max_wait, CFS_HZ);
785 #else /* !__KERNEL__ */
787 int sptlrpc_enc_pool_get_pages(struct ptlrpc_bulk_desc *desc)
792 void sptlrpc_enc_pool_put_pages(struct ptlrpc_bulk_desc *desc)
796 int sptlrpc_enc_pool_init(void)
801 void sptlrpc_enc_pool_fini(void)
806 static int cfs_hash_alg_id[] = {
807 [BULK_HASH_ALG_NULL] = CFS_HASH_ALG_NULL,
808 [BULK_HASH_ALG_ADLER32] = CFS_HASH_ALG_ADLER32,
809 [BULK_HASH_ALG_CRC32] = CFS_HASH_ALG_CRC32,
810 [BULK_HASH_ALG_MD5] = CFS_HASH_ALG_MD5,
811 [BULK_HASH_ALG_SHA1] = CFS_HASH_ALG_SHA1,
812 [BULK_HASH_ALG_SHA256] = CFS_HASH_ALG_SHA256,
813 [BULK_HASH_ALG_SHA384] = CFS_HASH_ALG_SHA384,
814 [BULK_HASH_ALG_SHA512] = CFS_HASH_ALG_SHA512,
816 const char * sptlrpc_get_hash_name(__u8 hash_alg)
818 return cfs_crypto_hash_name(cfs_hash_alg_id[hash_alg]);
820 EXPORT_SYMBOL(sptlrpc_get_hash_name);
822 __u8 sptlrpc_get_hash_alg(const char *algname)
824 return cfs_crypto_hash_alg(algname);
826 EXPORT_SYMBOL(sptlrpc_get_hash_alg);
828 int bulk_sec_desc_unpack(struct lustre_msg *msg, int offset, int swabbed)
830 struct ptlrpc_bulk_sec_desc *bsd;
831 int size = msg->lm_buflens[offset];
833 bsd = lustre_msg_buf(msg, offset, sizeof(*bsd));
835 CERROR("Invalid bulk sec desc: size %d\n", size);
840 __swab32s(&bsd->bsd_nob);
843 if (unlikely(bsd->bsd_version != 0)) {
844 CERROR("Unexpected version %u\n", bsd->bsd_version);
848 if (unlikely(bsd->bsd_type >= SPTLRPC_BULK_MAX)) {
849 CERROR("Invalid type %u\n", bsd->bsd_type);
853 /* FIXME more sanity check here */
855 if (unlikely(bsd->bsd_svc != SPTLRPC_BULK_SVC_NULL &&
856 bsd->bsd_svc != SPTLRPC_BULK_SVC_INTG &&
857 bsd->bsd_svc != SPTLRPC_BULK_SVC_PRIV)) {
858 CERROR("Invalid svc %u\n", bsd->bsd_svc);
864 EXPORT_SYMBOL(bulk_sec_desc_unpack);
866 int sptlrpc_get_bulk_checksum(struct ptlrpc_bulk_desc *desc, __u8 alg,
867 void *buf, int buflen)
869 struct cfs_crypto_hash_desc *hdesc;
872 unsigned int bufsize;
875 LASSERT(alg > BULK_HASH_ALG_NULL && alg < BULK_HASH_ALG_MAX);
876 LASSERT(buflen >= 4);
878 hdesc = cfs_crypto_hash_init(cfs_hash_alg_id[alg], NULL, 0);
880 CERROR("Unable to initialize checksum hash %s\n",
881 cfs_crypto_hash_name(cfs_hash_alg_id[alg]));
882 return PTR_ERR(hdesc);
885 hashsize = cfs_crypto_hash_digestsize(cfs_hash_alg_id[alg]);
887 for (i = 0; i < desc->bd_iov_count; i++) {
889 cfs_crypto_hash_update_page(hdesc, desc->bd_iov[i].kiov_page,
890 desc->bd_iov[i].kiov_offset & ~CFS_PAGE_MASK,
891 desc->bd_iov[i].kiov_len);
893 cfs_crypto_hash_update(hdesc, desc->bd_iov[i].iov_base,
894 desc->bd_iov[i].iov_len);
897 if (hashsize > buflen) {
898 bufsize = sizeof(hashbuf);
899 err = cfs_crypto_hash_final(hdesc, (unsigned char *)hashbuf,
901 memcpy(buf, hashbuf, buflen);
904 err = cfs_crypto_hash_final(hdesc, (unsigned char *)buf,
909 cfs_crypto_hash_final(hdesc, NULL, NULL);
912 EXPORT_SYMBOL(sptlrpc_get_bulk_checksum);