Searched refs:relations (Results 1 – 12 of 12) sorted by relevance
/Linux-v6.6/drivers/pci/controller/ |
D | pci-hyperv.c | 2754 struct pci_bus_relations *relations) in hv_pci_devices_present() argument 2759 dr = kzalloc(struct_size(dr, func, relations->device_count), in hv_pci_devices_present() 2764 dr->device_count = relations->device_count; in hv_pci_devices_present() 2766 dr->func[i].v_id = relations->func[i].v_id; in hv_pci_devices_present() 2767 dr->func[i].d_id = relations->func[i].d_id; in hv_pci_devices_present() 2768 dr->func[i].rev = relations->func[i].rev; in hv_pci_devices_present() 2769 dr->func[i].prog_intf = relations->func[i].prog_intf; in hv_pci_devices_present() 2770 dr->func[i].subclass = relations->func[i].subclass; in hv_pci_devices_present() 2771 dr->func[i].base_class = relations->func[i].base_class; in hv_pci_devices_present() 2772 dr->func[i].subsystem_id = relations->func[i].subsystem_id; in hv_pci_devices_present() [all …]
|
/Linux-v6.6/tools/memory-model/ |
D | lock.cat | 87 * and then convert that relation to a set of single-edge relations. 95 (* Generate all rf relations for LF events *) 115 (* Generate all rf relations for RU events *) 122 (* Generate all co relations, including LKW events but not UL *)
|
D | linux-kernel.cat | 24 (* Basic relations *) 131 * one but two non-rf relations, but only in conjunction with an RCU
|
D | README | 218 relations on the locking primitives.
|
/Linux-v6.6/Documentation/ABI/testing/ |
D | sysfs-class-extcon | 19 such binary relations may be expressed with extcon_dev's 88 Shows the relations of mutually exclusiveness. For example,
|
/Linux-v6.6/drivers/comedi/drivers/ni_routing/ |
D | README | 171 Various naming conventions and relations:
|
/Linux-v6.6/tools/memory-model/Documentation/ |
D | explanation.txt | 57 relations used in many models. Starting in Section 13 (AN OPERATIONAL 322 Events in the LKMM can be linked by various relations, which we will 324 of these relations to be orderings, that is, it requires them not to 768 relations; it is not independent. Given a read event R and a write 957 and po-loc relations agree with this global ordering; in other words, 961 relations not to have any cycles. This means it must not be possible 1602 The LKMM also defines the rcu-gp and rcu-rscsi relations. They bring 1825 sequence of relations contains fewer instances of rcu-gp (one) than of 1854 relations srcu-gp and srcu-rscsi added to represent SRCU grace periods 2351 point most of the relations defined by the LKMM (ppo, hb, prop, [all …]
|
D | recipes.txt | 550 avoid a counter-intuitive outcome depends on the types of relations
|
/Linux-v6.6/Documentation/mm/ |
D | hmm.rst | 52 complex data set needs to re-map all the pointer relations between each of its
|
/Linux-v6.6/net/sched/ |
D | Kconfig | 616 the famous u32 key in combination with logic relations.
|
/Linux-v6.6/Documentation/admin-guide/mm/damon/ |
D | usage.rst | 60 figure, parents-children relations are represented with indentations, each
|
/Linux-v6.6/Documentation/ |
D | memory-barriers.txt | 568 load-to-store relations, address-dependency barriers are not necessary
|