| 1 | /* |
| 2 | * Copyright 2010-2017 Intel Corporation. |
| 3 | * |
| 4 | * This program is free software; you can redistribute it and/or modify |
| 5 | * it under the terms of the GNU General Public License, version 2, |
| 6 | * as published by the Free Software Foundation. |
| 7 | * |
| 8 | * This program is distributed in the hope that it will be useful, |
| 9 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 10 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 11 | * General Public License for more details. |
| 12 | * |
| 13 | * Disclaimer: The codes contained in these modules may be specific to |
| 14 | * the Intel Software Development Platform codenamed Knights Ferry, |
| 15 | * and the Intel product codenamed Knights Corner, and are not backward |
| 16 | * compatible with other Intel products. Additionally, Intel will NOT |
| 17 | * support the codes or instruction set in future products. |
| 18 | * |
| 19 | * Intel offers no warranty of any kind regarding the code. This code is |
| 20 | * licensed on an "AS IS" basis and Intel is not obligated to provide |
| 21 | * any support, assistance, installation, training, or other services |
| 22 | * of any kind. Intel is also not obligated to provide any updates, |
| 23 | * enhancements or extensions. Intel specifically disclaims any warranty |
| 24 | * of merchantability, non-infringement, fitness for any particular |
| 25 | * purpose, and any other warranty. |
| 26 | * |
| 27 | * Further, Intel disclaims all liability of any kind, including but |
| 28 | * not limited to liability for infringement of any proprietary rights, |
| 29 | * relating to the use of the code, even if Intel is notified of the |
| 30 | * possibility of such liability. Except as expressly stated in an Intel |
| 31 | * license agreement provided with this code and agreed upon with Intel, |
| 32 | * no license, express or implied, by estoppel or otherwise, to any |
| 33 | * intellectual property rights is granted herein. |
| 34 | */ |
| 35 | |
| 36 | /* generate a virtual address for a given size */ |
| 37 | #ifndef MICSCIF_VA_NODE_H |
| 38 | #define MICSCIF_VA_NODE_H |
| 39 | |
| 40 | #include <linux/errno.h> |
| 41 | #include <linux/hardirq.h> |
| 42 | #include <linux/types.h> |
| 43 | #include <linux/capability.h> |
| 44 | #include <linux/slab.h> |
| 45 | #include <linux/string.h> |
| 46 | #include <linux/gfp.h> |
| 47 | #include <linux/vmalloc.h> |
| 48 | #include <asm/io.h> |
| 49 | #include <linux/kernel.h> |
| 50 | #include <linux/mm_types.h> |
| 51 | #include <linux/jiffies.h> |
| 52 | #include <linux/timer.h> |
| 53 | #include <linux/irqflags.h> |
| 54 | #include <linux/time.h> |
| 55 | #include <linux/spinlock.h> |
| 56 | #include <linux/mutex.h> |
| 57 | #include <linux/semaphore.h> |
| 58 | #include <linux/kthread.h> |
| 59 | #include <linux/sched.h> |
| 60 | #include <linux/delay.h> |
| 61 | #include <linux/wait.h> |
| 62 | #include <asm/bug.h> |
| 63 | #include <linux/pci.h> |
| 64 | #include <linux/device.h> |
| 65 | #include <linux/fs.h> |
| 66 | #include <linux/list.h> |
| 67 | #include <linux/workqueue.h> |
| 68 | #include <linux/interrupt.h> |
| 69 | #include <asm/atomic.h> |
| 70 | #include <linux/netdevice.h> |
| 71 | #include <linux/debugfs.h> |
| 72 | |
| 73 | #define invalid_va_node_index ((uint32_t)(-1)) |
| 74 | |
| 75 | struct va_node { |
| 76 | uint32_t next; |
| 77 | uint64_t base; |
| 78 | uint64_t range; |
| 79 | }; |
| 80 | |
| 81 | struct va_node_allocator { |
| 82 | /* Emulated variable-size array |
| 83 | * is implemented as a sequence of fixed-sized slabs. |
| 84 | * SlabDirectory keeps the sequence. |
| 85 | * Slab is a contiguous block of nodes -- saves number of allocations |
| 86 | * when allocing a new slab of nodes, alloc this size |
| 87 | */ |
| 88 | uint32_t slab_shift; |
| 89 | uint32_t nodes_in_slab; |
| 90 | uint32_t slab_mask; |
| 91 | struct va_node **pp_slab_directory; |
| 92 | uint32_t num_slabs; |
| 93 | uint32_t num_free_slabs; |
| 94 | uint32_t free_list; |
| 95 | }; |
| 96 | |
| 97 | int va_node_is_valid(uint32_t index); |
| 98 | |
| 99 | /* |
| 100 | * get the node corresponding to a NodePtr |
| 101 | * We are emulating a variable-size array |
| 102 | */ |
| 103 | struct va_node *va_node_get(struct va_node_allocator *node, uint32_t index); |
| 104 | |
| 105 | /* returns an NodePtr to a free node */ |
| 106 | int va_node_alloc(struct va_node_allocator *node, uint32_t *out_alloc); |
| 107 | |
| 108 | /* put a node back into the free pool, by NodePtr */ |
| 109 | void va_node_free(struct va_node_allocator *node, uint32_t index); |
| 110 | |
| 111 | void va_node_init(struct va_node_allocator *node); |
| 112 | |
| 113 | void va_node_destroy(struct va_node_allocator *node); |
| 114 | |
| 115 | #endif |