Searched refs:radix (Results 1 - 25 of 69) sorted by relevance

123

/linux-master/lib/
H A Dgeneric-radix-tree.c4 #include <linux/generic-radix-tree.h>
52 * Returns pointer to the specified byte @offset within @radix, or NULL if not
55 void *__genradix_ptr(struct __genradix *radix, size_t offset) argument
57 struct genradix_root *r = READ_ONCE(radix->root);
91 * Returns pointer to the specified byte @offset within @radix, allocating it if
94 void *__genradix_ptr_alloc(struct __genradix *radix, size_t offset, argument
97 struct genradix_root *v = READ_ONCE(radix->root);
121 if ((v = cmpxchg_release(&radix->root, r, new_root)) == r) {
153 struct __genradix *radix,
164 r = READ_ONCE(radix
152 __genradix_iter_peek(struct genradix_iter *iter, struct __genradix *radix, size_t objs_per_page) argument
205 __genradix_iter_peek_prev(struct genradix_iter *iter, struct __genradix *radix, size_t objs_per_page, size_t obj_size_plus_page_remainder) argument
276 __genradix_prealloc(struct __genradix *radix, size_t size, gfp_t gfp_mask) argument
289 __genradix_free(struct __genradix *radix) argument
[all...]
/linux-master/tools/testing/radix-tree/
H A DMakefile8 CORE_OFILES := xarray.o radix-tree.o idr.o linux.o test.o find_bit.o bitmap.o \
42 $(RM) $(TARGETS) *.o radix-tree.c idr.c generated/map-shift.h generated/bit-length.h
51 ../../../include/linux/radix-tree.h \
52 ../../../lib/radix-tree.h \
55 radix-tree.c: ../../../lib/radix-tree.c
H A Dregression4.c5 #include <linux/radix-tree.h>
H A Dregression2.c5 * Toshiyuki Okajima describes the following radix-tree bug:
10 * 0. The radix tree contains RADIX_TREE_MAP_SIZE items. And the tag of
18 * 2. An item is added into the radix tree and then the level of it is
19 * extended into 2 from 1. At that time, the new radix tree node succeeds
20 * the tag status of the root tag. Therefore the tag of the new radix tree
22 * PAGECACHE_TAG_TOWRITE tag in the child node of the new radix tree node.
26 * radix tree.) As the result, the slot of the radix tree node is NULL but
31 * slot of the radix tree node is NULL, but the tag which corresponds to
49 #include <linux/radix
[all...]
H A Dregression3.c23 #include <linux/radix-tree.h>
H A Dtest.h4 #include <linux/radix-tree.h>
52 /* Normally private parts of lib/radix-tree.c */
H A Dbenchmark.c6 #include <linux/radix-tree.h>
H A Dregression1.c5 * Salman Qazi describes the following radix-tree bug:
9 * 0. The radix tree contains two items, one has the index 0.
37 #include <linux/radix-tree.h>
/linux-master/arch/x86/kernel/cpu/sgx/
H A Ddriver.h8 #include <linux/radix-tree.h>
/linux-master/fs/bcachefs/
H A Dquota_types.h5 #include <linux/generic-radix-tree.h>
/linux-master/arch/powerpc/include/asm/book3s/64/
H A Dtlbflush.h10 #include <asm/book3s/64/tlbflush-radix.h>
34 static inline void tlbiel_all_lpid(bool radix) argument
39 if (radix)
H A Dradix.h12 #include <asm/book3s/64/radix-64k.h>
14 #include <asm/book3s/64/radix-4k.h>
18 #include <asm/book3s/64/tlbflush-radix.h>
303 /* For radix 2M at PMD level means thp */
311 /* For radix 1G at PUD level means pud hugepage support */
/linux-master/include/linux/
H A Diocontext.h5 #include <linux/radix-tree.h>
/linux-master/arch/powerpc/include/asm/
H A Dirq.h11 #include <linux/radix-tree.h>
H A Dkvm_book3s_64.h35 u8 radix; /* is this nested guest radix */ member in struct:kvm_nested_guest
128 return kvm->arch.radix;
133 bool radix; local
136 radix = vcpu->arch.nested->radix;
138 radix = kvm_is_radix(vcpu->kvm);
140 return radix;
/linux-master/drivers/infiniband/core/
H A Duverbs_uapi.c27 rc = radix_tree_insert(&uapi->radix, key, elm);
50 elm = radix_tree_lookup(&uapi->radix, key);
363 radix_tree_for_each_slot (slot, &uapi->radix, &iter,
425 radix_tree_for_each_slot (slot, &uapi->radix, &iter, 0) {
458 radix_tree_for_each_slot (slot, &uapi->radix, &iter, 0) {
477 radix_tree_for_each_slot (slot, &uapi->radix, &iter, start) {
481 radix_tree_iter_delete(&uapi->radix, &iter, slot);
534 radix_tree_for_each_slot (slot, &uapi->radix, &iter, starting_key) {
570 radix_tree_iter_delete(&uapi->radix, &iter, slot);
653 INIT_RADIX_TREE(&uapi->radix, GFP_KERNE
[all...]
H A Drdma_core.h83 * Depending on ID the slot pointer in the radix tree points at one of these
114 /* radix tree contains struct uverbs_api_* pointers */
115 struct radix_tree_root radix; member in struct:uverbs_api
138 res = radix_tree_lookup(&uapi->radix, uapi_key_obj(object_id));
/linux-master/drivers/media/usb/pvrusb2/
H A Dpvrusb2-debugifc.c83 int radix = 10; local
86 radix = 16;
90 radix = 8;
95 if (val < 0 || val >= radix)
97 result *= radix;
/linux-master/drivers/gpu/drm/i915/gem/
H A Di915_gem_pages.c180 radix_tree_for_each_slot(slot, &obj->mm.get_page.radix, &iter, 0)
181 radix_tree_delete(&obj->mm.get_page.radix, iter.index);
182 radix_tree_for_each_slot(slot, &obj->mm.get_dma_page.radix, &iter, 0)
183 radix_tree_delete(&obj->mm.get_dma_page.radix, iter.index);
567 ret = radix_tree_insert(&iter->radix, idx, sg);
573 ret = radix_tree_insert(&iter->radix, idx + i, entry);
607 sg = radix_tree_lookup(&iter->radix, n);
611 * the radix tree will contain a value entry that points
620 sg = radix_tree_lookup(&iter->radix, base);
H A Di915_gem_context_types.h15 #include <linux/radix-tree.h>
H A Di915_gem_object_types.h236 struct radix_tree_root radix; member in struct:i915_gem_object_page_iter
/linux-master/drivers/md/dm-vdo/
H A DMakefile54 indexer/radix-sort.o \
/linux-master/arch/powerpc/kvm/
H A Dbook3s_hv_ras.c86 tlbiel_all_lpid(vcpu->kvm->arch.radix);
103 tlbiel_all_lpid(vcpu->kvm->arch.radix);
/linux-master/drivers/net/ethernet/netronome/nfp/abm/
H A Dmain.h9 #include <linux/radix-tree.h>
/linux-master/arch/s390/include/asm/
H A Dgmap.h12 #include <linux/radix-tree.h>
28 * @guest_to_host: radix tree with guest to host address translation
29 * @host_to_guest: radix tree with pointer to segment table entries
36 * @host_to_rmap: radix tree with gmap_rmap lists

Completed in 242 milliseconds

123