| /src/external/bsd/wpa/dist/src/p2p/ |
| p2p_invitation.c | 196 struct p2p_channels all_channels, intersection, *channels = NULL; local
263 &intersection);
264 p2p_channels_dump(p2p, "intersection", &intersection);
270 &go, group_bssid, &op_freq, persistent, &intersection,
276 &intersection);
277 p2p_channels_dump(p2p, "intersection(GO)", &intersection);
278 if (intersection.reg_classes == 0) {
295 if (!p2p_channels_includes(&intersection, reg_class, channel)
446 struct p2p_channels intersection, *channels = NULL; local
[all...] |
| p2p_go_neg.c | 43 struct p2p_channels intersection; local
79 p2p_channels_intersect(own, &dev->channels, &intersection);
80 p2p_dbg(p2p, "Own reg_classes %d peer reg_classes %d intersection reg_classes %d",
83 (int) intersection.reg_classes);
84 if (intersection.reg_classes == 0) {
412 * @intersection: Support channel list intersection from local and peer
421 struct p2p_channels *intersection)
435 p2p_channels_includes(intersection, op_reg_class, op_channel)) {
436 p2p_dbg(p2p, "Pick own channel preference (reg_class %u channel %u) from intersection",
554 struct p2p_channels tmp, intersection; local
[all...] |
| p2p.c | 1838 struct p2p_channels intersection; local
1874 &intersection);
1876 p2p_channels_remove_freqs(&intersection, &p2p->no_go_freq);
1877 p2p_channels_dump(p2p, "intersection after no-GO removal",
1878 &intersection);
1881 p2p_channels_to_freqs(&intersection, res.freq_list,
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| ranges.cc | 208 symbolic_byte_range::intersection (const symbolic_byte_range &other, function in class:ana::symbolic_byte_range
211 /* If either is empty, then there is no intersection. */
289 ASSERT_EQ (r0_9.intersection (r0, m), tristate::TS_TRUE);
290 ASSERT_EQ (r0.intersection (r0_9, m), tristate::TS_TRUE);
291 ASSERT_EQ (r0_9.intersection (r9, m), tristate::TS_TRUE);
292 ASSERT_EQ (r9.intersection (r0_9, m), tristate::TS_TRUE);
293 ASSERT_EQ (r0_9.intersection (r10, m), tristate::TS_FALSE);
294 ASSERT_EQ (r10.intersection (r0_9, m), tristate::TS_FALSE);
295 ASSERT_EQ (concrete_empty.intersection (r0_9, m), tristate::TS_FALSE);
296 ASSERT_EQ (r0_9.intersection (concrete_empty, m), tristate::TS_FALSE)
[all...] |
| constraint-manager.cc | 492 the intersection to *OUT if OUT is non-NULL.
741 the intersection of that with this object. */
743 const bounded_ranges *intersection local
746 if (intersection->m_ranges.length () > 0)
750 if (intersection == this)
756 /* No intersection. */
851 /* Get the bounded_ranges instance for the intersection of A and B,
867 bounded_range intersection (NULL_TREE, NULL_TREE);
868 if (r_a.intersects_p (r_b, &intersection))
870 ranges.safe_push (intersection);
2177 const bounded_ranges *intersection local
[all...] |
| /src/external/gpl3/gcc/dist/libsanitizer/lsan/ |
| lsan_common.cpp | 550 InternalMmapVector<Region> intersection; local
551 Intersect(mapped_regions, regions, intersection);
553 for (const Region &r : intersection) {
|
| /src/external/gpl2/gettext/dist/gettext-tools/src/ |
| format-lisp.c | 942 /* ================= Intersection of two format_arg_lists ================= */
944 /* Create the intersection (i.e. combined constraints) of two argument
945 constraints. Return false if the intersection is empty, i.e. if the
1113 /* Create the intersection (i.e. combined constraints) of two argument list
1115 intersection is empty, i.e. if the two constraints give a contradiction. */
1173 /* Step 4: Elementwise intersection of list1->initial, list2->initial. */
1261 /* Step 5: Elementwise intersection of list1->repeated, list2->repeated. */
1324 /* Create the intersection of an argument list and the empty list.
1325 Return NULL if the intersection is empty. */
1345 /* Create the intersection of two argument list constraints. NULL stand
1350 intersection (struct format_arg_list *list1, struct format_arg_list *list2) function
3349 struct format_arg_list *intersection = local
[all...] |
| format-scheme.c | 945 /* ================= Intersection of two format_arg_lists ================= */
947 /* Create the intersection (i.e. combined constraints) of two argument
948 constraints. Return false if the intersection is empty, i.e. if the
1126 /* Create the intersection (i.e. combined constraints) of two argument list
1128 intersection is empty, i.e. if the two constraints give a contradiction. */
1186 /* Step 4: Elementwise intersection of list1->initial, list2->initial. */
1274 /* Step 5: Elementwise intersection of list1->repeated, list2->repeated. */
1337 /* Create the intersection of an argument list and the empty list.
1338 Return NULL if the intersection is empty. */
1358 /* Create the intersection of two argument list constraints. NULL stand
1363 intersection (struct format_arg_list *list1, struct format_arg_list *list2) function
3287 struct format_arg_list *intersection = local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| constraint-manager.cc | 487 the intersection to *OUT if OUT is non-NULL.
736 the intersection of that with this object. */
738 const bounded_ranges *intersection local
741 if (intersection->m_ranges.length () > 0)
745 if (intersection == this)
751 /* No intersection. */
846 /* Get the bounded_ranges instance for the intersection of A and B,
862 bounded_range intersection (NULL_TREE, NULL_TREE);
863 if (r_a.intersects_p (r_b, &intersection))
865 ranges.safe_push (intersection);
2161 const bounded_ranges *intersection local
[all...] |
| /src/external/mit/isl/dist/interface/ |
| template_cpp.cc | 389 std::vector<std::string> intersection; local
393 intersection.push_back(el);
395 return intersection;
|
