| /tools/testing/radix-tree/ |
| A D | multiorder.c | 16 unsigned order) in item_insert_order() argument 18 XA_STATE_ORDER(xas, xa, index, order); in item_insert_order() 66 assert(item->order == order[i]); in multiorder_iteration() 112 mask = (1UL << order[k]) - 1; in multiorder_tagged_iteration() 117 assert(item->order == order[k]); in multiorder_tagged_iteration() 139 mask = (1 << order[k]) - 1; in multiorder_tagged_iteration() 144 assert(item->order == order[k]); in multiorder_tagged_iteration() 172 item_insert_order(tree, 0, order); in creator_func() 218 unsigned int order; in load_creator() local 226 for (order = 1; order < RADIX_TREE_MAP_SHIFT; order++) { in load_creator() [all …]
|
| A D | iteration_check.c | 25 int order; in my_item_insert() local 29 for (order = max_order; order >= 0; order--) { in my_item_insert() 30 xas_set_order(&xas, index, order); in my_item_insert() 31 item->order = order; in my_item_insert() 41 if (order < 0) in my_item_insert() 165 void iteration_test(unsigned order, unsigned test_duration) in iteration_test() argument 170 order > 0 ? "multiorder " : "", test_duration); in iteration_test() 172 max_order = order; in iteration_test()
|
| A D | test.h | 10 unsigned int order; member 13 struct item *item_create(unsigned long index, unsigned int order); 36 void iteration_test(unsigned order, unsigned duration);
|
| A D | test.c | 28 struct item *item_create(unsigned long index, unsigned int order) in item_create() argument 33 ret->order = order; in item_create() 50 assert(item->order < BITS_PER_LONG); in item_sanity() 51 mask = (1UL << item->order) - 1; in item_sanity()
|
| /tools/testing/selftests/mm/ |
| A D | split_huge_page_test.c | 150 void split_pmd_thp_to_order(int order) in split_pmd_thp_to_order() argument 170 (uint64_t)one_page + len, order); in split_pmd_thp_to_order() 180 ksft_test_result_pass("Split huge pages to order %d successful\n", order); in split_pmd_thp_to_order() 267 void split_file_backed_thp(int order) in split_file_backed_thp() argument 319 write_debugfs(PATH_FMT, testfile, pgoff_start, pgoff_end, order); in split_file_backed_thp() 357 ksft_test_result_pass("File-backed THP split to order %d test done\n", order); in split_file_backed_thp() 463 int order, int offset) in split_thp_in_pagecache_to_order_at() argument 483 (uint64_t)addr + fd_size, order); in split_thp_in_pagecache_to_order_at() 486 (uint64_t)addr + fd_size, order, offset); in split_thp_in_pagecache_to_order_at() 507 ksft_exit_fail_msg("Split PMD-mapped pagecache folio to order %d failed\n", order); in split_thp_in_pagecache_to_order_at() [all …]
|
| /tools/mm/ |
| A D | thpmaps | 51 def odkb(order): 53 return (PAGE_SIZE << order) >> 10 275 order = int(order) 276 nr = 1 << order 280 stats[anon][align][order] += nr 317 nr_cont = 1 << order 419 contstats = [cont_parse(vma, order, ranges, anons, heads) for order in contorders] 518 if order < 1: 520 if (1 << order) * PAGE_SIZE != size: 522 if order > PMD_ORDER: [all …]
|
| /tools/testing/kunit/test_data/ |
| A D | test_is_test_passed-no_tests_run_no_header.log | 9 Built 1 zonelists in Zone order, mobility grouping on. Total pages: 14038 11 PID hash table entries: 256 (order: -1, 2048 bytes) 12 Dentry cache hash table entries: 8192 (order: 4, 65536 bytes) 13 Inode-cache hash table entries: 4096 (order: 3, 32768 bytes) 20 Mount-cache hash table entries: 512 (order: 0, 4096 bytes) 21 Mountpoint-cache hash table entries: 512 (order: 0, 4096 bytes) 26 futex hash table entries: 256 (order: 0, 6144 bytes)
|
| A D | test_output_isolated_correctly.log | 4 Dentry cache hash table entries: 65536 (order: 7, 524288 bytes) 5 Inode-cache hash table entries: 32768 (order: 6, 262144 bytes) 45 Mount-cache hash table entries: 1024 (order: 1, 8192 bytes) 46 Mountpoint-cache hash table entries: 1024 (order: 1, 8192 bytes) 51 futex hash table entries: 256 (order: 0, 6144 bytes)
|
| /tools/testing/fault-injection/ |
| A D | failcmd.sh | 52 --ignore-gfp-highmem=value, --min-order=value 102 LONGOPTS=$LONGOPTS,ignore-gfp-wait:,ignore-gfp-highmem:,min-order: 206 --min-order) 207 echo $2 > $FAULTATTR/min-order
|
| /tools/testing/selftests/bpf/test_kmods/ |
| A D | .gitignore | 6 /modules.order
|
| /tools/memory-model/ |
| A D | linux-kernel.cat | 132 * This was necessary in order to apply the "& loc" tests correctly. 140 * The synchronize_rcu() strong fence is special in that it can order not 148 * critical sections (joined by rcu-link) induces order like a generalized 154 let rec rcu-order = rcu-gp | srcu-gp | 159 (rcu-gp ; rcu-link ; rcu-order ; rcu-link ; rcu-rscsi) | 160 ((srcu-gp ; rcu-link ; rcu-order ; rcu-link ; srcu-rscsi) & loc) | 161 (rcu-rscsi ; rcu-link ; rcu-order ; rcu-link ; rcu-gp) | 162 ((srcu-rscsi ; rcu-link ; rcu-order ; rcu-link ; srcu-gp) & loc) | 163 (rcu-order ; rcu-link ; rcu-order) 164 let rcu-fence = po ; rcu-order ; po?
|
| /tools/perf/tests/ |
| A D | dwarf-unwind.c | 74 int idx = callchain_param.order == ORDER_CALLER ? in unwind_entry() 132 callchain_param.order = ORDER_CALLER; in test_dwarf_unwind__compare() 136 callchain_param.order = ORDER_CALLEE; in test_dwarf_unwind__compare()
|
| /tools/perf/ |
| A D | builtin-kmem.c | 294 int order; member 489 data->order = pstat->order; in __page_stat__findnew_page() 544 data->order = pstat->order; in __page_stat__findnew_alloc() 599 data->order = pstat->order; in __page_stat__findnew_caller() 815 u64 bytes = kmem_page_size << order; in evsel__process_page_alloc_event() 819 .order = order, in evsel__process_page_alloc_event() 875 order_stats[order][migrate_type]++; in evsel__process_page_alloc_event() 887 .order = order, in evsel__process_page_free_event() 902 page, order); in evsel__process_page_free_event() 1604 if (l->order < r->order) in page_order_cmp() [all …]
|
| /tools/testing/selftests/bpf/ |
| A D | DENYLIST | 2 # Alphabetical order
|
| A D | DENYLIST.s390x | 2 # Alphabetical order
|
| /tools/virtio/virtio-trace/ |
| A D | README | 15 3) A controller thread does poll() for a start order of a host. 16 4) After the controller of the trace agent receives a start order from a host, 20 6) If the controller receives a stop order from a host, the read/write threads 103 read/write threads in the agent wait for start order from host. If you add -o 113 A host injects read start order to the guest via virtio-serial. 117 A host injects read stop order to the guest via virtio-serial.
|
| /tools/testing/memblock/ |
| A D | internal.h | 19 unsigned int order) in memblock_free_pages() argument
|
| /tools/perf/tests/shell/base_report/ |
| A D | stderr-whitelist.txt | 4 \d+ out of order events recorded.
|
| /tools/testing/selftests/drivers/net/microchip/ |
| A D | ksz9477_qos.sh | 106 local order=$2 108 dcb apptrust set dev ${if_name} order ${order} 395 for order in "${order_variants[@]}"; do 396 set_apptrust_order ${swp1} "${order}" 397 if [[ "$order" != "$(port_get_default_apptrust ${swp1})" ]]; then
|
| /tools/testing/selftests/bpf/prog_tests/ |
| A D | cgroup_iter.c | 52 int order, const char *testname) in read_from_cgroup_iter() argument 64 linfo.cgroup.order = order; in read_from_cgroup_iter() 215 linfo.cgroup.order = BPF_CGROUP_ITER_SELF_ONLY; in test_walk_dead_self_only()
|
| /tools/memory-model/litmus-tests/ |
| A D | S+fencewmbonceonce+poacquireonce.litmus | 6 * Can a smp_wmb(), instead of a release, and an acquire order a prior
|
| A D | SB+poonceonces.litmus | 7 * to order the store-buffering pattern, where each process writes to the
|
| /tools/power/cpupower/debug/kernel/ |
| A D | Makefile | 16 - rm -rf Module.symvers modules.order
|
| /tools/memory-model/Documentation/ |
| A D | explanation.txt | 188 global order that agrees with the order of the instructions in the 208 its instructions in order. 626 You can think of the coherence order as being the order in which the 633 Coherence order is required to be consistent with program order. This 651 coherence order. 676 program order, it must also come later in x's coherence order and 743 the coherence order. 876 program order). 1004 order. Equivalently, 1633 X ->rcu-order T and Z ->rcu-order V.) On the other hand: [all …]
|
| /tools/perf/tests/config-fragments/ |
| A D | README | 3 an optimistic set as some features require hardware support in order to
|