1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
6 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 only,
10 * as published by the Free Software Foundation.
12 * This program is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License version 2 for more details (a copy is included
16 * in the LICENSE file that accompanied this code).
18 * You should have received a copy of the GNU General Public License
19 * version 2 along with this program; If not, see
20 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
22 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
23 * CA 95054 USA or visit www.sun.com if you need additional information or
29 * Copyright (c) 2007, 2010, Oracle and/or its affiliates. All rights reserved.
30 * Use is subject to license terms.
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>
44 #define DEBUG_SUBSYSTEM S_SEC
46 #include <libcfs/libcfs.h>
48 #include <liblustre.h>
49 #include <libcfs/list.h>
51 #include <linux/crypto.h>
55 #include <obd_cksum.h>
56 #include <obd_class.h>
57 #include <obd_support.h>
58 #include <lustre_net.h>
59 #include <lustre_import.h>
60 #include <lustre_dlm.h>
61 #include <lustre_sec.h>
63 #include "ptlrpc_internal.h"
65 /****************************************
66 * bulk encryption page pools *
67 ****************************************/
71 #define PTRS_PER_PAGE (CFS_PAGE_SIZE / sizeof(void *))
72 #define PAGES_PER_POOL (PTRS_PER_PAGE)
74 #define IDLE_IDX_MAX (100)
75 #define IDLE_IDX_WEIGHT (3)
77 #define CACHE_QUIESCENT_PERIOD (20)
79 static struct ptlrpc_enc_page_pool {
83 unsigned long epp_max_pages; /* maximum pages can hold, const */
84 unsigned int epp_max_pools; /* number of pools, const */
87 * wait queue in case of not enough free pages.
89 cfs_waitq_t epp_waitq; /* waiting threads */
90 unsigned int epp_waitqlen; /* wait queue length */
91 unsigned long epp_pages_short; /* # of pages wanted of in-q users */
92 unsigned int epp_growing:1; /* during adding pages */
95 * indicating how idle the pools are, from 0 to MAX_IDLE_IDX
96 * this is counted based on each time when getting pages from
97 * the pools, not based on time. which means in case that system
98 * is idled for a while but the idle_idx might still be low if no
99 * activities happened in the pools.
101 unsigned long epp_idle_idx;
103 /* last shrink time due to mem tight */
104 long epp_last_shrink;
105 long epp_last_access;
108 * in-pool pages bookkeeping
110 cfs_spinlock_t epp_lock; /* protect following fields */
111 unsigned long epp_total_pages; /* total pages in pools */
112 unsigned long epp_free_pages; /* current pages available */
117 unsigned long epp_st_max_pages; /* # of pages ever reached */
118 unsigned int epp_st_grows; /* # of grows */
119 unsigned int epp_st_grow_fails; /* # of add pages failures */
120 unsigned int epp_st_shrinks; /* # of shrinks */
121 unsigned long epp_st_access; /* # of access */
122 unsigned long epp_st_missings; /* # of cache missing */
123 unsigned long epp_st_lowfree; /* lowest free pages reached */
124 unsigned int epp_st_max_wqlen; /* highest waitqueue length */
125 cfs_time_t epp_st_max_wait; /* in jeffies */
129 cfs_page_t ***epp_pools;
135 const int pools_shrinker_seeks = CFS_DEFAULT_SEEKS;
136 static struct cfs_shrinker *pools_shrinker = NULL;
140 * /proc/fs/lustre/sptlrpc/encrypt_page_pools
142 int sptlrpc_proc_read_enc_pool(char *page, char **start, off_t off, int count,
143 int *eof, void *data)
147 cfs_spin_lock(&page_pools.epp_lock);
149 rc = snprintf(page, count,
150 "physical pages: %lu\n"
151 "pages per pool: %lu\n"
156 "idle index: %lu/100\n"
157 "last shrink: %lds\n"
158 "last access: %lds\n"
159 "max pages reached: %lu\n"
161 "grows failure: %u\n"
163 "cache access: %lu\n"
164 "cache missing: %lu\n"
165 "low free mark: %lu\n"
166 "max waitqueue depth: %u\n"
167 "max wait time: "CFS_TIME_T"/%u\n"
171 page_pools.epp_max_pages,
172 page_pools.epp_max_pools,
173 page_pools.epp_total_pages,
174 page_pools.epp_free_pages,
175 page_pools.epp_idle_idx,
176 cfs_time_current_sec() - page_pools.epp_last_shrink,
177 cfs_time_current_sec() - page_pools.epp_last_access,
178 page_pools.epp_st_max_pages,
179 page_pools.epp_st_grows,
180 page_pools.epp_st_grow_fails,
181 page_pools.epp_st_shrinks,
182 page_pools.epp_st_access,
183 page_pools.epp_st_missings,
184 page_pools.epp_st_lowfree,
185 page_pools.epp_st_max_wqlen,
186 page_pools.epp_st_max_wait, CFS_HZ
189 cfs_spin_unlock(&page_pools.epp_lock);
193 static void enc_pools_release_free_pages(long npages)
196 int p_idx_max1, p_idx_max2;
199 LASSERT(npages <= page_pools.epp_free_pages);
200 LASSERT(page_pools.epp_free_pages <= page_pools.epp_total_pages);
202 /* max pool index before the release */
203 p_idx_max2 = (page_pools.epp_total_pages - 1) / PAGES_PER_POOL;
205 page_pools.epp_free_pages -= npages;
206 page_pools.epp_total_pages -= npages;
208 /* max pool index after the release */
209 p_idx_max1 = page_pools.epp_total_pages == 0 ? -1 :
210 ((page_pools.epp_total_pages - 1) / PAGES_PER_POOL);
212 p_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
213 g_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
214 LASSERT(page_pools.epp_pools[p_idx]);
217 LASSERT(page_pools.epp_pools[p_idx]);
218 LASSERT(page_pools.epp_pools[p_idx][g_idx] != NULL);
220 cfs_free_page(page_pools.epp_pools[p_idx][g_idx]);
221 page_pools.epp_pools[p_idx][g_idx] = NULL;
223 if (++g_idx == PAGES_PER_POOL) {
229 /* free unused pools */
230 while (p_idx_max1 < p_idx_max2) {
231 LASSERT(page_pools.epp_pools[p_idx_max2]);
232 OBD_FREE(page_pools.epp_pools[p_idx_max2], CFS_PAGE_SIZE);
233 page_pools.epp_pools[p_idx_max2] = NULL;
239 * could be called frequently for query (@nr_to_scan == 0).
240 * we try to keep at least PTLRPC_MAX_BRW_PAGES pages in the pool.
242 static int enc_pools_shrink(int nr_to_scan, unsigned int gfp_mask)
244 if (unlikely(nr_to_scan != 0)) {
245 cfs_spin_lock(&page_pools.epp_lock);
246 nr_to_scan = min(nr_to_scan, (int) page_pools.epp_free_pages -
247 PTLRPC_MAX_BRW_PAGES);
248 if (nr_to_scan > 0) {
249 enc_pools_release_free_pages(nr_to_scan);
250 CDEBUG(D_SEC, "released %d pages, %ld left\n",
251 nr_to_scan, page_pools.epp_free_pages);
253 page_pools.epp_st_shrinks++;
254 page_pools.epp_last_shrink = cfs_time_current_sec();
256 cfs_spin_unlock(&page_pools.epp_lock);
260 * if no pool access for a long time, we consider it's fully idle.
261 * a little race here is fine.
263 if (unlikely(cfs_time_current_sec() - page_pools.epp_last_access >
264 CACHE_QUIESCENT_PERIOD)) {
265 cfs_spin_lock(&page_pools.epp_lock);
266 page_pools.epp_idle_idx = IDLE_IDX_MAX;
267 cfs_spin_unlock(&page_pools.epp_lock);
270 LASSERT(page_pools.epp_idle_idx <= IDLE_IDX_MAX);
271 return max((int) page_pools.epp_free_pages - PTLRPC_MAX_BRW_PAGES, 0) *
272 (IDLE_IDX_MAX - page_pools.epp_idle_idx) / IDLE_IDX_MAX;
276 int npages_to_npools(unsigned long npages)
278 return (int) ((npages + PAGES_PER_POOL - 1) / PAGES_PER_POOL);
282 * return how many pages cleaned up.
284 static unsigned long enc_pools_cleanup(cfs_page_t ***pools, int npools)
286 unsigned long cleaned = 0;
289 for (i = 0; i < npools; i++) {
291 for (j = 0; j < PAGES_PER_POOL; j++) {
293 cfs_free_page(pools[i][j]);
297 OBD_FREE(pools[i], CFS_PAGE_SIZE);
306 * merge @npools pointed by @pools which contains @npages new pages
307 * into current pools.
309 * we have options to avoid most memory copy with some tricks. but we choose
310 * the simplest way to avoid complexity. It's not frequently called.
312 static void enc_pools_insert(cfs_page_t ***pools, int npools, int npages)
315 int op_idx, np_idx, og_idx, ng_idx;
316 int cur_npools, end_npools;
319 LASSERT(page_pools.epp_total_pages+npages <= page_pools.epp_max_pages);
320 LASSERT(npages_to_npools(npages) == npools);
321 LASSERT(page_pools.epp_growing);
323 cfs_spin_lock(&page_pools.epp_lock);
326 * (1) fill all the free slots of current pools.
328 /* free slots are those left by rent pages, and the extra ones with
329 * index >= total_pages, locate at the tail of last pool. */
330 freeslot = page_pools.epp_total_pages % PAGES_PER_POOL;
332 freeslot = PAGES_PER_POOL - freeslot;
333 freeslot += page_pools.epp_total_pages - page_pools.epp_free_pages;
335 op_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
336 og_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
338 ng_idx = (npages - 1) % PAGES_PER_POOL;
341 LASSERT(page_pools.epp_pools[op_idx][og_idx] == NULL);
342 LASSERT(pools[np_idx][ng_idx] != NULL);
344 page_pools.epp_pools[op_idx][og_idx] = pools[np_idx][ng_idx];
345 pools[np_idx][ng_idx] = NULL;
349 if (++og_idx == PAGES_PER_POOL) {
357 ng_idx = PAGES_PER_POOL - 1;
362 * (2) add pools if needed.
364 cur_npools = (page_pools.epp_total_pages + PAGES_PER_POOL - 1) /
366 end_npools = (page_pools.epp_total_pages + npages + PAGES_PER_POOL -1) /
368 LASSERT(end_npools <= page_pools.epp_max_pools);
371 while (cur_npools < end_npools) {
372 LASSERT(page_pools.epp_pools[cur_npools] == NULL);
373 LASSERT(np_idx < npools);
374 LASSERT(pools[np_idx] != NULL);
376 page_pools.epp_pools[cur_npools++] = pools[np_idx];
377 pools[np_idx++] = NULL;
380 page_pools.epp_total_pages += npages;
381 page_pools.epp_free_pages += npages;
382 page_pools.epp_st_lowfree = page_pools.epp_free_pages;
384 if (page_pools.epp_total_pages > page_pools.epp_st_max_pages)
385 page_pools.epp_st_max_pages = page_pools.epp_total_pages;
387 CDEBUG(D_SEC, "add %d pages to total %lu\n", npages,
388 page_pools.epp_total_pages);
390 cfs_spin_unlock(&page_pools.epp_lock);
393 static int enc_pools_add_pages(int npages)
395 static CFS_DECLARE_MUTEX(sem_add_pages);
397 int npools, alloced = 0;
398 int i, j, rc = -ENOMEM;
400 if (npages < PTLRPC_MAX_BRW_PAGES)
401 npages = PTLRPC_MAX_BRW_PAGES;
403 cfs_down(&sem_add_pages);
405 if (npages + page_pools.epp_total_pages > page_pools.epp_max_pages)
406 npages = page_pools.epp_max_pages - page_pools.epp_total_pages;
409 page_pools.epp_st_grows++;
411 npools = npages_to_npools(npages);
412 OBD_ALLOC(pools, npools * sizeof(*pools));
416 for (i = 0; i < npools; i++) {
417 OBD_ALLOC(pools[i], CFS_PAGE_SIZE);
418 if (pools[i] == NULL)
421 for (j = 0; j < PAGES_PER_POOL && alloced < npages; j++) {
422 pools[i][j] = cfs_alloc_page(CFS_ALLOC_IO |
424 if (pools[i][j] == NULL)
430 LASSERT(alloced == npages);
432 enc_pools_insert(pools, npools, npages);
433 CDEBUG(D_SEC, "added %d pages into pools\n", npages);
437 enc_pools_cleanup(pools, npools);
438 OBD_FREE(pools, npools * sizeof(*pools));
441 page_pools.epp_st_grow_fails++;
442 CERROR("Failed to allocate %d enc pages\n", npages);
445 cfs_up(&sem_add_pages);
449 static inline void enc_pools_wakeup(void)
451 LASSERT_SPIN_LOCKED(&page_pools.epp_lock);
452 LASSERT(page_pools.epp_waitqlen >= 0);
454 if (unlikely(page_pools.epp_waitqlen)) {
455 LASSERT(cfs_waitq_active(&page_pools.epp_waitq));
456 cfs_waitq_broadcast(&page_pools.epp_waitq);
460 static int enc_pools_should_grow(int page_needed, long now)
462 /* don't grow if someone else is growing the pools right now,
463 * or the pools has reached its full capacity
465 if (page_pools.epp_growing ||
466 page_pools.epp_total_pages == page_pools.epp_max_pages)
469 /* if total pages is not enough, we need to grow */
470 if (page_pools.epp_total_pages < page_needed)
474 * we wanted to return 0 here if there was a shrink just happened
475 * moment ago, but this may cause deadlock if both client and ost
476 * live on single node.
479 if (now - page_pools.epp_last_shrink < 2)
484 * here we perhaps need consider other factors like wait queue
485 * length, idle index, etc. ?
488 /* grow the pools in any other cases */
493 * we allocate the requested pages atomically.
495 int sptlrpc_enc_pool_get_pages(struct ptlrpc_bulk_desc *desc)
497 cfs_waitlink_t waitlink;
498 unsigned long this_idle = -1;
504 LASSERT(desc->bd_iov_count > 0);
505 LASSERT(desc->bd_iov_count <= page_pools.epp_max_pages);
507 /* resent bulk, enc iov might have been allocated previously */
508 if (desc->bd_enc_iov != NULL)
511 OBD_ALLOC(desc->bd_enc_iov,
512 desc->bd_iov_count * sizeof(*desc->bd_enc_iov));
513 if (desc->bd_enc_iov == NULL)
516 cfs_spin_lock(&page_pools.epp_lock);
518 page_pools.epp_st_access++;
520 if (unlikely(page_pools.epp_free_pages < desc->bd_iov_count)) {
522 tick = cfs_time_current();
524 now = cfs_time_current_sec();
526 page_pools.epp_st_missings++;
527 page_pools.epp_pages_short += desc->bd_iov_count;
529 if (enc_pools_should_grow(desc->bd_iov_count, now)) {
530 page_pools.epp_growing = 1;
532 cfs_spin_unlock(&page_pools.epp_lock);
533 enc_pools_add_pages(page_pools.epp_pages_short / 2);
534 cfs_spin_lock(&page_pools.epp_lock);
536 page_pools.epp_growing = 0;
540 if (++page_pools.epp_waitqlen >
541 page_pools.epp_st_max_wqlen)
542 page_pools.epp_st_max_wqlen =
543 page_pools.epp_waitqlen;
545 cfs_set_current_state(CFS_TASK_UNINT);
546 cfs_waitlink_init(&waitlink);
547 cfs_waitq_add(&page_pools.epp_waitq, &waitlink);
549 cfs_spin_unlock(&page_pools.epp_lock);
550 cfs_waitq_wait(&waitlink, CFS_TASK_UNINT);
551 cfs_waitq_del(&page_pools.epp_waitq, &waitlink);
552 LASSERT(page_pools.epp_waitqlen > 0);
553 cfs_spin_lock(&page_pools.epp_lock);
554 page_pools.epp_waitqlen--;
557 LASSERT(page_pools.epp_pages_short >= desc->bd_iov_count);
558 page_pools.epp_pages_short -= desc->bd_iov_count;
564 /* record max wait time */
565 if (unlikely(tick != 0)) {
566 tick = cfs_time_current() - tick;
567 if (tick > page_pools.epp_st_max_wait)
568 page_pools.epp_st_max_wait = tick;
571 /* proceed with rest of allocation */
572 page_pools.epp_free_pages -= desc->bd_iov_count;
574 p_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
575 g_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
577 for (i = 0; i < desc->bd_iov_count; i++) {
578 LASSERT(page_pools.epp_pools[p_idx][g_idx] != NULL);
579 desc->bd_enc_iov[i].kiov_page =
580 page_pools.epp_pools[p_idx][g_idx];
581 page_pools.epp_pools[p_idx][g_idx] = NULL;
583 if (++g_idx == PAGES_PER_POOL) {
589 if (page_pools.epp_free_pages < page_pools.epp_st_lowfree)
590 page_pools.epp_st_lowfree = page_pools.epp_free_pages;
593 * new idle index = (old * weight + new) / (weight + 1)
595 if (this_idle == -1) {
596 this_idle = page_pools.epp_free_pages * IDLE_IDX_MAX /
597 page_pools.epp_total_pages;
599 page_pools.epp_idle_idx = (page_pools.epp_idle_idx * IDLE_IDX_WEIGHT +
601 (IDLE_IDX_WEIGHT + 1);
603 page_pools.epp_last_access = cfs_time_current_sec();
605 cfs_spin_unlock(&page_pools.epp_lock);
608 EXPORT_SYMBOL(sptlrpc_enc_pool_get_pages);
610 void sptlrpc_enc_pool_put_pages(struct ptlrpc_bulk_desc *desc)
615 if (desc->bd_enc_iov == NULL)
618 LASSERT(desc->bd_iov_count > 0);
620 cfs_spin_lock(&page_pools.epp_lock);
622 p_idx = page_pools.epp_free_pages / PAGES_PER_POOL;
623 g_idx = page_pools.epp_free_pages % PAGES_PER_POOL;
625 LASSERT(page_pools.epp_free_pages + desc->bd_iov_count <=
626 page_pools.epp_total_pages);
627 LASSERT(page_pools.epp_pools[p_idx]);
629 for (i = 0; i < desc->bd_iov_count; i++) {
630 LASSERT(desc->bd_enc_iov[i].kiov_page != NULL);
631 LASSERT(g_idx != 0 || page_pools.epp_pools[p_idx]);
632 LASSERT(page_pools.epp_pools[p_idx][g_idx] == NULL);
634 page_pools.epp_pools[p_idx][g_idx] =
635 desc->bd_enc_iov[i].kiov_page;
637 if (++g_idx == PAGES_PER_POOL) {
643 page_pools.epp_free_pages += desc->bd_iov_count;
647 cfs_spin_unlock(&page_pools.epp_lock);
649 OBD_FREE(desc->bd_enc_iov,
650 desc->bd_iov_count * sizeof(*desc->bd_enc_iov));
651 desc->bd_enc_iov = NULL;
653 EXPORT_SYMBOL(sptlrpc_enc_pool_put_pages);
656 * we don't do much stuff for add_user/del_user anymore, except adding some
657 * initial pages in add_user() if current pools are empty, rest would be
658 * handled by the pools's self-adaption.
660 int sptlrpc_enc_pool_add_user(void)
664 cfs_spin_lock(&page_pools.epp_lock);
665 if (page_pools.epp_growing == 0 && page_pools.epp_total_pages == 0) {
666 page_pools.epp_growing = 1;
669 cfs_spin_unlock(&page_pools.epp_lock);
672 enc_pools_add_pages(PTLRPC_MAX_BRW_PAGES +
673 PTLRPC_MAX_BRW_PAGES);
675 cfs_spin_lock(&page_pools.epp_lock);
676 page_pools.epp_growing = 0;
678 cfs_spin_unlock(&page_pools.epp_lock);
682 EXPORT_SYMBOL(sptlrpc_enc_pool_add_user);
684 int sptlrpc_enc_pool_del_user(void)
688 EXPORT_SYMBOL(sptlrpc_enc_pool_del_user);
690 static inline void enc_pools_alloc(void)
692 LASSERT(page_pools.epp_max_pools);
694 * on system with huge memory but small page size, this might lead to
695 * high-order allocation. but it's not common, and we suppose memory
696 * be not too much fragmented at module loading time.
698 OBD_ALLOC(page_pools.epp_pools,
699 page_pools.epp_max_pools * sizeof(*page_pools.epp_pools));
702 static inline void enc_pools_free(void)
704 LASSERT(page_pools.epp_max_pools);
705 LASSERT(page_pools.epp_pools);
707 OBD_FREE(page_pools.epp_pools,
708 page_pools.epp_max_pools * sizeof(*page_pools.epp_pools));
711 int sptlrpc_enc_pool_init(void)
714 * maximum capacity is 1/8 of total physical memory.
715 * is the 1/8 a good number?
717 page_pools.epp_max_pages = cfs_num_physpages / 8;
718 page_pools.epp_max_pools = npages_to_npools(page_pools.epp_max_pages);
720 cfs_waitq_init(&page_pools.epp_waitq);
721 page_pools.epp_waitqlen = 0;
722 page_pools.epp_pages_short = 0;
724 page_pools.epp_growing = 0;
726 page_pools.epp_idle_idx = 0;
727 page_pools.epp_last_shrink = cfs_time_current_sec();
728 page_pools.epp_last_access = cfs_time_current_sec();
730 cfs_spin_lock_init(&page_pools.epp_lock);
731 page_pools.epp_total_pages = 0;
732 page_pools.epp_free_pages = 0;
734 page_pools.epp_st_max_pages = 0;
735 page_pools.epp_st_grows = 0;
736 page_pools.epp_st_grow_fails = 0;
737 page_pools.epp_st_shrinks = 0;
738 page_pools.epp_st_access = 0;
739 page_pools.epp_st_missings = 0;
740 page_pools.epp_st_lowfree = 0;
741 page_pools.epp_st_max_wqlen = 0;
742 page_pools.epp_st_max_wait = 0;
745 if (page_pools.epp_pools == NULL)
748 pools_shrinker = cfs_set_shrinker(pools_shrinker_seeks,
750 if (pools_shrinker == NULL) {
758 void sptlrpc_enc_pool_fini(void)
760 unsigned long cleaned, npools;
762 LASSERT(pools_shrinker);
763 LASSERT(page_pools.epp_pools);
764 LASSERT(page_pools.epp_total_pages == page_pools.epp_free_pages);
766 cfs_remove_shrinker(pools_shrinker);
768 npools = npages_to_npools(page_pools.epp_total_pages);
769 cleaned = enc_pools_cleanup(page_pools.epp_pools, npools);
770 LASSERT(cleaned == page_pools.epp_total_pages);
774 if (page_pools.epp_st_access > 0) {
775 CWARN("max pages %lu, grows %u, grow fails %u, shrinks %u, "
776 "access %lu, missing %lu, max qlen %u, max wait "
778 page_pools.epp_st_max_pages, page_pools.epp_st_grows,
779 page_pools.epp_st_grow_fails,
780 page_pools.epp_st_shrinks, page_pools.epp_st_access,
781 page_pools.epp_st_missings, page_pools.epp_st_max_wqlen,
782 page_pools.epp_st_max_wait, CFS_HZ);
786 #else /* !__KERNEL__ */
788 int sptlrpc_enc_pool_get_pages(struct ptlrpc_bulk_desc *desc)
793 void sptlrpc_enc_pool_put_pages(struct ptlrpc_bulk_desc *desc)
797 int sptlrpc_enc_pool_init(void)
802 void sptlrpc_enc_pool_fini(void)
807 /****************************************
808 * Helpers to assist policy modules to *
809 * implement checksum funcationality *
810 ****************************************/
812 static struct sptlrpc_hash_type hash_types[] = {
813 [BULK_HASH_ALG_NULL] = { "null", "null", 0 },
814 [BULK_HASH_ALG_ADLER32] = { "adler32", "adler32", 4 },
815 [BULK_HASH_ALG_CRC32] = { "crc32", "crc32", 4 },
816 [BULK_HASH_ALG_MD5] = { "md5", "md5", 16 },
817 [BULK_HASH_ALG_SHA1] = { "sha1", "sha1", 20 },
818 [BULK_HASH_ALG_SHA256] = { "sha256", "sha256", 32 },
819 [BULK_HASH_ALG_SHA384] = { "sha384", "sha384", 48 },
820 [BULK_HASH_ALG_SHA512] = { "sha512", "sha512", 64 },
823 const struct sptlrpc_hash_type *sptlrpc_get_hash_type(__u8 hash_alg)
825 struct sptlrpc_hash_type *ht;
827 if (hash_alg < BULK_HASH_ALG_MAX) {
828 ht = &hash_types[hash_alg];
829 if (ht->sht_tfm_name)
834 EXPORT_SYMBOL(sptlrpc_get_hash_type);
836 const char * sptlrpc_get_hash_name(__u8 hash_alg)
838 const struct sptlrpc_hash_type *ht;
840 ht = sptlrpc_get_hash_type(hash_alg);
846 EXPORT_SYMBOL(sptlrpc_get_hash_name);
848 __u8 sptlrpc_get_hash_alg(const char *algname)
852 for (i = 0; i < BULK_HASH_ALG_MAX; i++)
853 if (!strcmp(hash_types[i].sht_name, algname))
857 EXPORT_SYMBOL(sptlrpc_get_hash_alg);
859 int bulk_sec_desc_unpack(struct lustre_msg *msg, int offset, int swabbed)
861 struct ptlrpc_bulk_sec_desc *bsd;
862 int size = msg->lm_buflens[offset];
864 bsd = lustre_msg_buf(msg, offset, sizeof(*bsd));
866 CERROR("Invalid bulk sec desc: size %d\n", size);
871 __swab32s(&bsd->bsd_nob);
874 if (unlikely(bsd->bsd_version != 0)) {
875 CERROR("Unexpected version %u\n", bsd->bsd_version);
879 if (unlikely(bsd->bsd_type >= SPTLRPC_BULK_MAX)) {
880 CERROR("Invalid type %u\n", bsd->bsd_type);
884 /* FIXME more sanity check here */
886 if (unlikely(bsd->bsd_svc != SPTLRPC_BULK_SVC_NULL &&
887 bsd->bsd_svc != SPTLRPC_BULK_SVC_INTG &&
888 bsd->bsd_svc != SPTLRPC_BULK_SVC_PRIV)) {
889 CERROR("Invalid svc %u\n", bsd->bsd_svc);
895 EXPORT_SYMBOL(bulk_sec_desc_unpack);
900 static int do_bulk_checksum_adler32(struct ptlrpc_bulk_desc *desc, void *buf)
908 for (i = 0; i < desc->bd_iov_count; i++) {
909 page = desc->bd_iov[i].kiov_page;
910 off = desc->bd_iov[i].kiov_offset & ~CFS_PAGE_MASK;
911 ptr = cfs_kmap(page) + off;
912 len = desc->bd_iov[i].kiov_len;
914 adler32 = adler32(adler32, ptr, len);
919 adler32 = cpu_to_le32(adler32);
920 memcpy(buf, &adler32, sizeof(adler32));
925 static int do_bulk_checksum_crc32(struct ptlrpc_bulk_desc *desc, void *buf)
933 for (i = 0; i < desc->bd_iov_count; i++) {
934 page = desc->bd_iov[i].kiov_page;
935 off = desc->bd_iov[i].kiov_offset & ~CFS_PAGE_MASK;
936 ptr = cfs_kmap(page) + off;
937 len = desc->bd_iov[i].kiov_len;
939 crc32 = crc32_le(crc32, ptr, len);
944 crc32 = cpu_to_le32(crc32);
945 memcpy(buf, &crc32, sizeof(crc32));
949 int sptlrpc_get_bulk_checksum(struct ptlrpc_bulk_desc *desc, __u8 alg,
950 void *buf, int buflen)
952 struct hash_desc hdesc;
955 struct scatterlist sl;
958 LASSERT(alg > BULK_HASH_ALG_NULL && alg < BULK_HASH_ALG_MAX);
959 LASSERT(buflen >= 4);
962 case BULK_HASH_ALG_ADLER32:
964 return do_bulk_checksum_adler32(desc, buf);
966 CERROR("Adler32 not supported\n");
969 case BULK_HASH_ALG_CRC32:
970 return do_bulk_checksum_crc32(desc, buf);
973 hdesc.tfm = ll_crypto_alloc_hash(hash_types[alg].sht_tfm_name, 0, 0);
974 if (hdesc.tfm == NULL) {
975 CERROR("Unable to allocate TFM %s\n", hash_types[alg].sht_name);
980 ll_crypto_hash_init(&hdesc);
982 hashsize = ll_crypto_hash_digestsize(hdesc.tfm);
984 for (i = 0; i < desc->bd_iov_count; i++) {
985 sg_set_page(&sl, desc->bd_iov[i].kiov_page,
986 desc->bd_iov[i].kiov_len,
987 desc->bd_iov[i].kiov_offset & ~CFS_PAGE_MASK);
988 ll_crypto_hash_update(&hdesc, &sl, sl.length);
991 if (hashsize > buflen) {
992 ll_crypto_hash_final(&hdesc, hashbuf);
993 memcpy(buf, hashbuf, buflen);
995 ll_crypto_hash_final(&hdesc, buf);
998 ll_crypto_free_hash(hdesc.tfm);
1001 EXPORT_SYMBOL(sptlrpc_get_bulk_checksum);
1003 #else /* !__KERNEL__ */
1005 int sptlrpc_get_bulk_checksum(struct ptlrpc_bulk_desc *desc, __u8 alg,
1006 void *buf, int buflen)
1011 LASSERT(alg == BULK_HASH_ALG_ADLER32 || alg == BULK_HASH_ALG_CRC32);
1013 if (alg == BULK_HASH_ALG_ADLER32)
1018 for (i = 0; i < desc->bd_iov_count; i++) {
1019 unsigned char *ptr = desc->bd_iov[i].iov_base;
1020 int len = desc->bd_iov[i].iov_len;
1023 case BULK_HASH_ALG_ADLER32:
1025 csum32 = adler32(csum32, ptr, len);
1027 CERROR("Adler32 not supported\n");
1031 case BULK_HASH_ALG_CRC32:
1032 csum32 = crc32_le(csum32, ptr, len);
1037 csum32 = cpu_to_le32(csum32);
1038 memcpy(buf, &csum32, sizeof(csum32));
1042 #endif /* __KERNEL__ */