1ab1e2860SLuigi Rizzo /* 237e3a6d3SLuigi Rizzo * Copyright (C) 2012-2014 Matteo Landi 337e3a6d3SLuigi Rizzo * Copyright (C) 2012-2016 Luigi Rizzo 437e3a6d3SLuigi Rizzo * Copyright (C) 2012-2016 Giuseppe Lettieri 537e3a6d3SLuigi Rizzo * All rights reserved. 6ab1e2860SLuigi Rizzo * 7ab1e2860SLuigi Rizzo * Redistribution and use in source and binary forms, with or without 8ab1e2860SLuigi Rizzo * modification, are permitted provided that the following conditions 9ab1e2860SLuigi Rizzo * are met: 10ab1e2860SLuigi Rizzo * 1. Redistributions of source code must retain the above copyright 11ab1e2860SLuigi Rizzo * notice, this list of conditions and the following disclaimer. 12ab1e2860SLuigi Rizzo * 2. Redistributions in binary form must reproduce the above copyright 13ab1e2860SLuigi Rizzo * notice, this list of conditions and the following disclaimer in the 14ab1e2860SLuigi Rizzo * documentation and/or other materials provided with the distribution. 15ab1e2860SLuigi Rizzo * 16ab1e2860SLuigi Rizzo * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 17ab1e2860SLuigi Rizzo * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 18ab1e2860SLuigi Rizzo * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 19ab1e2860SLuigi Rizzo * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 20ab1e2860SLuigi Rizzo * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 21ab1e2860SLuigi Rizzo * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 22ab1e2860SLuigi Rizzo * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 23ab1e2860SLuigi Rizzo * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 24ab1e2860SLuigi Rizzo * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 25ab1e2860SLuigi Rizzo * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 26ab1e2860SLuigi Rizzo * SUCH DAMAGE. 27ab1e2860SLuigi Rizzo */ 28ab1e2860SLuigi Rizzo 29ab1e2860SLuigi Rizzo /* 30ab1e2860SLuigi Rizzo * $FreeBSD$ 31ab1e2860SLuigi Rizzo * 32ab1e2860SLuigi Rizzo * (New) memory allocator for netmap 33ab1e2860SLuigi Rizzo */ 34ab1e2860SLuigi Rizzo 35ab1e2860SLuigi Rizzo /* 36ab1e2860SLuigi Rizzo * This allocator creates three memory pools: 37ab1e2860SLuigi Rizzo * nm_if_pool for the struct netmap_if 38ab1e2860SLuigi Rizzo * nm_ring_pool for the struct netmap_ring 39ab1e2860SLuigi Rizzo * nm_buf_pool for the packet buffers. 40ab1e2860SLuigi Rizzo * 41ab1e2860SLuigi Rizzo * that contain netmap objects. Each pool is made of a number of clusters, 42ab1e2860SLuigi Rizzo * multiple of a page size, each containing an integer number of objects. 43ab1e2860SLuigi Rizzo * The clusters are contiguous in user space but not in the kernel. 44ab1e2860SLuigi Rizzo * Only nm_buf_pool needs to be dma-able, 45ab1e2860SLuigi Rizzo * but for convenience use the same type of allocator for all. 46ab1e2860SLuigi Rizzo * 47ab1e2860SLuigi Rizzo * Once mapped, the three pools are exported to userspace 48ab1e2860SLuigi Rizzo * as a contiguous block, starting from nm_if_pool. Each 49ab1e2860SLuigi Rizzo * cluster (and pool) is an integral number of pages. 50ab1e2860SLuigi Rizzo * [ . . . ][ . . . . . .][ . . . . . . . . . .] 51ab1e2860SLuigi Rizzo * nm_if nm_ring nm_buf 52ab1e2860SLuigi Rizzo * 53ab1e2860SLuigi Rizzo * The userspace areas contain offsets of the objects in userspace. 54ab1e2860SLuigi Rizzo * When (at init time) we write these offsets, we find out the index 55ab1e2860SLuigi Rizzo * of the object, and from there locate the offset from the beginning 56ab1e2860SLuigi Rizzo * of the region. 57ab1e2860SLuigi Rizzo * 58ab1e2860SLuigi Rizzo * The invididual allocators manage a pool of memory for objects of 59ab1e2860SLuigi Rizzo * the same size. 60ab1e2860SLuigi Rizzo * The pool is split into smaller clusters, whose size is a 61ab1e2860SLuigi Rizzo * multiple of the page size. The cluster size is chosen 62ab1e2860SLuigi Rizzo * to minimize the waste for a given max cluster size 63ab1e2860SLuigi Rizzo * (we do it by brute force, as we have relatively few objects 64ab1e2860SLuigi Rizzo * per cluster). 65ab1e2860SLuigi Rizzo * 66ab1e2860SLuigi Rizzo * Objects are aligned to the cache line (64 bytes) rounding up object 67ab1e2860SLuigi Rizzo * sizes when needed. A bitmap contains the state of each object. 68ab1e2860SLuigi Rizzo * Allocation scans the bitmap; this is done only on attach, so we are not 69ab1e2860SLuigi Rizzo * too worried about performance 70ab1e2860SLuigi Rizzo * 71ab1e2860SLuigi Rizzo * For each allocator we can define (thorugh sysctl) the size and 72ab1e2860SLuigi Rizzo * number of each object. Memory is allocated at the first use of a 73ab1e2860SLuigi Rizzo * netmap file descriptor, and can be freed when all such descriptors 74ab1e2860SLuigi Rizzo * have been released (including unmapping the memory). 75ab1e2860SLuigi Rizzo * If memory is scarce, the system tries to get as much as possible 76ab1e2860SLuigi Rizzo * and the sysctl values reflect the actual allocation. 77ab1e2860SLuigi Rizzo * Together with desired values, the sysctl export also absolute 78ab1e2860SLuigi Rizzo * min and maximum values that cannot be overridden. 79ab1e2860SLuigi Rizzo * 80ab1e2860SLuigi Rizzo * struct netmap_if: 81ab1e2860SLuigi Rizzo * variable size, max 16 bytes per ring pair plus some fixed amount. 82ab1e2860SLuigi Rizzo * 1024 bytes should be large enough in practice. 83ab1e2860SLuigi Rizzo * 84ab1e2860SLuigi Rizzo * In the worst case we have one netmap_if per ring in the system. 85ab1e2860SLuigi Rizzo * 86ab1e2860SLuigi Rizzo * struct netmap_ring 87ab1e2860SLuigi Rizzo * variable size, 8 byte per slot plus some fixed amount. 88ab1e2860SLuigi Rizzo * Rings can be large (e.g. 4k slots, or >32Kbytes). 89ab1e2860SLuigi Rizzo * We default to 36 KB (9 pages), and a few hundred rings. 90ab1e2860SLuigi Rizzo * 91ab1e2860SLuigi Rizzo * struct netmap_buffer 92ab1e2860SLuigi Rizzo * The more the better, both because fast interfaces tend to have 93ab1e2860SLuigi Rizzo * many slots, and because we may want to use buffers to store 94ab1e2860SLuigi Rizzo * packets in userspace avoiding copies. 95ab1e2860SLuigi Rizzo * Must contain a full frame (eg 1518, or more for vlans, jumbo 96ab1e2860SLuigi Rizzo * frames etc.) plus be nicely aligned, plus some NICs restrict 97ab1e2860SLuigi Rizzo * the size to multiple of 1K or so. Default to 2K 98ab1e2860SLuigi Rizzo */ 99ab1e2860SLuigi Rizzo #ifndef _NET_NETMAP_MEM2_H_ 100ab1e2860SLuigi Rizzo #define _NET_NETMAP_MEM2_H_ 101ab1e2860SLuigi Rizzo 102ab1e2860SLuigi Rizzo 103ab1e2860SLuigi Rizzo 104ab1e2860SLuigi Rizzo /* We implement two kinds of netmap_mem_d structures: 105ab1e2860SLuigi Rizzo * 106ab1e2860SLuigi Rizzo * - global: used by hardware NICS; 107ab1e2860SLuigi Rizzo * 108ab1e2860SLuigi Rizzo * - private: used by VALE ports. 109ab1e2860SLuigi Rizzo * 110ab1e2860SLuigi Rizzo * In both cases, the netmap_mem_d structure has the same lifetime as the 111ab1e2860SLuigi Rizzo * netmap_adapter of the corresponding NIC or port. It is the responsibility of 112ab1e2860SLuigi Rizzo * the client code to delete the private allocator when the associated 113ab1e2860SLuigi Rizzo * netmap_adapter is freed (this is implemented by the NAF_MEM_OWNER flag in 114ab1e2860SLuigi Rizzo * netmap.c). The 'refcount' field counts the number of active users of the 115ab1e2860SLuigi Rizzo * structure. The global allocator uses this information to prevent/allow 116ab1e2860SLuigi Rizzo * reconfiguration. The private allocators release all their memory when there 117ab1e2860SLuigi Rizzo * are no active users. By 'active user' we mean an existing netmap_priv 118ab1e2860SLuigi Rizzo * structure holding a reference to the allocator. 119ab1e2860SLuigi Rizzo */ 120ab1e2860SLuigi Rizzo 121ab1e2860SLuigi Rizzo extern struct netmap_mem_d nm_mem; 122*c3e9b4dbSLuiz Otavio O Souza typedef uint16_t nm_memid_t; 123ab1e2860SLuigi Rizzo 12437e3a6d3SLuigi Rizzo int netmap_mem_get_lut(struct netmap_mem_d *, struct netmap_lut *); 125*c3e9b4dbSLuiz Otavio O Souza nm_memid_t netmap_mem_get_id(struct netmap_mem_d *); 126ab1e2860SLuigi Rizzo vm_paddr_t netmap_mem_ofstophys(struct netmap_mem_d *, vm_ooffset_t); 12737e3a6d3SLuigi Rizzo #ifdef _WIN32 12837e3a6d3SLuigi Rizzo PMDL win32_build_user_vm_map(struct netmap_mem_d* nmd); 12937e3a6d3SLuigi Rizzo #endif 1304bf50f18SLuigi Rizzo int netmap_mem_finalize(struct netmap_mem_d *, struct netmap_adapter *); 131ab1e2860SLuigi Rizzo int netmap_mem_init(void); 132ab1e2860SLuigi Rizzo void netmap_mem_fini(void); 133*c3e9b4dbSLuiz Otavio O Souza struct netmap_if * netmap_mem_if_new(struct netmap_adapter *, struct netmap_priv_d *); 134f9790aebSLuigi Rizzo void netmap_mem_if_delete(struct netmap_adapter *, struct netmap_if *); 135f9790aebSLuigi Rizzo int netmap_mem_rings_create(struct netmap_adapter *); 136f9790aebSLuigi Rizzo void netmap_mem_rings_delete(struct netmap_adapter *); 1374bf50f18SLuigi Rizzo void netmap_mem_deref(struct netmap_mem_d *, struct netmap_adapter *); 13837e3a6d3SLuigi Rizzo int netmap_mem2_get_pool_info(struct netmap_mem_d *, u_int, u_int *, u_int *); 139f0ea3689SLuigi Rizzo int netmap_mem_get_info(struct netmap_mem_d *, u_int *size, u_int *memflags, uint16_t *id); 140f9790aebSLuigi Rizzo ssize_t netmap_mem_if_offset(struct netmap_mem_d *, const void *vaddr); 141*c3e9b4dbSLuiz Otavio O Souza struct netmap_mem_d* netmap_mem_private_new( u_int txr, u_int txd, u_int rxr, u_int rxd, 142*c3e9b4dbSLuiz Otavio O Souza u_int extra_bufs, u_int npipes, int* error); 143847bf383SLuigi Rizzo void netmap_mem_delete(struct netmap_mem_d *); 144847bf383SLuigi Rizzo 145*c3e9b4dbSLuiz Otavio O Souza #define netmap_mem_get(d) __netmap_mem_get(d, __FUNCTION__, __LINE__) 146*c3e9b4dbSLuiz Otavio O Souza #define netmap_mem_put(d) __netmap_mem_put(d, __FUNCTION__, __LINE__) 147*c3e9b4dbSLuiz Otavio O Souza struct netmap_mem_d* __netmap_mem_get(struct netmap_mem_d *, const char *, int); 148847bf383SLuigi Rizzo void __netmap_mem_put(struct netmap_mem_d *, const char *, int); 149*c3e9b4dbSLuiz Otavio O Souza struct netmap_mem_d* netmap_mem_find(nm_memid_t); 150ab1e2860SLuigi Rizzo 15137e3a6d3SLuigi Rizzo #ifdef WITH_PTNETMAP_GUEST 15237e3a6d3SLuigi Rizzo struct netmap_mem_d* netmap_mem_pt_guest_new(struct ifnet *, 15337e3a6d3SLuigi Rizzo unsigned int nifp_offset, 154844a6f0cSLuigi Rizzo unsigned int memid); 15537e3a6d3SLuigi Rizzo struct ptnetmap_memdev; 15637e3a6d3SLuigi Rizzo struct netmap_mem_d* netmap_mem_pt_guest_attach(struct ptnetmap_memdev *, uint16_t); 15737e3a6d3SLuigi Rizzo int netmap_mem_pt_guest_ifp_del(struct netmap_mem_d *, struct ifnet *); 15837e3a6d3SLuigi Rizzo #endif /* WITH_PTNETMAP_GUEST */ 15937e3a6d3SLuigi Rizzo 160*c3e9b4dbSLuiz Otavio O Souza int netmap_mem_pools_info_get(struct nmreq *, struct netmap_mem_d *); 161844a6f0cSLuigi Rizzo 1624bf50f18SLuigi Rizzo #define NETMAP_MEM_PRIVATE 0x2 /* allocator uses private address space */ 1634bf50f18SLuigi Rizzo #define NETMAP_MEM_IO 0x4 /* the underlying memory is mmapped I/O */ 164ab1e2860SLuigi Rizzo 165f0ea3689SLuigi Rizzo uint32_t netmap_extra_alloc(struct netmap_adapter *, uint32_t *, uint32_t n); 166ab1e2860SLuigi Rizzo 167ab1e2860SLuigi Rizzo #endif 168