Searched refs:radix (Results 26 - 50 of 69) sorted by relevance

123

/linux-master/drivers/pinctrl/
H A Dcore.h14 #include <linux/radix-tree.h>
35 * this radix tree
36 * @pin_group_tree: optionally each pin group can be stored in this radix tree
38 * @pin_function_tree: optionally each function can be stored in this radix tree
/linux-master/include/linux/
H A Dbacking-dev-defs.h6 #include <linux/radix-tree.h>
189 struct radix_tree_root cgwb_tree; /* radix tree of active cgroup wbs */
H A Didr.h15 #include <linux/radix-tree.h>
26 * The IDR API does not expose the tagging functionality of the radix tree
86 * idr synchronization (stolen from radix-tree.h)
H A Ddax.h7 #include <linux/radix-tree.h>
H A Dswapops.h5 #include <linux/radix-tree.h>
16 * swapcache pages are stored in the swapper_space radix tree. We want to
H A Dirqdomain.h38 #include <linux/radix-tree.h>
/linux-master/drivers/sh/intc/
H A Dinternals.h8 #include <linux/radix-tree.h>
H A Dvirq.c15 #include <linux/radix-tree.h>
31 * Tags for the radix tree
/linux-master/security/tomoyo/
H A Dfile.c215 u8 radix; local
224 radix = TOMOYO_VALUE_TYPE_OCTAL;
227 radix = TOMOYO_VALUE_TYPE_HEXADECIMAL;
230 radix = TOMOYO_VALUE_TYPE_DECIMAL;
234 radix);
/linux-master/drivers/infiniband/core/
H A Duverbs_ioctl.c52 struct radix_tree_root *radix; member in struct:bundle_priv
367 * We search the radix tree with the method prefix and now we want to fast
369 * totally clear to me if this breaks the radix tree encasulation or not, but
373 * single radix chunk, so in most cases this will have no search. Other cases
390 return radix_tree_lookup_slot(pbundle->radix,
574 &uapi->radix, &attrs_iter,
602 pbundle->radix = &uapi->radix;
/linux-master/arch/powerpc/mm/book3s64/
H A Dpgtable.c59 * We can use MMU_PAGE_2M here, because only radix
79 * We can use MMU_PAGE_1G here, because only radix
309 static void flush_partition(unsigned int lpid, bool radix) argument
311 if (radix) {
345 * flush. The type of flush (hash or radix) depends on what the previous
551 * For radix translation with split pmd ptl, we store the deposited table in the
556 * With radix we use deposited table only for anonymous mapping.
/linux-master/tools/testing/radix-tree/
H A Dmain.c10 #include <linux/radix-tree.h>
163 // printf("generating radix tree indices...\n");
H A Dlinux.c12 #include <linux/radix-tree.h>
H A Dtag_check.c8 #include <linux/radix-tree.h>
H A Dmultiorder.c3 * multiorder.c: Multi-order radix tree entry testing
8 #include <linux/radix-tree.h>
/linux-master/arch/powerpc/kernel/
H A Dirq_64.c39 #include <linux/radix-tree.h>
H A Dirq.c47 #include <linux/radix-tree.h>
/linux-master/drivers/gpu/drm/i915/gvt/
H A Dgtt.h40 #include <linux/radix-tree.h>
/linux-master/drivers/gpu/drm/i915/gem/
H A Di915_gem_object.c126 INIT_RADIX_TREE(&obj->mm.get_page.radix, GFP_KERNEL | __GFP_NOWARN);
128 INIT_RADIX_TREE(&obj->mm.get_dma_page.radix, GFP_KERNEL | __GFP_NOWARN);
H A Di915_gem_ttm.c388 * the object. For example the radix tree for fast page lookup and the
400 radix_tree_for_each_slot(slot, &obj->ttm.get_io_page.radix, &iter, 0)
401 radix_tree_delete(&obj->ttm.get_io_page.radix, iter.index);
1305 INIT_RADIX_TREE(&obj->ttm.get_io_page.radix, GFP_KERNEL | __GFP_NOWARN);
/linux-master/drivers/md/
H A Ddm-zoned.h21 #include <linux/radix-tree.h>
/linux-master/drivers/ntb/test/
H A Dntb_msi_test.c7 #include <linux/radix-tree.h>
/linux-master/arch/powerpc/boot/
H A Dwrapper601 size=$(${CROSS}nm --no-sort --radix=d "$ofile" | grep -E ' _end$' | cut -d' ' -f1)
/linux-master/drivers/hwspinlock/
H A Dhwspinlock_core.c19 #include <linux/radix-tree.h>
30 /* radix tree tags */
34 * A radix tree is used to maintain the available hwspinlock instances.
44 * The radix tree API supports tagging items in the tree, which this
48 * single radix tree API call.
54 * as the radix-tree API requires that users provide all synchronisation.
55 * A mutex is needed because we're using non-atomic radix tree allocations.
/linux-master/include/linux/ceph/
H A Dmessenger.h10 #include <linux/radix-tree.h>

Completed in 475 milliseconds

123