1/*- 2 * Copyright (c) 2010 Isilon Systems, Inc. 3 * Copyright (c) 2010 iX Systems, Inc. 4 * Copyright (c) 2010 Panasas, Inc. 5 * Copyright (c) 2013-2017 Mellanox Technologies, Ltd. 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice unmodified, this list of conditions, and the following 13 * disclaimer. 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in the 16 * documentation and/or other materials provided with the distribution. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28 */ 29#ifndef _LINUXKPI_LINUX_GFP_H_ 30#define _LINUXKPI_LINUX_GFP_H_ 31 32#include <sys/types.h> 33#include <sys/systm.h> 34#include <sys/malloc.h> 35 36#include <linux/page.h> 37 38#include <vm/vm_param.h> 39#include <vm/vm_object.h> 40#include <vm/vm_extern.h> 41#include <vm/vm_kern.h> 42 43#define __GFP_NOWARN 0 44#define __GFP_HIGHMEM 0 45#define __GFP_ZERO M_ZERO 46#define __GFP_NORETRY 0 47#define __GFP_NOMEMALLOC 0 48#define __GFP_RECLAIM 0 49#define __GFP_RECLAIMABLE 0 50#define __GFP_RETRY_MAYFAIL 0 51#define __GFP_MOVABLE 0 52#define __GFP_COMP 0 53#define __GFP_KSWAPD_RECLAIM 0 54 55#define __GFP_IO 0 56#define __GFP_NO_KSWAPD 0 57#define __GFP_KSWAPD_RECLAIM 0 58#define __GFP_WAIT M_WAITOK 59#define __GFP_DMA32 (1U << 24) /* LinuxKPI only */ 60#define __GFP_BITS_SHIFT 25 61#define __GFP_BITS_MASK ((1 << __GFP_BITS_SHIFT) - 1) 62#define __GFP_NOFAIL M_WAITOK 63 64#define GFP_NOWAIT M_NOWAIT 65#define GFP_ATOMIC (M_NOWAIT | M_USE_RESERVE) 66#define GFP_KERNEL M_WAITOK 67#define GFP_USER M_WAITOK 68#define GFP_HIGHUSER M_WAITOK 69#define GFP_HIGHUSER_MOVABLE M_WAITOK 70#define GFP_IOFS M_NOWAIT 71#define GFP_NOIO M_NOWAIT 72#define GFP_NOFS M_NOWAIT 73#define GFP_DMA32 __GFP_DMA32 74#define GFP_TEMPORARY M_NOWAIT 75#define GFP_NATIVE_MASK (M_NOWAIT | M_WAITOK | M_USE_RESERVE | M_ZERO) 76#define GFP_TRANSHUGE 0 77#define GFP_TRANSHUGE_LIGHT 0 78 79CTASSERT((__GFP_DMA32 & GFP_NATIVE_MASK) == 0); 80CTASSERT((__GFP_BITS_MASK & GFP_NATIVE_MASK) == GFP_NATIVE_MASK); 81 82struct page_frag_cache { 83 void *va; 84 int pagecnt_bias; 85}; 86 87/* 88 * Resolve a page into a virtual address: 89 * 90 * NOTE: This function only works for pages allocated by the kernel. 91 */ 92extern void *linux_page_address(struct page *); 93 94#define page_address(page) linux_page_address(page) 95 96/* 97 * Page management for unmapped pages: 98 */ 99extern struct page *linux_alloc_pages(gfp_t flags, unsigned int order); 100extern void linux_free_pages(struct page *page, unsigned int order); 101void *linuxkpi_page_frag_alloc(struct page_frag_cache *, size_t, gfp_t); 102void linuxkpi_page_frag_free(void *); 103void linuxkpi__page_frag_cache_drain(struct page *, size_t); 104 105static inline struct page * 106alloc_page(gfp_t flags) 107{ 108 109 return (linux_alloc_pages(flags, 0)); 110} 111 112static inline struct page * 113alloc_pages(gfp_t flags, unsigned int order) 114{ 115 116 return (linux_alloc_pages(flags, order)); 117} 118 119static inline struct page * 120alloc_pages_node(int node_id, gfp_t flags, unsigned int order) 121{ 122 123 return (linux_alloc_pages(flags, order)); 124} 125 126static inline void 127__free_pages(struct page *page, unsigned int order) 128{ 129 130 linux_free_pages(page, order); 131} 132 133static inline void 134__free_page(struct page *page) 135{ 136 137 linux_free_pages(page, 0); 138} 139 140static inline struct page * 141dev_alloc_pages(unsigned int order) 142{ 143 return (linux_alloc_pages(GFP_ATOMIC, order)); 144} 145 146/* 147 * Page management for mapped pages: 148 */ 149extern vm_offset_t linux_alloc_kmem(gfp_t flags, unsigned int order); 150extern void linux_free_kmem(vm_offset_t, unsigned int order); 151 152static inline vm_offset_t 153get_zeroed_page(gfp_t flags) 154{ 155 156 return (linux_alloc_kmem(flags | __GFP_ZERO, 0)); 157} 158 159static inline vm_offset_t 160__get_free_page(gfp_t flags) 161{ 162 163 return (linux_alloc_kmem(flags, 0)); 164} 165 166static inline vm_offset_t 167__get_free_pages(gfp_t flags, unsigned int order) 168{ 169 170 return (linux_alloc_kmem(flags, order)); 171} 172 173static inline void 174free_pages(uintptr_t addr, unsigned int order) 175{ 176 if (addr == 0) 177 return; 178 179 linux_free_kmem(addr, order); 180} 181 182static inline void 183free_page(uintptr_t addr) 184{ 185 if (addr == 0) 186 return; 187 188 linux_free_kmem(addr, 0); 189} 190 191static inline void * 192page_frag_alloc(struct page_frag_cache *pfc, size_t fragsz, gfp_t gfp) 193{ 194 195 return (linuxkpi_page_frag_alloc(pfc, fragsz, gfp)); 196} 197 198static inline void 199page_frag_free(void *addr) 200{ 201 202 linuxkpi_page_frag_free(addr); 203} 204 205static inline void 206__page_frag_cache_drain(struct page *page, size_t count) 207{ 208 209 linuxkpi__page_frag_cache_drain(page, count); 210} 211 212static inline bool 213gfpflags_allow_blocking(const gfp_t gfp_flags) 214{ 215 return ((gfp_flags & (M_WAITOK | M_NOWAIT)) == M_WAITOK); 216} 217 218#define SetPageReserved(page) do { } while (0) /* NOP */ 219#define ClearPageReserved(page) do { } while (0) /* NOP */ 220 221#endif /* _LINUXKPI_LINUX_GFP_H_ */ 222