Home
last modified time | relevance | path

Searched refs:mas (Results 1 – 25 of 26) sorted by relevance

12

/linux/lib/
H A Dmaple_tree.c200 static void mas_set_height(struct ma_state *mas) in mas_set_height() argument
202 unsigned int new_flags = mas->tree->ma_flags; in mas_set_height()
205 MAS_BUG_ON(mas, mas->depth > MAPLE_HEIGHT_MAX); in mas_set_height()
206 new_flags |= mas->depth << MT_FLAGS_HEIGHT_OFFSET; in mas_set_height()
207 mas->tree->ma_flags = new_flags; in mas_set_height()
210 static unsigned int mas_mt_height(struct ma_state *mas) in mas_mt_height() argument
212 return mt_height(mas->tree); in mas_mt_height()
252 static __always_inline void mas_set_err(struct ma_state *mas, long err) in mas_set_err() argument
254 mas->node = MA_ERROR(err); in mas_set_err()
255 mas->status = ma_error; in mas_set_err()
[all …]
H A Dtest_maple_tree.c22 #define mas_dump(mas) do {} while (0) argument
23 #define mas_wr_dump(mas) do {} while (0) argument
352 MA_STATE(mas, mt, 0, 0); in check_rev_find()
359 mas_set(&mas, 1000); in check_rev_find()
360 val = mas_find_rev(&mas, 1000); in check_rev_find()
362 val = mas_find_rev(&mas, 1000); in check_rev_find()
365 mas_set(&mas, 999); in check_rev_find()
366 val = mas_find_rev(&mas, 997); in check_rev_find()
369 mas_set(&mas, 1000); in check_rev_find()
370 val = mas_find_rev(&mas, 900); in check_rev_find()
[all …]
/linux/drivers/spi/
H A Dspi-geni-qcom.c106 static void spi_slv_setup(struct spi_geni_master *mas) in spi_slv_setup() argument
108 struct geni_se *se = &mas->se; in spi_slv_setup()
113 dev_dbg(mas->dev, "spi slave setup done\n"); in spi_slv_setup()
117 struct spi_geni_master *mas, in get_spi_clk_cfg() argument
125 ret = geni_se_clk_freq_match(&mas->se, in get_spi_clk_cfg()
126 speed_hz * mas->oversampling, in get_spi_clk_cfg()
129 dev_err(mas->dev, "Failed(%d) to find src clk for %dHz\n", in get_spi_clk_cfg()
134 *clk_div = DIV_ROUND_UP(sclk_freq, mas->oversampling * speed_hz); in get_spi_clk_cfg()
135 actual_hz = sclk_freq / (mas->oversampling * *clk_div); in get_spi_clk_cfg()
137 dev_dbg(mas->dev, "req %u=>%u sclk %lu, idx %d, div %d\n", speed_hz, in get_spi_clk_cfg()
[all …]
/linux/include/linux/
H A Dmaple_tree.h272 #define mtree_lock_nested(mas, subclass) \
455 struct ma_state *mas; argument
456 struct maple_node *node; /* Decoded mas->node */ argument
459 enum maple_type type; /* mas->node type */
461 unsigned long *pivots; /* mas->node->pivots pointer */
463 void __rcu **slots; /* mas->node->slots pointer */
468 #define mas_lock(mas) spin_lock(&((mas)->tree->ma_lock))
469 #define mas_lock_nested(mas, subclass) \
470 spin_lock_nested(&((mas)
260 mtree_lock_nested(mas,subclass) global() argument
442 struct ma_state *mas; global() member
458 mas_unlock(mas) global() argument
530 mas_init(struct ma_state * mas,struct maple_tree * tree,unsigned long addr) mas_init() argument
541 mas_is_active(struct ma_state * mas) mas_is_active() argument
546 mas_is_err(struct ma_state * mas) mas_is_err() argument
561 mas_reset(struct ma_state * mas) mas_reset() argument
715 __mas_set_range(struct ma_state * mas,unsigned long start,unsigned long last) __mas_set_range() argument
736 mas_set_range(struct ma_state * mas,unsigned long start,unsigned long last) mas_set_range() argument
751 mas_set(struct ma_state * mas,unsigned long index) mas_set() argument
[all...]
H A Dmm.h998 return mas_find(&vmi->mas, max - 1); in vma_find()
1007 return mas_find(&vmi->mas, ULONG_MAX); in vma_next()
1013 return mas_next_range(&vmi->mas, ULONG_MAX); in vma_iter_next_range()
1019 return mas_prev(&vmi->mas, 0); in vma_prev()
1025 __mas_set_range(&vmi->mas, start, end - 1); in vma_iter_clear_gfp()
1026 mas_store_gfp(&vmi->mas, NULL, gfp); in vma_iter_clear_gfp()
1027 if (unlikely(mas_is_err(&vmi->mas))) in vma_iter_clear_gfp()
1036 mas_destroy(&vmi->mas); in vma_iter_free()
1042 vmi->mas.index = vma->vm_start; in vma_iter_bulk_store()
1043 vmi->mas.last = vma->vm_end - 1; in vma_iter_bulk_store()
[all …]
/linux/include/trace/events/
H A Dmaple_tree.h15 TP_PROTO(const char *fn, struct ma_state *mas),
17 TP_ARGS(fn, mas),
30 __entry->min = mas->min;
31 __entry->max = mas->max;
32 __entry->index = mas->index;
33 __entry->last = mas->last;
34 __entry->node = mas->node;
48 TP_PROTO(const char *fn, struct ma_state *mas),
50 TP_ARGS(fn, mas),
63 __entry->min = mas->min;
[all …]
/linux/mm/
H A Dinternal.h339 void free_pgtables(struct mmu_gather *tlb, struct ma_state *mas, in force_page_cache_readahead()
H A Ddebug.c297 mas_dump(&vmi->mas);
298 mt_dump(vmi->mas.tree, mt_dump_hex);
H A Dmmap.c1383 mt_init_flags(&mt_detach, vmi.mas.tree->ma_flags & MT_FLAGS_LOCK_MASK); in do_mmap()
1573 unmap_region(&vmi.mas, vma, vmg.prev, vmg.next);
1864 unmap_vmas(&tlb, &vmi.mas, vma, 0, ULONG_MAX, ULONG_MAX, false); in generic_get_unmapped_area_topdown()
1875 free_pgtables(&tlb, &vmi.mas, vma, FIRST_USER_ADDRESS, in generic_get_unmapped_area_topdown()
2402 remove_mt(struct mm_struct * mm,struct ma_state * mas) remove_mt() argument
2425 unmap_region(struct mm_struct * mm,struct ma_state * mas,struct vm_area_struct * vma,struct vm_area_struct * prev,struct vm_area_struct * next,unsigned long start,unsigned long end,unsigned long tree_end,bool mm_wr_locked) unmap_region() argument
H A Dmemory.c364 void free_pgtables(struct mmu_gather *tlb, struct ma_state *mas, in free_pgtables() argument
378 next = mas_find(mas, ceiling - 1); in free_pgtables()
404 next = mas_find(mas, ceiling - 1); in free_pgtables()
1881 void unmap_vmas(struct mmu_gather *tlb, struct ma_state *mas, in unmap_vmas() argument
1903 vma = mas_find(mas, tree_end - 1); in unmap_vmas()
6219 MA_STATE(mas, &mm->mm_mt, address, address); in lock_vma_under_rcu()
6224 vma = mas_walk(&mas); in lock_vma_under_rcu()
/linux/tools/testing/radix-tree/
H A Dmaple.c66 static int get_alloc_node_count(struct ma_state *mas) in get_alloc_node_count() argument
69 struct maple_alloc *node = mas->alloc; in get_alloc_node_count()
80 static void check_mas_alloc_node_count(struct ma_state *mas) in check_mas_alloc_node_count() argument
82 mas_node_count_gfp(mas, MAPLE_ALLOC_SLOTS + 1, GFP_KERNEL); in check_mas_alloc_node_count()
83 mas_node_count_gfp(mas, MAPLE_ALLOC_SLOTS + 3, GFP_KERNEL); in check_mas_alloc_node_count()
84 MT_BUG_ON(mas->tree, get_alloc_node_count(mas) != mas->alloc->total); in check_mas_alloc_node_count()
85 mas_destroy(mas); in check_mas_alloc_node_count()
100 MA_STATE(mas, mt, 0, 0); in check_new_node()
102 check_mas_alloc_node_count(&mas); in check_new_node()
108 mas_node_count(&mas, 3); in check_new_node()
[all …]
/linux/mm/damon/
H A Dvaddr-test.h
/linux/kernel/irq/
H A Dirqdesc.c153 MA_STATE(mas, &sparse_irqs, 0, 0); in irq_find_free_area()
155 if (mas_empty_area(&mas, from, MAX_SPARSE_IRQS, cnt)) in irq_find_free_area()
157 return mas.index; in irq_find_free_area()
173 MA_STATE(mas, &sparse_irqs, irq, irq); in irq_insert_desc()
174 WARN_ON(mas_store_gfp(&mas, desc, GFP_KERNEL) != 0); in irq_insert_desc()
179 MA_STATE(mas, &sparse_irqs, irq, irq); in delete_irq_desc()
180 mas_erase(&mas); in delete_irq_desc()
/linux/drivers/gpu/drm/nouveau/
H A Dnouveau_uvmm.c282 MA_STATE(mas, &uvmm->region_mt, addr, addr); in __nouveau_uvma_region_insert()
284 if (unlikely(mas_walk(&mas))) in __nouveau_uvma_region_insert()
287 if (unlikely(mas.last < last)) in __nouveau_uvma_region_insert()
290 mas.index = addr; in __nouveau_uvma_region_insert()
291 mas.last = last; in __nouveau_uvma_region_insert()
293 mas_store_gfp(&mas, reg, GFP_KERNEL); in __nouveau_uvma_region_insert()
322 MA_STATE(mas, &uvmm->region_mt, reg->va.addr, 0); in nouveau_uvma_region_remove()
324 mas_erase(&mas); in nouveau_uvma_region_remove()
362 MA_STATE(mas, &uvmm->region_mt, addr, 0); in nouveau_uvma_region_find_first()
364 return mas_find(&mas, addr + range - 1); in nouveau_uvma_region_find_first()
[all …]
H A Dnouveau_debugfs.c209 MA_STATE(mas, &uvmm->region_mt, 0, 0); in nouveau_debugfs_gpuva_regions()
214 mas_for_each(&mas, reg, ULONG_MAX) in nouveau_debugfs_gpuva_regions()
/linux/Documentation/core-api/
H A Dmaple_tree.rst145 The advanced API is based around the ma_state, this is where the 'mas'
152 The maple state keeps track of the range start and end in mas->index and
153 mas->last, respectively.
155 mas_walk() will walk the tree to the location of mas->index and set the
156 mas->index and mas->last according to the range for the entry.
/linux/drivers/media/i2c/
H A Dmax9286.c749 struct max9286_asd *mas; in max9286_v4l2_notifier_register() local
751 mas = v4l2_async_nf_add_fwnode(&priv->notifier, source->fwnode, in max9286_v4l2_notifier_register()
753 if (IS_ERR(mas)) { in max9286_v4l2_notifier_register()
755 i, PTR_ERR(mas)); in max9286_v4l2_notifier_register()
757 return PTR_ERR(mas); in max9286_v4l2_notifier_register()
760 mas->source = source; in max9286_v4l2_notifier_register()
/linux/drivers/media/pci/saa7164/
H A Dsaa7164-api.c615 u8 mas; in saa7164_api_set_dif() local
621 mas = 0xd0; in saa7164_api_set_dif()
623 mas = 0xe0; in saa7164_api_set_dif()
639 buf[0x0a] = mas; in saa7164_api_set_dif()
/linux/kernel/
H A Dfork.c666 mt_clear_in_rcu(vmi.mas.tree); in dup_mmap()
762 mt_set_in_rcu(vmi.mas.tree); in dup_mmap()
771 mas_set_range(&vmi.mas, mpnt->vm_start, mpnt->vm_end - 1); in dup_mmap()
772 mas_store(&vmi.mas, XA_ZERO_ENTRY); in dup_mmap()
/linux/fs/
H A Dlibfs.c497 MA_STATE(mas, &octx->mt, offset, offset); in offset_find_next()
501 child = mas_find(&mas, LONG_MAX); in offset_find_next()
/linux/tools/power/cpupower/po/
H A Dpt.po639 "- Tentando setar uma frequência específica, mas o regulador em nível de "
/linux/Documentation/translations/sp_SP/process/
H A Dadding-syscalls.rst153 debería considerar también si una versión :manpage:`xyzzyat(2)` es mas
H A Dhandling-regressions.rst159 * Cambiar a un kernel nuevo o mas antiguo -- rebajarse a una versión
H A Dsubmitting-patches.rst910 NO!!!! Gente, no mas bombas enormes de parches a linux-kernel@vger.kernel.org!
H A Dcoding-style.rst323 variable ``tmp``, que es mucho más fácil de escribir, y no es mas difícil

12