Searched refs:intersect (Results 1 - 25 of 30) sorted by relevance

12

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopPassManager.cpp54 PA.intersect(std::move(PassPA));
69 // Finally, we intersect the final preserved analyses to compute the
71 PA.intersect(std::move(PassPA));
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h496 // Then intersect the preserved set so that invalidation of module
498 PA.intersect(std::move(PassPA));
625 PA.intersect(std::move(PassPA));
684 PA.intersect(std::move(PassPA));
694 PA.intersect(std::move(PassPA));
706 // Update the analysis manager with each run and intersect the total set
709 PA.intersect(std::move(PassPA));
891 // Then intersect the preserved set so that invalidation of module
893 // Also intersect with the cross-SCC preserved set to capture any
895 UR.CrossSCCPA.intersect(PassP
[all...]
H A DAliasSetTracker.h89 AAMDNodes Intersection(AAInfo.intersect(NewAAInfo));
/freebsd-11-stable/contrib/wpa/src/p2p/
H A Dp2p_group.c1098 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_freq
[all...]
H A Dp2p_pd.c789 struct p2p_channels intersect; local
813 &intersect);
815 if (intersect.reg_classes == 0) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DRDFRegisters.cpp287 RegisterAggr &RegisterAggr::intersect(RegisterRef RR) { function in class:RegisterAggr
288 return intersect(RegisterAggr(PRI).insert(RR));
291 RegisterAggr &RegisterAggr::intersect(const RegisterAggr &RG) { function in class:RegisterAggr
307 T.insert(RR).intersect(*this);
338 // For each other unit, intersect it with the set of all registers
H A DRDFLiveness.cpp782 TA.insert(D.Addr->getRegRef(DFG)).intersect(S);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DRDFRegisters.h173 RegisterAggr &intersect(RegisterRef RR);
174 RegisterAggr &intersect(const RegisterAggr &RG);
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DConsumed.h174 void intersect(const ConsumedStateMap &Other);
/freebsd-11-stable/contrib/sendmail/src/
H A Dsasl.c161 intersect(s1, s2, rpool) function
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DSIModeRegister.cpp63 // intersect two Status values to produce a mode and mask that is a subset
65 Status intersect(const Status &S) const { function in struct:Status
342 BlockInfo[ThisBlock]->Pred = BlockInfo[ThisBlock]->Pred.intersect(BlockInfo[Pred->getNumber()]->Exit);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DPassManager.h226 void intersect(const PreservedAnalyses &Arg) { function in class:llvm::PreservedAnalyses
248 void intersect(PreservedAnalyses &&Arg) { function in class:llvm::PreservedAnalyses
526 // Finally, intersect the preserved analyses to compute the aggregate
528 PA.intersect(std::move(PassPA));
1318 // Then intersect the preserved set so that invalidation of module
1320 PA.intersect(std::move(PassPA));
1433 PA.intersect(P.run(IR, AM, std::forward<Ts>(Args)...));
H A DMetadata.h677 AAMDNodes intersect(const AAMDNodes &Other) { function in struct:llvm::AAMDNodes
1102 static MDNode *intersect(MDNode *A, MDNode *B);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/MSF/
H A DMappedBlockStream.cpp40 static Interval intersect(const Interval &I1, const Interval &I2) { function
135 Interval Intersection = intersect(CachedExtent, RequestExtent);
297 auto Intersection = intersect(WriteInterval, CachedInterval);
/freebsd-11-stable/tools/tools/ath/athrd/
H A Dathrd.c929 intersect(struct ieee80211_channel *dst, int16_t *dtxpow, int *nd, function
1235 intersect(bchans, btxpow, &nb, gchans, gtxpow, ng);
1239 intersect(tchans, ttxpow, &nt, achans, atxpow, na);
1243 intersect(tgchans, tgtxpow, &ntg, gchans, gtxpow, ng);
1247 intersect(gchans, gtxpow, &ng, nchans, ntxpow, nn);
1251 intersect(achans, atxpow, &na, nchans, ntxpow, nn);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DLoopPassManager.h374 // Then intersect the preserved set so that invalidation of module
376 PA.intersect(std::move(PassPA));
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyValueInfo.cpp95 static ValueLatticeElement intersect(const ValueLatticeElement &A, function
825 // the program, intersect those constraints with BBLV
839 BBLV = intersect(BBLV, getValueFromCondition(Val, I->getArgOperand(0)));
854 BBLV = intersect(BBLV, getValueFromCondition(Val, Cond));
946 TrueVal = intersect(TrueVal,
948 FalseVal = intersect(FalseVal,
977 FalseVal = intersect(FalseVal,
985 TrueVal = intersect(TrueVal,
1312 return intersect(getValueFromCondition(Val, BL, isTrueDest, Visited),
1537 // Try to intersect range
[all...]
H A DCGSCCPassManager.cpp102 // Finally, we intersect the final preserved analyses to compute the
104 PA.intersect(std::move(PassPA));
113 // Before we mark all of *this* SCC's analyses as preserved below, intersect
117 UR.CrossSCCPA.intersect(PA);
H A DTypeBasedAliasAnalysis.cpp531 MDNode::intersect(N.NoAlias, getMetadata(LLVMContext::MD_noalias));
H A DVectorUtils.cpp622 MD = MDNode::intersect(MD, IMD);
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DConsumed.cpp1025 Entry->intersect(*StateMap);
1039 Entry->intersect(*StateMap);
1132 void ConsumedStateMap::intersect(const ConsumedStateMap &Other) { function in class:ConsumedStateMap
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonConstExtenders.cpp67 OffsetRange &intersect(OffsetRange A) { function in struct:__anon2229::OffsetRange
1136 Range.intersect(getOffsetRange(Rd, *Op.getParent()));
1300 Ranges[I-Begin].intersect(Dev.shift(EV.Offset));
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenDAGPatterns.h258 bool intersect(SetType &Out, const SetType &In);
/freebsd-11-stable/gnu/usr.bin/grep/
H A Ddfa.c1940 charclass intersect; /* Intersection with some label set. */ local
1941 int intersectf; /* True if intersect is nonempty. */
2038 (intersect[k] = matches[k] & labels[j][k]) ? (intersectf = 1) : 0;
2057 copyset(intersect, labels[j]);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
H A DMetadata.cpp880 /// MDNode::concatenate() and \a MDNode::intersect() to maintain behaviour from
911 MDNode *MDNode::intersect(MDNode *A, MDNode *B) {

Completed in 412 milliseconds

12