/* * Copyright (c) 2015-2016 MediaTek Inc. * Author: Yong Wu * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 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 for more details. */ #ifndef MTK_IOMMU_SMI_H #define MTK_IOMMU_SMI_H #include #include #ifdef CONFIG_MTK_SMI #define MTK_LARB_NR_MAX 8 #define MTK_SMI_MMU_EN(port) BIT(port) struct mtk_smi_larb_iommu { struct device *dev; unsigned int mmu; }; struct mtk_smi_iommu { unsigned int larb_nr; struct mtk_smi_larb_iommu larb_imu[MTK_LARB_NR_MAX]; }; /* * mtk_smi_larb_get: Enable the power domain and clocks for this local arbiter. * It also initialize some basic setting(like iommu). * mtk_smi_larb_put: Disable the power domain and clocks for this local arbiter. * Both should be called in non-atomic context. * * Returns 0 if successful, negative on failure. */ int mtk_smi_larb_get(struct device *larbdev); void mtk_smi_larb_put(struct device *larbdev); #else static inline int mtk_smi_larb_get(struct device *larbdev) { return 0; } static inline void mtk_smi_larb_put(struct device *larbdev) { } #endif #endif abs'> summaryrefslogtreecommitdiff
path: root/tools/virtio
diff options
context:
space:
mode:
authorDavid S. Miller <davem@davemloft.net>2017-01-23 16:10:38 -0500
committerDavid S. Miller <davem@davemloft.net>2017-01-23 16:10:38 -0500
commit2acc76cbb7b7ad4f1e35d6c1d973f8cba1dde0bc (patch)
tree60d9d1e583a232e729f965670b2e21dd14a6bc84 /tools/virtio
parent10eeb5e645b5332b24986a554046f6c9cc2c22d4 (diff)
parentb8a943e2942296aad37a8e7adc43db493413e54b (diff)
Merge branch 'bpf-lpm'
Daniel Mack says: ==================== bpf: add longest prefix match map This patch set adds a longest prefix match algorithm that can be used to match IP addresses to a stored set of ranges. It is exposed as a bpf map type. Internally, data is stored in an unbalanced tree of nodes that has a maximum height of n, where n is the prefixlen the trie was created with. Note that this has nothing to do with fib or fib6 and is in no way meant to replace or share code with it. It's rather a much simpler implementation that is specifically written with bpf maps in mind. Patch 1/2 adds the implementation, 2/2 an extensive test suite and 3/3 has benchmarking code for the new trie type. Feedback is much appreciated. Changelog: v3 -> v4: * David added a 3rd patch that augments map_perf_test for LPM trie benchmarks * Limit allocation of maps of this new type to CAP_SYS_ADMIN for now, as requested by Alexei * Add a stub .map_delete_elem so the core does not stumble over a NULL pointer when the syscall is invoked * Tests for non-power-of-2 prefix lengths were added * More comment style fixes v2 -> v3: * Store both the key match data and the caller provided value in the same byte array attached to a node. This avoids double allocations * Bring back node->flags to distinguish between 'real' and intermediate nodes * Fix comment style and some typos v1 -> v2: * Turn spin lock into raw spinlock * Lock with irqsave options during trie_update_elem() * Return -ENOMEM properly from trie_alloc() * Force attr->flags == BPF_F_NO_PREALLOC during creation * Set trie->map.pages after creation to account for map memory * Allow arbitrary value sizes * Removed node->flags and denode intermediate nodes through node->value == NULL instead rfc -> v1: * Add __rcu pointer annotations to make sparse happy * Fold _lpm_trie_find_target_node() into its only caller * Fix some minor documentation issues ==================== Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'tools/virtio')