Searched full:against (Results 1 – 25 of 1991) sorted by relevance
12345678910>>...80
/Linux-v6.6/tools/memory-model/scripts/ |
D | README | 11 the results against the expected results recorded in the 29 Check a single litmus test against its "Result:" expected result. 34 Check the specified list of litmus tests against their "Result:" 55 against the .litmus file's "Result:" comment to judge whether 97 # Checks results against Result tags, runs in minutes:
|
/Linux-v6.6/tools/memory-model/Documentation/ |
D | ordering.txt | 12 all of the CPU's prior operations against some or all of its 16 against some or all of the CPU's prior accesses or some or all 68 accesses against all subsequent accesses from the viewpoint of all CPUs. 119 typically instead used to provide ordering against RCU read-side critical 263 end in _release. These operations order their own store against all 287 against "y". On x86, the version using smp_store_release() might compile 307 Note that release ordering is guaranteed only against the 308 memory-store portion of the RMW operation, and not against the 322 operations order their own load against all of the CPU's subsequent 333 improves upon smp_rmb() by ordering against subsequent stores as well [all …]
|
D | control-dependencies.txt | 192 WRITE_ONCE(c, 1); /* BUG: No ordering against the read from "a". */ 219 (*) Control dependencies can order prior loads against later stores. 221 Not prior loads against later loads, nor prior stores against 254 need all the CPUs to agree on the ordering of a given store against
|
/Linux-v6.6/security/apparmor/ |
D | match.c | 425 * @dfa: the dfa to match @str against (NOT NULL) 427 * @str: the string of bytes to match against the dfa (NOT NULL) 430 * aa_dfa_match_len will match @str against the dfa and return the state it 469 * @dfa: the dfa to match @str against (NOT NULL) 471 * @str: the null terminated string of bytes to match against the dfa (NOT NULL) 473 * aa_dfa_match will match @str against the dfa and return the state it 554 * @dfa: the dfa to match @str against (NOT NULL) 556 * @str: the null terminated string of bytes to match against the dfa (NOT NULL) 559 * aa_dfa_match will match @str against the dfa and return the state it 611 * @dfa: the dfa to match @str against (NOT NULL) [all …]
|
/Linux-v6.6/drivers/rapidio/ |
D | rio-driver.c | 19 * @id: the RIO device id structure to match against 20 * @rdev: the RIO device structure to match against 79 * @dev: the RIO device structure to match against 109 * @dev: the RIO device structure to match against 181 * @dev: the standard device structure to match against 182 * @drv: the standard driver structure containing the ids to match against
|
/Linux-v6.6/Documentation/ |
D | atomic_t.txt | 180 Where 'unordered' is against other memory locations. Address dependencies are 183 Fully ordered primitives are ordered against everything prior and everything 194 smp_mb__before_atomic() orders all earlier accesses against the RMW op 196 later accesses against the RMW op and all accesses preceding it. However, 226 a RELEASE because it orders preceding instructions against both the read 227 and write parts of the atomic_dec(), and against all following instructions 260 because it would not order the W part of the RMW against the following
|
/Linux-v6.6/drivers/staging/iio/Documentation/ |
D | inkernel.txt | 18 matched against the datasheet_name field of the iio_chan_spec. 44 * matching dev or dev_name against consumer_dev and consumer_dev_name 45 * matching consumer_channel against consumer_channel in the map
|
/Linux-v6.6/fs/verity/ |
D | Kconfig | 21 against the Merkle tree. The file is also made read-only. 28 against a known good value, e.g. from a digital signature). 33 protection against malicious disks vs. an ahead-of-time hash.
|
/Linux-v6.6/drivers/acpi/acpica/ |
D | nsarguments.c | 27 * against the argument type list for a predefined name. 202 * against the count that is specified in the method/object. in acpi_ns_check_argument_count() 219 * We can only check the incoming argument count against the in acpi_ns_check_argument_count() 252 * count against the ACPI specification. We don't validate against in acpi_ns_check_argument_count() 255 * method was checked against the ACPI spec earlier.) in acpi_ns_check_argument_count()
|
/Linux-v6.6/crypto/asymmetric_keys/ |
D | restrict.c | 60 * Check the new certificate against the ones in the trust keyring. If one of 160 * the new certificate against the ones in the trust_keyring. 260 * available, auth_ids[2] is matched against in key_or_keyring_common() 314 * Check the new certificate only against the key or keys passed in the data 341 * Check the new certificate against the key or keys passed in the data 342 * parameter and against the keys already linked to the destination keyring. If
|
/Linux-v6.6/Documentation/scsi/ |
D | ChangeLog.sym53c8xx_2 | 31 - Check against memory allocation failure for SCRIPTZ and add the 33 - Check against GPIO3 pulled low for HVD controllers (driver did 84 - Mask GPCNTL against 0x1c (was 0xfc) for the reading of the NVRAM. 130 - Prepare a new patch against linux-2.4.13.
|
/Linux-v6.6/Documentation/core-api/ |
D | assoc_array.rst | 40 problem, the iterator should lock against modification. Objects will not 144 Compare the object against an index key and return ``true`` if it matches and 199 The caller should lock exclusively against other modifiers of the array. 219 The caller should lock exclusively against other modifiers of the array. 235 The caller should lock exclusively against other modifiers of the array. 249 The caller should lock exclusively against other modifiers and accessors 277 lock exclusively against other modifiers of the array. 298 this is a problem, then modification should be locked against. The 544 this without locking against a read - so we have to replace that node too.
|
/Linux-v6.6/Documentation/security/ |
D | self-protection.rst | 6 structures within the Linux kernel to protect against security flaws in 16 but with systems in place that defend against the worst case we'll 18 still be kept in mind, is protecting the kernel against a _privileged_ 34 The most fundamental defense against security exploits is to reduce the 135 To protect against even privileged users, systems may need to either 149 kind of attack exist, and protections exist to defend against them. 268 attacks, it is important to defend against exposure of both kernel memory
|
/Linux-v6.6/fs/zonefs/ |
D | zonefs.h | 91 * To serialise fully against both syscall and mmap based IO and 93 * zonefs_seq_file_truncate() against zonefs_iomap_begin(), that is, 94 * file truncate operations against block mapping, i_truncate_mutex is 95 * used. i_truncate_mutex also protects against concurrent accesses
|
/Linux-v6.6/Documentation/bpf/libbpf/ |
D | libbpf_build.rst | 7 against and must be installed on the system for applications to work. 30 To build both static libbpf.a and shared libbpf.so against a custom libelf
|
/Linux-v6.6/Documentation/driver-api/acpi/ |
D | scan_handlers.rst | 56 to match a scan handler against each of them using the ids arrays of the 66 interesting to the given scan handler and may be matched against the next scan 79 is the order in which they are matched against device nodes during namespace
|
/Linux-v6.6/tools/testing/ktest/examples/ |
D | README | 10 crosstests.conf - this config shows an example of testing a git repo against 22 snowball.conf - An example config that was used to demo ktest.pl against
|
/Linux-v6.6/tools/include/linux/ |
D | refcount.h | 25 * future stores against the inc, this ensures we'll never modify the object 30 * will order us against the subsequent free(). 32 * The control dependency is against the load of the cmpxchg (ll/sc) that
|
D | list.h | 431 * list_for_each_safe - iterate over a list safe against removal of list entry 441 * list_for_each_prev_safe - iterate over a list backwards safe against removal of list entry 525 * list_for_each_entry_safe - iterate over list of given type safe against removal of list entry 538 * list_for_each_entry_safe_continue - continue list iteration safe against removal 545 * safe against removal of list entry. 554 * list_for_each_entry_safe_from - iterate over list from current point safe against removal 560 * Iterate over list of given type from current point, safe against 569 * list_for_each_entry_safe_reverse - iterate backwards over list safe against removal 575 * Iterate backwards over list of given type, safe against removal 750 * hlist_for_each_entry_safe - iterate over list of given type safe against removal of list entry
|
/Linux-v6.6/arch/s390/include/asm/ |
D | tlb.h | 84 * as the pgd. pmd_free_tlb checks the asce_limit against 2GB 104 * as the pgd. p4d_free_tlb checks the asce_limit against 8PB 122 * as the pgd. pud_free_tlb checks the asce_limit against 4TB
|
/Linux-v6.6/Documentation/admin-guide/ |
D | dynamic-debug-howto.rst | 109 the callsite to be compared, and a value to compare against. Possible 135 The given string is compared against the function name 142 The given string is compared against either the src-root relative 153 The given string is compared against the module name 179 The given class_name is validated against each module, which may 190 against the line number of each ``pr_debug()`` callsite. A single
|
/Linux-v6.6/arch/arm/mm/ |
D | physaddr.c | 19 * are early callers of __pa() against PAGE_OFFSET in __virt_addr_valid() 50 /* This is bounds checking against the kernel image only. in __phys_addr_symbol()
|
/Linux-v6.6/Documentation/virt/kvm/ |
D | review-checklist.rst | 10 2. Patches should be against kvm.git master branch. 39 12. Features must be robust against reset and kexec - for example, shared
|
/Linux-v6.6/Documentation/admin-guide/device-mapper/ |
D | dm-integrity.rst | 135 will protect the data against accidental corruption. 157 the size of files that were written. To protect against this 162 modification. To protect against accidental modification, use a 163 crc algorithm, to protect against malicious modification, use a 274 numbers in the journal section, to protect against a
|
/Linux-v6.6/Documentation/driver-api/media/ |
D | dtv-common.rst | 43 Two or more readers must be locked against each other. 46 Two or more writers must be locked against each other.
|
12345678910>>...80