| /Linux-v5.4/include/trace/events/ |
| D | compaction.h | 173 int order,
177 TP_ARGS(order, gfp_mask, prio),
180 __field(int, order)
186 __entry->order = order;
191 TP_printk("order=%d gfp_mask=%s priority=%d",
192 __entry->order,
200 int order,
203 TP_ARGS(zone, order, ret),
208 __field(int, order)
215 __entry->order = order;
[all …]
|
| D | kmem.h | 154 TP_PROTO(struct page *page, unsigned int order),
156 TP_ARGS(page, order),
160 __field( unsigned int, order )
165 __entry->order = order;
168 TP_printk("page=%p pfn=%lu order=%d",
171 __entry->order)
188 TP_printk("page=%p pfn=%lu order=0",
195 TP_PROTO(struct page *page, unsigned int order,
198 TP_ARGS(page, order, gfp_flags, migratetype),
202 __field( unsigned int, order )
[all …]
|
| D | vmscan.h | 54 TP_PROTO(int nid, int zid, int order),
56 TP_ARGS(nid, zid, order),
61 __field( int, order )
67 __entry->order = order;
70 TP_printk("nid=%d order=%d",
72 __entry->order)
77 TP_PROTO(int nid, int zid, int order, gfp_t gfp_flags),
79 TP_ARGS(nid, zid, order, gfp_flags),
84 __field( int, order )
91 __entry->order = order;
[all …]
|
| D | oom.h | 35 int order,
42 TP_ARGS(zoneref, order, reclaimable, available, min_wmark, no_progress_loops, wmark_check),
47 __field( int, order)
58 __entry->order = order;
66 …TP_printk("node=%d zone=%-8s order=%d reclaimable=%lu available=%lu min_wmark=%lu no_progress_loop…
68 __entry->order,
157 TP_PROTO(int order,
164 TP_ARGS(order, priority, result, retries, max_retries, ret),
167 __field( int, order)
176 __entry->order = order;
[all …]
|
| /Linux-v5.4/drivers/gpu/drm/i915/selftests/ |
| D | i915_buddy.c | 17 pr_err("block info: header=%llx, state=%u, order=%d, offset=%llx size=%llx root=%s buddy=%s\n", in __igt_dump_block()
204 unsigned int order; in igt_check_mm() local
220 order = i915_buddy_block_order(root); in igt_check_mm()
223 if (order != mm->max_order) { in igt_check_mm()
224 pr_err("max order root missing\n"); in igt_check_mm()
244 block = list_first_entry_or_null(&mm->free_list[order], in igt_check_mm()
248 pr_err("root mismatch at order=%u\n", order); in igt_check_mm()
318 int order; in igt_buddy_alloc_smoke() local
330 order = max_order; in igt_buddy_alloc_smoke()
335 block = i915_buddy_alloc(&mm, order); in igt_buddy_alloc_smoke()
[all …]
|
| D | i915_random.c | 69 void i915_random_reorder(unsigned int *order, unsigned int count, in i915_random_reorder() argument
72 i915_prandom_shuffle(order, sizeof(*order), count, state); in i915_random_reorder()
77 unsigned int *order, i; in i915_random_order() local
79 order = kmalloc_array(count, sizeof(*order), in i915_random_order()
81 if (!order) in i915_random_order()
82 return order; in i915_random_order()
85 order[i] = i; in i915_random_order()
87 i915_random_reorder(order, count, state); in i915_random_order()
88 return order; in i915_random_order()
|
| D | i915_syncmap.c | 274 unsigned int pass, order; in igt_syncmap_join_above() local
296 for (order = 0; order < 64; order += SHIFT) { in igt_syncmap_join_above()
297 u64 context = BIT_ULL(order); in igt_syncmap_join_above()
335 unsigned int step, order, idx; in igt_syncmap_join_below() local
345 for (order = 64 - SHIFT; order > 0; order -= SHIFT) { in igt_syncmap_join_below()
346 u64 context = step * BIT_ULL(order); in igt_syncmap_join_below()
353 … pr_err("Inserting context=%llx (order=%d, step=%d) did not return leaf (height=%d, prefix=%llx\n", in igt_syncmap_join_below()
354 context, order, step, sync->height, sync->prefix); in igt_syncmap_join_below()
362 for (order = SHIFT; order < 64; order += SHIFT) { in igt_syncmap_join_below()
363 u64 context = step * BIT_ULL(order); in igt_syncmap_join_below()
[all …]
|
| /Linux-v5.4/drivers/staging/media/soc_camera/ |
| D | soc_mediabus.c | 22 .order = SOC_MBUS_ORDER_LE,
32 .order = SOC_MBUS_ORDER_LE,
42 .order = SOC_MBUS_ORDER_LE,
52 .order = SOC_MBUS_ORDER_LE,
62 .order = SOC_MBUS_ORDER_LE,
72 .order = SOC_MBUS_ORDER_BE,
82 .order = SOC_MBUS_ORDER_LE,
92 .order = SOC_MBUS_ORDER_BE,
102 .order = SOC_MBUS_ORDER_LE,
111 .order = SOC_MBUS_ORDER_LE,
[all …]
|
| /Linux-v5.4/arch/arm/lib/ |
| D | lib1funcs.S | 106 .macro ARM_DIV2_ORDER divisor, order
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 …]
|
| /Linux-v5.4/tools/testing/radix-tree/ |
| 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 …]
|
| /Linux-v5.4/drivers/gpu/drm/lib/ |
| D | drm_random.c | 15 void drm_random_reorder(unsigned int *order, unsigned int count, in drm_random_reorder() argument
23 swap(order[i], order[j]); in drm_random_reorder()
30 unsigned int *order, i; in drm_random_order() local
32 order = kmalloc_array(count, sizeof(*order), GFP_KERNEL); in drm_random_order()
33 if (!order) in drm_random_order()
34 return order; in drm_random_order()
37 order[i] = i; in drm_random_order()
39 drm_random_reorder(order, count, state); in drm_random_order()
40 return order; in drm_random_order()
|
| /Linux-v5.4/drivers/media/pci/cx18/ |
| D | cx18-mailbox.c | 230 static void epu_dma_done(struct cx18 *cx, struct cx18_in_work_order *order) in epu_dma_done() argument
239 mb = &order->mb; in epu_dma_done()
246 (order->flags & CX18_F_EWO_MB_STALE_UPON_RECEIPT) ? in epu_dma_done()
252 mdl_ack = order->mdl_ack; in epu_dma_done()
276 if ((order->flags & CX18_F_EWO_MB_STALE_UPON_RECEIPT) && in epu_dma_done()
323 static void epu_debug(struct cx18 *cx, struct cx18_in_work_order *order) in epu_debug() argument
326 char *str = order->str; in epu_debug()
328 CX18_DEBUG_INFO("%x %s\n", order->mb.args[0], str); in epu_debug()
334 static void epu_cmd(struct cx18 *cx, struct cx18_in_work_order *order) in epu_cmd() argument
336 switch (order->rpu) { in epu_cmd()
[all …]
|
| /Linux-v5.4/include/linux/ |
| D | compaction.h | 64 * Number of free order-0 pages that should be available above given watermark
68 static inline unsigned long compact_gap(unsigned int order) in compact_gap() argument
72 * free scanner may have up to 1 << order pages on its list and then in compact_gap()
73 * try to split an (order - 1) free page. At that point, a gap of in compact_gap()
74 * 1 << order might not be enough, so it's safer to require twice that in compact_gap()
83 return 2UL << order; in compact_gap()
93 extern int fragmentation_index(struct zone *zone, unsigned int order);
95 unsigned int order, unsigned int alloc_flags,
99 extern enum compact_result compaction_suitable(struct zone *zone, int order,
102 extern void defer_compaction(struct zone *zone, int order);
[all …]
|
| D | page_owner.h | 11 extern void __reset_page_owner(struct page *page, unsigned int order);
13 unsigned int order, gfp_t gfp_mask);
14 extern void __split_page_owner(struct page *page, unsigned int order);
21 static inline void reset_page_owner(struct page *page, unsigned int order) in reset_page_owner() argument
24 __reset_page_owner(page, order); in reset_page_owner()
28 unsigned int order, gfp_t gfp_mask) in set_page_owner() argument
31 __set_page_owner(page, order, gfp_mask); in set_page_owner()
34 static inline void split_page_owner(struct page *page, unsigned int order) in split_page_owner() argument
37 __split_page_owner(page, order); in split_page_owner()
55 static inline void reset_page_owner(struct page *page, unsigned int order) in reset_page_owner() argument
[all …]
|
| /Linux-v5.4/mm/ |
| D | compaction.c | 48 #define block_start_pfn(pfn, order) round_down(pfn, 1UL << (order)) argument
49 #define block_end_pfn(pfn, order) ALIGN((pfn) + 1, 1UL << (order)) argument
71 unsigned int i, order, nr_pages; in split_map_pages() local
78 order = page_private(page); in split_map_pages()
79 nr_pages = 1 << order; in split_map_pages()
81 post_alloc_hook(page, order, __GFP_MOVABLE); in split_map_pages()
82 if (order) in split_map_pages()
83 split_page(page, order); in split_map_pages()
142 void defer_compaction(struct zone *zone, int order) in defer_compaction() argument
147 if (order < zone->compact_order_failed) in defer_compaction()
[all …]
|
| D | page_alloc.c | 209 * change gfp_allowed_mask in order to avoid using I/O during memory allocations
248 static void __free_pages_ok(struct page *page, unsigned int order);
324 * many cases very high-order allocations like THP are likely to be
383 static inline void kasan_free_nondeferred_pages(struct page *page, int order) in kasan_free_nondeferred_pages() argument
386 kasan_free_pages(page, order); in kasan_free_nondeferred_pages()
657 * Higher-order pages are called "compound pages". They are structured thusly:
667 * The first tail page's ->compound_order holds the order of allocation.
668 * This usage means that zero-order pages may not be compound.
677 void prep_compound_page(struct page *page, unsigned int order) in prep_compound_page() argument
680 int nr_pages = 1 << order; in prep_compound_page()
[all …]
|
| /Linux-v5.4/Documentation/media/uapi/v4l/ |
| D | field-order.rst | 10 .. _field-order:
13 Field Order
32 which field of a frame is older, the *temporal order*.
37 even) fields, the *spatial order*: The first line of the top field is
46 creating a natural order.
51 and spatial order of fields. The diagrams below should make this
55 bus in the same order they were captured, so if the top field was
60 order. Some drivers may permit the selection of a different order, to
83 - Applications request this field order when any field format
85 e.g. the requested image size, and return the actual field order.
[all …]
|
| /Linux-v5.4/arch/s390/mm/ |
| D | page-states.c | 71 static inline void set_page_unused(struct page *page, int order) in set_page_unused() argument
75 for (i = 0; i < (1 << order); i++) in set_page_unused()
82 static inline void set_page_stable_dat(struct page *page, int order) in set_page_stable_dat() argument
86 for (i = 0; i < (1 << order); i++) in set_page_stable_dat()
93 static inline void set_page_stable_nodat(struct page *page, int order) in set_page_stable_nodat() argument
97 for (i = 0; i < (1 << order); i++) in set_page_stable_nodat()
210 void arch_free_page(struct page *page, int order) in arch_free_page() argument
214 set_page_unused(page, order); in arch_free_page()
217 void arch_alloc_page(struct page *page, int order) in arch_alloc_page() argument
222 set_page_stable_dat(page, order); in arch_alloc_page()
[all …]
|
| /Linux-v5.4/tools/testing/selftests/tc-testing/tc-tests/actions/ |
| D | mpls.json | 20 "matchPattern": "action order [0-9]+: mpls.*dec_ttl.*pipe.*index 8 ref",
44 "matchPattern": "action order [0-9]+: mpls.*dec_ttl.*pass.*index 8 ref",
68 "matchPattern": "action order [0-9]+: mpls.*dec_ttl.*drop.*index 8 ref",
92 "matchPattern": "action order [0-9]+: mpls.*dec_ttl.*reclassify.*index 8 ref",
116 "matchPattern": "action order [0-9]+: mpls.*dec_ttl.*continue.*index 8 ref",
140 "matchPattern": "action order [0-9]+: mpls.*jump 10.*index 8 ref",
164 "matchPattern": "action order [0-9]+: mpls.*dec_ttl trap.*index 8 ref",
188 "matchPattern": "action order [0-9]+: mpls.*dec_ttl.*foo.*index 8 ref",
210 "matchPattern": "action order [0-9]+: mpls.*dec_ttl.*label.*20.*pipe",
232 "matchPattern": "action order [0-9]+: mpls.*dec_ttl.*tc.*3.*pipe",
[all …]
|
| D | sample.json | 20 "matchPattern": "action order [0-9]+: sample rate 1/10 group 1.*index 2 ref",
44 "matchPattern": "action order [0-9]+: sample rate 1/700 group 2 continue.*index 2 ref",
68 "matchPattern": "action order [0-9]+: sample rate 1/10000 group 11 drop.*index 22 ref",
92 … "matchPattern": "action order [0-9]+: sample rate 1/20000 group 72 reclassify.*index 100 ref",
116 "matchPattern": "action order [0-9]+: sample rate 1/20 group 2 pipe.*index 100 ref",
140 "matchPattern": "action order [0-9]+: sample rate 1/700 group 25 jump 4.*index 200 ref",
164 "matchPattern": "action order [0-9]+: sample rate 1/0 group 1.*index 2 ref",
188 "matchPattern": "action order [0-9]+: sample rate 1/200000 group 52 foo.*index 1 ref",
210 "matchPattern": "action order [0-9]+: sample.*index 1 ref",
232 "matchPattern": "action order [0-9]+: sample.*group 10.*index 1 ref",
[all …]
|
| D | skbedit.json | 20 "matchPattern": "action order [0-9]*: skbedit mark 1",
44 "matchPattern": "action order [0-9]*: skbedit mark 4294967295.*pipe.*index 1",
68 "matchPattern": "action order [0-9]*: skbedit mark",
90 "matchPattern": "action order [0-9]*: skbedit mark 1/0xaabb",
114 "matchPattern": "action order [0-9]*: skbedit mark 1/0xffffffff",
138 "matchPattern": "action order [0-9]*: skbedit mark 1/0xaabbccddeeff112233",
160 "matchPattern": "action order [0-9]*: skbedit mark 1/-1234",
183 "matchPattern": "action order [0-9]*: skbedit mark 1/0xaabb",
207 "matchPattern": "action order [0-9]*: skbedit priority :99",
231 "matchPattern": "action order [0-9]*: skbedit priority",
[all …]
|
| D | ife.json | 20 …"matchPattern": "action order [0-9]*: ife encode action pass.*type 0[xX]ED3E.*allow mark.*index 2",
44 … "matchPattern": "action order [0-9]*: ife encode action pipe.*type 0[xX]ED3E.*use mark.*index 2",
68 …"matchPattern": "action order [0-9]*: ife encode action continue.*type 0[xX]ED3E.*allow mark.*inde…
92 …"matchPattern": "action order [0-9]*: ife encode action drop.*type 0[xX]ED3E.*use mark 789.*index …
116 …"matchPattern": "action order [0-9]*: ife encode action reclassify.*type 0[xX]ED3E.*use mark 65676…
140 …"matchPattern": "action order [0-9]*: ife encode action jump 1.*type 0[xX]ED3E.*use mark 65.*index…
164 …"matchPattern": "action order [0-9]*: ife encode action reclassify.*type 0[xX]ED3E.*use mark 42949…
188 …"matchPattern": "action order [0-9]*: ife encode action pipe.*type 0[xX]ED3E.*use mark 42949672959…
210 …"matchPattern": "action order [0-9]*: ife encode action pass.*type 0[xX]ED3E.*allow prio.*index 9",
234 …"matchPattern": "action order [0-9]*: ife encode action pipe.*type 0[xX]ED3E.*use prio 7.*index 9",
[all …]
|
| /Linux-v5.4/Documentation/trace/postprocess/ |
| D | trace-vmscan-postprocess.pl | 31 # Per-order events
110 my $regex_direct_begin_default = 'order=([0-9]*) may_writepage=([0-9]*) gfp_flags=([A-Z_|]*)';
112 my $regex_kswapd_wake_default = 'nid=([0-9]*) order=([0-9]*)';
114 my $regex_wakeup_kswapd_default = 'nid=([0-9]*) zid=([0-9]*) order=([0-9]*) gfp_flags=([A-Z_|]*)';
115 my $regex_lru_isolate_default = 'isolate_mode=([0-9]*) classzone_idx=([0-9]*) order=([0-9]*) nr_req…
166 # Verify fields are in the right order
187 "order", "may_writepage",
196 "nid", "order");
204 "nid", "zid", "order", "gfp_flags");
208 "isolate_mode", "classzone_idx", "order",
[all …]
|
| /Linux-v5.4/drivers/pci/endpoint/ |
| D | pci-epc-mem.c | 16 * pci_epc_mem_get_order() - determine the allocation order of a memory size
18 * @size: the size for which to get the order
21 * always gets order with a constant PAGE_SIZE.
25 int order; in pci_epc_mem_get_order() local
31 order = fls(size); in pci_epc_mem_get_order()
33 order = fls64(size); in pci_epc_mem_get_order()
35 return order; in pci_epc_mem_get_order()
128 int order; in pci_epc_mem_alloc_addr() local
131 order = pci_epc_mem_get_order(mem, size); in pci_epc_mem_alloc_addr()
133 pageno = bitmap_find_free_region(mem->bitmap, mem->pages, order); in pci_epc_mem_alloc_addr()
[all …]
|
| /Linux-v5.4/lib/ |
| D | test_xarray.c | 68 unsigned order, void *entry, gfp_t gfp) in xa_store_order() argument
70 XA_STATE_ORDER(xas, xa, index, order); in xa_store_order()
173 unsigned int order; in check_xa_mark_1() local
203 for (order = 2; order < max_order; order++) { in check_xa_mark_1()
204 unsigned long base = round_down(index, 1UL << order); in check_xa_mark_1()
205 unsigned long next = base + (1UL << order); in check_xa_mark_1()
213 xa_store_order(xa, index, order, xa_mk_index(index), in check_xa_mark_1()
302 unsigned int order; in check_xa_shrink() local
327 for (order = 0; order < max_order; order++) { in check_xa_shrink()
328 unsigned long max = (1UL << order) - 1; in check_xa_shrink()
[all …]
|
