Home
last modified time | relevance | path

Searched refs:order (Results 1 – 12 of 12) sorted by relevance

/lib/
A Dtest_xarray.c207 for (order = 2; order < max_order; order++) { in check_xa_mark_1()
353 for (order = 0; order < max_order; order++) { in check_xa_shrink()
1240 for (order = 5; order < order_limit; order++) { in check_multi_find_3()
1404 for (order = 0; order < 20; order++) { in check_find_entry()
1438 for (order = 0; order < order_limit; order++) { in check_pause()
1466 for (order = order_limit - 1; order >= 0; order--) { in check_pause()
1772 for (order = 0; order < max_order; order++) { in check_create_range()
2061 for (order = 1; order < 12; order++) { in check_account()
2094 for (order = 0; order < max_order; order++) { in check_get_order()
2113 for (order = 0; order < max_order; order++) { in check_xas_get_order()
[all …]
A Dtest_kho.c80 unsigned int order = folio_order(folio); in kho_test_save_data() local
138 int order = get_random_u32() % NR_PAGE_ORDERS; in kho_test_generate_data() local
144 if (alloc_size + (PAGE_SIZE << order) > max_mem) { in kho_test_generate_data()
145 order = get_order(max_mem - alloc_size); in kho_test_generate_data()
146 if (order) in kho_test_generate_data()
147 order--; in kho_test_generate_data()
149 size = PAGE_SIZE << order; in kho_test_generate_data()
151 folio = folio_alloc(GFP_KERNEL | __GFP_NORETRY, order); in kho_test_generate_data()
220 unsigned int order = folios_info[i] & ~PAGE_MASK; in kho_test_restore_data() local
222 unsigned int size = PAGE_SIZE << order; in kho_test_restore_data()
[all …]
A Dgenalloc.c246 int order = pool->min_alloc_order; in gen_pool_destroy() local
282 int order = pool->min_alloc_order; in gen_pool_alloc_algo_owner() local
295 nbits = (size + (1UL << order) - 1) >> order; in gen_pool_alloc_algo_owner()
317 size = nbits << order; in gen_pool_alloc_algo_owner()
501 nbits = (size + (1UL << order) - 1) >> order; in gen_pool_free_owner()
509 size = nbits << order; in gen_pool_free_owner()
672 int order; in gen_pool_first_fit_align() local
675 order = pool->min_alloc_order; in gen_pool_first_fit_align()
676 align_mask = ((alignment->align + (1UL << order) - 1) >> order) - 1; in gen_pool_first_fit_align()
699 int order; in gen_pool_fixed_alloc() local
[all …]
A Dxarray.c682 while (shift > order) { in xas_create()
1153 return order == 0 ? 0 : order - 1; in xas_try_split_min_order()
1155 return order - (order % XA_CHUNK_SHIFT); in xas_try_split_min_order()
1887 order = __ffs(last + 1); in xa_store_range()
1919 int order = 0; in xas_get_order() local
1933 order++; in xas_get_order()
1936 order += xas->xa_node->shift; in xas_get_order()
1937 return order; in xas_get_order()
1951 int order = 0; in xa_get_order() local
1957 order = xas_get_order(&xas); in xa_get_order()
[all …]
A Dtest_meminit.c63 static int __init do_alloc_pages_order(int order, int *total_failures) in do_alloc_pages_order() argument
67 size_t size = PAGE_SIZE << order; in do_alloc_pages_order()
69 page = alloc_pages(GFP_KERNEL, order); in do_alloc_pages_order()
74 __free_pages(page, order); in do_alloc_pages_order()
76 page = alloc_pages(GFP_KERNEL, order); in do_alloc_pages_order()
83 __free_pages(page, order); in do_alloc_pages_order()
A Dscatterlist.c590 unsigned int order, bool chainable, in sgl_alloc_order() argument
598 nent = round_up(length, PAGE_SIZE << order) >> (PAGE_SHIFT + order); in sgl_alloc_order()
600 if (length > (nent << (PAGE_SHIFT + order))) in sgl_alloc_order()
617 elem_len = min_t(u64, length, PAGE_SIZE << order); in sgl_alloc_order()
618 page = alloc_pages(gfp, order); in sgl_alloc_order()
620 sgl_free_order(sgl, order); in sgl_alloc_order()
663 void sgl_free_n_order(struct scatterlist *sgl, int nents, int order) in sgl_free_n_order() argument
674 __free_pages(page, order); in sgl_free_n_order()
685 void sgl_free_order(struct scatterlist *sgl, int order) in sgl_free_order() argument
687 sgl_free_n_order(sgl, INT_MAX, order); in sgl_free_order()
A Dtest_bitmap.c307 int pos, order; in test_bitmap_region() local
313 for (order = 0; order < 10; order++) { in test_bitmap_region()
314 pos = bitmap_find_free_region(bmap, 1000, order); in test_bitmap_region()
315 if (order == 0) in test_bitmap_region()
318 expect_eq_uint(pos, order < 9 ? BIT(order) : -ENOMEM); in test_bitmap_region()
322 for (order = 1; order < 9; order++) in test_bitmap_region()
323 bitmap_release_region(bmap, BIT(order), order); in test_bitmap_region()
A DKconfig284 values for parameters 'm' (Galois field order) and 't'
300 Constant value for Galois field order 'm'. If 'k' is the
/lib/crc/arm64/
A Dcrc32-core.S57 bit\order w0
70 \order x3, x4, x5, x6
104 0: bit\order w0
109 \order x3
113 \order w3
117 hword\order w3
121 byte\order w3
123 0: bit\order w0
139 __crc32 order=be
151 bit\order w0
[all …]
/lib/zlib_inflate/
A Dinflate.c346 static const unsigned short order[19] = /* permutation of code lengths */ in zlib_inflate() local
487 state->lens[order[state->have++]] = (unsigned short)BITS(3); in zlib_inflate()
491 state->lens[order[state->have++]] = 0; in zlib_inflate()
/lib/crc/x86/
A Dcrc32c-3way.S84 # Process 1 <= n_misaligned <= 7 bytes individually in order to align
/lib/crypto/x86/
A Dsha1-ssse3-and-avx.S201 # order is important (REG_C is where it should be)

Completed in 26 milliseconds