| /src/external/gpl3/gcc.old/dist/libsanitizer/tsan/ |
| tsan_update_shadow_word.inc | 47 // Do the memory access intersect?
57 // The accesses do not intersect.
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| value-range-equiv.h | 51 void intersect (const value_range_equiv *);
|
| gimple-range-gori.cc | 896 r.intersect (op2_true);
902 ff.intersect (op2_false);
904 tf.intersect (op2_false);
906 ft.intersect (op2_true);
922 r.intersect (op2_false);
929 tt.intersect (op2_true);
931 tf.intersect (op2_false);
933 ft.intersect (op2_true);
1057 fprintf (dump_file, " intersect Known range : ");
1061 // Intersect the calculated result with the known result and return if done
[all...] |
| gimple-range.cc | 102 r.intersect (tmp);
155 r.intersect (entry_range);
246 r.intersect (edge_range);
327 r.intersect (tmp);
400 r.intersect (tmp);
|
| value-range.h | 75 void intersect (const irange &);
76 void intersect (const wide_int& lb, const wide_int& ub);
101 void intersect (const irange *); // DEPRECATED
558 irange::intersect (const irange &r) function in class:irange
562 irange::intersect (&r);
|
| gimple-range-fold.cc | 365 res.intersect (wi::zero (prec), wmaxm1);
393 res.intersect (r);
407 res.intersect (imag, imag);
434 res.intersect (tmp);
871 r.intersect (loop_range);
902 // If there is an LHS, intersect that with what is known.
907 r.intersect (def);
1019 r.intersect (lowers);
1041 r.intersect (uppers);
1454 e0_range.intersect (lhs_range)
[all...] |
| gimple-range-cache.h | 68 r.intersect (wi::one (prec), wi::max_value (prec, UNSIGNED));
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopPassManager.cpp | 96 PA.intersect(std::move(*PassPA));
104 // Finally, we intersect the final preserved analyses to compute the
106 PA.intersect(std::move(*PassPA));
148 PA.intersect(std::move(*PassPA));
156 // Finally, we intersect the final preserved analyses to compute the
158 PA.intersect(std::move(*PassPA));
307 // Then intersect the preserved set so that invalidation of module
309 PA.intersect(std::move(PassPA));
|
| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-range-gori.cc | 892 r.intersect (op2_true);
898 ff.intersect (op2_false);
900 tf.intersect (op2_false);
902 ft.intersect (op2_true);
918 r.intersect (op2_false);
925 tt.intersect (op2_true);
927 tf.intersect (op2_false);
929 ft.intersect (op2_true);
1061 change |= op2_range.intersect (new_result);
1065 change |= op1_range.intersect (new_result)
[all...] |
| value-range.cc | 148 vrange::intersect (const vrange &r) function in class:vrange
516 // Union or intersect the zero endpoints of two ranges. For example:
626 // Intersect two ranges when one is known to be a NAN.
645 frange::intersect (const vrange &v) function in class:frange
1521 irange::intersect (const vrange &v) function in class:irange
1544 bool res = intersect (r.lower_bound (), r.upper_bound ());
1647 // Multirange intersect for a specified wide_int [lb, ub] range.
1648 // Return TRUE if intersect changed anything.
1650 // NOTE: It is the caller's responsibility to intersect the mask.
1653 irange::intersect (const wide_int& lb, const wide_int& ub function in class:irange
[all...] |
| tree-assume.cc | 240 arg_range.intersect (edge_range);
262 edge_range.intersect (lhs_range);
|
| gimple-range-fold.cc | 454 res.intersect (int_range<2> (ptrdiff_type_node,
486 res.intersect (r);
502 res.intersect (imag);
530 res.intersect (tmp);
943 r.intersect (g->range ());
974 r.intersect (loop_range);
1010 r.intersect (val);
1022 // If there is an LHS, intersect that with what is known.
1027 r.intersect (def);
1222 e0_range.intersect (lhs_range)
[all...] |
| gimple-range-edge.cc | 128 // varying and intersect each other case from it.
156 default_range.intersect (def_range);
|
| /src/external/mit/isl/dist/ |
| isl_multi_intersect.c | 13 /* Intersect the parameter domain "dom1" with "dom2".
14 * That is, intersect the parameters of "dom2" with "dom1".
31 /* Intersect the domain of "multi" with "domain".
43 &FN(DOM,intersect),
47 /* Intersect the parameter domain of "multi" with "domain".
|
| isl_multi_bind_templ.c | 55 bnd = FN(DOM,intersect)(bnd, bnd_i);
|
| /src/games/gomoku/ |
| makemove.c | 258 intersect[a * FAREA + b] = s;
259 intersect[b * FAREA + a] = s;
272 intersect[a * FAREA + b] = es;
273 intersect[b * FAREA + a] = es;
321 * Update all other frames that intersect the current one
339 /* the other directions can only intersect at spot 'os' */
|
| bdinit.c | 251 intersect[fia * FAREA + fib] = s;
263 memset(intersect, 0, sizeof(intersect));
|
| gomoku.h | 267 extern spot_index intersect[FAREA * FAREA]; /* frame [a][b] intersection */
|
| /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| RangedConstraintManager.h | 156 /// Intersect the given range sets.
160 RangeSet intersect(RangeSet LHS, RangeSet RHS);
161 /// Intersect the given set with the closed range [Lower, Upper].
172 RangeSet intersect(RangeSet What, llvm::APSInt Lower, llvm::APSInt Upper);
173 /// Intersect the given range with the given point.
180 RangeSet intersect(RangeSet What, llvm::APSInt Point);
222 RangeSet intersect(const ContainerType &LHS, const ContainerType &RHS);
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 275 RangeSet RangeSet::Factory::intersect(RangeSet What, llvm::APSInt Lower,
315 return intersect(*What.Impl, DummyContainer);
318 RangeSet RangeSet::Factory::intersect(const RangeSet::ContainerType &LHS,
401 RangeSet RangeSet::Factory::intersect(RangeSet LHS, RangeSet RHS) {
407 return intersect(*LHS.Impl, *RHS.Impl);
410 RangeSet RangeSet::Factory::intersect(RangeSet LHS, llvm::APSInt Point) {
492 return intersect(From, Upper, Lower);
728 LLVM_NODISCARD inline RangeSet intersect(BasicValueFactory &BV,
752 LLVM_NODISCARD inline EndTy intersect(BasicValueFactory &BV,
760 intersect(BasicValueFactory &BV, RangeSet::Factory &F, const RangeSet *End)
[all...] |
| /src/external/bsd/wpa/dist/src/p2p/ |
| p2p_group.c | 1098 struct p2p_channels intersect, res; local
1104 os_memset(&intersect, 0, sizeof(intersect));
1107 p2p_channels_union(&intersect, &group->p2p->cfg->channels,
1108 &intersect);
1112 &intersect);
1121 p2p_channels_intersect(&intersect, &dev->channels, &res);
1122 intersect = res;
1125 p2p_channels_dump(group->p2p, "Group common channels", &intersect);
1128 *num = p2p_channels_to_freqs(&intersect, common_freqs, *num)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| PassManager.cpp | 127 // Then intersect the preserved set so that invalidation of module
129 PA.intersect(std::move(PassPA));
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| CGSCCPassManager.cpp | 119 // Finally, we intersect the final preserved analyses to compute the
121 PA.intersect(std::move(PassPA));
130 // Before we mark all of *this* SCC's analyses as preserved below, intersect
134 UR.CrossSCCPA.intersect(PA);
324 // Then intersect the preserved set so that invalidation of module
326 // Also intersect with the cross-SCC preserved set to capture any
328 UR.CrossSCCPA.intersect(PassPA);
329 PA.intersect(std::move(PassPA));
431 PA.intersect(std::move(PassPA));
480 PA.intersect(std::move(PassPA))
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| Consumed.h | 174 void intersect(const ConsumedStateMap &Other);
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| RDFRegisters.cpp | 209 // Intersect the negations of both words. Disregard reg=0,
292 RegisterAggr &RegisterAggr::intersect(RegisterRef RR) { function in class:RegisterAggr
293 return intersect(RegisterAggr(PRI).insert(RR));
296 RegisterAggr &RegisterAggr::intersect(const RegisterAggr &RG) { function in class:RegisterAggr
312 T.insert(RR).intersect(*this);
336 // For each other unit, intersect it with the set of all registers
|
