/openbmc/linux/arch/arm64/kvm/hyp/nvhe/ |
H A D | page_alloc.c | 25 * Order 2 1 0 28 * __find_buddy_nocheck(pool, page 0, order 0) => page 1 29 * __find_buddy_nocheck(pool, page 0, order 1) => page 2 30 * __find_buddy_nocheck(pool, page 1, order 0) => page 0 31 * __find_buddy_nocheck(pool, page 2, order 0) => page 3 35 unsigned short order) in __find_buddy_nocheck() argument 39 addr ^= (PAGE_SIZE << order); in __find_buddy_nocheck() 54 unsigned short order) in __find_buddy_avail() argument 56 struct hyp_page *buddy = __find_buddy_nocheck(pool, p, order); in __find_buddy_avail() 58 if (!buddy || buddy->order != order || buddy->refcount) in __find_buddy_avail() [all …]
|
/openbmc/linux/scripts/atomic/ |
H A D | gen-atomic-fallback.sh | 8 #gen_template_fallback(template, meta, pfx, name, sfx, order, atomic, int, args...) 16 local order="$1"; shift 28 #gen_order_fallback(meta, pfx, name, sfx, order, atomic, int, args...) 35 local order="$1"; shift 37 local tmpl_order=${order#_} 39 gen_template_fallback "${tmpl}" "${meta}" "${pfx}" "${name}" "${sfx}" "${order}" "$@" 42 #gen_proto_fallback(meta, pfx, name, sfx, order, atomic, int, args...) 49 local order="$1"; shift 51 local tmpl="$(find_fallback_template "${pfx}" "${name}" "${sfx}" "${order}")" 52 gen_template_fallback "${tmpl}" "${meta}" "${pfx}" "${name}" "${sfx}" "${order}" "$@" [all …]
|
H A D | gen-atomic-instrumented.sh | 37 local order="$1"; shift 39 if [ "${order}" = "_release" ]; then 41 elif [ -z "${order}" ] && ! meta_in "$meta" "slv"; then 52 #gen_proto_order_variant(meta, pfx, name, sfx, order, atomic, int, arg...) 59 local order="$1"; shift 63 local atomicname="${atomic}_${pfx}${name}${sfx}${order}" 67 local checks="$(gen_params_checks "${meta}" "${order}" "$@")" 71 gen_kerneldoc "" "${meta}" "${pfx}" "${name}" "${sfx}" "${order}" "${atomic}" "${int}" "$@" 88 local order="$1"; shift 92 case "$order" in [all …]
|
/openbmc/linux/include/trace/events/ |
H A D | compaction.h | 168 int order, 172 TP_ARGS(order, gfp_mask, prio), 175 __field(int, order) 181 __entry->order = order; 186 TP_printk("order=%d gfp_mask=%s priority=%d", 187 __entry->order, 195 int order, 198 TP_ARGS(zone, order, ret), 203 __field(int, order) 210 __entry->order = order; [all …]
|
H A D | vmscan.h | 68 TP_PROTO(int nid, int zid, int order), 70 TP_ARGS(nid, zid, order), 75 __field( int, order ) 81 __entry->order = order; 84 TP_printk("nid=%d order=%d", 86 __entry->order) 91 TP_PROTO(int nid, int zid, int order, gfp_t gfp_flags), 93 TP_ARGS(nid, zid, order, gfp_flags), 98 __field( int, order ) 105 __entry->order = order; [all …]
|
H A D | kmem.h | 138 TP_PROTO(struct page *page, unsigned int order), 140 TP_ARGS(page, order), 144 __field( unsigned int, order ) 149 __entry->order = order; 152 TP_printk("page=%p pfn=0x%lx order=%d", 155 __entry->order) 172 TP_printk("page=%p pfn=0x%lx order=0", 179 TP_PROTO(struct page *page, unsigned int order, 182 TP_ARGS(page, order, gfp_flags, migratetype), 186 __field( unsigned int, order ) [all …]
|
/openbmc/linux/drivers/net/ethernet/mellanox/mlx5/core/steering/ |
H A D | dr_buddy.c | 29 /* Allocating max_order bitmaps, one for each order */ in mlx5dr_buddy_init() 39 /* In the beginning, we have only one order that is available for in mlx5dr_buddy_init() 75 unsigned int *order) in dr_buddy_find_free_seg() argument 88 "ICM Buddy: failed finding free mem for order %d\n", in dr_buddy_find_free_seg() 99 *order = order_iter; in dr_buddy_find_free_seg() 106 * @order: Order of the buddy to update. 110 * It uses the data structures of the buddy system in order to find the first 111 * area of free place, starting from the current order till the maximum order 120 unsigned int order, in mlx5dr_buddy_alloc_mem() argument 126 err = dr_buddy_find_free_seg(buddy, order, &seg, &order_iter); in mlx5dr_buddy_alloc_mem() [all …]
|
/openbmc/linux/drivers/gpu/drm/tests/ |
H A D | drm_buddy_test.c | 21 static inline u64 get_size(int order, u64 chunk_size) in get_size() argument 23 return (1 << order) * chunk_size; in get_size() 49 …kunit_err(test, "block info: header=%llx, state=%u, order=%d, offset=%llx size=%llx root=%d buddy=… in __dump_block() 228 unsigned int order; in check_mm() local 244 order = drm_buddy_block_order(root); in check_mm() 247 if (order != mm->max_order) { in check_mm() 248 kunit_err(test, "max order root missing\n"); in check_mm() 268 block = list_first_entry_or_null(&mm->free_list[order], in check_mm() 271 kunit_err(test, "root mismatch at order=%u\n", order); in check_mm() 331 int order, top; in drm_test_buddy_alloc_pathological() local [all …]
|
/openbmc/linux/mm/ |
H A D | page_alloc.c | 229 static void __free_pages_ok(struct page *page, unsigned int order, 303 static bool page_contains_unaccepted(struct page *page, unsigned int order); 304 static void accept_page(struct page *page, unsigned int order); 305 static bool cond_accept_memory(struct zone *zone, unsigned int order); 331 _deferred_grow_zone(struct zone *zone, unsigned int order) in _deferred_grow_zone() argument 333 return deferred_grow_zone(zone, order); in _deferred_grow_zone() 520 static inline unsigned int order_to_pindex(int migratetype, int order) in order_to_pindex() argument 525 if (order > PAGE_ALLOC_COSTLY_ORDER) { in order_to_pindex() 526 VM_BUG_ON(order != pageblock_order); in order_to_pindex() 533 VM_BUG_ON(order > PAGE_ALLOC_COSTLY_ORDER); in order_to_pindex() [all …]
|
/openbmc/linux/drivers/gpu/drm/ttm/ |
H A D | ttm_pool.c | 54 * @vaddr: original vaddr return for the mapping and order in the lower bits 78 /* Allocate pages of size 1 << order with the given gfp_flags */ 80 unsigned int order) in ttm_pool_alloc_page() argument 87 /* Don't set the __GFP_COMP flag for higher order allocations. in ttm_pool_alloc_page() 91 if (order) in ttm_pool_alloc_page() 96 p = alloc_pages_node(pool->nid, gfp_flags, order); in ttm_pool_alloc_page() 98 p->private = order; in ttm_pool_alloc_page() 106 if (order) in ttm_pool_alloc_page() 109 vaddr = dma_alloc_attrs(pool->dev, (1ULL << order) * PAGE_SIZE, in ttm_pool_alloc_page() 122 dma->vaddr = (unsigned long)vaddr | order; in ttm_pool_alloc_page() [all …]
|
/openbmc/linux/lib/ |
H A D | test_xarray.c | 72 unsigned order, void *entry, gfp_t gfp) in xa_store_order() argument 74 XA_STATE_ORDER(xas, xa, index, order); in xa_store_order() 177 unsigned int order; in check_xa_mark_1() local 207 for (order = 2; order < max_order; order++) { in check_xa_mark_1() 208 unsigned long base = round_down(index, 1UL << order); in check_xa_mark_1() 209 unsigned long next = base + (1UL << order); in check_xa_mark_1() 217 xa_store_order(xa, index, order, xa_mk_index(index), in check_xa_mark_1() 328 unsigned int order; in check_xa_shrink() local 353 for (order = 0; order < max_order; order++) { in check_xa_shrink() 354 unsigned long max = (1UL << order) - 1; in check_xa_shrink() [all …]
|
/openbmc/linux/kernel/bpf/ |
H A D | cgroup_iter.c | 13 * 1. Walk the descendants of a cgroup in pre-order. 14 * 2. Walk the descendants of a cgroup in post-order. 18 * For walking descendants, cgroup_iter can walk in either pre-order or 19 * post-order. For walking ancestors, the iter walks up from a cgroup to 40 * EOPNOTSUPP. In order to work around, the user may have to update their 54 int order; member 77 if (p->order == BPF_CGROUP_ITER_DESCENDANTS_PRE) in cgroup_iter_seq_start() 79 else if (p->order == BPF_CGROUP_ITER_DESCENDANTS_POST) in cgroup_iter_seq_start() 110 if (p->order == BPF_CGROUP_ITER_DESCENDANTS_PRE) in cgroup_iter_seq_next() 112 else if (p->order == BPF_CGROUP_ITER_DESCENDANTS_POST) in cgroup_iter_seq_next() [all …]
|
/openbmc/linux/tools/testing/radix-tree/ |
H A D | multiorder.c | 3 * multiorder.c: Multi-order radix tree entry testing 16 unsigned order) in item_insert_order() argument 18 XA_STATE_ORDER(xas, xa, index, order); in item_insert_order() 19 struct item *item = item_create(index, order); in item_insert_order() 42 int order[NUM_ENTRIES] = {1, 1, 2, 3, 4, 1, 0, 1, 3, 0, 7}; in multiorder_iteration() local 47 err = item_insert_order(xa, index[i], order[i]); in multiorder_iteration() 53 if (j <= (index[i] | ((1 << order[i]) - 1))) in multiorder_iteration() 58 int height = order[i] / XA_CHUNK_SHIFT; in multiorder_iteration() 60 unsigned long mask = (1UL << order[i]) - 1; in multiorder_iteration() 66 assert(item->order == order[i]); in multiorder_iteration() [all …]
|
/openbmc/openbmc/meta-openembedded/meta-python/recipes-devtools/python/python3-pylint/ |
H A D | 0001-Adjust-test-expectations-for-ptest.patch | 17 @@ -3,14 +3,14 @@ wrong-import-order:14:0:14:10::"standard 18 …wrong-import-order:15:0:15:15::"standard import ""datetime"" should be placed before third party i… 19 …wrong-import-order:18:0:18:22::"third party import ""totally_missing"" should be placed before loc… 20 …wrong-import-order:20:0:20:14::"third party import ""astroid"" should be placed before local impor… 21 -wrong-import-order:22:0:22:22::"first party import ""pylint.checkers"" should be placed before loc… 22 -wrong-import-order:23:0:23:25::"first party import ""pylint.config"" should be placed before local… 23 -wrong-import-order:24:0:24:17::"first party import ""pylint.sys"" should be placed before local im… 24 -wrong-import-order:25:0:25:28::"first party import ""pylint.pyreverse"" should be placed before lo… 25 -wrong-import-order:30:0:30:40::"third party import ""six.moves.urllib.parse.quote"" should be plac… 26 -wrong-import-order:31:0:31:23::"first party import ""pylint.constants"" should be placed before lo… [all …]
|
/openbmc/linux/arch/arm/lib/ |
H A D | lib1funcs.S | 106 .macro ARM_DIV2_ORDER divisor, order argument 110 clz \order, \divisor 111 rsb \order, \order, #31 117 movhs \order, #16 118 movlo \order, #0 122 addhs \order, \order, #8 126 addhs \order, \order, #4 129 addhi \order, \order, #3 130 addls \order, \order, \divisor, lsr #1 137 .macro ARM_MOD_BODY dividend, divisor, order, spare [all …]
|
/openbmc/linux/mm/kmsan/ |
H A D | init.c | 105 * by their order: when kmsan_memblock_free_pages() is called for the first 106 * time with a certain order, it is reserved as a shadow block, for the second 109 * after which held_back[order] can be used again. 114 bool kmsan_memblock_free_pages(struct page *page, unsigned int order) in kmsan_memblock_free_pages() argument 118 if (!held_back[order].shadow) { in kmsan_memblock_free_pages() 119 held_back[order].shadow = page; in kmsan_memblock_free_pages() 122 if (!held_back[order].origin) { in kmsan_memblock_free_pages() 123 held_back[order].origin = page; in kmsan_memblock_free_pages() 126 shadow = held_back[order].shadow; in kmsan_memblock_free_pages() 127 origin = held_back[order].origin; in kmsan_memblock_free_pages() [all …]
|
/openbmc/u-boot/arch/arm/lib/ |
H A D | lib1funcs.S | 92 .macro ARM_DIV2_ORDER divisor, order argument 96 clz \order, \divisor 97 rsb \order, \order, #31 103 movhs \order, #16 104 movlo \order, #0 108 addhs \order, \order, #8 112 addhs \order, \order, #4 115 addhi \order, \order, #3 116 addls \order, \order, \divisor, lsr #1 123 .macro ARM_MOD_BODY dividend, divisor, order, spare [all …]
|
/openbmc/linux/drivers/gpu/drm/lib/ |
H A D | drm_random.c | 16 void drm_random_reorder(unsigned int *order, unsigned int count, in drm_random_reorder() argument 24 swap(order[i], order[j]); in drm_random_reorder() 31 unsigned int *order, i; in drm_random_order() local 33 order = kmalloc_array(count, sizeof(*order), GFP_KERNEL); in drm_random_order() 34 if (!order) in drm_random_order() 35 return order; in drm_random_order() 38 order[i] = i; in drm_random_order() 40 drm_random_reorder(order, count, state); in drm_random_order() 41 return order; in drm_random_order()
|
/openbmc/linux/drivers/media/pci/cx18/ |
H A D | cx18-mailbox.c | 231 static void epu_dma_done(struct cx18 *cx, struct cx18_in_work_order *order) in epu_dma_done() argument 240 mb = &order->mb; in epu_dma_done() 247 (order->flags & CX18_F_EWO_MB_STALE_UPON_RECEIPT) ? in epu_dma_done() 253 mdl_ack = order->mdl_ack; in epu_dma_done() 277 if ((order->flags & CX18_F_EWO_MB_STALE_UPON_RECEIPT) && in epu_dma_done() 324 static void epu_debug(struct cx18 *cx, struct cx18_in_work_order *order) in epu_debug() argument 327 char *str = order->str; in epu_debug() 329 CX18_DEBUG_INFO("%x %s\n", order->mb.args[0], str); in epu_debug() 335 static void epu_cmd(struct cx18 *cx, struct cx18_in_work_order *order) in epu_cmd() argument 337 switch (order->rpu) { in epu_cmd() [all …]
|
/openbmc/linux/drivers/gpu/drm/ttm/tests/ |
H A D | ttm_pool_test.c | 14 unsigned int order; member 81 unsigned long order = __fls(size / PAGE_SIZE); in ttm_pool_pre_populated() local 84 tt = ttm_tt_kunit_init(test, order, caching, size); in ttm_pool_pre_populated() 104 .order = 0, 108 .order = 2, 112 .order = MAX_ORDER + 1, 116 .order = 0, 121 .order = MAX_ORDER + 1, 144 unsigned int expected_num_pages = 1 << params->order; in ttm_pool_alloc_basic() 168 if (params->order <= MAX_ORDER) { in ttm_pool_alloc_basic() [all …]
|
/openbmc/linux/arch/riscv/mm/ |
H A D | hugetlbpage.c | 35 unsigned long order; in huge_pte_alloc() local 68 for_each_napot_order(order) { in huge_pte_alloc() 69 if (napot_cont_size(order) == sz) { in huge_pte_alloc() 70 pte = pte_alloc_huge(mm, pmd, addr & napot_cont_mask(order)); in huge_pte_alloc() 88 unsigned long order; in huge_pte_offset() local 119 for_each_napot_order(order) { in huge_pte_offset() 120 if (napot_cont_size(order) == sz) { in huge_pte_offset() 121 pte = pte_offset_huge(pmd, addr & napot_cont_mask(order)); in huge_pte_offset() 186 unsigned long order; in arch_make_huge_pte() local 188 for_each_napot_order(order) { in arch_make_huge_pte() [all …]
|
/openbmc/linux/arch/riscv/kvm/ |
H A D | tlb.c | 22 unsigned long order) in kvm_riscv_local_hfence_gvma_vmid_gpa() argument 26 if (PTRS_PER_PTE < (gpsz >> order)) { in kvm_riscv_local_hfence_gvma_vmid_gpa() 33 for (pos = gpa; pos < (gpa + gpsz); pos += BIT(order)) in kvm_riscv_local_hfence_gvma_vmid_gpa() 38 for (pos = gpa; pos < (gpa + gpsz); pos += BIT(order)) in kvm_riscv_local_hfence_gvma_vmid_gpa() 50 unsigned long order) in kvm_riscv_local_hfence_gvma_gpa() argument 54 if (PTRS_PER_PTE < (gpsz >> order)) { in kvm_riscv_local_hfence_gvma_gpa() 61 for (pos = gpa; pos < (gpa + gpsz); pos += BIT(order)) in kvm_riscv_local_hfence_gvma_gpa() 66 for (pos = gpa; pos < (gpa + gpsz); pos += BIT(order)) in kvm_riscv_local_hfence_gvma_gpa() 81 unsigned long order) in kvm_riscv_local_hfence_vvma_asid_gva() argument 85 if (PTRS_PER_PTE < (gvsz >> order)) { in kvm_riscv_local_hfence_vvma_asid_gva() [all …]
|
/openbmc/linux/include/linux/ |
H A D | compaction.h | 61 * Number of free order-0 pages that should be available above given watermark 65 static inline unsigned long compact_gap(unsigned int order) in compact_gap() argument 69 * free scanner may have up to 1 << order pages on its list and then in compact_gap() 70 * try to split an (order - 1) free page. At that point, a gap of in compact_gap() 71 * 1 << order might not be enough, so it's safer to require twice that in compact_gap() 80 return 2UL << order; in compact_gap() 85 extern unsigned int extfrag_for_order(struct zone *zone, unsigned int order); 86 extern int fragmentation_index(struct zone *zone, unsigned int order); 88 unsigned int order, unsigned int alloc_flags, 92 extern bool compaction_suitable(struct zone *zone, int order, [all …]
|
H A D | gfp.h | 63 * The zone fallback order is MOVABLE=>HIGHMEM=>NORMAL=>DMA32=>DMA. 171 static inline void arch_free_page(struct page *page, int order) { } in arch_free_page() argument 174 static inline void arch_alloc_page(struct page *page, int order) { } in arch_alloc_page() argument 177 struct page *__alloc_pages(gfp_t gfp, unsigned int order, int preferred_nid, 179 struct folio *__folio_alloc(gfp_t gfp, unsigned int order, int preferred_nid, 191 /* Bulk allocate order-0 pages */ 232 __alloc_pages_node(int nid, gfp_t gfp_mask, unsigned int order) in __alloc_pages_node() argument 237 return __alloc_pages(gfp_mask, order, nid, NULL); in __alloc_pages_node() 241 struct folio *__folio_alloc_node(gfp_t gfp, unsigned int order, int nid) in __folio_alloc_node() argument 246 return __folio_alloc(gfp, order, nid, NULL); in __folio_alloc_node() [all …]
|
/openbmc/linux/Documentation/userspace-api/media/v4l/ |
H A D | field-order.rst | 3 .. _field-order: 6 Field Order 25 which field of a frame is older, the *temporal order*. 30 even) fields, the *spatial order*: The first line of the top field is 39 creating a natural order. 44 and spatial order of fields. The diagrams below should make this 48 bus in the same order they were captured, so if the top field was 53 order. Some drivers may permit the selection of a different order, to 76 - Applications request this field order when any field format 78 e.g. the requested image size, and return the actual field order. [all …]
|