| /linux/lib/zstd/compress/ |
| H A D | zstd_ldm.c | 371 ldmMatchCandidate_t* const candidates = ldmState->matchCandidates; in ZSTD_ldm_generateSequences_internal() local
395 candidates[n].split = split; in ZSTD_ldm_generateSequences_internal()
396 candidates[n].hash = hash; in ZSTD_ldm_generateSequences_internal()
397 candidates[n].checksum = (U32)(xxhash >> 32); in ZSTD_ldm_generateSequences_internal()
398 candidates[n].bucket = ZSTD_ldm_getBucket(ldmState, hash, params->bucketSizeLog); in ZSTD_ldm_generateSequences_internal()
399 PREFETCH_L1(candidates[n].bucket); in ZSTD_ldm_generateSequences_internal()
406 BYTE const* const split = candidates[n].split; in ZSTD_ldm_generateSequences_internal()
407 U32 const checksum = candidates[n].checksum; in ZSTD_ldm_generateSequences_internal()
408 U32 const hash = candidates[n].hash; in ZSTD_ldm_generateSequences_internal()
409 ldmEntry_t* const bucket = candidates[n].bucket; in ZSTD_ldm_generateSequences_internal()
|
| /linux/Documentation/filesystems/ |
| H A D | propagate_umount.txt | 49 Finding candidates.
64 subtrees of U, in which case we'd end up examining the same candidates
68 number of candidates.
102 Note that there can be no absolute roots among the extra candidates -
271 S that do not belong to U. That set ('candidates') is all we need
273 consisting of all list elements that are marked as candidates (initially -
319 if it belongs to candidates.
336 iterate through the candidates anyway.
371 // to unmount) and a set of candidates, represented as a subset of list
374 // In the end candidates becomes empty and maximal non-revealing non-shifting
[all …]
|
| H A D | autofs-mount-control.rst | 156 candidates are enumerated, almost for no other reason than to "count"
355 this ioctl is called until no further expire candidates are found.
363 expire candidates can be found the ioctl returns -1 with errno set to
|
| /linux/fs/ |
| H A D | pnode.c | 573 struct list_head *candidates) in gather_candidates() argument
600 list_add(&child->mnt_list, candidates); in gather_candidates()
734 LIST_HEAD(candidates); // undecided umount candidates in propagate_umount()
737 gather_candidates(set, &candidates); in propagate_umount()
740 list_for_each_entry_safe(m, p, &candidates, mnt_list) in propagate_umount()
744 while (!list_empty(&candidates)) { in propagate_umount()
745 m = list_first_entry(&candidates,struct mount, mnt_list); in propagate_umount()
|
| /linux/scripts/ |
| H A D | rustdoc_test_gen.rs | 97 "No path candidates found for `{file}`. This is likely a bug in the build system, or \ in find_real_path() localVariable
104 let mut candidates = String::new(); in find_real_path()
106 writeln!(&mut candidates, " {path:?}").unwrap(); in find_real_path()
109 "Several path candidates found for `{file}`, please resolve the ambiguity by \ in main()
110 renaming a file or folder. Candidates:\n{candidates}", in main()
|
| /linux/drivers/hwmon/ |
| H A D | cros_ec_hwmon.c | 462 size_t candidates, i, sensor_name_size; in cros_ec_hwmon_probe_temp_sensors() local
467 candidates = EC_TEMP_SENSOR_ENTRIES; in cros_ec_hwmon_probe_temp_sensors()
469 candidates = ARRAY_SIZE(priv->temp_sensor_names); in cros_ec_hwmon_probe_temp_sensors()
471 for (i = 0; i < candidates; i++) { in cros_ec_hwmon_probe_temp_sensors()
|
| /linux/Documentation/userspace-api/media/v4l/ |
| H A D | vidioc-querystd.rst | 41 stores here a set of candidates, this can be a single flag or a set of
|
| /linux/Documentation/sound/designs/ |
| H A D | tracepoints.rst | 86 SNDRV_PCM_IOCTL_HW_REFINE to retrieve this flag, then decide candidates
|
| /linux/Documentation/ABI/testing/ |
| H A D | sysfs-fs-f2fs | 105 blocks less than 2MB. The candidates to be discarded are cached during
568 number of potential victim in all candidates, the value should be in
575 number of potential victim in all candidates, by default it was
589 candidates whose age is not beyond the threshold, by default it was
|
| /linux/tools/memory-model/Documentation/ |
| H A D | explanation.txt | 2247 are "race candidates" if they satisfy 1 - 4. Thus, whether or not two
2248 race candidates actually do race in a given execution depends on
2251 The LKMM tries to determine whether a program contains race candidates
2256 Determining whether two accesses are race candidates is easy; you can
2424 accesses are race candidates, the LKMM can prove they are not
2581 impossible. After all, to be race candidates the two accesses must
2665 If R and W are race candidates and it is possible to link R to
2670 If W and R are race candidates and it is possible to link W to
2675 If W and W' are race candidates and it is possible to link W
|
| /linux/Documentation/admin-guide/mm/ |
| H A D | ksm.rst | 34 has advised to be likely candidates for merging, by using the madvise(2)
|
| /linux/Documentation/networking/dsa/ |
| H A D | configuration.rst | 400 candidates.
|
| /linux/Documentation/scheduler/ |
| H A D | sched-energy.rst | 61 is used to break the tie between several good CPU candidates and pick the one
|
| /linux/drivers/md/ |
| H A D | md.c | 7277 LIST_HEAD(candidates); in autorun_devices()
7282 INIT_LIST_HEAD(&candidates); in autorun_devices()
7287 list_move(&rdev->same_set, &candidates); in autorun_devices()
7322 rdev_for_each_list(rdev, tmp, &candidates) { in autorun_devices()
7333 rdev_for_each_list(rdev, tmp, &candidates) { in autorun_devices()
|
| /linux/Documentation/driver-api/ |
| H A D | uio-howto.rst | 36 serial or USB) are no candidates for an UIO driver. Hardware that is
|
| /linux/Documentation/admin-guide/sysctl/ |
| H A D | vm.rst | 267 number of dirty objects on the system and create more candidates to be
|
| /linux/Documentation/process/ |
| H A D | submitting-patches.rst | 613 patch candidates. For more information, please read
|
| /linux/drivers/scsi/aic7xxx/ |
| H A D | aic7xxx.seq | 2387 * candidates for paging out an SCB if one is needed for a new command.
|
| /linux/Documentation/admin-guide/ |
| H A D | kernel-parameters.txt | 8493 candidates for using WQ_UNBOUND workqueues instead.
|