| /linux/tools/testing/selftests/sync/ |
| H A D | sync_wait.c | 35 int fenceA, fenceB, fenceC, merged; in test_fence_multi_timeline_wait() local 46 merged = sync_merge("mergeFence", fenceB, fenceA); in test_fence_multi_timeline_wait() 47 merged = sync_merge("mergeFence", fenceC, merged); in test_fence_multi_timeline_wait() 49 valid = sw_sync_fence_is_valid(merged); in test_fence_multi_timeline_wait() 53 active = sync_fence_count_with_status(merged, FENCE_STATUS_ACTIVE); in test_fence_multi_timeline_wait() 56 ret = sync_wait(merged, 0); in test_fence_multi_timeline_wait() 61 active = sync_fence_count_with_status(merged, FENCE_STATUS_ACTIVE); in test_fence_multi_timeline_wait() 62 signaled = sync_fence_count_with_status(merged, FENCE_STATUS_SIGNALED); in test_fence_multi_timeline_wait() 67 active = sync_fence_count_with_status(merged, FENCE_STATUS_ACTIVE); in test_fence_multi_timeline_wait() 68 signaled = sync_fence_count_with_status(merged, FENCE_STATUS_SIGNALED); in test_fence_multi_timeline_wait() [all …]
|
| H A D | sync_merge.c | 34 int fence, valid, merged; in test_fence_merge_same_fence() local 44 merged = sync_merge("mergeFence", fence, fence); in test_fence_merge_same_fence() 48 ASSERT(sync_fence_count_with_status(merged, FENCE_STATUS_SIGNALED) == 0, in test_fence_merge_same_fence() 52 ASSERT(sync_fence_count_with_status(merged, FENCE_STATUS_SIGNALED) == 1, in test_fence_merge_same_fence() 55 sw_sync_fence_destroy(merged); in test_fence_merge_same_fence()
|
| H A D | sync_stress_merge.c | 43 int fence, tmpfence, merged, valid; in test_merge_stress_random_merge() local 76 merged = sync_merge("merge", tmpfence, fence); in test_merge_stress_random_merge() 79 fence = merged; in test_merge_stress_random_merge() 81 valid = sw_sync_fence_is_valid(merged); in test_merge_stress_random_merge() 94 /* Trigger the merged fence */ in test_merge_stress_random_merge()
|
| H A D | sync_stress_consumer.c | 108 int fence, merged, tmp, valid, it, i; in mpcs_consumer_thread() local 119 merged = sync_merge("name", tmp, fence); in mpcs_consumer_thread() 122 fence = merged; in mpcs_consumer_thread()
|
| /linux/tools/crypto/tcrypt/ |
| H A D | tcrypt_speed_compare.py | 114 merged = {} 116 merged[alg] = {} 118 if op not in merged[alg]: 119 merged[alg][op] = [] 132 merged[alg][op].append(merged_item) 133 return merged 136 def format(merged): argument 137 for alg in merged.keys(): 138 for op in merged[alg].keys(): 150 if "base_ops" in merged[alg][op][0]: [all …]
|
| /linux/tools/perf/tests/ |
| H A D | maps.c | 18 struct map_def *merged; member 25 struct map_def *merged = &args->merged[args->i]; in check_maps_cb() local 27 if (map__start(map) != merged->start || in check_maps_cb() 28 map__end(map) != merged->end || in check_maps_cb() 29 strcmp(dso__name(map__dso(map)), merged->name) || in check_maps_cb() 48 static int check_maps(struct map_def *merged, unsigned int size, struct maps *maps) in check_maps() argument 57 .merged = merged, in check_maps() 66 merged[ in check_maps() [all...] |
| /linux/Documentation/filesystems/ |
| H A D | overlayfs.rst | 90 merged with the 'upper' object. 117 Where both upper and lower objects are directories, a merged directory 121 "upperdir" are combined into a merged directory:: 124 workdir=/work /merged 129 Then whenever a lookup is requested in such a merged directory, the 132 actual lookups find directories, both are stored and a merged 136 Only the lists of names from directories are merged. Other content 151 When a whiteout is found in the upper level of a merged directory, any 169 When a 'readdir' request is made on a merged directory, the upper and 170 lower directories are each read and the name lists merged in the [all …]
|
| /linux/Documentation/admin-guide/mm/ |
| H A D | ksm.rst | 26 KSM's merged pages were originally locked into kernel memory, but can now 46 unmerges whatever it merged in that range. Note: this unmerging call 95 specifies if pages from different NUMA nodes can be merged. 112 * set to 0 to stop ksmd from running but keep merged pages, 114 * set to 2 to stop ksmd and unmerge all pages currently merged, but 123 empty pages are merged with the kernel zero page(s) instead of 131 effective for pages merged after the change. 239 be merged, but some may not be abled to be merged after being checked
|
| /linux/Documentation/devicetree/bindings/mfd/ |
| H A D | dlg,da9063.yaml | 64 "^(ldo([1-9]|1[01])|bcore([1-2]|s-merged)|b(pro|mem|io|peri)|bmem-bio-merged|buck[1-4])$": 127 "^(ldo([5-9]|10|11)|bcore([1-2]|s-merged)|b(pro|mem|io|peri)|bmem-bio-merged)$": false 148 … "^(ldo([5-9]|10|11)|bcore([1-2]|s-merged)|b(pro|mem|io|peri)|bmem-bio-merged|buck4)$": false
|
| /linux/Documentation/ABI/testing/ |
| H A D | procfs-diskstats | 14 5 reads merged 18 9 writes merged 31 16 discards merged
|
| H A D | sysfs-kernel-mm-ksm | 52 When it is set to 0 only pages from the same node are merged, 53 otherwise pages from all nodes can be merged together (default).
|
| /linux/tools/testing/selftests/mm/ |
| H A D | ksm_tests.c | 150 " -C evaluate the time required to break COW of merged pages.\n\n"); in print_help() 268 * there are 'leftover' pages that cannot be merged. For example, if there in assert_ksm_pages_count() 270 * merged and the 11th page won't be affected. As a result, when the number in assert_ksm_pages_count() 339 /* verify that the right number of pages are merged */ in check_ksm_merge() 381 /* check that unmerging was successful and 0 pages are currently merged */ in check_ksm_unmerge() 417 * verify that the right number of pages are merged: in check_ksm_zero_page_merge() 418 * 1) if use_zero_pages is set to 1, empty pages are merged in check_ksm_zero_page_merge() 421 * and merged as usual. in check_ksm_zero_page_merge() 501 * verify that the right number of pages are merged: in check_ksm_numa_merge() 502 * 1) if merge_across_nodes was enabled, 2 duplicate pages will be merged; in check_ksm_numa_merge() [all …]
|
| /linux/Documentation/process/ |
| H A D | 6.Followthrough.rst | 137 burner so that the remaining patches can be worked into shape and merged. 146 merged into the mainline kernel. Congratulations! Once the celebration is 154 longer any question of your code being merged. Resist that temptation, 171 well make it harder for you to get work merged in the future. 187 after it's merged. The next time you post a patch, they will be evaluating 213 chances are that one of the two patches will not be merged, and "mine was 219 long after they have forgotten whose patch actually got merged.
|
| H A D | 1.Intro.rst | 12 merged into the official ("mainline") kernel, including automatic 42 assuming that the job is done when a patch is merged into the mainline. 132 - Code which has been merged into the mainline kernel is available to all 151 which has been merged into the mainline has significantly lower 173 exists. Should that happen, getting your code merged will become much 243 to the kernel. All code merged into the mainline kernel retains its
|
| /linux/drivers/md/dm-vdo/ |
| H A D | io-submitter.c | 134 * other bios may have been merged with it as well. 160 * any bios that have been merged with it. 179 * merged with. 265 * Return: whether or not the vio was merged. 270 bool merged = true; in try_bio_map_merge() local 289 merged = false; in try_bio_map_merge() 304 return merged; in try_bio_map_merge() 311 * If possible, this I/O will be merged other pending I/Os. Otherwise, the data_vio will be sent to
|
| /linux/tools/testing/vma/ |
| H A D | vma.c | 217 struct vm_area_struct *merged; in try_merge_new_vma() local 221 merged = merge_new(vmg); in try_merge_new_vma() 222 if (merged) { in try_merge_new_vma() 225 return merged; in try_merge_new_vma() 470 bool merged; in test_merge_new() local 498 vma_d = try_merge_new_vma(&mm, &vmg, 0x7000, 0x9000, 7, vm_flags, &merged); in test_merge_new() 502 ASSERT_FALSE(merged); in test_merge_new() 513 vma = try_merge_new_vma(&mm, &vmg, 0x2000, 0x3000, 2, vm_flags, &merged); in test_merge_new() 516 ASSERT_TRUE(merged); in test_merge_new() 530 vma = try_merge_new_vma(&mm, &vmg, 0x4000, 0x5000, 4, vm_flags, &merged); in test_merge_new() [all...] |
| /linux/drivers/net/ethernet/netronome/nfp/flower/ |
| H A D | conntrack.h | 50 * @tc_merge_tb: The table of merged tc flows 51 * @tc_merge_count: Keep count of the number of merged tc entries 56 * @nft_merge_tb: The table of merged tc+nft flows 57 * @nft_merge_count: Keep count of the number of merged tc+nft entries 156 * @children: List of nft merged entries
|
| /linux/net/batman-adv/ |
| H A D | fragmentation.c | 214 * exceeds the maximum size of one merged packet. Don't allow in batadv_frag_insert_packet() 244 * Return: the merged skb or NULL on error. 303 * There are three possible outcomes: 1) Packet is merged: Return true and 304 * set *skb to merged packet; 2) Packet is buffered: Return true and set *skb 307 * Return: true when the packet is merged or buffered, false when skb is not 337 * batadv_frag_skb_fwd() - forward fragments that would exceed MTU when merged 342 * Look up the next-hop of the fragments payload and check if the merged packet 364 /* Forward the fragment, if the merged packet would be too big to in batadv_frag_skb_fwd()
|
| /linux/Documentation/block/ |
| H A D | stat.rst | 30 read merges requests number of read I/Os merged with in-queue I/O 34 write merges requests number of write I/Os merged with in-queue I/O 41 discard merges requests number of discard I/Os merged with in-queue I/O 64 These values increment when an I/O request is merged with an
|
| /linux/tools/lib/perf/ |
| H A D | cpumap.c | 413 struct perf_cpu_map *merged; in perf_cpu_map__merge() local 446 merged = cpu_map__trim_new(k, tmp_cpus); in perf_cpu_map__merge() 449 *orig = merged; in perf_cpu_map__merge() 459 struct perf_cpu_map *merged = NULL; in perf_cpu_map__intersect() local 483 merged = cpu_map__trim_new(k, tmp_cpus); in perf_cpu_map__intersect() 485 return merged; in perf_cpu_map__intersect()
|
| /linux/scripts/ |
| H A D | Makefile.defconf | 9 # Creates 'merged defconfigs' 21 # Creates 'merged defconfigs without warning about overrides'
|
| /linux/fs/btrfs/ |
| H A D | extent_map.c | 237 * The merged flag is not an on-disk flag, it just indicates we had the in mergeable_maps() 238 * extent maps of 2 (or more) adjacent extents merged, so factor it out. in mergeable_maps() 256 * @merged: the extent we will not discard after the merge; updated with new values 258 * After this, one of the two extents is the new merged extent and the other is 259 * removed from the tree and likely freed. Note that @merged is one of @prev/@next 263 * For now only uncompressed regular extent can be merged. 266 struct extent_map *merged) in merge_ondisk_extents() argument 277 * There are two different cases where @prev and @next can be merged. in merge_ondisk_extents() 292 * For case 1), the merged data extent would be the same. in merge_ondisk_extents() 301 merged->disk_bytenr = new_disk_bytenr; in merge_ondisk_extents() [all …]
|
| /linux/Documentation/ABI/obsolete/ |
| H A D | sysfs-bus-iio | 31 Since kernel 5.11 the scan_elements attributes are merged into 62 Since kernel 5.11 the scan_elements attributes are merged into 100 Since kernel 5.11 the scan_elements attributes are merged into 135 Since kernel 5.11 the scan_elements attributes are merged into
|
| /linux/tools/lib/ |
| H A D | list_sort.c | 118 * merged to a size-2^(k+1) list as soon as we have 2^k following elements. 139 * which will be merged into a list of size 2^(k+2) before we create 192 * - A pair of pending sublists are merged as soon as the number in list_sort() 213 /* Install the merged result in place of the inputs */ in list_sort()
|
| /linux/block/ |
| H A D | badblocks.c | 67 * be merged into existing bad range E. The result is, 84 * be merged into existing bad range E. The result is, 149 * they will be merged into one, the result is, 172 * they will be merged into one, the result is, 255 * can be merged with rest part of S into less range S1 and S2. Now there is 322 * to no space, or some ranges are not merged to save bad blocks table space. 532 * merged with the bad range (from the bad table) indexed by 'prev'. 550 * merged from bad->len. 557 int merged = 0; in front_merge() local 562 merged = min_t(sector_t, sectors, BB_END(p[prev]) - s); in front_merge() [all …]
|