Home
last modified time | relevance | path

Searched full:relation (Results 1 – 25 of 351) sorted by relevance

12345678910>>...15

/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/relation/
H A Dinterface.hpp42 struct relation struct
67 struct relation<boost::variant<BOOST_VARIANT_ENUM_PARAMS(T)>, Geometry2> struct
81 return relation<Geometry1, Geometry2> in operator ()()
97 struct relation<Geometry1, boost::variant<BOOST_VARIANT_ENUM_PARAMS(T)> > struct
111 return relation<Geometry1, Geometry2> in operator ()()
131 struct relation struct
149 return relation<Geometry1, Geometry2> in operator ()()
168 \brief Calculates the relation between a pair of geometries as defined in DE-9IM.
169 \ingroup relation
172 \tparam Strategy \tparam_strategy{Relation}
[all …]
/OK3568_Linux_fs/kernel/security/yama/
H A Dyama_lsm.c112 * yama_relation_cleanup - remove invalid entries from the relation list
117 struct ptrace_relation *relation; in yama_relation_cleanup() local
121 list_for_each_entry_rcu(relation, &ptracer_relations, node) { in yama_relation_cleanup()
122 if (relation->invalid) { in yama_relation_cleanup()
123 list_del_rcu(&relation->node); in yama_relation_cleanup()
124 kfree_rcu(relation, rcu); in yama_relation_cleanup()
144 struct ptrace_relation *relation, *added; in yama_ptracer_add() local
156 list_for_each_entry_rcu(relation, &ptracer_relations, node) { in yama_ptracer_add()
157 if (relation->invalid) in yama_ptracer_add()
159 if (relation->tracee == tracee) { in yama_ptracer_add()
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/index/
H A Ddistance_predicates.hpp34 closer or further than value v. This is default relation.
110 \param pr The point relation. This may be generated by \c index::to_nearest(),
134 \param pr The point relation. This may be generated by \c to_nearest(),
136 \param minr The minimum bound relation. This may be generated by \c to_nearest(),
160 \param pr The point relation. This may be generated by \c to_nearest(),
162 \param maxr The maximum bound relation. This may be generated by \c to_nearest(),
188 \param pr The point relation. This may be generated by \c to_nearest(),
190 \param minr The minimum bound relation. This may be generated by \c to_nearest(),
192 \param maxr The maximum bound relation. This may be generated by \c to_nearest(),
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/index/detail/
H A Ddistance_predicates.hpp56 // relation traits and access
60 struct relation struct
69 struct relation< to_nearest<T> > struct
78 struct relation< to_centroid<T> > struct
87 struct relation< to_furthest<T> > struct
109 typedef detail::relation<PointRelation> relation; typedef
110 typedef typename relation::value_type point_type;
115 result = geometry::comparable_distance(relation::value(p.point_or_relation), i); in apply()
/OK3568_Linux_fs/kernel/tools/memory-model/Documentation/
H A Dexplanation.txt15 7. THE PROGRAM ORDER RELATION: po AND po-loc
18 10. THE READS-FROM RELATION: rf, rfi, and rfe
19 11. CACHE COHERENCE AND THE COHERENCE ORDER RELATION: co, coi, and coe
20 12. THE FROM-READS RELATION: fr, fri, and fre
22 14. PROPAGATION ORDER RELATION: cumul-fence
26 18. THE PRESERVED PROGRAM ORDER RELATION: ppo
28 20. THE HAPPENS-BEFORE RELATION: hb
29 21. THE PROPAGATES-BEFORE RELATION: pb
55 through 12 (THE FROM_READS RELATION) describe the fundamental
327 THE PROGRAM ORDER RELATION: po AND po-loc
[all …]
H A Drecipes.txt528 based on the relation between the accesses linking successive CPUs in a
533 this type of relation. In formal memory-modeling texts, this
534 relation is called "reads-from" and is usually abbreviated "rf".
538 of relation. In formal memory-modeling texts, this relation is
543 write-to-write relation between the last access of CPU1() and
545 this relation is often called "coherence order" and is sometimes
/OK3568_Linux_fs/kernel/tools/memory-model/
H A Dlock.cat62 * until after the co relation has been generated.
87 * and then convert that relation to a set of single-edge relations.
90 let pair-to-relation p = p ++ 0
91 in map pair-to-relation ((LKW * {r}) & loc & ext)
111 let pair-to-relation p = p ++ 0
112 in map pair-to-relation (((UL | IW) * {r}) & loc & ext)
119 (* Final rf relation *)
/OK3568_Linux_fs/kernel/drivers/cpufreq/
H A Dfreq_table.c122 unsigned int relation) in cpufreq_table_index_unsorted() argument
137 pr_debug("request for target %u kHz (relation: %u) for cpu %u\n", in cpufreq_table_index_unsorted()
138 target_freq, relation, policy->cpu); in cpufreq_table_index_unsorted()
140 switch (relation) { in cpufreq_table_index_unsorted()
159 switch (relation) { in cpufreq_table_index_unsorted()
H A Ds3c24xx-cpufreq.c272 unsigned int relation) in s3c_cpufreq_target() argument
285 s3c_freq_dbg("%s: policy %p, target %u, relation %u\n", in s3c_cpufreq_target()
286 __func__, policy, target_freq, relation); in s3c_cpufreq_target()
290 relation); in s3c_cpufreq_target()
321 relation); in s3c_cpufreq_target()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/
H A Drelation.hpp14 #include <boost/geometry/algorithms/detail/relation/interface.hpp>
15 #include <boost/geometry/algorithms/detail/relation/implementation.hpp>
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/bits/
H A Dstl_stack.h311 * This is an equivalence relation. Complexity and semantics in _GLIBCXX_VISIBILITY()
313 * are: this relation is linear in the size of the sequences, and in _GLIBCXX_VISIBILITY()
323 * @brief Stack ordering relation. in _GLIBCXX_VISIBILITY()
328 * This is an total ordering relation. Complexity and semantics in _GLIBCXX_VISIBILITY()
330 * are: this relation is linear in the size of the sequences, the in _GLIBCXX_VISIBILITY()
H A Dstl_queue.h337 * This is an equivalence relation. Complexity and semantics depend on the in _GLIBCXX_VISIBILITY()
338 * underlying sequence type, but the expected rules are: this relation is in _GLIBCXX_VISIBILITY()
348 * @brief Queue ordering relation. in _GLIBCXX_VISIBILITY()
353 * This is an total ordering relation. Complexity and semantics in _GLIBCXX_VISIBILITY()
355 * are: this relation is linear in the size of the sequences, the in _GLIBCXX_VISIBILITY()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/bits/
H A Dstl_stack.h311 * This is an equivalence relation. Complexity and semantics in _GLIBCXX_VISIBILITY()
313 * are: this relation is linear in the size of the sequences, and in _GLIBCXX_VISIBILITY()
323 * @brief Stack ordering relation. in _GLIBCXX_VISIBILITY()
328 * This is an total ordering relation. Complexity and semantics in _GLIBCXX_VISIBILITY()
330 * are: this relation is linear in the size of the sequences, the in _GLIBCXX_VISIBILITY()
H A Dstl_queue.h337 * This is an equivalence relation. Complexity and semantics depend on the in _GLIBCXX_VISIBILITY()
338 * underlying sequence type, but the expected rules are: this relation is in _GLIBCXX_VISIBILITY()
348 * @brief Queue ordering relation. in _GLIBCXX_VISIBILITY()
353 * This is an total ordering relation. Complexity and semantics in _GLIBCXX_VISIBILITY()
355 * are: this relation is linear in the size of the sequences, the in _GLIBCXX_VISIBILITY()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/
H A Dconcepts349 /// [concept.relation], concept relation
351 concept relation
357 concept equivalence_relation = relation<_Rel, _Tp, _Up>;
361 concept strict_weak_order = relation<_Rel, _Tp, _Up>;
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/
H A Dconcepts349 /// [concept.relation], concept relation
351 concept relation
357 concept equivalence_relation = relation<_Rel, _Tp, _Up>;
361 concept strict_weak_order = relation<_Rel, _Tp, _Up>;
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dtree-data-ref.h385 validity of the dependence relation. */
403 /* A data_dependence_relation represents a relation between two
412 /* A "yes/no/maybe" field for the dependence relation:
415 relation between A and B, and the description of this relation
449 /* When the dependence relation is affine, it can be represented by
453 /* Set to true when the dependence relation is on the same data
649 /* Return the dependence level for the DDR relation. */
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dtree-data-ref.h385 validity of the dependence relation. */
403 /* A data_dependence_relation represents a relation between two
412 /* A "yes/no/maybe" field for the dependence relation:
415 relation between A and B, and the description of this relation
449 /* When the dependence relation is affine, it can be represented by
453 /* Set to true when the dependence relation is on the same data
649 /* Return the dependence level for the DDR relation. */
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/relate/
H A Dinterface.hpp366 \brief Checks relation between a pair of geometries defined by a mask.
376 \return true if the relation is compatible with the mask, false otherwise.
395 \brief Checks relation between a pair of geometries defined by a mask.
403 \return true if the relation is compatible with the mask, false otherwise.
/OK3568_Linux_fs/yocto/poky/meta/files/common-licenses/
H A DCERN-OHL-1.139 …ding negligence), product liability or otherwise, arising in any way in relation to the Documentat…
40 …ity, costs, damages, fees and expenses, including claims by third parties, in relation to such use.
46 …nditions, or if the Licensee initiates legal action against Licensor in relation to this Licence. …
H A DCERN-OHL-1.242 …relation to the Documentation, modified Documentation and/or the use, manufacture or distribution …
48 …nditions, or if the Licensee initiates legal action against Licensor in relation to this Licence. …
/OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/iommu/
H A Dsamsung,sysmmu.yaml23 System MMUs are in many to one relation with peripheral devices, i.e. single
26 device. The relation between a System MMU and the peripheral device needs to be
/OK3568_Linux_fs/kernel/include/linux/
H A Dcpufreq.h323 unsigned int relation); /* Deprecated */
598 unsigned int relation);
601 unsigned int relation);
753 unsigned int relation);
973 unsigned int relation) in cpufreq_frequency_table_target() argument
977 relation); in cpufreq_frequency_table_target()
979 switch (relation) { in cpufreq_frequency_table_target()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/formulas/
H A Dvertex_latitude.hpp73 // simpler formula based on Clairaut relation for spheroids
86 //apply Clairaut relation in apply()
/OK3568_Linux_fs/kernel/Documentation/cpu-freq/
H A Dcpu-drivers.rst187 unsigned int target_frequency, unsigned int relation.
194 - if relation==CPUFREQ_REL_L, try to select a new_freq higher than or equal
196 - if relation==CPUFREQ_REL_H, try to select a new_freq lower than or equal

12345678910>>...15