| /external/llvm/lib/DebugInfo/PDB/Raw/ |
| D | MappedBlockStream.cpp | 91 Interval Intersection = intersect(CachedExtent, RequestExtent); in readBytes() local
94 if (Intersection != RequestExtent) in readBytes()
98 AbsoluteDifference(CachedExtent.first, Intersection.first); in readBytes()
277 auto Intersection = intersect(WriteInterval, CachedInterval); in writeBytes() local
278 assert(Intersection.first <= Intersection.second); in writeBytes()
280 uint32_t Length = Intersection.second - Intersection.first; in writeBytes()
282 AbsoluteDifference(WriteInterval.first, Intersection.first); in writeBytes()
284 AbsoluteDifference(CachedInterval.first, Intersection.first); in writeBytes()
|
| /external/vixl/src/aarch64/ |
| D | operands-aarch64.cc | 104 CPURegList CPURegList::Intersection(const CPURegList& list_1, in Intersection() function in vixl::aarch64::CPURegList
107 return Intersection(list_1, Intersection(list_2, list_3)); in Intersection()
111 CPURegList CPURegList::Intersection(const CPURegList& list_1, in Intersection() function in vixl::aarch64::CPURegList
115 return Intersection(Intersection(list_1, list_2), in Intersection()
116 Intersection(list_3, list_4)); in Intersection()
|
| D | operands-aarch64.h | 619 static CPURegList Intersection(const CPURegList& list_1, in Intersection() function
625 static CPURegList Intersection(const CPURegList& list_1,
628 static CPURegList Intersection(const CPURegList& list_1,
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DwarfExpression.cpp | 145 SmallBitVector Intersection(RegSize, false); in AddMachineRegPiece() local
146 Intersection.set(Offset, Offset + Size); in AddMachineRegPiece()
147 Intersection ^= Coverage; in AddMachineRegPiece()
151 if (Reg >= 0 && Intersection.any()) { in AddMachineRegPiece()
|
| /external/vixl/src/aarch32/ |
| D | instructions-aarch32.h | 507 static RegisterList Intersection(const RegisterList& list_1,
511 static RegisterList Intersection(const RegisterList& list_1,
514 return Intersection(list_1, Intersection(list_2, list_3));
516 static RegisterList Intersection(const RegisterList& list_1,
520 return Intersection(Intersection(list_1, list_2),
521 Intersection(list_3, list_4));
596 static VRegisterList Intersection(const VRegisterList& list_1, in Intersection() function
600 static VRegisterList Intersection(const VRegisterList& list_1, in Intersection() function
603 return Intersection(list_1, Intersection(list_2, list_3)); in Intersection()
605 static VRegisterList Intersection(const VRegisterList& list_1, in Intersection() function
[all …]
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenRegisters.cpp | 1668 std::set<unsigned> Intersection; in computeRegUnitSets() local
1673 std::inserter(Intersection, Intersection.begin())); in computeRegUnitSets()
1674 if (Intersection.empty()) in computeRegUnitSets()
1881 CodeGenRegister::Vec Intersection; in inferCommonSubClass() local
1884 std::inserter(Intersection, Intersection.begin()), deref<llvm::less>()); in inferCommonSubClass()
1887 if (Intersection.empty()) in inferCommonSubClass()
1897 getOrCreateSubClass(RC1, &Intersection, in inferCommonSubClass()
|
| /external/llvm/lib/Analysis/ |
| D | DependenceAnalysis.cpp | 3476 SmallBitVector Intersection = Pair[SI].GroupLoops; in depends() local
3477 Intersection &= Pair[SJ].GroupLoops; in depends()
3478 if (Intersection.any()) { in depends()
3838 SmallBitVector Intersection = Pair[SI].GroupLoops; in getSplitIteration() local
3839 Intersection &= Pair[SJ].GroupLoops; in getSplitIteration()
3840 if (Intersection.any()) { in getSplitIteration()
|
| D | ValueTracking.cpp | 4089 ConstantRange Intersection = DomCR.intersectWith(CR); in isImpliedCondMatchingImmOperands() local
4091 if (Intersection.isEmptySet()) in isImpliedCondMatchingImmOperands()
|
| /external/llvm/lib/Transforms/Vectorize/ |
| D | SLPVectorizer.cpp | 210 if (auto *Intersection = dyn_cast<BinaryOperator>(VL[0])) { in propagateIRFlags() local
215 Intersection->andIRFlags(Scalar); in propagateIRFlags()
217 VecOp->copyIRFlags(Intersection); in propagateIRFlags()
|
| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineCompares.cpp | 3348 ConstantRange Intersection = DominatingCR.intersectWith(CR); in visitICmpInst() local
3350 if (Intersection.isEmptySet()) in visitICmpInst()
3360 if (auto *AI = Intersection.getSingleElement()) in visitICmpInst()
|
| /external/python/cpython2/Doc/library/ |
| D | collections.rst | 155 of corresponding elements. Intersection and union return the minimum and
|
| /external/python/cpython2/Doc/whatsnew/ |
| D | 2.6.rst | 1587 >>> s.intersection('abc123', 'cdf246') # Intersection between all inputs
|