| /freebsd-12.1/contrib/wpa/src/p2p/ |
| H A D | p2p_group.c | 1098 struct p2p_channels intersect, res; in p2p_group_get_common_freqs() local 1104 os_memset(&intersect, 0, sizeof(intersect)); in p2p_group_get_common_freqs() 1107 p2p_channels_union(&intersect, &group->p2p->cfg->channels, in p2p_group_get_common_freqs() 1108 &intersect); in p2p_group_get_common_freqs() 1112 &intersect); in p2p_group_get_common_freqs() 1121 p2p_channels_intersect(&intersect, &dev->channels, &res); in p2p_group_get_common_freqs() 1122 intersect = res; in p2p_group_get_common_freqs() 1125 p2p_channels_dump(group->p2p, "Group common channels", &intersect); in p2p_group_get_common_freqs() 1128 *num = p2p_channels_to_freqs(&intersect, common_freqs, *num); in p2p_group_get_common_freqs()
|
| H A D | p2p_pd.c | 791 struct p2p_channels intersect; in p2p_process_prov_disc_req() local 815 &intersect); in p2p_process_prov_disc_req() 817 if (intersect.reg_classes == 0) { in p2p_process_prov_disc_req()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPassManager.cpp | 55 PA.intersect(std::move(PassPA)); in run() 72 PA.intersect(std::move(PassPA)); in run()
|
| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | CGSCCPassManager.h | 473 PA.intersect(std::move(PassPA)); 651 PA.intersect(std::move(PassPA)); 776 PA.intersect(std::move(PassPA)); 829 PA.intersect(std::move(PassPA)); 839 PA.intersect(std::move(PassPA)); 854 PA.intersect(std::move(PassPA));
|
| H A D | AliasSetTracker.h | 88 AAMDNodes Intersection(AAInfo.intersect(NewAAInfo)); in updateSizeAndAAInfo()
|
| /freebsd-12.1/contrib/llvm/lib/Target/Hexagon/ |
| H A D | RDFRegisters.cpp | 288 RegisterAggr &RegisterAggr::intersect(RegisterRef RR) { in intersect() function in RegisterAggr 289 return intersect(RegisterAggr(PRI).insert(RR)); in intersect() 292 RegisterAggr &RegisterAggr::intersect(const RegisterAggr &RG) { in intersect() function in RegisterAggr 308 T.insert(RR).intersect(*this); in intersectWith()
|
| H A D | RDFRegisters.h | 174 RegisterAggr &intersect(RegisterRef RR); 175 RegisterAggr &intersect(const RegisterAggr &RG);
|
| H A D | HexagonConstExtenders.cpp | 66 OffsetRange &intersect(OffsetRange A) { in intersect() function 1135 Range.intersect(getOffsetRange(Rd, *Op.getParent())); in getOffsetRange() 1299 Ranges[I-Begin].intersect(Dev.shift(EV.Offset)); in assignInits()
|
| H A D | RDFLiveness.cpp | 784 TA.insert(D.Addr->getRegRef(DFG)).intersect(S); in computeLiveIns()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | LazyValueInfo.cpp | 92 static ValueLatticeElement intersect(const ValueLatticeElement &A, in intersect() function 818 BBLV = intersect(BBLV, getValueFromCondition(Val, I->getArgOperand(0))); in intersectAssumeOrGuardBlockValueConstantRange() 831 BBLV = intersect(BBLV, getValueFromCondition(Val, Cond)); in intersectAssumeOrGuardBlockValueConstantRange() 902 TrueVal = intersect(TrueVal, in solveBlockValueSelect() 904 FalseVal = intersect(FalseVal, in solveBlockValueSelect() 933 FalseVal = intersect(FalseVal, in solveBlockValueSelect() 941 TrueVal = intersect(TrueVal, in solveBlockValueSelect() 1164 return intersect(getValueFromCondition(Val, BL, isTrueDest, Visited), in getValueFromConditionImpl() 1403 Result = intersect(LocalResult, InBlock); in getEdgeValue()
|
| H A D | TypeBasedAliasAnalysis.cpp | 534 MDNode::intersect(N.NoAlias, getMetadata(LLVMContext::MD_noalias)); in getAAMetadata()
|
| H A D | CGSCCPassManager.cpp | 105 PA.intersect(std::move(PassPA)); in run()
|
| H A D | VectorUtils.cpp | 583 MD = MDNode::intersect(MD, IMD); in propagateMetadata()
|
| /freebsd-12.1/contrib/llvm/lib/DebugInfo/MSF/ |
| H A D | MappedBlockStream.cpp | 41 static Interval intersect(const Interval &I1, const Interval &I2) { in intersect() function 136 Interval Intersection = intersect(CachedExtent, RequestExtent); in readBytes() 298 auto Intersection = intersect(WriteInterval, CachedInterval); in fixCacheAfterWrite()
|
| /freebsd-12.1/contrib/llvm/include/llvm/IR/ |
| H A D | PassManager.h | 226 void intersect(const PreservedAnalyses &Arg) { in intersect() function 248 void intersect(PreservedAnalyses &&Arg) { in intersect() function 521 PA.intersect(std::move(PassPA)); in run() 1312 PA.intersect(std::move(PassPA)); in run() 1425 PA.intersect(P.run(IR, AM, std::forward<Ts>(Args)...)); in run()
|
| H A D | Metadata.h | 671 AAMDNodes intersect(const AAMDNodes &Other) { in intersect() function 1094 static MDNode *intersect(MDNode *A, MDNode *B);
|
| /freebsd-12.1/tools/tools/ath/athrd/ |
| H A D | athrd.c | 929 intersect(struct ieee80211_channel *dst, int16_t *dtxpow, int *nd, in intersect() function 1235 intersect(bchans, btxpow, &nb, gchans, gtxpow, ng); in main() 1239 intersect(tchans, ttxpow, &nt, achans, atxpow, na); in main() 1243 intersect(tgchans, tgtxpow, &ntg, gchans, gtxpow, ng); in main() 1247 intersect(gchans, gtxpow, &ng, nchans, ntxpow, nn); in main() 1251 intersect(achans, atxpow, &na, nchans, ntxpow, nn); in main()
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | SIModeRegister.cpp | 66 Status intersect(const Status &S) const { in intersect() function 343 …BlockInfo[ThisBlock]->Pred = BlockInfo[ThisBlock]->Pred.intersect(BlockInfo[Pred->getNumber()]->Ex… in processBlockPhase2()
|
| /freebsd-12.1/contrib/sendmail/src/ |
| H A D | sasl.c | 161 intersect(s1, s2, rpool) in intersect() function
|
| /freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
| H A D | Consumed.h | 175 void intersect(const ConsumedStateMap &Other);
|
| /freebsd-12.1/contrib/llvm/include/llvm/Transforms/Scalar/ |
| H A D | LoopPassManager.h | 373 PA.intersect(std::move(PassPA));
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/ |
| H A D | Consumed.cpp | 1026 Entry->intersect(*StateMap); in addInfo() 1040 Entry->intersect(*StateMap); in addInfo() 1133 void ConsumedStateMap::intersect(const ConsumedStateMap &Other) { in intersect() function in ConsumedStateMap
|
| /freebsd-12.1/contrib/gdb/gdb/doc/ |
| H A D | LRS | 87 Ranges do not have to be nested. Eg. Two ranges may intersect while
|
| /freebsd-12.1/gnu/usr.bin/grep/ |
| H A D | dfa.c | 1940 charclass intersect; /* Intersection with some label set. */ in dfastate() local 2038 (intersect[k] = matches[k] & labels[j][k]) ? (intersectf = 1) : 0; in dfastate() 2057 copyset(intersect, labels[j]); in dfastate()
|
| /freebsd-12.1/contrib/llvm/utils/TableGen/ |
| H A D | CodeGenDAGPatterns.h | 247 bool intersect(SetType &Out, const SetType &In);
|