/* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*- * vim:expandtab:shiftwidth=8:tabstop=8: * * GPL HEADER START * * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 only, * as published by the Free Software Foundation. * * This program is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * General Public License version 2 for more details (a copy is included * in the LICENSE file that accompanied this code). * * You should have received a copy of the GNU General Public License * version 2 along with this program; If not, see [sun.com URL with a * copy of GPLv2]. * * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, * CA 95054 USA or visit www.sun.com if you need additional information or * have any questions. * * GPL HEADER END */ /* * Copyright 2008 Sun Microsystems, Inc. All rights reserved * Use is subject to license terms. */ /* * This file is part of Lustre, http://www.lustre.org/ * Lustre is a trademark of Sun Microsystems, Inc. */ #define DEBUG_SUBSYSTEM S_LNET #include #include #include #include #include static unsigned int cfs_alloc_flags_to_gfp(u_int32_t flags) { unsigned int mflags = 0; #if (LINUX_VERSION_CODE < KERNEL_VERSION(2,5,0)) if (flags & CFS_ALLOC_ATOMIC) mflags |= __GFP_HIGH; else if (flags & CFS_ALLOC_WAIT) mflags |= __GFP_WAIT; else mflags |= (__GFP_HIGH | __GFP_WAIT); if (flags & CFS_ALLOC_IO) mflags |= __GFP_IO | __GFP_HIGHIO; #else if (flags & CFS_ALLOC_ATOMIC) mflags |= __GFP_HIGH; else mflags |= __GFP_WAIT; if (flags & CFS_ALLOC_NOWARN) mflags |= __GFP_NOWARN; if (flags & CFS_ALLOC_IO) mflags |= __GFP_IO; #endif if (flags & CFS_ALLOC_FS) mflags |= __GFP_FS; if (flags & CFS_ALLOC_HIGH) mflags |= __GFP_HIGH; return mflags; } void * cfs_alloc(size_t nr_bytes, u_int32_t flags) { void *ptr = NULL; ptr = kmalloc(nr_bytes, cfs_alloc_flags_to_gfp(flags)); if (ptr != NULL && (flags & CFS_ALLOC_ZERO)) memset(ptr, 0, nr_bytes); return ptr; } void cfs_free(void *addr) { kfree(addr); } void * cfs_alloc_large(size_t nr_bytes) { return vmalloc(nr_bytes); } void cfs_free_large(void *addr) { vfree(addr); } cfs_page_t *cfs_alloc_pages(unsigned int flags, unsigned int order) { /* * XXX nikita: do NOT call portals_debug_msg() (CDEBUG/ENTRY/EXIT) * from here: this will lead to infinite recursion. */ return alloc_pages(cfs_alloc_flags_to_gfp(flags), order); } void __cfs_free_pages(cfs_page_t *page, unsigned int order) { __free_pages(page, order); } cfs_mem_cache_t * cfs_mem_cache_create (const char *name, size_t size, size_t offset, unsigned long flags) { #ifdef HAVE_KMEM_CACHE_CREATE_DTOR return kmem_cache_create(name, size, offset, flags, NULL, NULL); #else return kmem_cache_create(name, size, offset, flags, NULL); #endif } int cfs_mem_cache_destroy (cfs_mem_cache_t * cachep) { #ifdef HAVE_KMEM_CACHE_DESTROY_INT return kmem_cache_destroy(cachep); #else kmem_cache_destroy(cachep); return 0; #endif } void * cfs_mem_cache_alloc(cfs_mem_cache_t *cachep, int flags) { return kmem_cache_alloc(cachep, cfs_alloc_flags_to_gfp(flags)); } void cfs_mem_cache_free(cfs_mem_cache_t *cachep, void *objp) { return kmem_cache_free(cachep, objp); } EXPORT_SYMBOL(cfs_alloc); EXPORT_SYMBOL(cfs_free); EXPORT_SYMBOL(cfs_alloc_large); EXPORT_SYMBOL(cfs_free_large); EXPORT_SYMBOL(cfs_alloc_pages); EXPORT_SYMBOL(__cfs_free_pages); EXPORT_SYMBOL(cfs_mem_cache_create); EXPORT_SYMBOL(cfs_mem_cache_destroy); EXPORT_SYMBOL(cfs_mem_cache_alloc); EXPORT_SYMBOL(cfs_mem_cache_free);